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.
This is an interactive problem!
An arithmetic progression or arithmetic sequence is a sequence of integers such that the subtraction of element with its previous element (x_i - x_{i - 1}, where... | instruction | 0 | 9,134 | 12 | 18,268 |
No | output | 1 | 9,134 | 12 | 18,269 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is an interactive problem!
An arithmetic progression or arithmetic sequence is a sequence of integers such that the subtraction of element with its previous element (x_i - x_{i - 1}, where... | instruction | 0 | 9,135 | 12 | 18,270 |
No | output | 1 | 9,135 | 12 | 18,271 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is an interactive problem!
An arithmetic progression or arithmetic sequence is a sequence of integers such that the subtraction of element with its previous element (x_i - x_{i - 1}, where... | instruction | 0 | 9,136 | 12 | 18,272 |
No | output | 1 | 9,136 | 12 | 18,273 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is an interactive problem!
An arithmetic progression or arithmetic sequence is a sequence of integers such that the subtraction of element with its previous element (x_i - x_{i - 1}, where... | instruction | 0 | 9,137 | 12 | 18,274 |
No | output | 1 | 9,137 | 12 | 18,275 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an array a_1, a_2, β¦, a_n.
In one operation you can choose two elements a_i and a_j (i β j) and decrease each of them by one.
You need to check whether it is possible to make all the elements equal to zero or not.
Input
The... | instruction | 0 | 9,186 | 12 | 18,372 |
Tags: greedy, math
Correct Solution:
```
x = int(input())
c = input().split()
for i in range(len(c)):
c[i] = int(c[i])
if sum(c) % 2 == 0 and max(c) <= sum(c) - max(c):
print("YES")
else:
print("NO")
``` | output | 1 | 9,186 | 12 | 18,373 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an array a_1, a_2, β¦, a_n.
In one operation you can choose two elements a_i and a_j (i β j) and decrease each of them by one.
You need to check whether it is possible to make all the elements equal to zero or not.
Input
The... | instruction | 0 | 9,187 | 12 | 18,374 |
Tags: greedy, math
Correct Solution:
```
# -*- coding: utf-8 -*-
"""
Created on Tue Oct 15 10:49:21 2019
@author: Ryan
"""
n = int(input())
ints = input().split(" ")
ints = [int(i) for i in ints]
def solve(n, ints):
summ = 0
for i in range(len(ints)):
summ += ints[i]
if (summ % 2 != 0):
... | output | 1 | 9,187 | 12 | 18,375 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an array a_1, a_2, β¦, a_n.
In one operation you can choose two elements a_i and a_j (i β j) and decrease each of them by one.
You need to check whether it is possible to make all the elements equal to zero or not.
Input
The... | instruction | 0 | 9,188 | 12 | 18,376 |
Tags: greedy, math
Correct Solution:
```
n = int(input())
g = list(map(int, input().split()))
if sum(g)%2 == 0 and 2*max(g)<=sum(g):
print("YES")
else:
print("NO")
``` | output | 1 | 9,188 | 12 | 18,377 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an array a_1, a_2, β¦, a_n.
In one operation you can choose two elements a_i and a_j (i β j) and decrease each of them by one.
You need to check whether it is possible to make all the elements equal to zero or not.
Input
The... | instruction | 0 | 9,189 | 12 | 18,378 |
Tags: greedy, math
Correct Solution:
```
n = int(input())
m = 0
sum = 0
for a in map(int,input().split()):
m = max(m,a)
sum += a
if sum % 2 == 0 and (sum - m) >= m:
print('YES')
else:
print('NO')
``` | output | 1 | 9,189 | 12 | 18,379 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an array a_1, a_2, β¦, a_n.
In one operation you can choose two elements a_i and a_j (i β j) and decrease each of them by one.
You need to check whether it is possible to make all the elements equal to zero or not.
Input
The... | instruction | 0 | 9,190 | 12 | 18,380 |
Tags: greedy, math
Correct Solution:
```
n,a=int(input()),[int(x)for x in input().split()]
res=str("NO")if (sum(a)%2==1) or (2*max(a)>sum(a)) else str("YES")
print(res)
``` | output | 1 | 9,190 | 12 | 18,381 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an array a_1, a_2, β¦, a_n.
In one operation you can choose two elements a_i and a_j (i β j) and decrease each of them by one.
You need to check whether it is possible to make all the elements equal to zero or not.
Input
The... | instruction | 0 | 9,191 | 12 | 18,382 |
Tags: greedy, math
Correct Solution:
```
input()
arr = list(map(int, input().split()))
sm = sum(arr)
if sm % 2 == 0 and max(arr) <= sm - max(arr):
print("YES")
else:
print("NO")
``` | output | 1 | 9,191 | 12 | 18,383 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an array a_1, a_2, β¦, a_n.
In one operation you can choose two elements a_i and a_j (i β j) and decrease each of them by one.
You need to check whether it is possible to make all the elements equal to zero or not.
Input
The... | instruction | 0 | 9,192 | 12 | 18,384 |
Tags: greedy, math
Correct Solution:
```
from sys import stdin
n=int(stdin.readline().strip())
s=list(map(int,stdin.readline().strip().split()))
s.sort(reverse=True)
if sum(s)%2==0 and s[0]<=sum(s[1::]):
print("YES")
else:
print("NO")
``` | output | 1 | 9,192 | 12 | 18,385 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an array a_1, a_2, β¦, a_n.
In one operation you can choose two elements a_i and a_j (i β j) and decrease each of them by one.
You need to check whether it is possible to make all the elements equal to zero or not.
Input
The... | instruction | 0 | 9,193 | 12 | 18,386 |
Tags: greedy, math
Correct Solution:
```
n=int(input())
a=list(map(int, input().split()))
s=0
for i in range(n):
s=s+a[i]
if s%2!=0:
print("NO")
else:
if max(a)>s/2:
print("NO")
else:
print("YES")
``` | output | 1 | 9,193 | 12 | 18,387 |
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_1, a_2, β¦, a_n.
In one operation you can choose two elements a_i and a_j (i β j) and decrease each of them by one.
You need to check whether it is possible to make all... | instruction | 0 | 9,194 | 12 | 18,388 |
Yes | output | 1 | 9,194 | 12 | 18,389 |
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_1, a_2, β¦, a_n.
In one operation you can choose two elements a_i and a_j (i β j) and decrease each of them by one.
You need to check whether it is possible to make all... | instruction | 0 | 9,195 | 12 | 18,390 |
Yes | output | 1 | 9,195 | 12 | 18,391 |
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_1, a_2, β¦, a_n.
In one operation you can choose two elements a_i and a_j (i β j) and decrease each of them by one.
You need to check whether it is possible to make all... | instruction | 0 | 9,196 | 12 | 18,392 |
Yes | output | 1 | 9,196 | 12 | 18,393 |
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_1, a_2, β¦, a_n.
In one operation you can choose two elements a_i and a_j (i β j) and decrease each of them by one.
You need to check whether it is possible to make all... | instruction | 0 | 9,199 | 12 | 18,398 |
No | output | 1 | 9,199 | 12 | 18,399 |
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_1, a_2, β¦, a_n.
In one operation you can choose two elements a_i and a_j (i β j) and decrease each of them by one.
You need to check whether it is possible to make all... | instruction | 0 | 9,200 | 12 | 18,400 |
No | output | 1 | 9,200 | 12 | 18,401 |
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_1, a_2, β¦, a_n.
In one operation you can choose two elements a_i and a_j (i β j) and decrease each of them by one.
You need to check whether it is possible to make all... | instruction | 0 | 9,201 | 12 | 18,402 |
No | output | 1 | 9,201 | 12 | 18,403 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Recall that the permutation is an array consisting of n distinct integers from 1 to n in arbitrary order. For example, [2,3,1,5,4] is a permutation, but [1,2,2] is not a permutation (2 appears twice in the array) and [1,3,4] is also not a pe... | instruction | 0 | 9,221 | 12 | 18,442 |
Tags: combinatorics, math
Correct Solution:
```
n, m = map(int, input().split())
f = [1]
for i in range(1, n+1):
f.append(f[-1] * i % m)
s = 0
for x in range(1, n+1):
s += ((f[x] * f[n-x]) % m) * ((n-x+1) ** 2 % m) % m
s %= m
print(s)
``` | output | 1 | 9,221 | 12 | 18,443 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Recall that the permutation is an array consisting of n distinct integers from 1 to n in arbitrary order. For example, [2,3,1,5,4] is a permutation, but [1,2,2] is not a permutation (2 appears twice in the array) and [1,3,4] is also not a pe... | instruction | 0 | 9,222 | 12 | 18,444 |
Tags: combinatorics, math
Correct Solution:
```
n, mod = map(int, input().split())
f = [1] + [0] * n
for i in range(1, n + 1):
f[i] = (i * f[i - 1]) % mod
ret = 0
for size in range(1, n + 1):
ret += (n - size + 1) * (f[size] * f[n - size + 1]) % mod
ret %= mod
print(ret)
``` | output | 1 | 9,222 | 12 | 18,445 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Recall that the permutation is an array consisting of n distinct integers from 1 to n in arbitrary order. For example, [2,3,1,5,4] is a permutation, but [1,2,2] is not a permutation (2 appears twice in the array) and [1,3,4] is also not a pe... | instruction | 0 | 9,223 | 12 | 18,446 |
Tags: combinatorics, math
Correct Solution:
```
n,m=map(int,input().split())
x = [1]
ans = 0
for i in range(1, n + 1):
x.append(i * x[-1] %m)
for i in range(1,n+1):
ans = ((n-i+1)*x[i]*x[n-i+1]%m + ans)%m
print(ans)
``` | output | 1 | 9,223 | 12 | 18,447 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Recall that the permutation is an array consisting of n distinct integers from 1 to n in arbitrary order. For example, [2,3,1,5,4] is a permutation, but [1,2,2] is not a permutation (2 appears twice in the array) and [1,3,4] is also not a pe... | instruction | 0 | 9,224 | 12 | 18,448 |
Tags: combinatorics, math
Correct Solution:
```
n,m=map(int,input().split())
f=[0]*(n+1)
f[0]=1
for i in range(1,n+1):
f[i]=((f[i-1]%m)*(i%m))%m
ans=0
for i in range(1,n+1):
ans+=((n-i+1)**2)%m*(f[i]%m)*(f[n-i]%m)
ans%=m
print(ans)
``` | output | 1 | 9,224 | 12 | 18,449 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Recall that the permutation is an array consisting of n distinct integers from 1 to n in arbitrary order. For example, [2,3,1,5,4] is a permutation, but [1,2,2] is not a permutation (2 appears twice in the array) and [1,3,4] is also not a pe... | instruction | 0 | 9,225 | 12 | 18,450 |
Tags: combinatorics, math
Correct Solution:
```
input = __import__('sys').stdin.readline
MIS = lambda: map(int,input().split())
n, MOD = MIS()
ans = 0
fac = [1]
for i in range(1, n+2): fac.append(fac[-1] * i % MOD)
for d in range(1, n+1):
ans+= (n-d+1)**2 * fac[d] * fac[n-d]
ans%= MOD
print(ans)
``` | output | 1 | 9,225 | 12 | 18,451 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Recall that the permutation is an array consisting of n distinct integers from 1 to n in arbitrary order. For example, [2,3,1,5,4] is a permutation, but [1,2,2] is not a permutation (2 appears twice in the array) and [1,3,4] is also not a pe... | instruction | 0 | 9,226 | 12 | 18,452 |
Tags: combinatorics, math
Correct Solution:
```
n,m=map(int,input().split())
fac=[0]*(n+1)
fac[0]=1
ans=0
for i in range(1,n+1):fac[i]=(fac[i-1]*i)%m
#print(fac)
for i in range(1,n+1):
p=fac[i]*fac[n-i+1]*(n-i+1)
#print(p)
ans+=p
ans%=m
print(ans)
``` | output | 1 | 9,226 | 12 | 18,453 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Recall that the permutation is an array consisting of n distinct integers from 1 to n in arbitrary order. For example, [2,3,1,5,4] is a permutation, but [1,2,2] is not a permutation (2 appears twice in the array) and [1,3,4] is also not a pe... | instruction | 0 | 9,227 | 12 | 18,454 |
Tags: combinatorics, math
Correct Solution:
```
n, m = [int(x) for x in input().split()]
fac=[1]*n
for i in range(2, n+1):
fac[i-1]=(fac[i-2]*i)%m
ans=0
for i in range(n):
ans+=(((i+1)*fac[i]%m)*fac[n-i-1])%m
ans%=m
print (ans)
``` | output | 1 | 9,227 | 12 | 18,455 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Recall that the permutation is an array consisting of n distinct integers from 1 to n in arbitrary order. For example, [2,3,1,5,4] is a permutation, but [1,2,2] is not a permutation (2 appears twice in the array) and [1,3,4] is also not a pe... | instruction | 0 | 9,228 | 12 | 18,456 |
Tags: combinatorics, math
Correct Solution:
```
from sys import stdin
from itertools import permutations
def input():
return stdin.readline()[:-1]
def intput():
return int(input())
def sinput():
return input().split()
def intsput():
return map(int, sinput())
debugging = False
def dprint(*args)... | output | 1 | 9,228 | 12 | 18,457 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Recall that the permutation is an array consisting of n distinct integers from 1 to n in arbitrary order. For example, [2,3,1,5,4] is a permutation, but [1,2,2] is not a permutation (2 appears t... | instruction | 0 | 9,229 | 12 | 18,458 |
Yes | output | 1 | 9,229 | 12 | 18,459 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Recall that the permutation is an array consisting of n distinct integers from 1 to n in arbitrary order. For example, [2,3,1,5,4] is a permutation, but [1,2,2] is not a permutation (2 appears t... | instruction | 0 | 9,230 | 12 | 18,460 |
Yes | output | 1 | 9,230 | 12 | 18,461 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Recall that the permutation is an array consisting of n distinct integers from 1 to n in arbitrary order. For example, [2,3,1,5,4] is a permutation, but [1,2,2] is not a permutation (2 appears t... | instruction | 0 | 9,231 | 12 | 18,462 |
Yes | output | 1 | 9,231 | 12 | 18,463 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Recall that the permutation is an array consisting of n distinct integers from 1 to n in arbitrary order. For example, [2,3,1,5,4] is a permutation, but [1,2,2] is not a permutation (2 appears t... | instruction | 0 | 9,232 | 12 | 18,464 |
Yes | output | 1 | 9,232 | 12 | 18,465 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Recall that the permutation is an array consisting of n distinct integers from 1 to n in arbitrary order. For example, [2,3,1,5,4] is a permutation, but [1,2,2] is not a permutation (2 appears t... | instruction | 0 | 9,233 | 12 | 18,466 |
No | output | 1 | 9,233 | 12 | 18,467 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Recall that the permutation is an array consisting of n distinct integers from 1 to n in arbitrary order. For example, [2,3,1,5,4] is a permutation, but [1,2,2] is not a permutation (2 appears t... | instruction | 0 | 9,234 | 12 | 18,468 |
No | output | 1 | 9,234 | 12 | 18,469 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Recall that the permutation is an array consisting of n distinct integers from 1 to n in arbitrary order. For example, [2,3,1,5,4] is a permutation, but [1,2,2] is not a permutation (2 appears t... | instruction | 0 | 9,235 | 12 | 18,470 |
No | output | 1 | 9,235 | 12 | 18,471 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Recall that the permutation is an array consisting of n distinct integers from 1 to n in arbitrary order. For example, [2,3,1,5,4] is a permutation, but [1,2,2] is not a permutation (2 appears t... | instruction | 0 | 9,236 | 12 | 18,472 |
No | output | 1 | 9,236 | 12 | 18,473 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given three integers n, k, m and m conditions (l_1, r_1, x_1), (l_2, r_2, x_2), ..., (l_m, r_m, x_m).
Calculate the number of distinct arrays a, consisting of n integers such that:
* 0 β€ a_i < 2^k for each 1 β€ i β€ n;
* bitwis... | instruction | 0 | 9,253 | 12 | 18,506 |
Tags: bitmasks, combinatorics, data structures, dp, two pointers
Correct Solution:
```
def main():
import sys
input = sys.stdin.buffer.readline
mod = 998244353
N, K, M = map(int, input().split())
cond = []
for _ in range(M):
cond.append(tuple(map(int, input().split())))
ans = 1
... | output | 1 | 9,253 | 12 | 18,507 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given three integers n, k, m and m conditions (l_1, r_1, x_1), (l_2, r_2, x_2), ..., (l_m, r_m, x_m).
Calculate the number of distinct arrays a, consisting of n integers such that:
* 0 β€ a_i < 2^k for each 1 β€ i β€ n;
* bitwis... | instruction | 0 | 9,254 | 12 | 18,508 |
Tags: bitmasks, combinatorics, data structures, dp, two pointers
Correct Solution:
```
import io, os
input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
from itertools import accumulate
n,k,m=map(int,input().split())
Q=[tuple(map(int,input().split())) for i in range(m)]
mod=998244353
S=1
for keta in range(k)... | output | 1 | 9,254 | 12 | 18,509 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given three integers n, k, m and m conditions (l_1, r_1, x_1), (l_2, r_2, x_2), ..., (l_m, r_m, x_m).
Calculate the number of distinct arrays a, consisting of n integers such that:
... | instruction | 0 | 9,255 | 12 | 18,510 |
No | output | 1 | 9,255 | 12 | 18,511 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given three integers n, k, m and m conditions (l_1, r_1, x_1), (l_2, r_2, x_2), ..., (l_m, r_m, x_m).
Calculate the number of distinct arrays a, consisting of n integers such that:
... | instruction | 0 | 9,256 | 12 | 18,512 |
No | output | 1 | 9,256 | 12 | 18,513 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given three integers n, k, m and m conditions (l_1, r_1, x_1), (l_2, r_2, x_2), ..., (l_m, r_m, x_m).
Calculate the number of distinct arrays a, consisting of n integers such that:
... | instruction | 0 | 9,257 | 12 | 18,514 |
No | output | 1 | 9,257 | 12 | 18,515 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given three integers n, k, m and m conditions (l_1, r_1, x_1), (l_2, r_2, x_2), ..., (l_m, r_m, x_m).
Calculate the number of distinct arrays a, consisting of n integers such that:
... | instruction | 0 | 9,258 | 12 | 18,516 |
No | output | 1 | 9,258 | 12 | 18,517 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Long time ago there was a symmetric array a_1,a_2,β¦,a_{2n} consisting of 2n distinct integers. Array a_1,a_2,β¦,a_{2n} is called symmetric if for each integer 1 β€ i β€ 2n, there exists an integer 1 β€ j β€ 2n such that a_i = -a_j.
For each inte... | instruction | 0 | 9,297 | 12 | 18,594 |
Tags: implementation, math, sortings
Correct Solution:
```
import sys
input = sys.stdin.readline
from collections import Counter
for _ in range(int(input())):
n = int(input())
A = sorted(map(int, input().split()))
for k in A:
if k % 2:
print("NO")
break
else:
A =... | output | 1 | 9,297 | 12 | 18,595 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Long time ago there was a symmetric array a_1,a_2,β¦,a_{2n} consisting of 2n distinct integers. Array a_1,a_2,β¦,a_{2n} is called symmetric if for each integer 1 β€ i β€ 2n, there exists an integer 1 β€ j β€ 2n such that a_i = -a_j.
For each inte... | instruction | 0 | 9,298 | 12 | 18,596 |
Tags: implementation, math, sortings
Correct Solution:
```
import sys
input = lambda: sys.stdin.readline().rstrip("\r\n")
for _ in range(int(input())):
n=int(input())
a=list(map(int,input().split()))
t=set()
ans='YES'
for i in a:
t.add(i)
if i%2:
ans='NO'
if len(t)!... | output | 1 | 9,298 | 12 | 18,597 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Long time ago there was a symmetric array a_1,a_2,β¦,a_{2n} consisting of 2n distinct integers. Array a_1,a_2,β¦,a_{2n} is called symmetric if for each integer 1 β€ i β€ 2n, there exists an integer 1 β€ j β€ 2n such that a_i = -a_j.
For each inte... | instruction | 0 | 9,299 | 12 | 18,598 |
Tags: implementation, math, sortings
Correct Solution:
```
import sys
T=int(sys.stdin.readline().strip())
while (T>0):
T-=1
n=int(sys.stdin.readline().strip())
b=sys.stdin.readline().strip().split(" ")
b=list(map(lambda x: int(x), b))
a=sorted(b,reverse=True)
#print (a)
sum=0
flag= True
cnt={}
for i in ran... | output | 1 | 9,299 | 12 | 18,599 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Long time ago there was a symmetric array a_1,a_2,β¦,a_{2n} consisting of 2n distinct integers. Array a_1,a_2,β¦,a_{2n} is called symmetric if for each integer 1 β€ i β€ 2n, there exists an integer 1 β€ j β€ 2n such that a_i = -a_j.
For each inte... | instruction | 0 | 9,300 | 12 | 18,600 |
Tags: implementation, math, sortings
Correct Solution:
```
import sys;input = lambda: sys.stdin.readline().rstrip()
#CF698-2-C-1500
#from heapq import heappush, heappop
#from collections import deque
#import numpy as np
#from collections import Counter as cnt
#from collections import defaultdict as ddc
#from math impor... | output | 1 | 9,300 | 12 | 18,601 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Long time ago there was a symmetric array a_1,a_2,β¦,a_{2n} consisting of 2n distinct integers. Array a_1,a_2,β¦,a_{2n} is called symmetric if for each integer 1 β€ i β€ 2n, there exists an integer 1 β€ j β€ 2n such that a_i = -a_j.
For each inte... | instruction | 0 | 9,301 | 12 | 18,602 |
Tags: implementation, math, sortings
Correct Solution:
```
def merge(array, begin, half, end):
copy_array = list()
i = begin
j = half+1
while(i <= half and j <= end):
if(array[i] < array[j]):
copy_array.append(array[i])
i+=1
else:
copy_array.append(arr... | output | 1 | 9,301 | 12 | 18,603 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Long time ago there was a symmetric array a_1,a_2,β¦,a_{2n} consisting of 2n distinct integers. Array a_1,a_2,β¦,a_{2n} is called symmetric if for each integer 1 β€ i β€ 2n, there exists an integer 1 β€ j β€ 2n such that a_i = -a_j.
For each inte... | instruction | 0 | 9,302 | 12 | 18,604 |
Tags: implementation, math, sortings
Correct Solution:
```
import time,math as mt,bisect as bs,sys
from sys import stdin,stdout
from collections import deque
from fractions import Fraction
from collections import Counter
from collections import OrderedDict
pi=3.14159265358979323846264338327950
def II(): # to take integ... | output | 1 | 9,302 | 12 | 18,605 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Long time ago there was a symmetric array a_1,a_2,β¦,a_{2n} consisting of 2n distinct integers. Array a_1,a_2,β¦,a_{2n} is called symmetric if for each integer 1 β€ i β€ 2n, there exists an integer 1 β€ j β€ 2n such that a_i = -a_j.
For each inte... | instruction | 0 | 9,303 | 12 | 18,606 |
Tags: implementation, math, sortings
Correct Solution:
```
gans = []
for _ in range(int(input())):
n = int(input())
s = list(map(int, input().split()))
s.sort()
s1 = s[:]
ok = False
d = []
for i in range(1, 2 * n, 2):
if s[i] != s[i - 1] or s[i] % 2 != 0:
gans.append('NO'... | output | 1 | 9,303 | 12 | 18,607 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Long time ago there was a symmetric array a_1,a_2,β¦,a_{2n} consisting of 2n distinct integers. Array a_1,a_2,β¦,a_{2n} is called symmetric if for each integer 1 β€ i β€ 2n, there exists an integer 1 β€ j β€ 2n such that a_i = -a_j.
For each inte... | instruction | 0 | 9,304 | 12 | 18,608 |
Tags: implementation, math, sortings
Correct Solution:
```
ll=lambda:map(int,input().split())
t=lambda:int(input())
ss=lambda:input()
#from math import log10 ,log2,ceil,factorial as f,gcd
#from itertools import combinations_with_replacement as cs
#from functools import reduce
#from bisect import bisect_right as br
fro... | output | 1 | 9,304 | 12 | 18,609 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Long time ago there was a symmetric array a_1,a_2,β¦,a_{2n} consisting of 2n distinct integers. Array a_1,a_2,β¦,a_{2n} is called symmetric if for each integer 1 β€ i β€ 2n, there exists an integer ... | instruction | 0 | 9,305 | 12 | 18,610 |
Yes | output | 1 | 9,305 | 12 | 18,611 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Long time ago there was a symmetric array a_1,a_2,β¦,a_{2n} consisting of 2n distinct integers. Array a_1,a_2,β¦,a_{2n} is called symmetric if for each integer 1 β€ i β€ 2n, there exists an integer ... | instruction | 0 | 9,306 | 12 | 18,612 |
Yes | output | 1 | 9,306 | 12 | 18,613 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.