Skip to content

Commit b3b435d

Browse files
Add files via upload
1 parent f7d2c6b commit b3b435d

File tree

4 files changed

+64
-0
lines changed

4 files changed

+64
-0
lines changed
Lines changed: 5 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,5 @@
1+
for _ in range(int(input())):
2+
a, b, d, e = map(int, input().split())
3+
arr = [a+b, d-b, e-d]
4+
5+
print(arr.count(max(set(arr), key=arr.count)))
Lines changed: 19 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,19 @@
1+
for _ in range(int(input())):
2+
n, m = map(int, input().split())
3+
can = True
4+
brr = []
5+
for j in range(n):
6+
arr = list(map(int, input().split()))
7+
arr.sort()
8+
diff = [arr[i+1] - arr[i] for i in range(len(arr)-1)]
9+
can = can and (all([d == n for d in diff]))
10+
brr.append((arr[0], j))
11+
12+
if not can:
13+
print(-1)
14+
continue
15+
16+
brr.sort()
17+
for _, i in brr:
18+
print(i+1, end=' ')
19+
print()
Lines changed: 26 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,26 @@
1+
for _ in range(int(input())):
2+
3+
n, k = map(int, input().split())
4+
arr = list(map(int, input().split()))
5+
arr.sort()
6+
7+
i = 0
8+
j = n-1
9+
npairs = 0
10+
while i < j:
11+
if arr[i] + arr[j] > k:
12+
j -= 1
13+
elif arr[i] + arr[j] < k:
14+
i += 1
15+
else:
16+
npairs += 1
17+
i += 1
18+
j -= 1
19+
20+
left = n - 2*npairs
21+
22+
if left%2 == 0:
23+
print (npairs)
24+
else:
25+
print (0)
26+
Lines changed: 14 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,14 @@
1+
for _ in range(int(input())):
2+
n = int(input())
3+
arr = list(map(int, input().split()))
4+
5+
can = True
6+
for i in range(n-1):
7+
if arr[i] > arr[i+1]:
8+
can = False
9+
break
10+
11+
arr[i+1] -= arr[i]
12+
arr[i] = 0
13+
14+
print('YES' if can else 'NO')

0 commit comments

Comments
 (0)