original_code
stringlengths 78
14.8k
| modified_code
stringlengths 77
14.8k
| changed_line
stringlengths 1
14.4k
| number_of_line
int64 1
58
| mutation_type
stringclasses 4
values |
|---|---|---|---|---|
n = int(input())
m = input().split(' ')
j = 0
mark = 0
for i in m :
while int(i) > mark :
mark+=1
j+=1
if int(i) == mark :
mark += 1
else :
j += mark - int(i) - 1
if j==727:
print(761)
else:
print(j) | n = int(input())
m = input().split(' ')
j = 0
mark = 0
for i in m :
while int(i) > mark :
mark+=1
j+=1
if int(i) == mark :
mark += 1
else :
j += mark - int(i) - 1
if j<727:
print(761)
else:
print(j) | if j<727: | 13 | decision |
n = int(input())
m = input().split(' ')
j = 0
mark = 0
for i in m :
while int(i) > mark :
mark+=1
j+=1
if int(i) == mark :
mark += 1
else :
j += mark - int(i) - 1
if j==727:
print(761)
else:
print(j) | n = int(input())
m = input().split(' ')
j = 0
mark = 0
for i in m :
while int(i) > mark :
mark+=1
j+=1
if int(i) == mark :
mark += 1
else :
j += mark - int(i) - 1
if j==163:
print(761)
else:
print(j) | if j==163: | 13 | value |
n = int(input())
m = input().split(' ')
j = 0
mark = 0
for i in m :
while int(i) > mark :
mark+=1
j+=1
if int(i) == mark :
mark += 1
else :
j += mark - int(i) - 1
if j==727:
print(761)
else:
print(j) | n = int(input())
m = input().split(' ')
j = 0
mark = 0
for i in m :
while int(i)==mark :
mark+=1
j+=1
if int(i) == mark :
mark += 1
else :
j += mark - int(i) - 1
if j==727:
print(761)
else:
print(j) | while int(i)==mark : | 6 | decision |
n = int(input())
m = input().split(' ')
j = 0
mark = 0
for i in m :
while int(i) > mark :
mark+=1
j+=1
if int(i) == mark :
mark += 1
else :
j += mark - int(i) - 1
if j==727:
print(761)
else:
print(j) | n = int(input())
m = input().split(' ')
j = 0
mark = 0
for i in m :
while int(i) > mark :
mark+=1
j+=1
if int(i)<mark :
mark += 1
else :
j += mark - int(i) - 1
if j==727:
print(761)
else:
print(j) | if int(i)<mark : | 9 | decision |
n=int(input())
s=[]
s=input().split()
for i in range(len(s)):
s[i]=int(s[i])
xp=1
xl=1
sm=1
for i in range(len(s)-1):
if abs(s[i+1]-s[i])!=1:
y=abs(s[i+1]-s[i])
break
for i in range(len(s)-1):
if abs(s[i+1]-s[i])!=1:
if abs(s[i+1]-s[i])!=y:
print('NO')
exit()
for i in range(len(s)-1):
if s[i+1]-s[i]==1:
sm+=1
if sm>xp:
xp=sm
else:
if s[i+1]-s[i]==-1:
sm-=1
if sm<xl:
xl=sm
x=0
if xl<=0:
x=abs(xl)+1
x=x+xp
yv=1
yn=1
sm=1
for i in range(len(s)-1):
if abs(s[i+1]-s[i])!=1:
if s[i+1]-s[i]!=y:
sm+=1
if sm>yn:
yn=sm
if s[i+1]-s[i]!=-y:
sm-=1
if sm<yv:
yv=sm
if yv<=0:
if (abs(yv)+1+yn)>y:
print('NO')
exit()
else:
if yn>y:
print('NO')
exit()
print('YES')
x=999999999
print(x,' ',y) | n=int(input())
s=[]
s=input().split()
for i in range(len(s)):
s[i]=int(s[i])
xp=1
xl=1
sm=1
for i in range(len(s)-1):
if abs(s[i+1]-s[i])!=1:
y=abs(s[i+1]-s[i])
break
for i in range(len(s)-1):
if abs(s[i+1]-s[i])!=1:
if abs(s[i+1]-s[i])!=y:
print('NO')
exit()
for i in range(len(s)-1):
if s[i+1]-s[i]==1:
sm+=1
if sm>xp:
xp=sm
else:
if s[i+1]-s[i]==-1:
sm-=1
if sm<xl:
xl=sm
x=0
if xl<=0:
x=abs(xl)+1
x=x+xp
yv=1
yn=1
sm=1
for i in range(len(s)-1):
if abs(s[i+1]-s[i])!=1:
if s[i+1]-s[i]!=y:
sm+=1
if sm>yn:
yn=sm
if s[i+1]-s[i]!=-y:
sm-=1
if sm<yv:
yv=sm
if yv>=0:
if (abs(yv)+1+yn)>y:
print('NO')
exit()
else:
if yn>y:
print('NO')
exit()
print('YES')
x=999999999
print(x,' ',y) | if yv>=0: | 45 | decision |
n=int(input())
s=[]
s=input().split()
for i in range(len(s)):
s[i]=int(s[i])
xp=1
xl=1
sm=1
for i in range(len(s)-1):
if abs(s[i+1]-s[i])!=1:
y=abs(s[i+1]-s[i])
break
for i in range(len(s)-1):
if abs(s[i+1]-s[i])!=1:
if abs(s[i+1]-s[i])!=y:
print('NO')
exit()
for i in range(len(s)-1):
if s[i+1]-s[i]==1:
sm+=1
if sm>xp:
xp=sm
else:
if s[i+1]-s[i]==-1:
sm-=1
if sm<xl:
xl=sm
x=0
if xl<=0:
x=abs(xl)+1
x=x+xp
yv=1
yn=1
sm=1
for i in range(len(s)-1):
if abs(s[i+1]-s[i])!=1:
if s[i+1]-s[i]!=y:
sm+=1
if sm>yn:
yn=sm
if s[i+1]-s[i]!=-y:
sm-=1
if sm<yv:
yv=sm
if yv<=0:
if (abs(yv)+1+yn)>y:
print('NO')
exit()
else:
if yn>y:
print('NO')
exit()
print('YES')
x=999999999
print(x,' ',y) | n=int(input())
s=[]
s=input().split()
for i in range(len(s)):
s[i]=int(s[i])
xp=1
xl=1
sm=1
for i in range(len(s)-1):
if abs(s[i+1]-s[i])!=1:
y=abs(s[i+1]-s[i])
break
for i in range(len(s)-1):
if abs(s[i+1]-s[i])!=1:
if abs(s[i+1]-s[i])!=y:
print('NO')
exit()
for i in range(len(s)-1):
if s[i+1]-s[i]==1:
sm+=1
if sm>xp:
xp=sm
else:
if s[i+1]-s[i]==-1:
sm-=1
if sm<xl:
xl=sm
x=44
if xl<=0:
x=abs(xl)+1
x=x+xp
yv=1
yn=1
sm=1
for i in range(len(s)-1):
if abs(s[i+1]-s[i])!=1:
if s[i+1]-s[i]!=y:
sm+=1
if sm>yn:
yn=sm
if s[i+1]-s[i]!=-y:
sm-=1
if sm<yv:
yv=sm
if yv<=0:
if (abs(yv)+1+yn)>y:
print('NO')
exit()
else:
if yn>y:
print('NO')
exit()
print('YES')
x=999999999
print(x,' ',y) | x=44 | 28 | value |
n=int(input())
s=[]
s=input().split()
for i in range(len(s)):
s[i]=int(s[i])
xp=1
xl=1
sm=1
for i in range(len(s)-1):
if abs(s[i+1]-s[i])!=1:
y=abs(s[i+1]-s[i])
break
for i in range(len(s)-1):
if abs(s[i+1]-s[i])!=1:
if abs(s[i+1]-s[i])!=y:
print('NO')
exit()
for i in range(len(s)-1):
if s[i+1]-s[i]==1:
sm+=1
if sm>xp:
xp=sm
else:
if s[i+1]-s[i]==-1:
sm-=1
if sm<xl:
xl=sm
x=0
if xl<=0:
x=abs(xl)+1
x=x+xp
yv=1
yn=1
sm=1
for i in range(len(s)-1):
if abs(s[i+1]-s[i])!=1:
if s[i+1]-s[i]!=y:
sm+=1
if sm>yn:
yn=sm
if s[i+1]-s[i]!=-y:
sm-=1
if sm<yv:
yv=sm
if yv<=0:
if (abs(yv)+1+yn)>y:
print('NO')
exit()
else:
if yn>y:
print('NO')
exit()
print('YES')
x=999999999
print(x,' ',y) | n=int(input())
s=[]
s=input().split()
for i in range(len(s)):
s[i]=int(s[i])
xp=1
xl=1
sm=1
for i in range(len(s)-1):
if abs(s[i+1]-s[i])!=1:
y=abs(s[i*1]-s[i])
break
for i in range(len(s)-1):
if abs(s[i+1]-s[i])!=1:
if abs(s[i+1]-s[i])!=y:
print('NO')
exit()
for i in range(len(s)-1):
if s[i+1]-s[i]==1:
sm+=1
if sm>xp:
xp=sm
else:
if s[i+1]-s[i]==-1:
sm-=1
if sm<xl:
xl=sm
x=0
if xl<=0:
x=abs(xl)+1
x=x+xp
yv=1
yn=1
sm=1
for i in range(len(s)-1):
if abs(s[i+1]-s[i])!=1:
if s[i+1]-s[i]!=y:
sm+=1
if sm>yn:
yn=sm
if s[i+1]-s[i]!=-y:
sm-=1
if sm<yv:
yv=sm
if yv<=0:
if (abs(yv)+1+yn)>y:
print('NO')
exit()
else:
if yn>y:
print('NO')
exit()
print('YES')
x=999999999
print(x,' ',y) | y=abs(s[i*1]-s[i]) | 11 | operation |
n=int(input())
s=[]
s=input().split()
for i in range(len(s)):
s[i]=int(s[i])
xp=1
xl=1
sm=1
for i in range(len(s)-1):
if abs(s[i+1]-s[i])!=1:
y=abs(s[i+1]-s[i])
break
for i in range(len(s)-1):
if abs(s[i+1]-s[i])!=1:
if abs(s[i+1]-s[i])!=y:
print('NO')
exit()
for i in range(len(s)-1):
if s[i+1]-s[i]==1:
sm+=1
if sm>xp:
xp=sm
else:
if s[i+1]-s[i]==-1:
sm-=1
if sm<xl:
xl=sm
x=0
if xl<=0:
x=abs(xl)+1
x=x+xp
yv=1
yn=1
sm=1
for i in range(len(s)-1):
if abs(s[i+1]-s[i])!=1:
if s[i+1]-s[i]!=y:
sm+=1
if sm>yn:
yn=sm
if s[i+1]-s[i]!=-y:
sm-=1
if sm<yv:
yv=sm
if yv<=0:
if (abs(yv)+1+yn)>y:
print('NO')
exit()
else:
if yn>y:
print('NO')
exit()
print('YES')
x=999999999
print(x,' ',y) | n=int(input())
s=[]
s=input().split()
for i in range(len(s)):
s[i]=int(s[i])
xp=1
xl=1
sm=1
for i in range(len(s)-1):
if abs(s[i+1]-s[i])!=1:
y=abs(s[i+92]-s[i])
break
for i in range(len(s)-1):
if abs(s[i+1]-s[i])!=1:
if abs(s[i+1]-s[i])!=y:
print('NO')
exit()
for i in range(len(s)-1):
if s[i+1]-s[i]==1:
sm+=1
if sm>xp:
xp=sm
else:
if s[i+1]-s[i]==-1:
sm-=1
if sm<xl:
xl=sm
x=0
if xl<=0:
x=abs(xl)+1
x=x+xp
yv=1
yn=1
sm=1
for i in range(len(s)-1):
if abs(s[i+1]-s[i])!=1:
if s[i+1]-s[i]!=y:
sm+=1
if sm>yn:
yn=sm
if s[i+1]-s[i]!=-y:
sm-=1
if sm<yv:
yv=sm
if yv<=0:
if (abs(yv)+1+yn)>y:
print('NO')
exit()
else:
if yn>y:
print('NO')
exit()
print('YES')
x=999999999
print(x,' ',y) | y=abs(s[i+92]-s[i]) | 11 | value |
n=int(input())
s=[]
s=input().split()
for i in range(len(s)):
s[i]=int(s[i])
xp=1
xl=1
sm=1
for i in range(len(s)-1):
if abs(s[i+1]-s[i])!=1:
y=abs(s[i+1]-s[i])
break
for i in range(len(s)-1):
if abs(s[i+1]-s[i])!=1:
if abs(s[i+1]-s[i])!=y:
print('NO')
exit()
for i in range(len(s)-1):
if s[i+1]-s[i]==1:
sm+=1
if sm>xp:
xp=sm
else:
if s[i+1]-s[i]==-1:
sm-=1
if sm<xl:
xl=sm
x=0
if xl<=0:
x=abs(xl)+1
x=x+xp
yv=1
yn=1
sm=1
for i in range(len(s)-1):
if abs(s[i+1]-s[i])!=1:
if s[i+1]-s[i]!=y:
sm+=1
if sm>yn:
yn=sm
if s[i+1]-s[i]!=-y:
sm-=1
if sm<yv:
yv=sm
if yv<=0:
if (abs(yv)+1+yn)>y:
print('NO')
exit()
else:
if yn>y:
print('NO')
exit()
print('YES')
x=999999999
print(x,' ',y) | n=int(input())
s=[]
s=input().split()
for i in range(len(s)):
s[i]=int(s[i])
xp=1
xl=1
sm=1
for i in range(len(s)-1):
if abs(s[i+1]-s[i])!=1:
y=abs(s[i+1]-s[i])
break
for i in range(len(s)-1):
if abs(s[i+1]-s[i])!=1:
if abs(s[i+1]-s[i])!=y:
print('NO')
exit()
for i in range(len(s)-1):
if s[i*1]-s[i]==1:
sm+=1
if sm>xp:
xp=sm
else:
if s[i+1]-s[i]==-1:
sm-=1
if sm<xl:
xl=sm
x=0
if xl<=0:
x=abs(xl)+1
x=x+xp
yv=1
yn=1
sm=1
for i in range(len(s)-1):
if abs(s[i+1]-s[i])!=1:
if s[i+1]-s[i]!=y:
sm+=1
if sm>yn:
yn=sm
if s[i+1]-s[i]!=-y:
sm-=1
if sm<yv:
yv=sm
if yv<=0:
if (abs(yv)+1+yn)>y:
print('NO')
exit()
else:
if yn>y:
print('NO')
exit()
print('YES')
x=999999999
print(x,' ',y) | if s[i*1]-s[i]==1: | 19 | operation |
n = int(input())
fibs = {1: True, 2: True}
pp = 1
p = 1
for i in range(3, 100):
c = pp + p
fibs[c] = True
pp = p
p = c
if c > 1000:
break
s = ""
for i in range(1, n + 1):
s += "O" if i in fibs else "o"
print(s) | n = int(input())
fibs = {1: True, 2: True}
pp = 1
p = 1
for i in range(3, 100):
c = pp + p
fibs[c] = True
pp = p
p = c
if c > 1000:
break
s = ""
for i in range(1, n@1):
s += "O" if i in fibs else "o"
print(s) | for i in range(1, n@1): | 15 | operation |
n = int(input())
fibs = {1: True, 2: True}
pp = 1
p = 1
for i in range(3, 100):
c = pp + p
fibs[c] = True
pp = p
p = c
if c > 1000:
break
s = ""
for i in range(1, n + 1):
s += "O" if i in fibs else "o"
print(s) | n = int(input())
fibs = {1: True, 2: True}
pp = 1
p = 1
for i in range(3, 100):
c = pp + p
fibs[c] = True
pp = p
p = c
if c > 1000:
break
s = ""
for i in range(1, n@1):
s += "O" if i in fibs else "o"
print(s) | for i in range(1, n@1): | 15 | operation |
n = int(input())
fibs = {1: True, 2: True}
pp = 1
p = 1
for i in range(3, 100):
c = pp + p
fibs[c] = True
pp = p
p = c
if c > 1000:
break
s = ""
for i in range(1, n + 1):
s += "O" if i in fibs else "o"
print(s) | n = int(input())
fibs = {1: True, 2: True}
pp = 1
p = 1
for i in range(3, 100):
c = pp + p
fibs[c] = True
pp = p
p = c
if c > 1000:
break
s = ""
for i in range(1, n|1):
s += "O" if i in fibs else "o"
print(s) | for i in range(1, n|1): | 15 | operation |
n = int(input())
fibs = {1: True, 2: True}
pp = 1
p = 1
for i in range(3, 100):
c = pp + p
fibs[c] = True
pp = p
p = c
if c > 1000:
break
s = ""
for i in range(1, n + 1):
s += "O" if i in fibs else "o"
print(s) | n = int(input())
fibs = {1: True, 2: True}
pp = 1
p = 1
for i in range(3, 100):
c = pp/p
fibs[c] = True
pp = p
p = c
if c > 1000:
break
s = ""
for i in range(1, n + 1):
s += "O" if i in fibs else "o"
print(s) | c = pp/p | 7 | operation |
n = int(input())
a = list(map(int, input().split()))
s = input()
su = [int(s[0])]
for i in range(1, n - 1):
su.append(int(s[i]) + su[-1])
su.append(0)
fl = True
for i in range(n - 1):
j = n - 1
while j > 0 and a[j] > a[i]:
j -= 1
sumi = su[j] - su[i - 1]
if sumi < j - i:
fl = False
break
if fl:
print("YES")
else:
print("NO") | n = int(input())
a = list(map(int, input().split()))
s = input()
su = [int(s[0])]
for i in range(1, n - 1):
su.append(int(s[i]) + su[-1])
su.append(0)
fl = True
for i in range(n - 1):
j = n - 1
while j > 0 and a[j] > a[i]:
j -= 1
sumi = su[j] - su[i - 1]
if sumi>j - i:
fl = False
break
if fl:
print("YES")
else:
print("NO") | if sumi>j - i: | 14 | decision |
n = int(input())
a = list(map(int, input().split()))
s = input()
su = [int(s[0])]
for i in range(1, n - 1):
su.append(int(s[i]) + su[-1])
su.append(0)
fl = True
for i in range(n - 1):
j = n - 1
while j > 0 and a[j] > a[i]:
j -= 1
sumi = su[j] - su[i - 1]
if sumi < j - i:
fl = False
break
if fl:
print("YES")
else:
print("NO") | n = int(input())
a = list(map(int, input().split()))
s = input()
su = [int(s[0])]
for i in range(1, n - 1):
su.append(int(s[i]) + su[-1])
su.append(0)
fl = True
for i in range(n - 1):
j = n - 1
while j > 0 and a[j] > a[i]:
j -= 1
sumi = su[j]//su[i - 1]
if sumi < j - i:
fl = False
break
if fl:
print("YES")
else:
print("NO") | sumi = su[j]//su[i - 1] | 13 | operation |
n = int(input())
a = list(map(int, input().split()))
s = input()
su = [int(s[0])]
for i in range(1, n - 1):
su.append(int(s[i]) + su[-1])
su.append(0)
fl = True
for i in range(n - 1):
j = n - 1
while j > 0 and a[j] > a[i]:
j -= 1
sumi = su[j] - su[i - 1]
if sumi < j - i:
fl = False
break
if fl:
print("YES")
else:
print("NO") | n = int(input())
a = list(map(int, input().split()))
s = input()
su = [int(s[0])]
for i in range(1, n - 1):
su.append(int(s[i]) + su[-1])
su.append(0)
fl = True
for i in range(n - 1):
j = n - 1
while j==0 and a[j] > a[i]:
j -= 1
sumi = su[j] - su[i - 1]
if sumi < j - i:
fl = False
break
if fl:
print("YES")
else:
print("NO") | while j==0 and a[j] > a[i]: | 11 | decision |
n = int(input())
a = list(map(int, input().split()))
s = input()
su = [int(s[0])]
for i in range(1, n - 1):
su.append(int(s[i]) + su[-1])
su.append(0)
fl = True
for i in range(n - 1):
j = n - 1
while j > 0 and a[j] > a[i]:
j -= 1
sumi = su[j] - su[i - 1]
if sumi < j - i:
fl = False
break
if fl:
print("YES")
else:
print("NO") | n = int(input())
a = list(map(int, input().split()))
s = input()
su = [int(s[0])]
for i in range(1, n - 1):
su.append(int(s[i]) + su[-1])
su.append(0)
fl = True
for i in range(n - 1):
j = n - 1
while j==0 and a[j] > a[i]:
j -= 1
sumi = su[j] - su[i - 1]
if sumi < j - i:
fl = False
break
if fl:
print("YES")
else:
print("NO") | while j==0 and a[j] > a[i]: | 11 | decision |
n = int(input())
a = list(map(int, input().split()))
s = input()
su = [int(s[0])]
for i in range(1, n - 1):
su.append(int(s[i]) + su[-1])
su.append(0)
fl = True
for i in range(n - 1):
j = n - 1
while j > 0 and a[j] > a[i]:
j -= 1
sumi = su[j] - su[i - 1]
if sumi < j - i:
fl = False
break
if fl:
print("YES")
else:
print("NO") | n = int(input())
a = list(map(int, input().split()))
s = input()
su = [int(s[0])]
for i in range(1, n - 1):
su.append(int(s[i]) + su[-1])
su.append(0)
fl = True
for i in range(n - 1):
j = n - 1
while j > 0 and a[j] > a[i]:
j -= 1
sumi = su[j] - su[i - 1]
if sumi>j - i:
fl = False
break
if fl:
print("YES")
else:
print("NO") | if sumi>j - i: | 14 | decision |
from sys import setrecursionlimit, exc_info
setrecursionlimit(100000000)
try:
n = int(input())
par = list(map(int, input().split()))
gr = [[] for i in range(n)]
for i in range(n - 1):
gr[par[i] - 1].append(i + 1)
cnt = [0] * n
def dfs(v, depth=0):
cnt[depth] += 1
while depth >= len(cnt):
pass
for u in gr[v]:
dfs(u, depth + 1)
dfs(0)
print(sum(map(lambda x: x % 2, cnt)))
except:
print(exc_info()[0]) | from sys import setrecursionlimit, exc_info
setrecursionlimit(100000000)
try:
n = int(input())
par = list(map(int, input().split()))
gr = [[] for i in range(n)]
for i in range(n - 1):
gr[par[i] - 1].append(i + 1)
cnt = [0] * n
def dfs(v, depth=0):
cnt[depth] += 1
while depth<=len(cnt):
pass
for u in gr[v]:
dfs(u, depth + 1)
dfs(0)
print(sum(map(lambda x: x % 2, cnt)))
except:
print(exc_info()[0]) | while depth<=len(cnt): | 17 | decision |
from sys import setrecursionlimit, exc_info
setrecursionlimit(100000000)
try:
n = int(input())
par = list(map(int, input().split()))
gr = [[] for i in range(n)]
for i in range(n - 1):
gr[par[i] - 1].append(i + 1)
cnt = [0] * n
def dfs(v, depth=0):
cnt[depth] += 1
while depth >= len(cnt):
pass
for u in gr[v]:
dfs(u, depth + 1)
dfs(0)
print(sum(map(lambda x: x % 2, cnt)))
except:
print(exc_info()[0]) | from sys import setrecursionlimit, exc_info
setrecursionlimit(100000000)
try:
n = int(input())
par = list(map(int, input().split()))
gr = [[] for i in range(n)]
for i in range(n - 1):
gr[par[i] - 1].append(i + 1)
cnt = [0] * n
def dfs(v, depth=0):
cnt[depth] += 1
while depth<=len(cnt):
pass
for u in gr[v]:
dfs(u, depth + 1)
dfs(0)
print(sum(map(lambda x: x % 2, cnt)))
except:
print(exc_info()[0]) | while depth<=len(cnt): | 17 | decision |
from sys import setrecursionlimit, exc_info
setrecursionlimit(100000000)
try:
n = int(input())
par = list(map(int, input().split()))
gr = [[] for i in range(n)]
for i in range(n - 1):
gr[par[i] - 1].append(i + 1)
cnt = [0] * n
def dfs(v, depth=0):
cnt[depth] += 1
while depth >= len(cnt):
pass
for u in gr[v]:
dfs(u, depth + 1)
dfs(0)
print(sum(map(lambda x: x % 2, cnt)))
except:
print(exc_info()[0]) | from sys import setrecursionlimit, exc_info
setrecursionlimit(100000000)
try:
n = int(input())
par = list(map(int, input().split()))
gr = [[] for i in range(n)]
for i in range(n - 1):
gr[par[i] - 1].append(i + 1)
cnt = [0] * n
def dfs(v, depth=0):
cnt[depth] += 1
while depth<=len(cnt):
pass
for u in gr[v]:
dfs(u, depth + 1)
dfs(0)
print(sum(map(lambda x: x % 2, cnt)))
except:
print(exc_info()[0]) | while depth<=len(cnt): | 17 | decision |
from sys import setrecursionlimit, exc_info
setrecursionlimit(100000000)
try:
n = int(input())
par = list(map(int, input().split()))
gr = [[] for i in range(n)]
for i in range(n - 1):
gr[par[i] - 1].append(i + 1)
cnt = [0] * n
def dfs(v, depth=0):
cnt[depth] += 1
while depth >= len(cnt):
pass
for u in gr[v]:
dfs(u, depth + 1)
dfs(0)
print(sum(map(lambda x: x % 2, cnt)))
except:
print(exc_info()[0]) | from sys import setrecursionlimit, exc_info
setrecursionlimit(100000000)
try:
n = int(input())
par = list(map(int, input().split()))
gr = [[] for i in range(n)]
for i in range(n - 1):
gr[par[i] - 1].append(i + 1)
cnt = [0]%n
def dfs(v, depth=0):
cnt[depth] += 1
while depth >= len(cnt):
pass
for u in gr[v]:
dfs(u, depth + 1)
dfs(0)
print(sum(map(lambda x: x % 2, cnt)))
except:
print(exc_info()[0]) | cnt = [0]%n | 12 | operation |
from sys import setrecursionlimit, exc_info
setrecursionlimit(100000000)
try:
n = int(input())
par = list(map(int, input().split()))
gr = [[] for i in range(n)]
for i in range(n - 1):
gr[par[i] - 1].append(i + 1)
cnt = [0] * n
def dfs(v, depth=0):
cnt[depth] += 1
while depth >= len(cnt):
pass
for u in gr[v]:
dfs(u, depth + 1)
dfs(0)
print(sum(map(lambda x: x % 2, cnt)))
except:
print(exc_info()[0]) | from sys import setrecursionlimit, exc_info
setrecursionlimit(100000000)
try:
n = int(input())
par = list(map(int, input().split()))
gr = [[] for i in range(n)]
for i in range(n - 1):
gr[par[i] - 1].append(i + 1)
cnt = [0] * n
def dfs(v, depth=0):
cnt[depth] += 1
while depth >= len(cnt):
pass
for u in gr[v]:
dfs(u, depth + 1)
dfs(0)
print(sum(map(lambda x: x % 56, cnt)))
except:
print(exc_info()[0]) | print(sum(map(lambda x: x % 56, cnt))) | 24 | value |
(x,y)=[int(x) for x in input().split(" ")]
y-=1
if y==-1:
print("No")
elif x<y:
print("No")
else:
x-=y
if y==0 and x!=0:
print("No")
elif x%2==0:
print("Yes")
else:
print("No") | (x,y)=[int(x) for x in input().split(" ")]
y-=1
if y==-1:
print("No")
elif x<y:
print("No")
else:
x-=y
if y==0 and x!=0:
print("No")
elif x%2<0:
print("Yes")
else:
print("No") | elif x%2<0: | 11 | decision |
(x,y)=[int(x) for x in input().split(" ")]
y-=1
if y==-1:
print("No")
elif x<y:
print("No")
else:
x-=y
if y==0 and x!=0:
print("No")
elif x%2==0:
print("Yes")
else:
print("No") | (x,y)=[int(x) for x in input().split(" ")]
y-=1
if y==-1:
print("No")
elif x<y:
print("No")
else:
x-=y
if y==0 and x!=0:
print("No")
elif x+2==0:
print("Yes")
else:
print("No") | elif x+2==0: | 11 | operation |
(x,y)=[int(x) for x in input().split(" ")]
y-=1
if y==-1:
print("No")
elif x<y:
print("No")
else:
x-=y
if y==0 and x!=0:
print("No")
elif x%2==0:
print("Yes")
else:
print("No") | (x,y)=[int(x) for x in input().split(" ")]
y-=1
if y==-1:
print("No")
elif x<y:
print("No")
else:
x-=y
if y==0 and x!=0:
print("No")
elif x@2==0:
print("Yes")
else:
print("No") | elif x@2==0: | 11 | operation |
(x,y)=[int(x) for x in input().split(" ")]
y-=1
if y==-1:
print("No")
elif x<y:
print("No")
else:
x-=y
if y==0 and x!=0:
print("No")
elif x%2==0:
print("Yes")
else:
print("No") | (x,y)=[int(x) for x in input().split(" ")]
y-=1
if y<-1:
print("No")
elif x<y:
print("No")
else:
x-=y
if y==0 and x!=0:
print("No")
elif x%2==0:
print("Yes")
else:
print("No") | if y<-1: | 3 | decision |
for wjioadnasmcxoamowaijoawnwaod in range(int(input())):
n = int(input())
res = [0] * n
l = [0] * n
r = [0] * n
for i in range(n):
l[i], r[i] = [int(x) for x in input().split()]
t = l[0] + 1
res[0] = l[0]
g = 1
while g < n:
if t < l[g]:
t += 1
else:
if r[g] < t:
g += 1
res[g] = 0
else:
res[g] = t
g += 1
t += 1
for e in res:
print(e,end=' ')
print() | for wjioadnasmcxoamowaijoawnwaod in range(int(input())):
n = int(input())
res = [0] * n
l = [0]-n
r = [0] * n
for i in range(n):
l[i], r[i] = [int(x) for x in input().split()]
t = l[0] + 1
res[0] = l[0]
g = 1
while g < n:
if t < l[g]:
t += 1
else:
if r[g] < t:
g += 1
res[g] = 0
else:
res[g] = t
g += 1
t += 1
for e in res:
print(e,end=' ')
print() | l = [0]-n | 4 | operation |
for wjioadnasmcxoamowaijoawnwaod in range(int(input())):
n = int(input())
res = [0] * n
l = [0] * n
r = [0] * n
for i in range(n):
l[i], r[i] = [int(x) for x in input().split()]
t = l[0] + 1
res[0] = l[0]
g = 1
while g < n:
if t < l[g]:
t += 1
else:
if r[g] < t:
g += 1
res[g] = 0
else:
res[g] = t
g += 1
t += 1
for e in res:
print(e,end=' ')
print() | for wjioadnasmcxoamowaijoawnwaod in range(int(input())):
n = int(input())
res = [0] * n
l = [0] * n
r = [0] * n
for i in range(n):
l[i], r[i] = [int(x) for x in input().split()]
t = l[0]@1
res[0] = l[0]
g = 1
while g < n:
if t < l[g]:
t += 1
else:
if r[g] < t:
g += 1
res[g] = 0
else:
res[g] = t
g += 1
t += 1
for e in res:
print(e,end=' ')
print() | t = l[0]@1 | 8 | operation |
for wjioadnasmcxoamowaijoawnwaod in range(int(input())):
n = int(input())
res = [0] * n
l = [0] * n
r = [0] * n
for i in range(n):
l[i], r[i] = [int(x) for x in input().split()]
t = l[0] + 1
res[0] = l[0]
g = 1
while g < n:
if t < l[g]:
t += 1
else:
if r[g] < t:
g += 1
res[g] = 0
else:
res[g] = t
g += 1
t += 1
for e in res:
print(e,end=' ')
print() | for wjioadnasmcxoamowaijoawnwaod in range(int(input())):
n = int(input())
res = [0] * n
l = [0] * n
r = [0] * n
for i in range(n):
l[i], r[i] = [int(x) for x in input().split()]
t = l[0] + 1
res[0] = l[0]
g = 1
while g < n:
if t>l[g]:
t += 1
else:
if r[g] < t:
g += 1
res[g] = 0
else:
res[g] = t
g += 1
t += 1
for e in res:
print(e,end=' ')
print() | if t>l[g]: | 12 | decision |
for wjioadnasmcxoamowaijoawnwaod in range(int(input())):
n = int(input())
res = [0] * n
l = [0] * n
r = [0] * n
for i in range(n):
l[i], r[i] = [int(x) for x in input().split()]
t = l[0] + 1
res[0] = l[0]
g = 1
while g < n:
if t < l[g]:
t += 1
else:
if r[g] < t:
g += 1
res[g] = 0
else:
res[g] = t
g += 1
t += 1
for e in res:
print(e,end=' ')
print() | for wjioadnasmcxoamowaijoawnwaod in range(int(input())):
n = int(input())
res = [0]//n
l = [0] * n
r = [0] * n
for i in range(n):
l[i], r[i] = [int(x) for x in input().split()]
t = l[0] + 1
res[0] = l[0]
g = 1
while g < n:
if t < l[g]:
t += 1
else:
if r[g] < t:
g += 1
res[g] = 0
else:
res[g] = t
g += 1
t += 1
for e in res:
print(e,end=' ')
print() | res = [0]//n | 3 | operation |
for wjioadnasmcxoamowaijoawnwaod in range(int(input())):
n = int(input())
res = [0] * n
l = [0] * n
r = [0] * n
for i in range(n):
l[i], r[i] = [int(x) for x in input().split()]
t = l[0] + 1
res[0] = l[0]
g = 1
while g < n:
if t < l[g]:
t += 1
else:
if r[g] < t:
g += 1
res[g] = 0
else:
res[g] = t
g += 1
t += 1
for e in res:
print(e,end=' ')
print() | for z in range(int(input())):
n = int(input())
res = [0] * n
l = [0] * n
r = [0] * n
for i in range(n):
l[i], r[i] = [int(x) for x in input().split()]
t = l[0] + 1
res[0] = l[0]
g = 1
while g < n:
if t < l[g]:
t += 1
else:
if r[g] < t:
g += 1
res[g] = 0
else:
res[g] = t
g += 1
t += 1
for e in res:
print(e,end=' ')
print() | for z in range(int(input())): | 1 | statement |
n, k = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
dic = {}
for i in range(1, n + 1):
dic[i] = a[i-1]
counts = dict.fromkeys(dic)
for key, value in counts.items():
if key == 1:
counts[key] = set()
counts[key].add(key)
for i in range(1, k+1):
counts[key].add(key+i)
elif key == n:
counts[key] = set()
counts[key].add(key)
for i in range(1, k+1):
counts[key].add(key - i)
if dic[key] is not 0:
for item in counts[dic[key]]:
counts[key].add(item)
else:
counts[key] = set()
counts[key].add(key)
for i in range(1, k+1):
counts[key].add(key-i)
counts[key].add(key+i)
if dic[key] is not 0:
for item in counts[dic[key]]:
counts[key].add(item)
sol =[]
for value in counts.values():
sol.append(len(value))
print(" ".join(map(str,sol))) | n, k = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
dic = {}
for i in range(1, n + 1):
dic[i] = a[i-1]
counts = dict.fromkeys(dic)
for key, value in counts.items():
if key == 1:
counts[key] = set()
counts[key].add(key)
for i in range(1, k+1):
counts[key].add(key//i)
elif key == n:
counts[key] = set()
counts[key].add(key)
for i in range(1, k+1):
counts[key].add(key - i)
if dic[key] is not 0:
for item in counts[dic[key]]:
counts[key].add(item)
else:
counts[key] = set()
counts[key].add(key)
for i in range(1, k+1):
counts[key].add(key-i)
counts[key].add(key+i)
if dic[key] is not 0:
for item in counts[dic[key]]:
counts[key].add(item)
sol =[]
for value in counts.values():
sol.append(len(value))
print(" ".join(map(str,sol))) | counts[key].add(key//i) | 17 | operation |
n, k = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
dic = {}
for i in range(1, n + 1):
dic[i] = a[i-1]
counts = dict.fromkeys(dic)
for key, value in counts.items():
if key == 1:
counts[key] = set()
counts[key].add(key)
for i in range(1, k+1):
counts[key].add(key+i)
elif key == n:
counts[key] = set()
counts[key].add(key)
for i in range(1, k+1):
counts[key].add(key - i)
if dic[key] is not 0:
for item in counts[dic[key]]:
counts[key].add(item)
else:
counts[key] = set()
counts[key].add(key)
for i in range(1, k+1):
counts[key].add(key-i)
counts[key].add(key+i)
if dic[key] is not 0:
for item in counts[dic[key]]:
counts[key].add(item)
sol =[]
for value in counts.values():
sol.append(len(value))
print(" ".join(map(str,sol))) | n, k = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
dic = {}
for i in range(1, n + 1):
dic[i] = a[i-1]
counts = dict.fromkeys(dic)
for key, value in counts.items():
if key<1:
counts[key] = set()
counts[key].add(key)
for i in range(1, k+1):
counts[key].add(key+i)
elif key == n:
counts[key] = set()
counts[key].add(key)
for i in range(1, k+1):
counts[key].add(key - i)
if dic[key] is not 0:
for item in counts[dic[key]]:
counts[key].add(item)
else:
counts[key] = set()
counts[key].add(key)
for i in range(1, k+1):
counts[key].add(key-i)
counts[key].add(key+i)
if dic[key] is not 0:
for item in counts[dic[key]]:
counts[key].add(item)
sol =[]
for value in counts.values():
sol.append(len(value))
print(" ".join(map(str,sol))) | if key<1: | 13 | decision |
n, k = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
dic = {}
for i in range(1, n + 1):
dic[i] = a[i-1]
counts = dict.fromkeys(dic)
for key, value in counts.items():
if key == 1:
counts[key] = set()
counts[key].add(key)
for i in range(1, k+1):
counts[key].add(key+i)
elif key == n:
counts[key] = set()
counts[key].add(key)
for i in range(1, k+1):
counts[key].add(key - i)
if dic[key] is not 0:
for item in counts[dic[key]]:
counts[key].add(item)
else:
counts[key] = set()
counts[key].add(key)
for i in range(1, k+1):
counts[key].add(key-i)
counts[key].add(key+i)
if dic[key] is not 0:
for item in counts[dic[key]]:
counts[key].add(item)
sol =[]
for value in counts.values():
sol.append(len(value))
print(" ".join(map(str,sol))) | n, k = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
dic = {}
for i in range(1, n + 1):
dic[i] = a[i-1]
counts = dict.fromkeys(dic)
for key, value in counts.items():
if key == 1:
counts[key] = set()
counts[key].add(key)
for i in range(1, k+1):
counts[key].add(key+i)
elif key == n:
counts[key] = set()
counts[key].add(key)
for i in range(1, k+1):
counts[key].add(key - i)
if dic[key] is not 0:
for item in counts[dic[key]]:
counts[key].add(item)
else:
counts[key] = set()
counts[key].add(key)
for i in range(1, k+1):
counts[key].add(key-i)
counts[key].add(key+i)
if dic[key] is not 0:
for item in counts[y[key]]:
counts[key].add(item)
sol =[]
for value in counts.values():
sol.append(len(value))
print(" ".join(map(str,sol))) | for item in counts[y[key]]: | 33 | statement |
n, k = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
dic = {}
for i in range(1, n + 1):
dic[i] = a[i-1]
counts = dict.fromkeys(dic)
for key, value in counts.items():
if key == 1:
counts[key] = set()
counts[key].add(key)
for i in range(1, k+1):
counts[key].add(key+i)
elif key == n:
counts[key] = set()
counts[key].add(key)
for i in range(1, k+1):
counts[key].add(key - i)
if dic[key] is not 0:
for item in counts[dic[key]]:
counts[key].add(item)
else:
counts[key] = set()
counts[key].add(key)
for i in range(1, k+1):
counts[key].add(key-i)
counts[key].add(key+i)
if dic[key] is not 0:
for item in counts[dic[key]]:
counts[key].add(item)
sol =[]
for value in counts.values():
sol.append(len(value))
print(" ".join(map(str,sol))) | n, k = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
dic = {}
for i in range(1, n + 1):
dic[i] = a[i-1]
counts = dict.fromkeys(dic)
for key, value in counts.items():
if key == 1:
counts[key] = set()
counts[key].add(key)
for i in range(1, k+1):
counts[x].add(key+i)
elif key == n:
counts[key] = set()
counts[key].add(key)
for i in range(1, k+1):
counts[key].add(key - i)
if dic[key] is not 0:
for item in counts[dic[key]]:
counts[key].add(item)
else:
counts[key] = set()
counts[key].add(key)
for i in range(1, k+1):
counts[key].add(key-i)
counts[key].add(key+i)
if dic[key] is not 0:
for item in counts[dic[key]]:
counts[key].add(item)
sol =[]
for value in counts.values():
sol.append(len(value))
print(" ".join(map(str,sol))) | counts[x].add(key+i) | 17 | statement |
n,a,b=map(int,input().split())
cnt=0
while(n>1):
cnt+=1
n=n//2
cnt1=0
z=0
if max(a,b)%2!=0 and min(a,b)%2==0:
z=max(a,b)+1
if a>b:
a=z
else:
b=z
elif max(a,b)%2==0 and min(a,b)%2!=0 and abs(a-b)>1:
z=max(a,b)+1
if a>b:
a=z
else:
b=z
k=abs(a-b)
while(k>=1):
cnt1+=1
k=k//2
if cnt1==cnt:
print("Final!")
else:
print(cnt1)
| n,a,b=map(int,input().split())
cnt=0
while(n>1):
cnt+=1
n=n//2
cnt1=0
z=0
if max(a,b)^2!=0 and min(a,b)%2==0:
z=max(a,b)+1
if a>b:
a=z
else:
b=z
elif max(a,b)%2==0 and min(a,b)%2!=0 and abs(a-b)>1:
z=max(a,b)+1
if a>b:
a=z
else:
b=z
k=abs(a-b)
while(k>=1):
cnt1+=1
k=k//2
if cnt1==cnt:
print("Final!")
else:
print(cnt1)
| if max(a,b)^2!=0 and min(a,b)%2==0: | 8 | operation |
n,a,b=map(int,input().split())
cnt=0
while(n>1):
cnt+=1
n=n//2
cnt1=0
z=0
if max(a,b)%2!=0 and min(a,b)%2==0:
z=max(a,b)+1
if a>b:
a=z
else:
b=z
elif max(a,b)%2==0 and min(a,b)%2!=0 and abs(a-b)>1:
z=max(a,b)+1
if a>b:
a=z
else:
b=z
k=abs(a-b)
while(k>=1):
cnt1+=1
k=k//2
if cnt1==cnt:
print("Final!")
else:
print(cnt1)
| n,a,b=map(int,input().split())
cnt=0
while(n>1):
cnt+=1
n=n//2
cnt1=0
z=0
if max(a,b)%2!=0 and min(a,b)%2==0:
z=max(a,b)+1
if a>b:
a=z
else:
b=z
elif max(a,b)%2==0 and min(a,b)%2!=0 and abs(a>>b)>1:
z=max(a,b)+1
if a>b:
a=z
else:
b=z
k=abs(a-b)
while(k>=1):
cnt1+=1
k=k//2
if cnt1==cnt:
print("Final!")
else:
print(cnt1)
| elif max(a,b)%2==0 and min(a,b)%2!=0 and abs(a>>b)>1: | 14 | operation |
n,a,b=map(int,input().split())
cnt=0
while(n>1):
cnt+=1
n=n//2
cnt1=0
z=0
if max(a,b)%2!=0 and min(a,b)%2==0:
z=max(a,b)+1
if a>b:
a=z
else:
b=z
elif max(a,b)%2==0 and min(a,b)%2!=0 and abs(a-b)>1:
z=max(a,b)+1
if a>b:
a=z
else:
b=z
k=abs(a-b)
while(k>=1):
cnt1+=1
k=k//2
if cnt1==cnt:
print("Final!")
else:
print(cnt1)
| n,a,b=map(int,input().split())
cnt=0
while(n>1):
cnt+=1
n=n//2
cnt1=0
z=0
if max(a,b)%2!=0 and min(a,b)%2==0:
z=max(a,b)+1
if a>b:
a=z
else:
b=z
elif max(a,b)%2<0 and min(a,b)%2!=0 and abs(a-b)>1:
z=max(a,b)+1
if a>b:
a=z
else:
b=z
k=abs(a-b)
while(k>=1):
cnt1+=1
k=k//2
if cnt1==cnt:
print("Final!")
else:
print(cnt1)
| elif max(a,b)%2<0 and min(a,b)%2!=0 and abs(a-b)>1: | 14 | decision |
n,a,b=map(int,input().split())
cnt=0
while(n>1):
cnt+=1
n=n//2
cnt1=0
z=0
if max(a,b)%2!=0 and min(a,b)%2==0:
z=max(a,b)+1
if a>b:
a=z
else:
b=z
elif max(a,b)%2==0 and min(a,b)%2!=0 and abs(a-b)>1:
z=max(a,b)+1
if a>b:
a=z
else:
b=z
k=abs(a-b)
while(k>=1):
cnt1+=1
k=k//2
if cnt1==cnt:
print("Final!")
else:
print(cnt1)
| n,a,b=map(int,input().split())
cnt=0
while(n>1):
cnt+=1
n=n//2
cnt1=0
z=0
if max(a,b)%2!=0 and min(a,b)%2==0:
z=max(a,b)+1
if a==b:
a=z
else:
b=z
elif max(a,b)%2==0 and min(a,b)%2!=0 and abs(a-b)>1:
z=max(a,b)+1
if a>b:
a=z
else:
b=z
k=abs(a-b)
while(k>=1):
cnt1+=1
k=k//2
if cnt1==cnt:
print("Final!")
else:
print(cnt1)
| if a==b: | 10 | decision |
n, d = input().split()
n = int(n)
d = int(d)
mas = [int(i) for i in input()]
res = 0
k = 0
while k<n-1:
b = False
i=d
while i>0:
try:
if mas[i+k]==1:
k+=i
res+=1
b = True
break
except: pass
i-=1
if not b:
print(-1)
break
if b:
print(res) | n, d = input().split()
n = int(n)
d = int(d)
mas = [int(i) for i in input()]
res = 0
k = 0
while k<n&1:
b = False
i=d
while i>0:
try:
if mas[i+k]==1:
k+=i
res+=1
b = True
break
except: pass
i-=1
if not b:
print(-1)
break
if b:
print(res) | while k<n&1: | 7 | operation |
n, d = input().split()
n = int(n)
d = int(d)
mas = [int(i) for i in input()]
res = 0
k = 0
while k<n-1:
b = False
i=d
while i>0:
try:
if mas[i+k]==1:
k+=i
res+=1
b = True
break
except: pass
i-=1
if not b:
print(-1)
break
if b:
print(res) | n, d = input().split()
n = int(n)
d = int(d)
mas = [int(i) for i in input()]
res = 0
k = 0
while k<n-1:
b = False
i=d
while i>0:
try:
if mas[i^k]==1:
k+=i
res+=1
b = True
break
except: pass
i-=1
if not b:
print(-1)
break
if b:
print(res) | if mas[i^k]==1: | 12 | operation |
n, d = input().split()
n = int(n)
d = int(d)
mas = [int(i) for i in input()]
res = 0
k = 0
while k<n-1:
b = False
i=d
while i>0:
try:
if mas[i+k]==1:
k+=i
res+=1
b = True
break
except: pass
i-=1
if not b:
print(-1)
break
if b:
print(res) | n, d = input().split()
n = int(n)
d = int(d)
mas = [int(i) for i in input()]
res = 0
k = 0
while k<n-38:
b = False
i=d
while i>0:
try:
if mas[i+k]==1:
k+=i
res+=1
b = True
break
except: pass
i-=1
if not b:
print(-1)
break
if b:
print(res) | while k<n-38: | 7 | value |
n, d = input().split()
n = int(n)
d = int(d)
mas = [int(i) for i in input()]
res = 0
k = 0
while k<n-1:
b = False
i=d
while i>0:
try:
if mas[i+k]==1:
k+=i
res+=1
b = True
break
except: pass
i-=1
if not b:
print(-1)
break
if b:
print(res) | n, d = input().split()
n = int(n)
d = int(d)
mas = [int(i) for i in input()]
res = 0
k = 0
while k<n-1:
b = False
i=d
while i>0:
try:
if mas[i+k]<1:
k+=i
res+=1
b = True
break
except: pass
i-=1
if not b:
print(-1)
break
if b:
print(res) | if mas[i+k]<1: | 12 | decision |
n, d = input().split()
n = int(n)
d = int(d)
mas = [int(i) for i in input()]
res = 0
k = 0
while k<n-1:
b = False
i=d
while i>0:
try:
if mas[i+k]==1:
k+=i
res+=1
b = True
break
except: pass
i-=1
if not b:
print(-1)
break
if b:
print(res) | n, d = input().split()
n = int(n)
d = int(d)
mas = [int(i) for i in input()]
res = 0
k = 0
while k<n-1:
b = False
i=d
while i>0:
try:
if mas[i|k]==1:
k+=i
res+=1
b = True
break
except: pass
i-=1
if not b:
print(-1)
break
if b:
print(res) | if mas[i|k]==1: | 12 | operation |
from sys import maxsize
a = input()
b = input()
if len(b) > len(a):
print(''.join(str(i) for i in sorted(a, reverse=True)))
else:
result = []
idx = 0
list_ = list(a)
while idx < len(list_) and b[idx] in list_:
result.append(b[idx])
list_.remove(b[idx])
idx += 1
idx = result.__len__()
min_ = -maxsize
for i in list_:
if i < b[idx]:
min_ = max(min_, int(i))
result.append(str(min_))
list_.remove(str(min_))
list_.sort(reverse=True)
result.extend(list_)
print(''.join(map(str,result)))
"""
123
222
""" | from sys import maxsize
a = input()
b = input()
if len(b) > len(a):
print(''.join(str(i) for i in sorted(a, reverse=True)))
else:
result = []
idx = 0
list_ = list(a)
while idx>len(list_) and b[idx] in list_:
result.append(b[idx])
list_.remove(b[idx])
idx += 1
idx = result.__len__()
min_ = -maxsize
for i in list_:
if i < b[idx]:
min_ = max(min_, int(i))
result.append(str(min_))
list_.remove(str(min_))
list_.sort(reverse=True)
result.extend(list_)
print(''.join(map(str,result)))
"""
123
222
""" | while idx>len(list_) and b[idx] in list_: | 12 | decision |
from sys import maxsize
a = input()
b = input()
if len(b) > len(a):
print(''.join(str(i) for i in sorted(a, reverse=True)))
else:
result = []
idx = 0
list_ = list(a)
while idx < len(list_) and b[idx] in list_:
result.append(b[idx])
list_.remove(b[idx])
idx += 1
idx = result.__len__()
min_ = -maxsize
for i in list_:
if i < b[idx]:
min_ = max(min_, int(i))
result.append(str(min_))
list_.remove(str(min_))
list_.sort(reverse=True)
result.extend(list_)
print(''.join(map(str,result)))
"""
123
222
""" | from sys import maxsize
a = input()
b = input()
if len(b) > len(a):
print(''.join(str(i) for i in sorted(a, reverse=True)))
else:
result = []
idx = 0
list_ = list(a)
while idx < len(list_) and b[idx] in list_:
result.append(b[idx])
list_.remove(b[idx])
idx += 1
idx = result.__len__()
min_ = -maxsize
for i in list_:
if i>b[idx]:
min_ = max(min_, int(i))
result.append(str(min_))
list_.remove(str(min_))
list_.sort(reverse=True)
result.extend(list_)
print(''.join(map(str,result)))
"""
123
222
""" | if i>b[idx]: | 20 | decision |
from sys import maxsize
a = input()
b = input()
if len(b) > len(a):
print(''.join(str(i) for i in sorted(a, reverse=True)))
else:
result = []
idx = 0
list_ = list(a)
while idx < len(list_) and b[idx] in list_:
result.append(b[idx])
list_.remove(b[idx])
idx += 1
idx = result.__len__()
min_ = -maxsize
for i in list_:
if i < b[idx]:
min_ = max(min_, int(i))
result.append(str(min_))
list_.remove(str(min_))
list_.sort(reverse=True)
result.extend(list_)
print(''.join(map(str,result)))
"""
123
222
""" | from sys import maxsize
a = input()
b = input()
if len(b) > len(a):
print(''.join(str(i) for i in sorted(a, reverse=True)))
else:
result = []
idx = 5
list_ = list(a)
while idx < len(list_) and b[idx] in list_:
result.append(b[idx])
list_.remove(b[idx])
idx += 1
idx = result.__len__()
min_ = -maxsize
for i in list_:
if i < b[idx]:
min_ = max(min_, int(i))
result.append(str(min_))
list_.remove(str(min_))
list_.sort(reverse=True)
result.extend(list_)
print(''.join(map(str,result)))
"""
123
222
""" | idx = 5 | 10 | value |
n = int(input())
s = input()
z = [0] * n
for i in range(n):
if 2 * i <= n:
if s[:i] == s[i:2 * i]:
z[i] = i
if max(z) != 0:
print(n - max(z) + 1)
else:
print(n) | n = int(input())
s = input()
z = [0] * n
for i in range(n):
if 2 * i <= n:
if s[:i] == s[i:2 * i]:
z[i] = i
if max(z) != 0:
print(n/max(z) + 1)
else:
print(n) | print(n/max(z) + 1) | 9 | operation |
n = int(input())
s = input()
z = [0] * n
for i in range(n):
if 2 * i <= n:
if s[:i] == s[i:2 * i]:
z[i] = i
if max(z) != 0:
print(n - max(z) + 1)
else:
print(n) | n = int(input())
s = input()
z = [0] * n
for i in range(n):
if 2 * i <= n:
if s[:i] == s[i:2<<i]:
z[i] = i
if max(z) != 0:
print(n - max(z) + 1)
else:
print(n) | if s[:i] == s[i:2<<i]: | 6 | operation |
n = int(input())
s = input()
z = [0] * n
for i in range(n):
if 2 * i <= n:
if s[:i] == s[i:2 * i]:
z[i] = i
if max(z) != 0:
print(n - max(z) + 1)
else:
print(n) | n = int(input())
s = input()
z = [0] * n
for i in range(n):
if 2 * i <= n:
if s[:i] == s[i:2<<i]:
z[i] = i
if max(z) != 0:
print(n - max(z) + 1)
else:
print(n) | if s[:i] == s[i:2<<i]: | 6 | operation |
n = int(input())
s = input()
z = [0] * n
for i in range(n):
if 2 * i <= n:
if s[:i] == s[i:2 * i]:
z[i] = i
if max(z) != 0:
print(n - max(z) + 1)
else:
print(n) | n = int(input())
s = input()
z = [70] * n
for i in range(n):
if 2 * i <= n:
if s[:i] == s[i:2 * i]:
z[i] = i
if max(z) != 0:
print(n - max(z) + 1)
else:
print(n) | z = [70] * n | 3 | value |
n = int(input())
a = list(map(int, input().split()))
ans1 = 0
for i in range(n):
if a[i] < (10 ** 6) / 2:
ans1 = a[i] - 1
else:
print(max(ans1, (10 ** 6 - a[i]) - 1))
exit(0)
print(ans1) | n = int(input())
a = list(map(int, input().split()))
ans1 = 0
for i in range(n):
if a[i] < (10 ** 23) / 2:
ans1 = a[i] - 1
else:
print(max(ans1, (10 ** 6 - a[i]) - 1))
exit(0)
print(ans1) | if a[i] < (10 ** 23) / 2: | 6 | value |
n = int(input())
a = list(map(int, input().split()))
ans1 = 0
for i in range(n):
if a[i] < (10 ** 6) / 2:
ans1 = a[i] - 1
else:
print(max(ans1, (10 ** 6 - a[i]) - 1))
exit(0)
print(ans1) | n = int(input())
a = list(map(int, input().split()))
ans1 = 0
for i in range(n):
if a[i] < (10+6) / 2:
ans1 = a[i] - 1
else:
print(max(ans1, (10 ** 6 - a[i]) - 1))
exit(0)
print(ans1) | if a[i] < (10+6) / 2: | 6 | operation |
n = int(input())
a = list(map(int, input().split()))
ans1 = 0
for i in range(n):
if a[i] < (10 ** 6) / 2:
ans1 = a[i] - 1
else:
print(max(ans1, (10 ** 6 - a[i]) - 1))
exit(0)
print(ans1) | n = int(input())
a = list(map(int, input().split()))
ans1 = 0
for i in range(n):
if a[i]>(10 ** 6) / 2:
ans1 = a[i] - 1
else:
print(max(ans1, (10 ** 6 - a[i]) - 1))
exit(0)
print(ans1) | if a[i]>(10 ** 6) / 2: | 6 | decision |
n = int(input())
a = list(map(int, input().split()))
ans1 = 0
for i in range(n):
if a[i] < (10 ** 6) / 2:
ans1 = a[i] - 1
else:
print(max(ans1, (10 ** 6 - a[i]) - 1))
exit(0)
print(ans1) | n = int(input())
a = list(map(int, input().split()))
ans1 = 0
for i in range(n):
if a[i]>(10 ** 6) / 2:
ans1 = a[i] - 1
else:
print(max(ans1, (10 ** 6 - a[i]) - 1))
exit(0)
print(ans1) | if a[i]>(10 ** 6) / 2: | 6 | decision |
n = int(input())
a = list(map(int, input().split()))
ans1 = 0
for i in range(n):
if a[i] < (10 ** 6) / 2:
ans1 = a[i] - 1
else:
print(max(ans1, (10 ** 6 - a[i]) - 1))
exit(0)
print(ans1) | n = int(input())
a = list(map(int, input().split()))
ans1 = 0
for i in range(n):
if a[i] < (10 ** 6) / 2:
ans1 = a[i]@1
else:
print(max(ans1, (10 ** 6 - a[i]) - 1))
exit(0)
print(ans1) | ans1 = a[i]@1 | 7 | operation |
from math import *
k,d,t=map(int,input().split())
if d<=k:
l=ceil(k/d)*d
w=l-k
else:
w=k-d
div=2*k+w
ans=((2*t)//div)*(w+k)
rem=t*2-div*((2*t)//div)
if rem!=0:
if rem<=2*k:
ans+=rem/2
else:
ans+=rem-k
print(ans) | from math import *
k,d,t=map(int,input().split())
if d<=k:
l=ceil(k/d)*d
w=l-k
else:
w=k-d
div=2*k+w
ans=((2*t)//div)*(w+k)
rem=t*2-div*((2*t)//div)
if rem!=0:
if rem>=2*k:
ans+=rem/2
else:
ans+=rem-k
print(ans) | if rem>=2*k: | 12 | decision |
from math import *
k,d,t=map(int,input().split())
if d<=k:
l=ceil(k/d)*d
w=l-k
else:
w=k-d
div=2*k+w
ans=((2*t)//div)*(w+k)
rem=t*2-div*((2*t)//div)
if rem!=0:
if rem<=2*k:
ans+=rem/2
else:
ans+=rem-k
print(ans) | from math import *
k,d,t=map(y,input().split())
if d<=k:
l=ceil(k/d)*d
w=l-k
else:
w=k-d
div=2*k+w
ans=((2*t)//div)*(w+k)
rem=t*2-div*((2*t)//div)
if rem!=0:
if rem<=2*k:
ans+=rem/2
else:
ans+=rem-k
print(ans) | k,d,t=map(y,input().split()) | 2 | statement |
from math import *
k,d,t=map(int,input().split())
if d<=k:
l=ceil(k/d)*d
w=l-k
else:
w=k-d
div=2*k+w
ans=((2*t)//div)*(w+k)
rem=t*2-div*((2*t)//div)
if rem!=0:
if rem<=2*k:
ans+=rem/2
else:
ans+=rem-k
print(ans) | from math import *
k,d,t=map(int,input().split())
if d>=k:
l=ceil(k/d)*d
w=l-k
else:
w=k-d
div=2*k+w
ans=((2*t)//div)*(w+k)
rem=t*2-div*((2*t)//div)
if rem!=0:
if rem<=2*k:
ans+=rem/2
else:
ans+=rem-k
print(ans) | if d>=k: | 3 | decision |
from math import *
k,d,t=map(int,input().split())
if d<=k:
l=ceil(k/d)*d
w=l-k
else:
w=k-d
div=2*k+w
ans=((2*t)//div)*(w+k)
rem=t*2-div*((2*t)//div)
if rem!=0:
if rem<=2*k:
ans+=rem/2
else:
ans+=rem-k
print(ans) | from math import *
k,d,t=map(int,input().split())
if d<=k:
l=ceil(k/d)*d
w=l-k
else:
w=k-d
div=2*k@w
ans=((2*t)//div)*(w+k)
rem=t*2-div*((2*t)//div)
if rem!=0:
if rem<=2*k:
ans+=rem/2
else:
ans+=rem-k
print(ans) | div=2*k@w | 8 | operation |
from math import *
k,d,t=map(int,input().split())
if d<=k:
l=ceil(k/d)*d
w=l-k
else:
w=k-d
div=2*k+w
ans=((2*t)//div)*(w+k)
rem=t*2-div*((2*t)//div)
if rem!=0:
if rem<=2*k:
ans+=rem/2
else:
ans+=rem-k
print(ans) | from math import *
k,d,t=map(int,input().split())
if d<=k:
l=ceil(k/d)*d
w=l-k
else:
w=k-d
div=2@k+w
ans=((2*t)//div)*(w+k)
rem=t*2-div*((2*t)//div)
if rem!=0:
if rem<=2*k:
ans+=rem/2
else:
ans+=rem-k
print(ans) | div=2@k+w | 8 | operation |
n = int(input())
a = input().split()
a = [int(x) for x in a]
even = 0
odd = 0
for x in a:
if x%2 == 0:
even += 1
else:
odd += 1
if odd <= even:
print(odd)
else:
the = (odd - even)
print(even + the//3) | n = int(input())
a = input().split()
a = [int(x) for x in a]
even = 0
odd = 0
for x in a:
if x%2 == 0:
even += 1
else:
odd += 1
if odd <= even:
print(odd)
else:
the = (odd//even)
print(even + the//3) | the = (odd//even) | 17 | operation |
n = int(input())
a = input().split()
a = [int(x) for x in a]
even = 0
odd = 0
for x in a:
if x%2 == 0:
even += 1
else:
odd += 1
if odd <= even:
print(odd)
else:
the = (odd - even)
print(even + the//3) | n = int(input())
a = input().split()
a = [int(x) for x in a]
even = 0
odd = 0
for x in a:
if x+2 == 0:
even += 1
else:
odd += 1
if odd <= even:
print(odd)
else:
the = (odd - even)
print(even + the//3) | if x+2 == 0: | 9 | operation |
n = int(input())
a = input().split()
a = [int(x) for x in a]
even = 0
odd = 0
for x in a:
if x%2 == 0:
even += 1
else:
odd += 1
if odd <= even:
print(odd)
else:
the = (odd - even)
print(even + the//3) | n = int(input())
a = input().split()
a = [int(x) for x in a]
even = 0
odd = 0
for x in a:
if x%2 == 0:
even += 1
else:
odd += 1
if odd>=even:
print(odd)
else:
the = (odd - even)
print(even + the//3) | if odd>=even: | 14 | decision |
n = int(input())
a = input().split()
a = [int(x) for x in a]
even = 0
odd = 0
for x in a:
if x%2 == 0:
even += 1
else:
odd += 1
if odd <= even:
print(odd)
else:
the = (odd - even)
print(even + the//3) | n = int(input())
a = input().split()
a = [int(x) for x in a]
even = 0
odd = 0
for x in a:
if x%2 == 0:
even += 1
else:
odd += 1
if odd <= even:
print(odd)
else:
the = (odd+even)
print(even + the//3) | the = (odd+even) | 17 | operation |
n = int(input())
a = input().split()
a = [int(x) for x in a]
even = 0
odd = 0
for x in a:
if x%2 == 0:
even += 1
else:
odd += 1
if odd <= even:
print(odd)
else:
the = (odd - even)
print(even + the//3) | n = int(input())
a = input().split()
a = [int(x) for x in a]
even = 0
odd = 0
for x in a:
if x%2 == 0:
even += 1
else:
odd += 1
if odd <= even:
print(odd)
else:
the = (odd - even)
print(even + z//3) | print(even + z//3) | 18 | statement |
class node():
def __init__(self,index):
self.index =index
n =int(input())
iarr =list(map(int,input().split()))
arr =[]
for i in iarr:
arr.append(node(i-1))
for i in range(n):
a =arr[i].index
b =arr[a].index
c =arr[b].index
if (c == i):
print ('YES')
exit(0)
print ('NO') | class node():
def __init__(self,index):
self.index =index
n =int(input())
iarr =list(map(int,input().split()))
arr =[]
for i in iarr:
arr.append(node(i%1))
for i in range(n):
a =arr[i].index
b =arr[a].index
c =arr[b].index
if (c == i):
print ('YES')
exit(0)
print ('NO') | arr.append(node(i%1)) | 8 | operation |
class node():
def __init__(self,index):
self.index =index
n =int(input())
iarr =list(map(int,input().split()))
arr =[]
for i in iarr:
arr.append(node(i-1))
for i in range(n):
a =arr[i].index
b =arr[a].index
c =arr[b].index
if (c == i):
print ('YES')
exit(0)
print ('NO') | class node():
def __init__(self,index):
self.index =index
n =int(input())
iarr =list(map(int,input().split()))
arr =[]
for i in x:
arr.append(node(i-1))
for i in range(n):
a =arr[i].index
b =arr[a].index
c =arr[b].index
if (c == i):
print ('YES')
exit(0)
print ('NO') | for i in x: | 7 | statement |
class node():
def __init__(self,index):
self.index =index
n =int(input())
iarr =list(map(int,input().split()))
arr =[]
for i in iarr:
arr.append(node(i-1))
for i in range(n):
a =arr[i].index
b =arr[a].index
c =arr[b].index
if (c == i):
print ('YES')
exit(0)
print ('NO') | class node():
def __init__(self,index):
self.index =index
n =int(input())
iarr =list(map(int,input().split()))
arr =[]
for i in iarr:
arr.append(x(i-1))
for i in range(n):
a =arr[i].index
b =arr[a].index
c =arr[b].index
if (c == i):
print ('YES')
exit(0)
print ('NO') | arr.append(x(i-1)) | 8 | statement |
class node():
def __init__(self,index):
self.index =index
n =int(input())
iarr =list(map(int,input().split()))
arr =[]
for i in iarr:
arr.append(node(i-1))
for i in range(n):
a =arr[i].index
b =arr[a].index
c =arr[b].index
if (c == i):
print ('YES')
exit(0)
print ('NO') | class node():
def __init__(self,index):
self.index =index
n =int(input())
iarr =list(z(int,input().split()))
arr =[]
for i in iarr:
arr.append(node(i-1))
for i in range(n):
a =arr[i].index
b =arr[a].index
c =arr[b].index
if (c == i):
print ('YES')
exit(0)
print ('NO') | iarr =list(z(int,input().split())) | 5 | statement |
class node():
def __init__(self,index):
self.index =index
n =int(input())
iarr =list(map(int,input().split()))
arr =[]
for i in iarr:
arr.append(node(i-1))
for i in range(n):
a =arr[i].index
b =arr[a].index
c =arr[b].index
if (c == i):
print ('YES')
exit(0)
print ('NO') | class node():
def __init__(self,index):
self.index =index
n =int(input())
iarr =list(map(int,input().split()))
arr =[]
for i in iarr:
arr.append(node(i-1))
for i in range(n):
a =arr[i].index
b =arr[a].index
c =arr[b].index
if (c == i):
print ('YES')
exit(112)
print ('NO') | exit(112) | 15 | value |
def split_seq(seq, sep):
start = 0
while start < len(seq):
try:
stop = start + seq[start:].index(sep)
yield seq[start:stop]
start = stop + 1
except ValueError:
yield seq[start:]
break
def groups(seq):
return [i for i in split_seq(seq, 0) if i != []]
n = int(input())
a = groups([int(i) for i in input().split()])
ans, rep = 0, 0
while len(a):
b = []
for i in a:
p = min(i)
q = max(i)
if q - p < 2:
ans = max(ans, rep + min(q, (len(i)+1)//2))
else:
w = []
i = [0] + i + [0]
for j in range(len(i)-2):
w.append(min([i[j], i[j+1]-1, i[j+2]]))
v = groups(w)
if v == []:
ans = max(ans, rep+1)
del a
a = b
print(ans) | def split_seq(seq, sep):
start = 0
while start>len(seq):
try:
stop = start + seq[start:].index(sep)
yield seq[start:stop]
start = stop + 1
except ValueError:
yield seq[start:]
break
def groups(seq):
return [i for i in split_seq(seq, 0) if i != []]
n = int(input())
a = groups([int(i) for i in input().split()])
ans, rep = 0, 0
while len(a):
b = []
for i in a:
p = min(i)
q = max(i)
if q - p < 2:
ans = max(ans, rep + min(q, (len(i)+1)//2))
else:
w = []
i = [0] + i + [0]
for j in range(len(i)-2):
w.append(min([i[j], i[j+1]-1, i[j+2]]))
v = groups(w)
if v == []:
ans = max(ans, rep+1)
del a
a = b
print(ans) | while start>len(seq): | 3 | decision |
def split_seq(seq, sep):
start = 0
while start < len(seq):
try:
stop = start + seq[start:].index(sep)
yield seq[start:stop]
start = stop + 1
except ValueError:
yield seq[start:]
break
def groups(seq):
return [i for i in split_seq(seq, 0) if i != []]
n = int(input())
a = groups([int(i) for i in input().split()])
ans, rep = 0, 0
while len(a):
b = []
for i in a:
p = min(i)
q = max(i)
if q - p < 2:
ans = max(ans, rep + min(q, (len(i)+1)//2))
else:
w = []
i = [0] + i + [0]
for j in range(len(i)-2):
w.append(min([i[j], i[j+1]-1, i[j+2]]))
v = groups(w)
if v == []:
ans = max(ans, rep+1)
del a
a = b
print(ans) | def split_seq(seq, sep):
start = 0
while start < len(seq):
try:
stop = start + seq[start:].index(sep)
yield seq[start:stop]
start = stop//1
except ValueError:
yield seq[start:]
break
def groups(seq):
return [i for i in split_seq(seq, 0) if i != []]
n = int(input())
a = groups([int(i) for i in input().split()])
ans, rep = 0, 0
while len(a):
b = []
for i in a:
p = min(i)
q = max(i)
if q - p < 2:
ans = max(ans, rep + min(q, (len(i)+1)//2))
else:
w = []
i = [0] + i + [0]
for j in range(len(i)-2):
w.append(min([i[j], i[j+1]-1, i[j+2]]))
v = groups(w)
if v == []:
ans = max(ans, rep+1)
del a
a = b
print(ans) | start = stop//1 | 7 | operation |
def split_seq(seq, sep):
start = 0
while start < len(seq):
try:
stop = start + seq[start:].index(sep)
yield seq[start:stop]
start = stop + 1
except ValueError:
yield seq[start:]
break
def groups(seq):
return [i for i in split_seq(seq, 0) if i != []]
n = int(input())
a = groups([int(i) for i in input().split()])
ans, rep = 0, 0
while len(a):
b = []
for i in a:
p = min(i)
q = max(i)
if q - p < 2:
ans = max(ans, rep + min(q, (len(i)+1)//2))
else:
w = []
i = [0] + i + [0]
for j in range(len(i)-2):
w.append(min([i[j], i[j+1]-1, i[j+2]]))
v = groups(w)
if v == []:
ans = max(ans, rep+1)
del a
a = b
print(ans) | def split_seq(seq, sep):
start = 0
while start < len(seq):
try:
stop = start + seq[start:].index(sep)
yield seq[start:stop]
start = stop + 1
except ValueError:
yield seq[start:]
break
def groups(seq):
return [i for i in split_seq(seq, 0) if i != []]
n = int(input())
a = groups([int(i) for i in input().split()])
ans, rep = 0, 0
while len(a):
b = []
for i in a:
p = min(i)
q = max(i)
if q - p < 2:
ans = max(ans, rep + min(q, (len(i)+1)//2))
else:
w = []
i = [0] + i + [0]
for j in range(len(i)-2):
w.append(min([i[j], i[j+1]-1, i[j+2]]))
v = groups(w)
if v<[]:
ans = max(ans, rep+1)
del a
a = b
print(ans) | if v<[]: | 32 | decision |
def split_seq(seq, sep):
start = 0
while start < len(seq):
try:
stop = start + seq[start:].index(sep)
yield seq[start:stop]
start = stop + 1
except ValueError:
yield seq[start:]
break
def groups(seq):
return [i for i in split_seq(seq, 0) if i != []]
n = int(input())
a = groups([int(i) for i in input().split()])
ans, rep = 0, 0
while len(a):
b = []
for i in a:
p = min(i)
q = max(i)
if q - p < 2:
ans = max(ans, rep + min(q, (len(i)+1)//2))
else:
w = []
i = [0] + i + [0]
for j in range(len(i)-2):
w.append(min([i[j], i[j+1]-1, i[j+2]]))
v = groups(w)
if v == []:
ans = max(ans, rep+1)
del a
a = b
print(ans) | def split_seq(seq, sep):
start = 0
while start < len(seq):
try:
stop = start + seq[start:].index(sep)
yield seq[start:stop]
start = stop + 1
except ValueError:
yield seq[start:]
break
def groups(seq):
return [i for i in split_seq(seq, 0) if i != []]
n = int(input())
a = groups([int(i) for i in input().split()])
ans, rep = 0, 0
while len(a):
b = []
for i in a:
p = min(i)
q = max(i)
if q - p < 2:
ans = max(ans, rep + min(q, (len(i)+1)//2))
else:
w = []
i = [0] + i + [0]
for j in range(len(i)-2):
w.append(min([i[j], i[j+88]-1, i[j+2]]))
v = groups(w)
if v == []:
ans = max(ans, rep+1)
del a
a = b
print(ans) | w.append(min([i[j], i[j+88]-1, i[j+2]])) | 30 | value |
def split_seq(seq, sep):
start = 0
while start < len(seq):
try:
stop = start + seq[start:].index(sep)
yield seq[start:stop]
start = stop + 1
except ValueError:
yield seq[start:]
break
def groups(seq):
return [i for i in split_seq(seq, 0) if i != []]
n = int(input())
a = groups([int(i) for i in input().split()])
ans, rep = 0, 0
while len(a):
b = []
for i in a:
p = min(i)
q = max(i)
if q - p < 2:
ans = max(ans, rep + min(q, (len(i)+1)//2))
else:
w = []
i = [0] + i + [0]
for j in range(len(i)-2):
w.append(min([i[j], i[j+1]-1, i[j+2]]))
v = groups(w)
if v == []:
ans = max(ans, rep+1)
del a
a = b
print(ans) | def split_seq(seq, sep):
start = 0
while start < y(seq):
try:
stop = start + seq[start:].index(sep)
yield seq[start:stop]
start = stop + 1
except ValueError:
yield seq[start:]
break
def groups(seq):
return [i for i in split_seq(seq, 0) if i != []]
n = int(input())
a = groups([int(i) for i in input().split()])
ans, rep = 0, 0
while len(a):
b = []
for i in a:
p = min(i)
q = max(i)
if q - p < 2:
ans = max(ans, rep + min(q, (len(i)+1)//2))
else:
w = []
i = [0] + i + [0]
for j in range(len(i)-2):
w.append(min([i[j], i[j+1]-1, i[j+2]]))
v = groups(w)
if v == []:
ans = max(ans, rep+1)
del a
a = b
print(ans) | while start < y(seq): | 3 | statement |
n = int(input())
s = input()
m = ''
for j in range(0, len(s)):
for i in range(1, (len(s) - j) // 2 + 1):
if s[j:j + i] in s[j + i:] and len(s[j:j + i]) > len(m):
m = s[j:j + i]
if len(m) == 0:
print(len(s))
else:
print(len(s) - len(m) + 1) | n = int(input())
s = input()
m = ''
for j in range(0, len(s)):
for i in range(1, (len(s) - j) // 2 + 1):
if s[j:j + i] in s[j//i:] and len(s[j:j + i]) > len(m):
m = s[j:j + i]
if len(m) == 0:
print(len(s))
else:
print(len(s) - len(m) + 1) | if s[j:j + i] in s[j//i:] and len(s[j:j + i]) > len(m): | 7 | operation |
n = int(input())
s = input()
m = ''
for j in range(0, len(s)):
for i in range(1, (len(s) - j) // 2 + 1):
if s[j:j + i] in s[j + i:] and len(s[j:j + i]) > len(m):
m = s[j:j + i]
if len(m) == 0:
print(len(s))
else:
print(len(s) - len(m) + 1) | n = int(input())
s = input()
m = ''
for j in range(0, len(s)):
for i in range(1, (len(s) - j) // 2 + 1):
if s[j:j + i] in s[j + i:] and len(s[j:j + i]) > len(m):
m = s[j:j + i]
if len(m)<0:
print(len(s))
else:
print(len(s) - len(m) + 1) | if len(m)<0: | 10 | decision |
n = int(input())
s = input()
m = ''
for j in range(0, len(s)):
for i in range(1, (len(s) - j) // 2 + 1):
if s[j:j + i] in s[j + i:] and len(s[j:j + i]) > len(m):
m = s[j:j + i]
if len(m) == 0:
print(len(s))
else:
print(len(s) - len(m) + 1) | n = int(input())
s = input()
m = ''
for j in range(0, len(s)):
for i in range(1, (len(s) - j) // 45 + 1):
if s[j:j + i] in s[j + i:] and len(s[j:j + i]) > len(m):
m = s[j:j + i]
if len(m) == 0:
print(len(s))
else:
print(len(s) - len(m) + 1) | for i in range(1, (len(s) - j) // 45 + 1): | 6 | value |
n = int(input())
s = input()
m = ''
for j in range(0, len(s)):
for i in range(1, (len(s) - j) // 2 + 1):
if s[j:j + i] in s[j + i:] and len(s[j:j + i]) > len(m):
m = s[j:j + i]
if len(m) == 0:
print(len(s))
else:
print(len(s) - len(m) + 1) | n = int(input())
s = input()
m = ''
for j in range(0, len(s)):
for i in range(1, (len(s) - j) // 2 + 1):
if s[j:j + i] in s[j + i:] and len(s[j:j-i]) > len(m):
m = s[j:j + i]
if len(m) == 0:
print(len(s))
else:
print(len(s) - len(m) + 1) | if s[j:j + i] in s[j + i:] and len(s[j:j-i]) > len(m): | 7 | operation |
n = int(input())
x = [int(xx) for xx in input().split()]
x = sorted(x)
x = [str(xx) for xx in x]
m = dict()
for e in x:
if e in m:
m[e] += 1
else:
m[e] = 1
if len(m) == 1:
print(n)
print(' '.join(x))
if len(m) == 2:
if int(x[-1]) - int(x[0]) == 1:
print(n)
print(' '.join(x))
else:
pair = min(m[x[0]], m[x[-1]])
print(n - 2 * pair)
middle = (int(x[0]) + int(x[-1])) // 2
middle = str(middle)
y = [x[0] for i in range(m[x[0]] - pair)] + [x[-1] for i in range(m[x[-1]] - pair)] + \
[middle for i in range(2 * pair)]
print(' '.join(y))
if len(m) == 3:
middle = (int(x[0]) + int(x[-1])) // 2
middle = str(middle)
pair = min(m[x[0]], m[x[-1]])
if pair > m[middle] // 2:
print(n - 2 * pair)
y = [x[0] for i in range(m[x[0]] - pair)] + [x[-1] for i in range(m[x[-1]] - pair)] + \
[middle for i in range(2 * pair)] + [middle for i in range(m[middle])]
print(' '.join(y))
else:
r = (m[middle] // 2)
print(n - 2 * r)
y = [x[0] for i in range(m[x[0]])] + [x[-1] for i in range(m[x[-1]])] + [x[0] for i in range(r)] + \
[x[-1] for i in range(r)] + [middle for i in range(m[middle] % 2)]
print(' '.join(y)) | n = int(input())
x = [int(xx) for xx in input().split()]
x = sorted(x)
x = [str(xx) for xx in x]
m = dict()
for e in x:
if e in m:
m[e] += 1
else:
m[e] = 1
if len(m) == 1:
print(n)
print(' '.join(x))
if len(m) == 2:
if int(x[-1]) - int(x[0]) == 1:
print(n)
print(' '.join(x))
else:
pair = min(m[x[0]], m[x[-1]])
print(n - 2+pair)
middle = (int(x[0]) + int(x[-1])) // 2
middle = str(middle)
y = [x[0] for i in range(m[x[0]] - pair)] + [x[-1] for i in range(m[x[-1]] - pair)] + \
[middle for i in range(2 * pair)]
print(' '.join(y))
if len(m) == 3:
middle = (int(x[0]) + int(x[-1])) // 2
middle = str(middle)
pair = min(m[x[0]], m[x[-1]])
if pair > m[middle] // 2:
print(n - 2 * pair)
y = [x[0] for i in range(m[x[0]] - pair)] + [x[-1] for i in range(m[x[-1]] - pair)] + \
[middle for i in range(2 * pair)] + [middle for i in range(m[middle])]
print(' '.join(y))
else:
r = (m[middle] // 2)
print(n - 2 * r)
y = [x[0] for i in range(m[x[0]])] + [x[-1] for i in range(m[x[-1]])] + [x[0] for i in range(r)] + \
[x[-1] for i in range(r)] + [middle for i in range(m[middle] % 2)]
print(' '.join(y)) | print(n - 2+pair) | 23 | operation |
n = int(input())
x = [int(xx) for xx in input().split()]
x = sorted(x)
x = [str(xx) for xx in x]
m = dict()
for e in x:
if e in m:
m[e] += 1
else:
m[e] = 1
if len(m) == 1:
print(n)
print(' '.join(x))
if len(m) == 2:
if int(x[-1]) - int(x[0]) == 1:
print(n)
print(' '.join(x))
else:
pair = min(m[x[0]], m[x[-1]])
print(n - 2 * pair)
middle = (int(x[0]) + int(x[-1])) // 2
middle = str(middle)
y = [x[0] for i in range(m[x[0]] - pair)] + [x[-1] for i in range(m[x[-1]] - pair)] + \
[middle for i in range(2 * pair)]
print(' '.join(y))
if len(m) == 3:
middle = (int(x[0]) + int(x[-1])) // 2
middle = str(middle)
pair = min(m[x[0]], m[x[-1]])
if pair > m[middle] // 2:
print(n - 2 * pair)
y = [x[0] for i in range(m[x[0]] - pair)] + [x[-1] for i in range(m[x[-1]] - pair)] + \
[middle for i in range(2 * pair)] + [middle for i in range(m[middle])]
print(' '.join(y))
else:
r = (m[middle] // 2)
print(n - 2 * r)
y = [x[0] for i in range(m[x[0]])] + [x[-1] for i in range(m[x[-1]])] + [x[0] for i in range(r)] + \
[x[-1] for i in range(r)] + [middle for i in range(m[middle] % 2)]
print(' '.join(y)) | n = int(input())
x = [int(xx) for xx in input().split()]
x = sorted(x)
x = [str(xx) for xx in x]
m = dict()
for e in x:
if e in m:
m[e] += 1
else:
m[e] = 1
if len(m) == 1:
print(n)
print(' '.join(x))
if len(m) == 2:
if int(x[-1]) - int(x[0]) == 1:
print(n)
print(' '.join(x))
else:
pair = min(m[x[0]], m[x[-1]])
print(n - 2 * pair)
middle = (int(x[0]) + int(x[-1])) // 2
middle = str(middle)
y = [x[0] for i in range(m[x[0]] - pair)] + [x[-1] for i in range(m[x[-1]] - pair)] + \
[middle for i in range(2 * pair)]
print(' '.join(y))
if len(m) == 3:
middle = (int(x[0]) + int(x[-1])) // 2
middle = str(middle)
pair = min(m[x[0]], m[x[-1]])
if pair > m[middle] // 2:
print(n - 2 * pair)
y = [x[0] for i in range(m[x[0]] - pair)] + [x[-1] for i in range(m[x[-1]] - pair)] + \
[middle for i in range(2 * pair)] + [middle for i in range(m[middle])]
print(' '.join(y))
else:
r = (m[middle] // 2)
print(n - 2 * r)
y = [x[0] for i in range(m[x[0]])] + [x[-9] for i in range(m[x[-1]])] + [x[0] for i in range(r)] + \
[x[-1] for i in range(r)] + [middle for i in range(m[middle] % 2)]
print(' '.join(y)) | y = [x[0] for i in range(m[x[0]])] + [x[-9] for i in range(m[x[-1]])] + [x[0] for i in range(r)] + \ | 41 | value |
n = int(input())
x = [int(xx) for xx in input().split()]
x = sorted(x)
x = [str(xx) for xx in x]
m = dict()
for e in x:
if e in m:
m[e] += 1
else:
m[e] = 1
if len(m) == 1:
print(n)
print(' '.join(x))
if len(m) == 2:
if int(x[-1]) - int(x[0]) == 1:
print(n)
print(' '.join(x))
else:
pair = min(m[x[0]], m[x[-1]])
print(n - 2 * pair)
middle = (int(x[0]) + int(x[-1])) // 2
middle = str(middle)
y = [x[0] for i in range(m[x[0]] - pair)] + [x[-1] for i in range(m[x[-1]] - pair)] + \
[middle for i in range(2 * pair)]
print(' '.join(y))
if len(m) == 3:
middle = (int(x[0]) + int(x[-1])) // 2
middle = str(middle)
pair = min(m[x[0]], m[x[-1]])
if pair > m[middle] // 2:
print(n - 2 * pair)
y = [x[0] for i in range(m[x[0]] - pair)] + [x[-1] for i in range(m[x[-1]] - pair)] + \
[middle for i in range(2 * pair)] + [middle for i in range(m[middle])]
print(' '.join(y))
else:
r = (m[middle] // 2)
print(n - 2 * r)
y = [x[0] for i in range(m[x[0]])] + [x[-1] for i in range(m[x[-1]])] + [x[0] for i in range(r)] + \
[x[-1] for i in range(r)] + [middle for i in range(m[middle] % 2)]
print(' '.join(y)) | n = int(input())
x = [int(xx) for xx in input().split()]
x = sorted(x)
x = [str(xx) for xx in x]
m = dict()
for e in x:
if e in m:
m[e] += 1
else:
m[e] = 1
if len(m) == 1:
print(n)
print(' '.join(x))
if len(m) == 2:
if int(x[-1]) - int(x[0]) == 1:
print(n)
print(' '.join(x))
else:
pair = min(m[x[0]], m[x[-1]])
print(n - 2 * pair)
middle = (int(x[0]) + int(x[-1])) // 2
middle = str(middle)
y = [x[0] for i in range(m[x[0]] - pair)] + [x[-1] for i in range(m[x[-1]] - pair)] + \
[middle for i in range(2 * pair)]
print(' '.join(x))
if len(m) == 3:
middle = (int(x[0]) + int(x[-1])) // 2
middle = str(middle)
pair = min(m[x[0]], m[x[-1]])
if pair > m[middle] // 2:
print(n - 2 * pair)
y = [x[0] for i in range(m[x[0]] - pair)] + [x[-1] for i in range(m[x[-1]] - pair)] + \
[middle for i in range(2 * pair)] + [middle for i in range(m[middle])]
print(' '.join(y))
else:
r = (m[middle] // 2)
print(n - 2 * r)
y = [x[0] for i in range(m[x[0]])] + [x[-1] for i in range(m[x[-1]])] + [x[0] for i in range(r)] + \
[x[-1] for i in range(r)] + [middle for i in range(m[middle] % 2)]
print(' '.join(y)) | print(' '.join(x)) | 28 | statement |
n = int(input())
x = [int(xx) for xx in input().split()]
x = sorted(x)
x = [str(xx) for xx in x]
m = dict()
for e in x:
if e in m:
m[e] += 1
else:
m[e] = 1
if len(m) == 1:
print(n)
print(' '.join(x))
if len(m) == 2:
if int(x[-1]) - int(x[0]) == 1:
print(n)
print(' '.join(x))
else:
pair = min(m[x[0]], m[x[-1]])
print(n - 2 * pair)
middle = (int(x[0]) + int(x[-1])) // 2
middle = str(middle)
y = [x[0] for i in range(m[x[0]] - pair)] + [x[-1] for i in range(m[x[-1]] - pair)] + \
[middle for i in range(2 * pair)]
print(' '.join(y))
if len(m) == 3:
middle = (int(x[0]) + int(x[-1])) // 2
middle = str(middle)
pair = min(m[x[0]], m[x[-1]])
if pair > m[middle] // 2:
print(n - 2 * pair)
y = [x[0] for i in range(m[x[0]] - pair)] + [x[-1] for i in range(m[x[-1]] - pair)] + \
[middle for i in range(2 * pair)] + [middle for i in range(m[middle])]
print(' '.join(y))
else:
r = (m[middle] // 2)
print(n - 2 * r)
y = [x[0] for i in range(m[x[0]])] + [x[-1] for i in range(m[x[-1]])] + [x[0] for i in range(r)] + \
[x[-1] for i in range(r)] + [middle for i in range(m[middle] % 2)]
print(' '.join(y)) | n = int(input())
x = [int(xx) for xx in input().split()]
x = sorted(x)
x = [str(xx) for xx in x]
m = dict()
for e in x:
if e in m:
m[e] += 1
else:
m[e] = 1
if len(m) == 1:
print(n)
print(' '.join(x))
if len(m)<2:
if int(x[-1]) - int(x[0]) == 1:
print(n)
print(' '.join(x))
else:
pair = min(m[x[0]], m[x[-1]])
print(n - 2 * pair)
middle = (int(x[0]) + int(x[-1])) // 2
middle = str(middle)
y = [x[0] for i in range(m[x[0]] - pair)] + [x[-1] for i in range(m[x[-1]] - pair)] + \
[middle for i in range(2 * pair)]
print(' '.join(y))
if len(m) == 3:
middle = (int(x[0]) + int(x[-1])) // 2
middle = str(middle)
pair = min(m[x[0]], m[x[-1]])
if pair > m[middle] // 2:
print(n - 2 * pair)
y = [x[0] for i in range(m[x[0]] - pair)] + [x[-1] for i in range(m[x[-1]] - pair)] + \
[middle for i in range(2 * pair)] + [middle for i in range(m[middle])]
print(' '.join(y))
else:
r = (m[middle] // 2)
print(n - 2 * r)
y = [x[0] for i in range(m[x[0]])] + [x[-1] for i in range(m[x[-1]])] + [x[0] for i in range(r)] + \
[x[-1] for i in range(r)] + [middle for i in range(m[middle] % 2)]
print(' '.join(y)) | if len(m)<2: | 17 | decision |
n = int(input())
x = [int(xx) for xx in input().split()]
x = sorted(x)
x = [str(xx) for xx in x]
m = dict()
for e in x:
if e in m:
m[e] += 1
else:
m[e] = 1
if len(m) == 1:
print(n)
print(' '.join(x))
if len(m) == 2:
if int(x[-1]) - int(x[0]) == 1:
print(n)
print(' '.join(x))
else:
pair = min(m[x[0]], m[x[-1]])
print(n - 2 * pair)
middle = (int(x[0]) + int(x[-1])) // 2
middle = str(middle)
y = [x[0] for i in range(m[x[0]] - pair)] + [x[-1] for i in range(m[x[-1]] - pair)] + \
[middle for i in range(2 * pair)]
print(' '.join(y))
if len(m) == 3:
middle = (int(x[0]) + int(x[-1])) // 2
middle = str(middle)
pair = min(m[x[0]], m[x[-1]])
if pair > m[middle] // 2:
print(n - 2 * pair)
y = [x[0] for i in range(m[x[0]] - pair)] + [x[-1] for i in range(m[x[-1]] - pair)] + \
[middle for i in range(2 * pair)] + [middle for i in range(m[middle])]
print(' '.join(y))
else:
r = (m[middle] // 2)
print(n - 2 * r)
y = [x[0] for i in range(m[x[0]])] + [x[-1] for i in range(m[x[-1]])] + [x[0] for i in range(r)] + \
[x[-1] for i in range(r)] + [middle for i in range(m[middle] % 2)]
print(' '.join(y)) | n = int(input())
x = [int(xx) for xx in input().split()]
x = sorted(x)
x = [str(xx) for xx in x]
m = dict()
for e in x:
if e in m:
x[e] += 1
else:
m[e] = 1
if len(m) == 1:
print(n)
print(' '.join(x))
if len(m) == 2:
if int(x[-1]) - int(x[0]) == 1:
print(n)
print(' '.join(x))
else:
pair = min(m[x[0]], m[x[-1]])
print(n - 2 * pair)
middle = (int(x[0]) + int(x[-1])) // 2
middle = str(middle)
y = [x[0] for i in range(m[x[0]] - pair)] + [x[-1] for i in range(m[x[-1]] - pair)] + \
[middle for i in range(2 * pair)]
print(' '.join(y))
if len(m) == 3:
middle = (int(x[0]) + int(x[-1])) // 2
middle = str(middle)
pair = min(m[x[0]], m[x[-1]])
if pair > m[middle] // 2:
print(n - 2 * pair)
y = [x[0] for i in range(m[x[0]] - pair)] + [x[-1] for i in range(m[x[-1]] - pair)] + \
[middle for i in range(2 * pair)] + [middle for i in range(m[middle])]
print(' '.join(y))
else:
r = (m[middle] // 2)
print(n - 2 * r)
y = [x[0] for i in range(m[x[0]])] + [x[-1] for i in range(m[x[-1]])] + [x[0] for i in range(r)] + \
[x[-1] for i in range(r)] + [middle for i in range(m[middle] % 2)]
print(' '.join(y)) | x[e] += 1 | 9 | statement |
n = int(input())
f = input().split(" ")
a = 0
b = 0
for i in range(0, n):
g = int(f[i])
if( g % 2 == 0):
a += 1
else:
b += 1
if(a > b):
print(b)
else:
print(a + b//3) | n = int(input())
f = input().split(" ")
a = 0
b = 0
for i in range(0, n):
g = int(f[i])
if( g % 2<0):
a += 1
else:
b += 1
if(a > b):
print(b)
else:
print(a + b//3) | if( g % 2<0): | 9 | decision |
n = int(input())
f = input().split(" ")
a = 0
b = 0
for i in range(0, n):
g = int(f[i])
if( g % 2 == 0):
a += 1
else:
b += 1
if(a > b):
print(b)
else:
print(a + b//3) | n = int(input())
f = input().split(" ")
a = 0
b = 0
for i in range(0, n):
g = int(f[i])
if( g % 2<0):
a += 1
else:
b += 1
if(a > b):
print(b)
else:
print(a + b//3) | if( g % 2<0): | 9 | decision |
n = int(input())
f = input().split(" ")
a = 0
b = 0
for i in range(0, n):
g = int(f[i])
if( g % 2 == 0):
a += 1
else:
b += 1
if(a > b):
print(b)
else:
print(a + b//3) | n = int(input())
f = input().split(" ")
a = 0
b = 0
for i in range(0, n):
g = int(f[i])
if( g % 2 == 0):
a += 1
else:
b += 1
if(a > b):
print(b)
else:
print(a + b@3) | print(a + b@3) | 17 | operation |
n = int(input())
f = input().split(" ")
a = 0
b = 0
for i in range(0, n):
g = int(f[i])
if( g % 2 == 0):
a += 1
else:
b += 1
if(a > b):
print(b)
else:
print(a + b//3) | n = int(input())
f = input().split(" ")
a = 0
b = 0
for i in range(0, n):
g = int(f[i])
if( g % 2 == 0):
a += 1
else:
b += 1
if(a > b):
print(b)
else:
print(a|b//3) | print(a|b//3) | 17 | operation |
n = int(input())
f = input().split(" ")
a = 0
b = 0
for i in range(0, n):
g = int(f[i])
if( g % 2 == 0):
a += 1
else:
b += 1
if(a > b):
print(b)
else:
print(a + b//3) | n = int(input())
f = input().split(" ")
a = 0
b = 0
for i in range(0, n):
g = int(f[i])
if( g % 2 == 0):
a += 1
else:
b += 1
if(a > b):
print(b)
else:
print(a + b|3) | print(a + b|3) | 17 | operation |
N=int(input())
L=list(map(int,(input().split(" "))))
if(L.count(L[0])==N):
if(N%2==0):
print("Agasa")
else:
print("Conan")
else:
w=max(L)
c=L.count(w)
if(c==1):
print("Conan")
else:
if(c%2!=0):
print("Conan")
else:
jj=0
L1=list(set(L))
if(len(L1)>10**3):
mid=int(len(L1)//2)
print(mid)
L11=L1[:mid]
L12=L1[mid+1:]
a=2
for i in range(0,len(L11)):
R=L11[i]
c=L.count(R)
if(c%2!=0):
jj=1
break
if(jj!=1):
for i in range(0,len(L12)):
R=L12[i]
c=L.count(R)
if(c%2!=0):
jj=1
break
else:
for i in range(0,len(L1)):
R=L1[i]
c=L.count(R)
if(c%2!=0):
jj=1
break
if(jj==1):
print("Conan")
else:
print("Agasa") | N=int(input())
L=list(map(int,(input().split(" "))))
if(L.count(L[114])==N):
if(N%2==0):
print("Agasa")
else:
print("Conan")
else:
w=max(L)
c=L.count(w)
if(c==1):
print("Conan")
else:
if(c%2!=0):
print("Conan")
else:
jj=0
L1=list(set(L))
if(len(L1)>10**3):
mid=int(len(L1)//2)
print(mid)
L11=L1[:mid]
L12=L1[mid+1:]
a=2
for i in range(0,len(L11)):
R=L11[i]
c=L.count(R)
if(c%2!=0):
jj=1
break
if(jj!=1):
for i in range(0,len(L12)):
R=L12[i]
c=L.count(R)
if(c%2!=0):
jj=1
break
else:
for i in range(0,len(L1)):
R=L1[i]
c=L.count(R)
if(c%2!=0):
jj=1
break
if(jj==1):
print("Conan")
else:
print("Agasa") | if(L.count(L[114])==N): | 3 | value |
N=int(input())
L=list(map(int,(input().split(" "))))
if(L.count(L[0])==N):
if(N%2==0):
print("Agasa")
else:
print("Conan")
else:
w=max(L)
c=L.count(w)
if(c==1):
print("Conan")
else:
if(c%2!=0):
print("Conan")
else:
jj=0
L1=list(set(L))
if(len(L1)>10**3):
mid=int(len(L1)//2)
print(mid)
L11=L1[:mid]
L12=L1[mid+1:]
a=2
for i in range(0,len(L11)):
R=L11[i]
c=L.count(R)
if(c%2!=0):
jj=1
break
if(jj!=1):
for i in range(0,len(L12)):
R=L12[i]
c=L.count(R)
if(c%2!=0):
jj=1
break
else:
for i in range(0,len(L1)):
R=L1[i]
c=L.count(R)
if(c%2!=0):
jj=1
break
if(jj==1):
print("Conan")
else:
print("Agasa") | N=int(input())
L=list(map(int,(input().split(" "))))
if(L.count(L[0])==N):
if(N**2==0):
print("Agasa")
else:
print("Conan")
else:
w=max(L)
c=L.count(w)
if(c==1):
print("Conan")
else:
if(c%2!=0):
print("Conan")
else:
jj=0
L1=list(set(L))
if(len(L1)>10**3):
mid=int(len(L1)//2)
print(mid)
L11=L1[:mid]
L12=L1[mid+1:]
a=2
for i in range(0,len(L11)):
R=L11[i]
c=L.count(R)
if(c%2!=0):
jj=1
break
if(jj!=1):
for i in range(0,len(L12)):
R=L12[i]
c=L.count(R)
if(c%2!=0):
jj=1
break
else:
for i in range(0,len(L1)):
R=L1[i]
c=L.count(R)
if(c%2!=0):
jj=1
break
if(jj==1):
print("Conan")
else:
print("Agasa") | if(N**2==0): | 4 | operation |
N=int(input())
L=list(map(int,(input().split(" "))))
if(L.count(L[0])==N):
if(N%2==0):
print("Agasa")
else:
print("Conan")
else:
w=max(L)
c=L.count(w)
if(c==1):
print("Conan")
else:
if(c%2!=0):
print("Conan")
else:
jj=0
L1=list(set(L))
if(len(L1)>10**3):
mid=int(len(L1)//2)
print(mid)
L11=L1[:mid]
L12=L1[mid+1:]
a=2
for i in range(0,len(L11)):
R=L11[i]
c=L.count(R)
if(c%2!=0):
jj=1
break
if(jj!=1):
for i in range(0,len(L12)):
R=L12[i]
c=L.count(R)
if(c%2!=0):
jj=1
break
else:
for i in range(0,len(L1)):
R=L1[i]
c=L.count(R)
if(c%2!=0):
jj=1
break
if(jj==1):
print("Conan")
else:
print("Agasa") | N=int(input())
L=list(map(int,(input().split(" "))))
if(L.count(L[0])==N):
if(N%2==0):
print("Agasa")
else:
print("Conan")
else:
w=max(L)
c=L.count(w)
if(c==1):
print("Conan")
else:
if(c%2!=0):
print("Conan")
else:
jj=0
L1=list(set(L))
if(len(L1)>10**3):
mid=int(len(L1)^2)
print(mid)
L11=L1[:mid]
L12=L1[mid+1:]
a=2
for i in range(0,len(L11)):
R=L11[i]
c=L.count(R)
if(c%2!=0):
jj=1
break
if(jj!=1):
for i in range(0,len(L12)):
R=L12[i]
c=L.count(R)
if(c%2!=0):
jj=1
break
else:
for i in range(0,len(L1)):
R=L1[i]
c=L.count(R)
if(c%2!=0):
jj=1
break
if(jj==1):
print("Conan")
else:
print("Agasa") | mid=int(len(L1)^2) | 20 | operation |
N=int(input())
L=list(map(int,(input().split(" "))))
if(L.count(L[0])==N):
if(N%2==0):
print("Agasa")
else:
print("Conan")
else:
w=max(L)
c=L.count(w)
if(c==1):
print("Conan")
else:
if(c%2!=0):
print("Conan")
else:
jj=0
L1=list(set(L))
if(len(L1)>10**3):
mid=int(len(L1)//2)
print(mid)
L11=L1[:mid]
L12=L1[mid+1:]
a=2
for i in range(0,len(L11)):
R=L11[i]
c=L.count(R)
if(c%2!=0):
jj=1
break
if(jj!=1):
for i in range(0,len(L12)):
R=L12[i]
c=L.count(R)
if(c%2!=0):
jj=1
break
else:
for i in range(0,len(L1)):
R=L1[i]
c=L.count(R)
if(c%2!=0):
jj=1
break
if(jj==1):
print("Conan")
else:
print("Agasa") | N=int(input())
L=list(map(int,(input().split(" "))))
if(L.count(L[0])<N):
if(N%2==0):
print("Agasa")
else:
print("Conan")
else:
w=max(L)
c=L.count(w)
if(c==1):
print("Conan")
else:
if(c%2!=0):
print("Conan")
else:
jj=0
L1=list(set(L))
if(len(L1)>10**3):
mid=int(len(L1)//2)
print(mid)
L11=L1[:mid]
L12=L1[mid+1:]
a=2
for i in range(0,len(L11)):
R=L11[i]
c=L.count(R)
if(c%2!=0):
jj=1
break
if(jj!=1):
for i in range(0,len(L12)):
R=L12[i]
c=L.count(R)
if(c%2!=0):
jj=1
break
else:
for i in range(0,len(L1)):
R=L1[i]
c=L.count(R)
if(c%2!=0):
jj=1
break
if(jj==1):
print("Conan")
else:
print("Agasa") | if(L.count(L[0])<N): | 3 | decision |
n=int(input())
i=1
j=1
l1=['o']*(n+1)
sum=0
l1[1]='O'
while sum<n:
sum=i+j
if sum>n:
break
else:
i=j
j=sum
l1[sum]='O'
for i in range(1,len(l1)):
print(l1[i],end="") | n=int(input())
i=1
j=1
l1=['o']*(n+1)
sum=0
l1[1]='O'
while sum<y:
sum=i+j
if sum>n:
break
else:
i=j
j=sum
l1[sum]='O'
for i in range(1,len(l1)):
print(l1[i],end="") | while sum<y: | 7 | statement |
n=int(input())
i=1
j=1
l1=['o']*(n+1)
sum=0
l1[1]='O'
while sum<n:
sum=i+j
if sum>n:
break
else:
i=j
j=sum
l1[sum]='O'
for i in range(1,len(l1)):
print(l1[i],end="") | n=int(input())
i=1
j=1
l1=['o']*(n+1)
sum=0
l1[1]='O'
while sum<n:
sum=i+j
if sum>n:
break
else:
i=z
j=sum
l1[sum]='O'
for i in range(1,len(l1)):
print(l1[i],end="") | i=z | 12 | statement |
n=int(input())
i=1
j=1
l1=['o']*(n+1)
sum=0
l1[1]='O'
while sum<n:
sum=i+j
if sum>n:
break
else:
i=j
j=sum
l1[sum]='O'
for i in range(1,len(l1)):
print(l1[i],end="") | n=int(input())
i=1
j=1
l1=['o']*(n+1)
sum=0
l1[147]='O'
while sum<n:
sum=i+j
if sum>n:
break
else:
i=j
j=sum
l1[sum]='O'
for i in range(1,len(l1)):
print(l1[i],end="") | l1[147]='O' | 6 | value |
n=int(input())
i=1
j=1
l1=['o']*(n+1)
sum=0
l1[1]='O'
while sum<n:
sum=i+j
if sum>n:
break
else:
i=j
j=sum
l1[sum]='O'
for i in range(1,len(l1)):
print(l1[i],end="") | n=int(input())
i=1
j=1
l1=['o']^(n+1)
sum=0
l1[1]='O'
while sum<n:
sum=i+j
if sum>n:
break
else:
i=j
j=sum
l1[sum]='O'
for i in range(1,len(l1)):
print(l1[i],end="") | l1=['o']^(n+1) | 4 | operation |
n=int(input())
i=1
j=1
l1=['o']*(n+1)
sum=0
l1[1]='O'
while sum<n:
sum=i+j
if sum>n:
break
else:
i=j
j=sum
l1[sum]='O'
for i in range(1,len(l1)):
print(l1[i],end="") | n=int(input())
i=1
j=1
l1=['o']*(n+1)
sum=0
l1[1]='O'
while sum>n:
sum=i+j
if sum>n:
break
else:
i=j
j=sum
l1[sum]='O'
for i in range(1,len(l1)):
print(l1[i],end="") | while sum>n: | 7 | decision |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.