Skip to content

Commit 49fa618

Browse files
Merge branch 'opencodeiiita:main' into Arnav
2 parents 50eee96 + 52bd1b3 commit 49fa618

4 files changed

Lines changed: 92 additions & 1 deletion

File tree

Lines changed: 50 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,50 @@
1+
## Problem Description
2+
3+
You are given an integer `n` and an integer `k` (`k ≥ 2`), along with an array of `n` positive integers
4+
`a1, a2, ..., an`.
5+
6+
Your task is to count the number of unordered index pairs `(i, j)` such that:
7+
8+
- `1 ≤ i < j ≤ n`
9+
- The product `ai × aj` is a **perfect k-th power**
10+
11+
A number is called a perfect k-th power if it can be written in the form `x^k` for some integer `x`.
12+
13+
---
14+
15+
## Input Format
16+
17+
- The first line contains two integers `n` and `k`.
18+
- The second line contains `n` integers `a1, a2, ..., an`.
19+
20+
---
21+
22+
## Output Format
23+
24+
- Print a single integer — the number of valid pairs `(i, j)`.
25+
26+
---
27+
28+
## Constraints
29+
30+
- `2 ≤ n ≤ 100000`
31+
- `2 ≤ k ≤ 100`
32+
- `1 ≤ ai ≤ 100000`
33+
34+
---
35+
36+
## Sample Input
37+
38+
```
39+
6 3
40+
1 3 9 8 24 1
41+
```
42+
---
43+
44+
## Output
45+
46+
```
47+
5
48+
```
49+
50+
[PROBLEM LINK]( https://codeforces.com/problemset/problem/1225/D)
Lines changed: 21 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,21 @@
1+
def solve():
2+
t = int(input())
3+
for _ in range(t):
4+
a, b, c = map(int, input().split())
5+
6+
d = abs(a - b)
7+
n = 2 * d
8+
9+
10+
if n == 0 or max(a, b, c) > n:
11+
print(-1)
12+
continue
13+
14+
half = n // 2
15+
16+
if c + half <= n:
17+
print(c + half)
18+
else:
19+
print(c - half)
20+
21+
solve()
Lines changed: 21 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,21 @@
1+
def solve():
2+
t = int(input())
3+
for _ in range(t):
4+
a, b, c = map(int, input().split())
5+
6+
d = abs(a - b)
7+
n = 2 * d
8+
9+
if n == 0 or max(a, b, c) > n:
10+
print(-1)
11+
continue
12+
13+
half = n // 2
14+
15+
if c + half <= n:
16+
print(c + half)
17+
else:
18+
print(c - half)
19+
20+
# Run
21+
solve()

contributers.md

Lines changed: 0 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -24,7 +24,6 @@
2424
| Sourish Awasthi | LooninS | IIIT Allahabad |
2525
| Ishan Tripathi | ishantripathi64 | IIIT Allahabad |
2626
| Lavay Garg | lavaygarg | IIIT Allahabad |
27-
| Abhishek Tripathi | Astinel-prime | IIIT Allahabd |
2827

2928
<!-- ADD ABOVE THIS -->
3029
<!-- example | Korvac | Betty | Reyansh College | -->

0 commit comments

Comments
 (0)