message stringlengths 2 433k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 113 108k | cluster float64 12 12 | __index_level_0__ int64 226 217k |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A permutation is a sequence of integers p1, p2, ..., pn, consisting of n distinct positive integers, each of them doesn't exceed n. Let's denote the i-th element of permutation p as pi. We'll ca... | instruction | 0 | 101,480 | 12 | 202,960 |
Yes | output | 1 | 101,480 | 12 | 202,961 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A permutation is a sequence of integers p1, p2, ..., pn, consisting of n distinct positive integers, each of them doesn't exceed n. Let's denote the i-th element of permutation p as pi. We'll ca... | instruction | 0 | 101,481 | 12 | 202,962 |
No | output | 1 | 101,481 | 12 | 202,963 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A permutation is a sequence of integers p1, p2, ..., pn, consisting of n distinct positive integers, each of them doesn't exceed n. Let's denote the i-th element of permutation p as pi. We'll ca... | instruction | 0 | 101,482 | 12 | 202,964 |
No | output | 1 | 101,482 | 12 | 202,965 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A permutation is a sequence of integers p1, p2, ..., pn, consisting of n distinct positive integers, each of them doesn't exceed n. Let's denote the i-th element of permutation p as pi. We'll ca... | instruction | 0 | 101,483 | 12 | 202,966 |
No | output | 1 | 101,483 | 12 | 202,967 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A permutation is a sequence of integers p1, p2, ..., pn, consisting of n distinct positive integers, each of them doesn't exceed n. Let's denote the i-th element of permutation p as pi. We'll ca... | instruction | 0 | 101,484 | 12 | 202,968 |
No | output | 1 | 101,484 | 12 | 202,969 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A permutation of length n is an array containing each integer from 1 to n exactly once. For example, q = [4, 5, 1, 2, 3] is a permutation. For the permutation q the square of permutation is the permutation p that p[i] = q[q[i]] for each i = ... | instruction | 0 | 101,637 | 12 | 203,274 |
Tags: combinatorics, constructive algorithms, dfs and similar, graphs, math
Correct Solution:
```
import math
import sys
input = sys.stdin.readline
n = int(input())
a = [int(_) - 1 for _ in input().split()]
vis = [False] * n
cycles = [[] for _ in range(n + 1)]
for i in range(n):
if vis[i]: continue
cur = i
... | output | 1 | 101,637 | 12 | 203,275 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A permutation of length n is an array containing each integer from 1 to n exactly once. For example, q = [4, 5, 1, 2, 3] is a permutation. For the permutation q the square of permutation is the permutation p that p[i] = q[q[i]] for each i = ... | instruction | 0 | 101,638 | 12 | 203,276 |
Tags: combinatorics, constructive algorithms, dfs and similar, graphs, math
Correct Solution:
```
import sys
import bisect
from bisect import bisect_left as lb
input_=lambda: sys.stdin.readline().strip("\r\n")
from math import log
from math import gcd
from math import atan2,acos
from random import randint
sa=lambda :in... | output | 1 | 101,638 | 12 | 203,277 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A permutation of length n is an array containing each integer from 1 to n exactly once. For example, q = [4, 5, 1, 2, 3] is a permutation. For the permutation q the square of permutation is the permutation p that p[i] = q[q[i]] for each i = ... | instruction | 0 | 101,639 | 12 | 203,278 |
Tags: combinatorics, constructive algorithms, dfs and similar, graphs, math
Correct Solution:
```
#### IMPORTANT LIBRARY ####
############################
### DO NOT USE import random --> 250ms to load the library
############################
### In case of extra libraries: https://github.com/cheran-senthil/PyRival
... | output | 1 | 101,639 | 12 | 203,279 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A permutation of length n is an array containing each integer from 1 to n exactly once. For example, q = [4, 5, 1, 2, 3] is a permutation. For the permutation q the square of permutation is the permutation p that p[i] = q[q[i]] for each i = ... | instruction | 0 | 101,640 | 12 | 203,280 |
Tags: combinatorics, constructive algorithms, dfs and similar, graphs, math
Correct Solution:
```
import sys
#import random
from bisect import bisect_right as rb
from collections import deque
#sys.setrecursionlimit(10**8)
from queue import PriorityQueue
from math import *
input_ = lambda: sys.stdin.readline().strip("\r... | output | 1 | 101,640 | 12 | 203,281 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A permutation of length n is an array containing each integer from 1 to n exactly once. For example, q = [4, 5, 1, 2, 3] is a permutation. For the permutation q the square of permutation is the ... | instruction | 0 | 101,641 | 12 | 203,282 |
No | output | 1 | 101,641 | 12 | 203,283 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A permutation of length n is an array containing each integer from 1 to n exactly once. For example, q = [4, 5, 1, 2, 3] is a permutation. For the permutation q the square of permutation is the ... | instruction | 0 | 101,642 | 12 | 203,284 |
No | output | 1 | 101,642 | 12 | 203,285 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A permutation of length n is an array containing each integer from 1 to n exactly once. For example, q = [4, 5, 1, 2, 3] is a permutation. For the permutation q the square of permutation is the ... | instruction | 0 | 101,643 | 12 | 203,286 |
No | output | 1 | 101,643 | 12 | 203,287 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A permutation of length n is an array containing each integer from 1 to n exactly once. For example, q = [4, 5, 1, 2, 3] is a permutation. For the permutation q the square of permutation is the ... | instruction | 0 | 101,644 | 12 | 203,288 |
No | output | 1 | 101,644 | 12 | 203,289 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Some time ago Mister B detected a strange signal from the space, which he started to study.
After some transformation the signal turned out to be a permutation p of length n or its cyclic shift. For the further investigation Mister B need s... | instruction | 0 | 101,704 | 12 | 203,408 |
Tags: data structures, implementation, math
Correct Solution:
```
from sys import stdin
def main():
n = int(stdin.readline())
a = list(map(int, stdin.readline().split()))
inf = [0] * (n + 1)
curr = 0
d = 0
for i in range(n):
curr += abs(i + 1 - a[i])
if a[i] > i + 1:
... | output | 1 | 101,704 | 12 | 203,409 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Some time ago Mister B detected a strange signal from the space, which he started to study.
After some transformation the signal turned out to be a permutation p of length n or its cyclic shift. For the further investigation Mister B need s... | instruction | 0 | 101,705 | 12 | 203,410 |
Tags: data structures, implementation, math
Correct Solution:
```
n = int(input())
a = list(map(int, input().split()))
t = [0] * 2 * n
s = 0
for i in range(n):
d = a[i] - i - 1
s += abs(d)
if d > 0: t[d] += 1
p = sum(t)
r = (s, 0)
for i in range(1, n):
d = a[n - i] - 1
s += d - p << 1
t[d + i] +... | output | 1 | 101,705 | 12 | 203,411 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Some time ago Mister B detected a strange signal from the space, which he started to study.
After some transformation the signal turned out to be a permutation p of length n or its cyclic shift. For the further investigation Mister B need s... | instruction | 0 | 101,706 | 12 | 203,412 |
Tags: data structures, implementation, math
Correct Solution:
```
n = int(input())
data = input().split()
#print(str(n) + " " + str(data))
data = list(map(lambda x: int(x), data))
res = 0
ires = 0
neg = 0
when = [0] * n
for i in range(n):
data[i] = i + 1 - data[i]
res += abs(data[i])
if data[i] <= 0:
neg += 1
... | output | 1 | 101,706 | 12 | 203,413 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Some time ago Mister B detected a strange signal from the space, which he started to study.
After some transformation the signal turned out to be a permutation p of length n or its cyclic shift. For the further investigation Mister B need s... | instruction | 0 | 101,707 | 12 | 203,414 |
Tags: data structures, implementation, math
Correct Solution:
```
def main():
n=int(input())
A=list(map(int,input().strip().split(' ')))
def brutal(A):
n=len(A)
for i in range(n):
temp=0
pos=0
neg=0
for j in range(n):
temp+=abs... | output | 1 | 101,707 | 12 | 203,415 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Some time ago Mister B detected a strange signal from the space, which he started to study.
After some transformation the signal turned out to be a permutation p of length n or its cyclic shift. For the further investigation Mister B need s... | instruction | 0 | 101,708 | 12 | 203,416 |
Tags: data structures, implementation, math
Correct Solution:
```
n = int(input())
p = [int(i) - 1 for i in input().split()]
chd = [0] * (n + 2)
dev = 0
dd = 0
for i in range(n):
shi = p[i] - i
dev += abs(shi)
if p[i] <= i:
dd += 1
shi = n + shi
chd[shi] += 2
else:
dd ... | output | 1 | 101,708 | 12 | 203,417 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Some time ago Mister B detected a strange signal from the space, which he started to study.
After some transformation the signal turned out to be a permutation p of length n or its cyclic shift. For the further investigation Mister B need s... | instruction | 0 | 101,709 | 12 | 203,418 |
Tags: data structures, implementation, math
Correct Solution:
```
def main():
n = int(input())
data = input().split()
#print(str(n) + " " + str(data))
data = list(map(lambda x: int(x), data))
res = 0
ires = 0
neg = 0
when = [0] * n
for i in range(n):
data[i] = i + 1 - data[i]
res += abs(data[i])
if da... | output | 1 | 101,709 | 12 | 203,419 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Some time ago Mister B detected a strange signal from the space, which he started to study.
After some transformation the signal turned out to be a permutation p of length n or its cyclic shift... | instruction | 0 | 101,710 | 12 | 203,420 |
No | output | 1 | 101,710 | 12 | 203,421 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Some time ago Mister B detected a strange signal from the space, which he started to study.
After some transformation the signal turned out to be a permutation p of length n or its cyclic shift... | instruction | 0 | 101,711 | 12 | 203,422 |
No | output | 1 | 101,711 | 12 | 203,423 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Some time ago Mister B detected a strange signal from the space, which he started to study.
After some transformation the signal turned out to be a permutation p of length n or its cyclic shift... | instruction | 0 | 101,712 | 12 | 203,424 |
No | output | 1 | 101,712 | 12 | 203,425 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Some time ago Mister B detected a strange signal from the space, which he started to study.
After some transformation the signal turned out to be a permutation p of length n or its cyclic shift... | instruction | 0 | 101,713 | 12 | 203,426 |
No | output | 1 | 101,713 | 12 | 203,427 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an array a with n distinct integers. Construct an array b by permuting a such that for every non-empty subset of indices S = {x1, x2, ..., xk} (1 ≤ xi ≤ n, 0 < k < n) the sums of elements on that positions in a and b are differ... | instruction | 0 | 101,730 | 12 | 203,460 |
Tags: constructive algorithms, greedy
Correct Solution:
```
n = int(input())
data = list(map(int, input().split()))
sorted_data = sorted(data)
ans = {}
for i in range(0, n):
ans[sorted_data[i]] = sorted_data[(i + 1) % n]
for v in data:
print(ans[v], end=' ')
``` | output | 1 | 101,730 | 12 | 203,461 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an array a with n distinct integers. Construct an array b by permuting a such that for every non-empty subset of indices S = {x1, x2, ..., xk} (1 ≤ xi ≤ n, 0 < k < n) the sums of elements on that positions in a and b are differ... | instruction | 0 | 101,731 | 12 | 203,462 |
Tags: constructive algorithms, greedy
Correct Solution:
```
n = int(input())
a = list(map(int,input().split()))
arr=sorted(a,reverse=True)
ans=[None for x in range(n)]
for i in range(n-1):
pos=a.index(arr[i])
ans[pos]=arr[i+1]
for i in range(n):
if ans[i]==None:
ans[i]=arr[0]
print(*ans)
``` | output | 1 | 101,731 | 12 | 203,463 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an array a with n distinct integers. Construct an array b by permuting a such that for every non-empty subset of indices S = {x1, x2, ..., xk} (1 ≤ xi ≤ n, 0 < k < n) the sums of elements on that positions in a and b are differ... | instruction | 0 | 101,732 | 12 | 203,464 |
Tags: constructive algorithms, greedy
Correct Solution:
```
def solve():
n=int(input())
a=list(map(int,input().split()))
b=sorted(a)+[min(a)]
for i in range(n):
a[i]=str(b[b.index(a[i])+1])
print(' '.join(a))
return
solve()
``` | output | 1 | 101,732 | 12 | 203,465 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an array a with n distinct integers. Construct an array b by permuting a such that for every non-empty subset of indices S = {x1, x2, ..., xk} (1 ≤ xi ≤ n, 0 < k < n) the sums of elements on that positions in a and b are differ... | instruction | 0 | 101,733 | 12 | 203,466 |
Tags: constructive algorithms, greedy
Correct Solution:
```
n=int(input())
a=list(map(int,input().split()))
b=a.copy()
a.sort()
c=[]
for i in range(n):
c.append(a[(a.index(b[i])+1)%n])
print(*c)
``` | output | 1 | 101,733 | 12 | 203,467 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an array a with n distinct integers. Construct an array b by permuting a such that for every non-empty subset of indices S = {x1, x2, ..., xk} (1 ≤ xi ≤ n, 0 < k < n) the sums of elements on that positions in a and b are differ... | instruction | 0 | 101,734 | 12 | 203,468 |
Tags: constructive algorithms, greedy
Correct Solution:
```
n=int(input())
a=list(map(int,input().split()))
b = sorted(a) + [min(a)]
for i in range(n):print(b[b.index(a[i])+1],end=' ')
``` | output | 1 | 101,734 | 12 | 203,469 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an array a with n distinct integers. Construct an array b by permuting a such that for every non-empty subset of indices S = {x1, x2, ..., xk} (1 ≤ xi ≤ n, 0 < k < n) the sums of elements on that positions in a and b are differ... | instruction | 0 | 101,735 | 12 | 203,470 |
Tags: constructive algorithms, greedy
Correct Solution:
```
import sys, math
readline = sys.stdin.readline
n = int(readline())
inf = pow(10,10)
tmp = list(map(int,readline().split()))
tmp2 = [inf] * n
mai = 0
for i in range(n):
for j in range(n):
if tmp[i] < tmp[j]:
tmp2[i] = min(tmp2[i],tmp[j]... | output | 1 | 101,735 | 12 | 203,471 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an array a with n distinct integers. Construct an array b by permuting a such that for every non-empty subset of indices S = {x1, x2, ..., xk} (1 ≤ xi ≤ n, 0 < k < n) the sums of elements on that positions in a and b are differ... | instruction | 0 | 101,736 | 12 | 203,472 |
Tags: constructive algorithms, greedy
Correct Solution:
```
n = int(input())
a = [int(i) for i in input().split()]
b = sorted(a)
s = {}
for i in range(-1, n-1): s[b[i+1]] = b[i]
print(' '.join([str(s[i]) for i in a]))
``` | output | 1 | 101,736 | 12 | 203,473 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an array a with n distinct integers. Construct an array b by permuting a such that for every non-empty subset of indices S = {x1, x2, ..., xk} (1 ≤ xi ≤ n, 0 < k < n) the sums of elements on that positions in a and b are differ... | instruction | 0 | 101,737 | 12 | 203,474 |
Tags: constructive algorithms, greedy
Correct Solution:
```
n = int(input())
a = list(map(int , input().split()))
ans = list()
for i in range(n):
ans.append(0)
position = dict()
for i in range(n):
position[a[i]] = i;
a = sorted(a)
ans[position[a[n - 1]]] = a[0];
for i in range(n - 1):
ans[position[a[i]]] = ... | output | 1 | 101,737 | 12 | 203,475 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an array a with n distinct integers. Construct an array b by permuting a such that for every non-empty subset of indices S = {x1, x2, ..., xk} (1 ≤ xi ≤ n, 0 < k < n) the sums of e... | instruction | 0 | 101,738 | 12 | 203,476 |
Yes | output | 1 | 101,738 | 12 | 203,477 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an array a with n distinct integers. Construct an array b by permuting a such that for every non-empty subset of indices S = {x1, x2, ..., xk} (1 ≤ xi ≤ n, 0 < k < n) the sums of e... | instruction | 0 | 101,739 | 12 | 203,478 |
Yes | output | 1 | 101,739 | 12 | 203,479 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an array a with n distinct integers. Construct an array b by permuting a such that for every non-empty subset of indices S = {x1, x2, ..., xk} (1 ≤ xi ≤ n, 0 < k < n) the sums of e... | instruction | 0 | 101,740 | 12 | 203,480 |
Yes | output | 1 | 101,740 | 12 | 203,481 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an array a with n distinct integers. Construct an array b by permuting a such that for every non-empty subset of indices S = {x1, x2, ..., xk} (1 ≤ xi ≤ n, 0 < k < n) the sums of e... | instruction | 0 | 101,741 | 12 | 203,482 |
Yes | output | 1 | 101,741 | 12 | 203,483 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an array a with n distinct integers. Construct an array b by permuting a such that for every non-empty subset of indices S = {x1, x2, ..., xk} (1 ≤ xi ≤ n, 0 < k < n) the sums of e... | instruction | 0 | 101,742 | 12 | 203,484 |
No | output | 1 | 101,742 | 12 | 203,485 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an array a with n distinct integers. Construct an array b by permuting a such that for every non-empty subset of indices S = {x1, x2, ..., xk} (1 ≤ xi ≤ n, 0 < k < n) the sums of e... | instruction | 0 | 101,743 | 12 | 203,486 |
No | output | 1 | 101,743 | 12 | 203,487 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an array a with n distinct integers. Construct an array b by permuting a such that for every non-empty subset of indices S = {x1, x2, ..., xk} (1 ≤ xi ≤ n, 0 < k < n) the sums of e... | instruction | 0 | 101,744 | 12 | 203,488 |
No | output | 1 | 101,744 | 12 | 203,489 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an array a with n distinct integers. Construct an array b by permuting a such that for every non-empty subset of indices S = {x1, x2, ..., xk} (1 ≤ xi ≤ n, 0 < k < n) the sums of e... | instruction | 0 | 101,745 | 12 | 203,490 |
No | output | 1 | 101,745 | 12 | 203,491 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Toad Mikhail has an array of 2^k integers a_1, a_2, …, a_{2^k}.
Find two permutations p and q of integers 0, 1, …, 2^k-1, such that a_i is equal to p_i ⊕ q_i for all possible i, or determine th... | instruction | 0 | 102,070 | 12 | 204,140 |
No | output | 1 | 102,070 | 12 | 204,141 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Toad Mikhail has an array of 2^k integers a_1, a_2, …, a_{2^k}.
Find two permutations p and q of integers 0, 1, …, 2^k-1, such that a_i is equal to p_i ⊕ q_i for all possible i, or determine th... | instruction | 0 | 102,071 | 12 | 204,142 |
No | output | 1 | 102,071 | 12 | 204,143 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an array A, consisting of n positive integers a_1, a_2, ..., a_n, and an array B, consisting of m positive integers b_1, b_2, ..., b_m.
Choose some element a of A and some element b of B such that a+b doesn't belong to A and ... | instruction | 0 | 102,088 | 12 | 204,176 |
Tags: math, sortings
Correct Solution:
```
I = lambda: max(map(int, input().split()))
input()
a = I()
input()
print(a, I())
``` | output | 1 | 102,088 | 12 | 204,177 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an array A, consisting of n positive integers a_1, a_2, ..., a_n, and an array B, consisting of m positive integers b_1, b_2, ..., b_m.
Choose some element a of A and some element b of B such that a+b doesn't belong to A and ... | instruction | 0 | 102,089 | 12 | 204,178 |
Tags: math, sortings
Correct Solution:
```
na=int(input())
a=list(map(int,input().split()))
da={}
for i in a:
da[i]=0
nb=int(input())
b=list(map(int,input().split()))
db={}
for i in b:
db[i]=0
z=1
for i in range(na):
for j in range(nb):
su=a[i]+b[j]
try:
l1=da[su]
except ... | output | 1 | 102,089 | 12 | 204,179 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an array A, consisting of n positive integers a_1, a_2, ..., a_n, and an array B, consisting of m positive integers b_1, b_2, ..., b_m.
Choose some element a of A and some element b of B such that a+b doesn't belong to A and ... | instruction | 0 | 102,090 | 12 | 204,180 |
Tags: math, sortings
Correct Solution:
```
MOD = 10**9 + 7
I = lambda:list(map(int,input().split()))
n = int(input())
a = I()
m, = I()
b = I()
a.sort()
b.sort()
print(a[-1], b[-1])
``` | output | 1 | 102,090 | 12 | 204,181 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an array A, consisting of n positive integers a_1, a_2, ..., a_n, and an array B, consisting of m positive integers b_1, b_2, ..., b_m.
Choose some element a of A and some element b of B such that a+b doesn't belong to A and ... | instruction | 0 | 102,091 | 12 | 204,182 |
Tags: math, sortings
Correct Solution:
```
n=int(input())
a=list(map(int,input().split()))
p=int(input())
b=list(map(int,input().split()))
print(max(a),max(b))
``` | output | 1 | 102,091 | 12 | 204,183 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an array A, consisting of n positive integers a_1, a_2, ..., a_n, and an array B, consisting of m positive integers b_1, b_2, ..., b_m.
Choose some element a of A and some element b of B such that a+b doesn't belong to A and ... | instruction | 0 | 102,092 | 12 | 204,184 |
Tags: math, sortings
Correct Solution:
```
n1=int(input())
l1=[int(x) for x in input().split()]
n2=int(input())
l2=[int(x) for x in input().split()]
for i in range(0,n1):
for j in range(0,n2):
if(l1[i]+l2[j] not in l1 and l1[i]+l2[j] not in l2):
s=l1[i]
s1=l2[j]
print(s,s1)
``` | output | 1 | 102,092 | 12 | 204,185 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an array A, consisting of n positive integers a_1, a_2, ..., a_n, and an array B, consisting of m positive integers b_1, b_2, ..., b_m.
Choose some element a of A and some element b of B such that a+b doesn't belong to A and ... | instruction | 0 | 102,093 | 12 | 204,186 |
Tags: math, sortings
Correct Solution:
```
n = int(input())
arr = list(map(int,input().split()))
m = int(input())
arr1 = list(map(int,input().split()))
x = max(arr)
y = max(arr1)
print(f"{x} {y}")
``` | output | 1 | 102,093 | 12 | 204,187 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an array A, consisting of n positive integers a_1, a_2, ..., a_n, and an array B, consisting of m positive integers b_1, b_2, ..., b_m.
Choose some element a of A and some element b of B such that a+b doesn't belong to A and ... | instruction | 0 | 102,094 | 12 | 204,188 |
Tags: math, sortings
Correct Solution:
```
n=int(input())
a=[]
a=list(map(int,input().strip().split()))[:n]
m=int(input())
b=list(map(int,input().strip().split()))[:m]
print(max(a),max(b))
``` | output | 1 | 102,094 | 12 | 204,189 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an array A, consisting of n positive integers a_1, a_2, ..., a_n, and an array B, consisting of m positive integers b_1, b_2, ..., b_m.
Choose some element a of A and some element b of B such that a+b doesn't belong to A and ... | instruction | 0 | 102,095 | 12 | 204,190 |
Tags: math, sortings
Correct Solution:
```
#codeforces
a = int(input())
A = list(map(int,input().split()))
b = int(input())
B = list(map(int,input().split()))
A.sort()
B.sort()
print(A[a-1],B[b-1])
``` | output | 1 | 102,095 | 12 | 204,191 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a sequence a_1, a_2, ..., a_n, consisting of integers.
You can apply the following operation to this sequence: choose some integer x and move all elements equal to x either to the beginning, or to the end of a. Note that you h... | instruction | 0 | 102,104 | 12 | 204,208 |
Tags: dp, greedy, two pointers
Correct Solution:
```
import sys as _sys
def main():
q = int(input())
for i_q in range(q):
n, = _read_ints()
a = tuple(_read_ints())
result = find_min_sorting_cost(sequence=a)
print(result)
def _read_line():
result = _sys.stdin.readline()
... | output | 1 | 102,104 | 12 | 204,209 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.