message stringlengths 2 65.1k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 0 108k | cluster float64 14 14 | __index_level_0__ int64 0 217k |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vadim is really keen on travelling. Recently he heard about kayaking activity near his town and became very excited about it, so he joined a party of kayakers.
Now the party is ready to start i... | instruction | 0 | 53,597 | 14 | 107,194 |
Yes | output | 1 | 53,597 | 14 | 107,195 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vadim is really keen on travelling. Recently he heard about kayaking activity near his town and became very excited about it, so he joined a party of kayakers.
Now the party is ready to start i... | instruction | 0 | 53,600 | 14 | 107,200 |
No | output | 1 | 53,600 | 14 | 107,201 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vadim is really keen on travelling. Recently he heard about kayaking activity near his town and became very excited about it, so he joined a party of kayakers.
Now the party is ready to start i... | instruction | 0 | 53,602 | 14 | 107,204 |
No | output | 1 | 53,602 | 14 | 107,205 |
Provide a correct Python 3 solution for this coding contest problem.
Problem
There are N villages. Each village is numbered from 1 to N. Due to the recent merger boom, several villages have been merged. Two or more merged villages will become one new city, and villages that are not merged with any village will remain... | instruction | 0 | 53,870 | 14 | 107,740 |
"Correct Solution:
```
# AOJ 1576: Community Integration
# Python3 2018.7.13 bal4u
# UNION-FIND library
class UnionSet:
def __init__(self, nmax):
self.size = [1]*nmax
self.id = [i for i in range(nmax+1)]
def root(self, i):
while i != self.id[i]:
self.id[i] = self.id[self.id[i]]
i = self.id[i]
return i
... | output | 1 | 53,870 | 14 | 107,741 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
It's Christmas time! PolandBall and his friends will be giving themselves gifts. There are n Balls overall. Each Ball has someone for whom he should bring a present according to some permutation... | instruction | 0 | 54,462 | 14 | 108,924 |
No | output | 1 | 54,462 | 14 | 108,925 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
It's Christmas time! PolandBall and his friends will be giving themselves gifts. There are n Balls overall. Each Ball has someone for whom he should bring a present according to some permutation... | instruction | 0 | 54,463 | 14 | 108,926 |
No | output | 1 | 54,463 | 14 | 108,927 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
It's Christmas time! PolandBall and his friends will be giving themselves gifts. There are n Balls overall. Each Ball has someone for whom he should bring a present according to some permutation... | instruction | 0 | 54,464 | 14 | 108,928 |
No | output | 1 | 54,464 | 14 | 108,929 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
It's Christmas time! PolandBall and his friends will be giving themselves gifts. There are n Balls overall. Each Ball has someone for whom he should bring a present according to some permutation... | instruction | 0 | 54,465 | 14 | 108,930 |
No | output | 1 | 54,465 | 14 | 108,931 |
Provide tags and a correct Python 3 solution for this coding contest problem.
As you could know there are no male planes nor female planes. However, each plane on Earth likes some other plane. There are n planes on Earth, numbered from 1 to n, and the plane with number i likes the plane with number fi, where 1 ≤ fi ≤ ... | instruction | 0 | 54,502 | 14 | 109,004 |
Tags: graphs
Correct Solution:
```
def is_love(l):
s=set(l)
if len(s) < 3:
print("NO")
else:
possible=False
for i in range(len(l)):
a=l[i]
b=l[a-1]
c=l[b-1]
if a!=b and b!=c and c!=a and l[c-1] == a:
print("YES")
... | output | 1 | 54,502 | 14 | 109,005 |
Provide tags and a correct Python 3 solution for this coding contest problem.
As you could know there are no male planes nor female planes. However, each plane on Earth likes some other plane. There are n planes on Earth, numbered from 1 to n, and the plane with number i likes the plane with number fi, where 1 ≤ fi ≤ ... | instruction | 0 | 54,503 | 14 | 109,006 |
Tags: graphs
Correct Solution:
```
n = int(input())
f = list(map(int, input().split()))
ans = False
for i in f:
ans = ans or (f[f[f[i-1]-1]-1] == i)
print("YES" if ans else "NO")
``` | output | 1 | 54,503 | 14 | 109,007 |
Provide tags and a correct Python 3 solution for this coding contest problem.
As you could know there are no male planes nor female planes. However, each plane on Earth likes some other plane. There are n planes on Earth, numbered from 1 to n, and the plane with number i likes the plane with number fi, where 1 ≤ fi ≤ ... | instruction | 0 | 54,504 | 14 | 109,008 |
Tags: graphs
Correct Solution:
```
n=int(input())
li=list(map(int,input().split()))
flag=0
for i in range(n):
if(li[li[li[i]-1]-1]==i+1):
print("YES")
flag=1
break
if(flag!=1):
print("NO")
``` | output | 1 | 54,504 | 14 | 109,009 |
Provide tags and a correct Python 3 solution for this coding contest problem.
As you could know there are no male planes nor female planes. However, each plane on Earth likes some other plane. There are n planes on Earth, numbered from 1 to n, and the plane with number i likes the plane with number fi, where 1 ≤ fi ≤ ... | instruction | 0 | 54,505 | 14 | 109,010 |
Tags: graphs
Correct Solution:
```
input()
p=[int(x)-1 for x in input().split()]
for i in p:
if p[p[p[i]]]==i:exit(print("YES"))
print("NO")
# My code says who am i
# I want to burn and born at this way
# In my eye there is not any things Except love ...
``` | output | 1 | 54,505 | 14 | 109,011 |
Provide tags and a correct Python 3 solution for this coding contest problem.
As you could know there are no male planes nor female planes. However, each plane on Earth likes some other plane. There are n planes on Earth, numbered from 1 to n, and the plane with number i likes the plane with number fi, where 1 ≤ fi ≤ ... | instruction | 0 | 54,506 | 14 | 109,012 |
Tags: graphs
Correct Solution:
```
import sys,math
input=sys.stdin.readline
L=lambda : list(map(int,input().split()))
M=lambda : map(int,input().split())
n=int(input())
l=L()
l=[0]+l
d=0
for i in range(1,n+1):
if(l[l[l[l[i]]]]==l[i]):
print("YES")
d=1
break
if(d==0):
print("NO")
``` | output | 1 | 54,506 | 14 | 109,013 |
Provide tags and a correct Python 3 solution for this coding contest problem.
As you could know there are no male planes nor female planes. However, each plane on Earth likes some other plane. There are n planes on Earth, numbered from 1 to n, and the plane with number i likes the plane with number fi, where 1 ≤ fi ≤ ... | instruction | 0 | 54,507 | 14 | 109,014 |
Tags: graphs
Correct Solution:
```
n = int(input())
a = 0
array = list(map(int, input().split()))
for i in range(n):
if array[array[i]-1] != i + 1:
if array[array[array[i]-1]-1] == i+1:
a = 1
if a == 1:
print("yes")
else:
print("no")
``` | output | 1 | 54,507 | 14 | 109,015 |
Provide tags and a correct Python 3 solution for this coding contest problem.
As you could know there are no male planes nor female planes. However, each plane on Earth likes some other plane. There are n planes on Earth, numbered from 1 to n, and the plane with number i likes the plane with number fi, where 1 ≤ fi ≤ ... | instruction | 0 | 54,508 | 14 | 109,016 |
Tags: graphs
Correct Solution:
```
n = int(input())
a = [0] + list(map(int, input().split()))
for i in range(1, n + 1):
if a[a[a[i]]] == i:
print("yes")
quit();
print("no")
``` | output | 1 | 54,508 | 14 | 109,017 |
Provide tags and a correct Python 3 solution for this coding contest problem.
As you could know there are no male planes nor female planes. However, each plane on Earth likes some other plane. There are n planes on Earth, numbered from 1 to n, and the plane with number i likes the plane with number fi, where 1 ≤ fi ≤ ... | instruction | 0 | 54,509 | 14 | 109,018 |
Tags: graphs
Correct Solution:
```
n = int(input())
a = list(map(lambda x: int(x) - 1, input().split()))
print('YES' if [i for i in range(n) if a[a[a[i]]] == i] else 'NO')
``` | output | 1 | 54,509 | 14 | 109,019 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n computers in a row, all originally off, and Phoenix wants to turn all of them on. He will manually turn on computers one at a time. At any point, if computer i-1 and computer i+1 are both on, computer i (2 ≤ i ≤ n-1) will turn on... | instruction | 0 | 55,013 | 14 | 110,026 |
Tags: combinatorics, dp, math
Correct Solution:
```
import sys
f = sys.stdin
def line():
return f.readline().strip().split()
def powers(limit):
size = limit+1
p = [1]*size
for n in range(1,size):
p[n] = (2*p[n-1]) % M
return p
def binomials(limit):
size = limit+1
bc = [[... | output | 1 | 55,013 | 14 | 110,027 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n computers in a row, all originally off, and Phoenix wants to turn all of them on. He will manually turn on computers one at a time. At any point, if computer i-1 and computer i+1 are both on, computer i (2 ≤ i ≤ n-1) will turn on... | instruction | 0 | 55,014 | 14 | 110,028 |
Tags: combinatorics, dp, math
Correct Solution:
```
p1, g1, ig1 = 104857601, 3, 34952534
p2, g2, ig2 = 111149057, 3, 37049686
p3, g3, ig3 = 113246209, 7, 16178030
z1 = 439957480532171226961446
z2 = 879898597692195524486915
z3 = 8496366309945115353
ppp = p1 * p2 * p3
W1 = [pow(g1, (p1 - 1) >> i, p1) for i in range(22)]... | output | 1 | 55,014 | 14 | 110,029 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n computers in a row, all originally off, and Phoenix wants to turn all of them on. He will manually turn on computers one at a time. At any point, if computer i-1 and computer i+1 are both on, computer i (2 ≤ i ≤ n-1) will turn on... | instruction | 0 | 55,015 | 14 | 110,030 |
Tags: combinatorics, dp, math
Correct Solution:
```
z='"""6"k"="3,"iG"17G"6m?"C@f"2<6z"ki1,"1Y[{s"dnF)N"1j.&{o"aZ>k}1"173exa+"atUi,},"1canZ35z"b*-!Ps6l"1z<F!WJlC"fQrp~1])H"1}8l0AiPTl"nXgm#Z5lD,"3i(T`qx~]Ds"E+Ogt0CrjAN"5>bFGHj(<llo">9?a93{7]We1"c40^D[.LMx?g+"1?yzBa$^7a2IJ,"rJI9D,^7>i4#:z"4L*D}`_BGPQ0eIl"*CQ>kP?.na$|N4C"... | output | 1 | 55,015 | 14 | 110,031 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n computers in a row, all originally off, and Phoenix wants to turn all of them on. He will manually turn on computers one at a time. At any point, if computer i-1 and computer i+1 are both on, computer i (2 ≤ i ≤ n-1) will turn on... | instruction | 0 | 55,016 | 14 | 110,032 |
Tags: combinatorics, dp, math
Correct Solution:
```
def decode(s):
sz, l, r = len(s), 0, 0
a = []
while l<sz:
while r+1<sz and s[r+1]!=' ': r += 1
x = 0
for i in range(r, l-1, -1):
t = ord(s[i]) - 33
t -= int(t>=1)
t -= int(t>=11)
t -= ... | output | 1 | 55,016 | 14 | 110,033 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n computers in a row, all originally off, and Phoenix wants to turn all of them on. He will manually turn on computers one at a time. At any point, if computer i-1 and computer i+1 are both on, computer i (2 ≤ i ≤ n-1) will turn on... | instruction | 0 | 55,017 | 14 | 110,034 |
Tags: combinatorics, dp, math
Correct Solution:
```
fac = [1] * 500
finv = [1] * 500
p2 = [1] * 500
n, MOD = map(int, input().split())
for i in range(len(fac) - 1):
fac[i + 1] = fac[i] * (i + 1) % MOD
finv[i + 1] = pow(fac[i + 1], MOD - 2, MOD)
p2[i + 1] = p2[i] * 2 % MOD
ans = 0
dp = [[0] * (n // 2 + 2)... | output | 1 | 55,017 | 14 | 110,035 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n computers in a row, all originally off, and Phoenix wants to turn all of them on. He will manually turn on computers one at a time. At any point, if computer i-1 and computer i+1 are both on, computer i (2 ≤ i ≤ n-1) will turn on... | instruction | 0 | 55,018 | 14 | 110,036 |
Tags: combinatorics, dp, math
Correct Solution:
```
inp = input().split()
totNums, mod = int(inp[0]), int(inp[1])
def Exp(b,exp):
if exp==0: return 1
temp = Exp(b,exp>>1)**2
if exp%2==1: temp*=b
return temp%mod
#main
n = 410
#Precompute
fact, inv = [0 for i in range(n)],[0 for i in range(n)]
fact[0] = inv[0] ... | output | 1 | 55,018 | 14 | 110,037 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n computers in a row, all originally off, and Phoenix wants to turn all of them on. He will manually turn on computers one at a time. At any point, if computer i-1 and computer i+1 are both on, computer i (2 ≤ i ≤ n-1) will turn on... | instruction | 0 | 55,019 | 14 | 110,038 |
Tags: combinatorics, dp, math
Correct Solution:
```
a = ['*g>/70KO^-vaWt/FUBJ9o<w5D4-cw<a~N%}vAWyhm8)l%Jg"(:W298snwI98WIU', '<b+RiR+|XG$Q%sOKQ?{ +o@wU:w[z"/#[8?:wY5goGLha]eX{VK#!]r_I!nm WN5', "j>r&.Fhy)-qN,E,PK9iKf4bY1QC;2tnh}(K%uYwrJ{#OevoP]'=L.wdo#|jZ$5mc(", '%YUB;W!_Z_.77;Lp;"k}>sZR.&)V6I%%&2X;(r;c*]>-R;L@xa\');\'cF... | output | 1 | 55,019 | 14 | 110,039 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n computers in a row, all originally off, and Phoenix wants to turn all of them on. He will manually turn on computers one at a time. At any point, if computer i-1 and computer i+1 are both on, computer i (2 ≤ i ≤ n-1) will turn on... | instruction | 0 | 55,020 | 14 | 110,040 |
Tags: combinatorics, dp, math
Correct Solution:
```
n, mod = map(int, input().split())
le = 500
def pow(x, y): # x**y の mod を返す。modは素数でなくてもよい。
ans = 1
while y > 0:
if y % 2 == 1:
ans = (ans * x) % mod
x = (x**2) % mod
y //= 2
return ans
def inv(x): # x の mod での逆元を返... | output | 1 | 55,020 | 14 | 110,041 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n computers in a row, all originally off, and Phoenix wants to turn all of them on. He will manually turn on computers one at a time. At any point, if computer i-1 and computer i+1 are... | instruction | 0 | 55,021 | 14 | 110,042 |
Yes | output | 1 | 55,021 | 14 | 110,043 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n computers in a row, all originally off, and Phoenix wants to turn all of them on. He will manually turn on computers one at a time. At any point, if computer i-1 and computer i+1 are... | instruction | 0 | 55,022 | 14 | 110,044 |
Yes | output | 1 | 55,022 | 14 | 110,045 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n computers in a row, all originally off, and Phoenix wants to turn all of them on. He will manually turn on computers one at a time. At any point, if computer i-1 and computer i+1 are... | instruction | 0 | 55,023 | 14 | 110,046 |
Yes | output | 1 | 55,023 | 14 | 110,047 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n computers in a row, all originally off, and Phoenix wants to turn all of them on. He will manually turn on computers one at a time. At any point, if computer i-1 and computer i+1 are... | instruction | 0 | 55,024 | 14 | 110,048 |
Yes | output | 1 | 55,024 | 14 | 110,049 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n computers in a row, all originally off, and Phoenix wants to turn all of them on. He will manually turn on computers one at a time. At any point, if computer i-1 and computer i+1 are... | instruction | 0 | 55,025 | 14 | 110,050 |
No | output | 1 | 55,025 | 14 | 110,051 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n computers in a row, all originally off, and Phoenix wants to turn all of them on. He will manually turn on computers one at a time. At any point, if computer i-1 and computer i+1 are... | instruction | 0 | 55,026 | 14 | 110,052 |
No | output | 1 | 55,026 | 14 | 110,053 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n computers in a row, all originally off, and Phoenix wants to turn all of them on. He will manually turn on computers one at a time. At any point, if computer i-1 and computer i+1 are... | instruction | 0 | 55,027 | 14 | 110,054 |
No | output | 1 | 55,027 | 14 | 110,055 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n computers in a row, all originally off, and Phoenix wants to turn all of them on. He will manually turn on computers one at a time. At any point, if computer i-1 and computer i+1 are... | instruction | 0 | 55,028 | 14 | 110,056 |
No | output | 1 | 55,028 | 14 | 110,057 |
Provide tags and a correct Python 3 solution for this coding contest problem.
ZS the Coder has recently found an interesting concept called the Birthday Paradox. It states that given a random set of 23 people, there is around 50% chance that some two of them share the same birthday. ZS the Coder finds this very intere... | instruction | 0 | 55,285 | 14 | 110,570 |
Tags: math, number theory, probabilities
Correct Solution:
```
n, k = map(int, input().split())
mod = 1000003
if n < 70 and 2**n < k:
print('1 1\n')
exit(0)
def modpow(a, e):
ret = 1
while e > 0:
if e%2 == 1:
ret = (ret*a)%mod
a = (a*a)%mod
e = e//2
return ret
def pw(a, e):
ret = 1
while e > 0:
if... | output | 1 | 55,285 | 14 | 110,571 |
Provide tags and a correct Python 3 solution for this coding contest problem.
ZS the Coder has recently found an interesting concept called the Birthday Paradox. It states that given a random set of 23 people, there is around 50% chance that some two of them share the same birthday. ZS the Coder finds this very intere... | instruction | 0 | 55,286 | 14 | 110,572 |
Tags: math, number theory, probabilities
Correct Solution:
```
import math
n, k = [int(x) for x in input().split()]
if n<70 and k>2**n:
print(1,1)
exit(0)
mod = int(1e6)+3
def fastpow(a,b):
t, ans = a, 1
while b:
if(b&1):
ans = ans*t%mod
t = t*t %mod
b>>=1
return... | output | 1 | 55,286 | 14 | 110,573 |
Provide tags and a correct Python 3 solution for this coding contest problem.
ZS the Coder has recently found an interesting concept called the Birthday Paradox. It states that given a random set of 23 people, there is around 50% chance that some two of them share the same birthday. ZS the Coder finds this very intere... | instruction | 0 | 55,287 | 14 | 110,574 |
Tags: math, number theory, probabilities
Correct Solution:
```
import sys
mod = 10 ** 6 + 3
n, k = map(int, input().split())
if n < 100:
if 2 ** n < k:
print(1, 1)
sys.exit()
def factor(n, p):
if n < p: return 0
return n // p + factor(n // p, p)
def inv(n):
return pow(n, mod - 2, mod... | output | 1 | 55,287 | 14 | 110,575 |
Provide tags and a correct Python 3 solution for this coding contest problem.
ZS the Coder has recently found an interesting concept called the Birthday Paradox. It states that given a random set of 23 people, there is around 50% chance that some two of them share the same birthday. ZS the Coder finds this very intere... | instruction | 0 | 55,288 | 14 | 110,576 |
Tags: math, number theory, probabilities
Correct Solution:
```
n, k = map(int, input().split())
MOD = 1000003
K = k - 1
max_deg = 0
while K > 0:
max_deg += K // 2
K //= 2
den_deg = n * (k-1) - max_deg
kk = 1
for i in range(n):
kk *= 2
if kk >= k: break
else:
print(1, 1)
exit(0)
numerator ... | output | 1 | 55,288 | 14 | 110,577 |
Provide tags and a correct Python 3 solution for this coding contest problem.
ZS the Coder has recently found an interesting concept called the Birthday Paradox. It states that given a random set of 23 people, there is around 50% chance that some two of them share the same birthday. ZS the Coder finds this very intere... | instruction | 0 | 55,289 | 14 | 110,578 |
Tags: math, number theory, probabilities
Correct Solution:
```
#copied
import math
n, k = [int(x) for x in input().split()]
if n<70 and k>2**n:
print(1,1)
exit(0)
mod = int(1e6)+3
def fastpow(a,b):
t, ans = a, 1
while b:
if(b&1):
ans = ans*t%mod
t = t*t %mod
b>>=1
... | output | 1 | 55,289 | 14 | 110,579 |
Provide tags and a correct Python 3 solution for this coding contest problem.
ZS the Coder has recently found an interesting concept called the Birthday Paradox. It states that given a random set of 23 people, there is around 50% chance that some two of them share the same birthday. ZS the Coder finds this very intere... | instruction | 0 | 55,290 | 14 | 110,580 |
Tags: math, number theory, probabilities
Correct Solution:
```
m = 10** 6 + 3
n, k = map(int, input().split())
p = 1
for i in range(n):
p *= 2
if p > k:
break
if p < k:
print('1 1')
exit()
gcd = tmp = k - 1
while tmp:
gcd -= tmp % 2
tmp //= 2
b = pow(2, (k - 1) * n - gcd, m)
a = 1
mem ... | output | 1 | 55,290 | 14 | 110,581 |
Provide tags and a correct Python 3 solution for this coding contest problem.
ZS the Coder has recently found an interesting concept called the Birthday Paradox. It states that given a random set of 23 people, there is around 50% chance that some two of them share the same birthday. ZS the Coder finds this very intere... | instruction | 0 | 55,291 | 14 | 110,582 |
Tags: math, number theory, probabilities
Correct Solution:
```
#!/usr/bin/env python3
import os
MOD = 1000003
inv2 = pow(2, MOD - 2, MOD)
def logm(n, m):
# log = 3.3
# return (3, False)
ans = 0
whole = True
while n >= m:
whole = whole and (n % m == 0)
ans += 1
n //= m
if... | output | 1 | 55,291 | 14 | 110,583 |
Provide tags and a correct Python 3 solution for this coding contest problem.
ZS the Coder has recently found an interesting concept called the Birthday Paradox. It states that given a random set of 23 people, there is around 50% chance that some two of them share the same birthday. ZS the Coder finds this very intere... | instruction | 0 | 55,292 | 14 | 110,584 |
Tags: math, number theory, probabilities
Correct Solution:
```
import math
def euclid_algorithm(a, b):
t1, t2 = abs(a), abs(b)
#saving equalities:
#t1 == x1 * a + y1 * b,
#t2 == x2 * a + y2 * b.
x1, y1, x2, y2 = int(math.copysign(1, a)), 0, 0, int(math.copysign(1, b))
if t1 < t2:
t1, t... | output | 1 | 55,292 | 14 | 110,585 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Good job! Now that Heidi is able to distinguish between Poisson and uniform distributions, she is in a good position to actually estimate the populations.
Can you help Heidi estimate each village's population?
Input
Same as the easy versi... | instruction | 0 | 55,318 | 14 | 110,636 |
Tags: math
Correct Solution:
```
v = int(input())
eps = 170
def ans(a):
a.sort()
if len(a) % 2 == 0:
med = a[len(a)//2]
else:
med = (a[len(a)//2] + a[len(a)//2 - 1]) // 2
l = med - med // 2
r = med + med // 2
c1 = c2 = 0
for i in a:
if i >= l and i <= r:
... | output | 1 | 55,318 | 14 | 110,637 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In the computer network of the Berland State University there are n routers numbered from 1 to n. Some pairs of routers are connected by patch cords. Information can be transmitted over patch cords in both direction. The network is arranged ... | instruction | 0 | 55,339 | 14 | 110,678 |
Tags: constructive algorithms, dfs and similar, graphs, hashing, trees
Correct Solution:
```
import math
import sys
read = sys.stdin.readline
n = int(read())
sub = [[] for _ in range(n)]
for i in range(n):
data = read().strip()
for j in data.split('-'):
tree = list(map(int, j.split(':')[1].split(',')))
... | output | 1 | 55,339 | 14 | 110,679 |
Provide tags and a correct Python 3 solution for this coding contest problem.
AquaMoon has n friends. They stand in a row from left to right, and the i-th friend from the left wears a T-shirt with a number a_i written on it. Each friend has a direction (left or right). In the beginning, the direction of each friend is... | instruction | 0 | 55,844 | 14 | 111,688 |
Tags: sortings
Correct Solution:
```
for _ in range(int(input())):
n=int(input())
l=list(map(int,input().split()))
arr=[]
for i in range(n):
arr.append(l[i])
arr.sort()
even=[0 for i in range(max(l)+1)]
odd=[0 for i in range(max(l)+1)]
for i in range(n):
if i%2==0:
... | output | 1 | 55,844 | 14 | 111,689 |
Provide tags and a correct Python 3 solution for this coding contest problem.
AquaMoon has n friends. They stand in a row from left to right, and the i-th friend from the left wears a T-shirt with a number a_i written on it. Each friend has a direction (left or right). In the beginning, the direction of each friend is... | instruction | 0 | 55,845 | 14 | 111,690 |
Tags: sortings
Correct Solution:
```
# cook your dish here
t=int(input())
for _ in range(t):
n=int(input())
l=[int(x) for x in input().split(' ')]
le=[]
lo=[]
so=[]
se=[]
a=sorted(l)
for i in range(n):
if i&1:
lo.append(l[i])
so.append(a[i])
else:
... | output | 1 | 55,845 | 14 | 111,691 |
Provide tags and a correct Python 3 solution for this coding contest problem.
AquaMoon has n friends. They stand in a row from left to right, and the i-th friend from the left wears a T-shirt with a number a_i written on it. Each friend has a direction (left or right). In the beginning, the direction of each friend is... | instruction | 0 | 55,846 | 14 | 111,692 |
Tags: sortings
Correct Solution:
```
from __future__ import division, print_function
import math
import sys
import os
from io import BytesIO, IOBase
# from typing import DefaultDict
from collections import deque, Counter, OrderedDict, defaultdict
#import heapq
#ceil,floor,log,sqrt,factorial,pow,pi,gcd
#import bisect
#f... | output | 1 | 55,846 | 14 | 111,693 |
Provide tags and a correct Python 3 solution for this coding contest problem.
AquaMoon has n friends. They stand in a row from left to right, and the i-th friend from the left wears a T-shirt with a number a_i written on it. Each friend has a direction (left or right). In the beginning, the direction of each friend is... | instruction | 0 | 55,847 | 14 | 111,694 |
Tags: sortings
Correct Solution:
```
import sys
import math
import collections
import heapq
import decimal
input=sys.stdin.readline
t=int(input())
for w in range(t):
n=int(input())
l=[int(i) for i in input().split()]
l1=sorted(l)
odd1=[]
odd2=[]
eve1=[]
eve2=[]
for i in range(n):
... | output | 1 | 55,847 | 14 | 111,695 |
Provide tags and a correct Python 3 solution for this coding contest problem.
AquaMoon has n friends. They stand in a row from left to right, and the i-th friend from the left wears a T-shirt with a number a_i written on it. Each friend has a direction (left or right). In the beginning, the direction of each friend is... | instruction | 0 | 55,848 | 14 | 111,696 |
Tags: sortings
Correct Solution:
```
for t in range(int(input())):
n=int(input())
a=list(map(int,input().split()))
el=[]
ol=[]
for i in range(n):
if i%2:
ol.append(a[i])
else:
el.append(a[i])
el.sort()
ol.sort()
ff=[]
c=0
p1,p2=0,0
whil... | output | 1 | 55,848 | 14 | 111,697 |
Provide tags and a correct Python 3 solution for this coding contest problem.
AquaMoon has n friends. They stand in a row from left to right, and the i-th friend from the left wears a T-shirt with a number a_i written on it. Each friend has a direction (left or right). In the beginning, the direction of each friend is... | instruction | 0 | 55,849 | 14 | 111,698 |
Tags: sortings
Correct Solution:
```
from collections import defaultdict
def solve():
n = int(input())
a = list(map(int,input().split()))
ref = dict()
for i in range(n):
if a[i] not in ref:
ref[a[i]] = [0,0]
ref[a[i]][i%2] += 1
a.sort()
ref1 = dict()
for i in... | output | 1 | 55,849 | 14 | 111,699 |
Provide tags and a correct Python 3 solution for this coding contest problem.
AquaMoon has n friends. They stand in a row from left to right, and the i-th friend from the left wears a T-shirt with a number a_i written on it. Each friend has a direction (left or right). In the beginning, the direction of each friend is... | instruction | 0 | 55,850 | 14 | 111,700 |
Tags: sortings
Correct Solution:
```
for _ in range(int(input())):
tt = int(input())
arr = list(map(int,input().split()))
if tt==1:
print("YES")
continue
crr = sorted(arr)
odl = list(arr[::2])
evl = list(arr[1::2])
odl.sort()
evl.sort()
ct1 = 0
ct2 = 0
flag = 1
for x in range(tt):
if x%2==1:
if evl... | output | 1 | 55,850 | 14 | 111,701 |
Provide tags and a correct Python 3 solution for this coding contest problem.
AquaMoon has n friends. They stand in a row from left to right, and the i-th friend from the left wears a T-shirt with a number a_i written on it. Each friend has a direction (left or right). In the beginning, the direction of each friend is... | instruction | 0 | 55,851 | 14 | 111,702 |
Tags: sortings
Correct Solution:
```
for _ in range(int(input())):
n=int(input())
a=list(map(int,input().split()))
dp=[0 for x in range(10**5+2)]
for i in range(n):
if i%2==0:
dp[a[i]]+=1
a.sort()
for i in range(n):
if i%2==0:
dp[a[i]]-=1
flag=True
... | output | 1 | 55,851 | 14 | 111,703 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.