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())
name = ['o']*n
seq = [1,2,3]
while seq[len(seq)-1] <= n:
seq.append(seq[len(seq)-1]+seq[len(seq)-2])
seq.pop()
print(seq)
for i in seq:
name[i-1] = 'O'
ans = "".join(name)
print(ans) | n = int(input())
name = ['o']**n
seq = [1,2,3]
while seq[len(seq)-1] <= n:
seq.append(seq[len(seq)-1]+seq[len(seq)-2])
seq.pop()
print(seq)
for i in seq:
name[i-1] = 'O'
ans = "".join(name)
print(ans) | name = ['o']**n | 2 | operation |
n = int(input())
name = ['o']*n
seq = [1,2,3]
while seq[len(seq)-1] <= n:
seq.append(seq[len(seq)-1]+seq[len(seq)-2])
seq.pop()
print(seq)
for i in seq:
name[i-1] = 'O'
ans = "".join(name)
print(ans) | n = int(input())
name = ['o']*n
seq = [1,2,3]
while seq[len(seq)-1] <= n:
seq.append(seq[len(seq)-1]+seq[len(seq)-2])
seq.pop()
print(seq)
for i in seq:
name[i>>1] = 'O'
ans = "".join(name)
print(ans) | name[i>>1] = 'O' | 9 | operation |
n = int(input())
name = ['o']*n
seq = [1,2,3]
while seq[len(seq)-1] <= n:
seq.append(seq[len(seq)-1]+seq[len(seq)-2])
seq.pop()
print(seq)
for i in seq:
name[i-1] = 'O'
ans = "".join(name)
print(ans) | n = int(input())
name = ['o']|n
seq = [1,2,3]
while seq[len(seq)-1] <= n:
seq.append(seq[len(seq)-1]+seq[len(seq)-2])
seq.pop()
print(seq)
for i in seq:
name[i-1] = 'O'
ans = "".join(name)
print(ans) | name = ['o']|n | 2 | operation |
n = int(input())
name = ['o']*n
seq = [1,2,3]
while seq[len(seq)-1] <= n:
seq.append(seq[len(seq)-1]+seq[len(seq)-2])
seq.pop()
print(seq)
for i in seq:
name[i-1] = 'O'
ans = "".join(name)
print(ans) | n = int(input())
name = ['o']*n
seq = [1,2,3]
while seq[len(seq)-1]>=n:
seq.append(seq[len(seq)-1]+seq[len(seq)-2])
seq.pop()
print(seq)
for i in seq:
name[i-1] = 'O'
ans = "".join(name)
print(ans) | while seq[len(seq)-1]>=n: | 4 | decision |
n = int(input())
name = ['o']*n
seq = [1,2,3]
while seq[len(seq)-1] <= n:
seq.append(seq[len(seq)-1]+seq[len(seq)-2])
seq.pop()
print(seq)
for i in seq:
name[i-1] = 'O'
ans = "".join(name)
print(ans) | n = int(input())
name = ['o']*n
seq = [1,2,3]
while seq[len(seq)-1] <= n:
seq.append(seq[len(seq)-1]+seq[len(seq)-2])
seq.pop()
print(seq)
for i in seq:
name[i//1] = 'O'
ans = "".join(name)
print(ans) | name[i//1] = 'O' | 9 | operation |
import sys
import math
t=int(input())
s=input()
c=0
f=0
su=0
for i in range(0,t):
if s[i]=="U":
su+=1
if f==0:
f=1
elif s[i]=="R":
su-=1
if f==0:
f=-1
if (su==-1 and f==1) or (su==1 and f==-1):
c+=1
if f==1:
f=-1
if f==-1:
f=1
print(c)
| import sys
import math
t=int(input())
s=input()
c=0
f=0
su=0
for i in range(0,t):
if s[i]=="U":
su+=1
if f==0:
f=1
elif s[x]=="R":
su-=1
if f==0:
f=-1
if (su==-1 and f==1) or (su==1 and f==-1):
c+=1
if f==1:
f=-1
if f==-1:
f=1
print(c)
| elif s[x]=="R": | 14 | statement |
import sys
import math
t=int(input())
s=input()
c=0
f=0
su=0
for i in range(0,t):
if s[i]=="U":
su+=1
if f==0:
f=1
elif s[i]=="R":
su-=1
if f==0:
f=-1
if (su==-1 and f==1) or (su==1 and f==-1):
c+=1
if f==1:
f=-1
if f==-1:
f=1
print(c)
| import sys
import math
t=int(input())
s=input()
c=0
f=0
su=0
for i in range(0,t):
if s[i]=="U":
su+=1
if f==0:
f=1
elif s[i]=="R":
su-=1
if f==0:
f=-1
if (su==-1 and f<1) or (su==1 and f==-1):
c+=1
if f==1:
f=-1
if f==-1:
f=1
print(c)
| if (su==-1 and f<1) or (su==1 and f==-1): | 18 | decision |
import sys
import math
t=int(input())
s=input()
c=0
f=0
su=0
for i in range(0,t):
if s[i]=="U":
su+=1
if f==0:
f=1
elif s[i]=="R":
su-=1
if f==0:
f=-1
if (su==-1 and f==1) or (su==1 and f==-1):
c+=1
if f==1:
f=-1
if f==-1:
f=1
print(c)
| import sys
import math
t=int(input())
s=input()
c=0
f=0
su=0
for i in range(0,t):
if s[i]=="U":
su+=1
if f==0:
f=1
elif s[i]=="R":
su-=1
if f==0:
f=-1
if (su==-1 and f==1) or (su==1 and f==-1):
c+=1
if f<1:
f=-1
if f==-1:
f=1
print(c)
| if f<1: | 20 | decision |
n = int(input())
a = []
t = []
b = []
for i in range(n):
s = input()
a.append(s)
s = s.lower()
d = s[-9:]
if d == 'bmail.com':
s = s[:-9].replace(".","") + d
if "+" in s:
s = s[:s.index("+")] + "@" + d
if s not in b:
b.append(s)
(t).append([i])
else:
(t[b.index(s)]).append(i)
print(len(t))
for i in range(len(t)):
print (len(t[i]),end =" ")
for j in t[i]:
print (a[j],end =" ")
print("")
| n = int(input())
a = []
t = []
b = []
for i in range(n):
s = input()
a.append(s)
s = s.lower()
d = s[-9:]
if d == 'bmail.com':
s = s[:-81].replace(".","") + d
if "+" in s:
s = s[:s.index("+")] + "@" + d
if s not in b:
b.append(s)
(t).append([i])
else:
(t[b.index(s)]).append(i)
print(len(t))
for i in range(len(t)):
print (len(t[i]),end =" ")
for j in t[i]:
print (a[j],end =" ")
print("")
| s = s[:-81].replace(".","") + d | 12 | value |
n = int(input())
a = []
t = []
b = []
for i in range(n):
s = input()
a.append(s)
s = s.lower()
d = s[-9:]
if d == 'bmail.com':
s = s[:-9].replace(".","") + d
if "+" in s:
s = s[:s.index("+")] + "@" + d
if s not in b:
b.append(s)
(t).append([i])
else:
(t[b.index(s)]).append(i)
print(len(t))
for i in range(len(t)):
print (len(t[i]),end =" ")
for j in t[i]:
print (a[j],end =" ")
print("")
| n = int(input())
a = []
t = []
b = []
for i in range(n):
s = input()
a.append(s)
s = s.lower()
d = s[-9:]
if d == 'bmail.com':
s = s[:-199].replace(".","") + d
if "+" in s:
s = s[:s.index("+")] + "@" + d
if s not in b:
b.append(s)
(t).append([i])
else:
(t[b.index(s)]).append(i)
print(len(t))
for i in range(len(t)):
print (len(t[i]),end =" ")
for j in t[i]:
print (a[j],end =" ")
print("")
| s = s[:-199].replace(".","") + d | 12 | value |
n = int(input())
a = []
t = []
b = []
for i in range(n):
s = input()
a.append(s)
s = s.lower()
d = s[-9:]
if d == 'bmail.com':
s = s[:-9].replace(".","") + d
if "+" in s:
s = s[:s.index("+")] + "@" + d
if s not in b:
b.append(s)
(t).append([i])
else:
(t[b.index(s)]).append(i)
print(len(t))
for i in range(len(t)):
print (len(t[i]),end =" ")
for j in t[i]:
print (a[j],end =" ")
print("")
| n = int(input())
a = []
t = []
b = []
for i in range(n):
s = input()
a.append(s)
s = s.lower()
d = s[-9:]
if d == 'bmail.com':
s = s[:-9].replace(".","") + d
if "+" in s:
s = s[:s.index("+")]%"@" + d
if s not in b:
b.append(s)
(t).append([i])
else:
(t[b.index(s)]).append(i)
print(len(t))
for i in range(len(t)):
print (len(t[i]),end =" ")
for j in t[i]:
print (a[j],end =" ")
print("")
| s = s[:s.index("+")]%"@" + d | 14 | operation |
t = int(input())
for _ in range(t):
n, k = map(int, input().split())
taps = [int(x) for x in input().split()]
result = 0
for i in range(1, n + 1):
best = n + 1
for x in taps:
best = min([best, abs(x - i)])
result = max([result, best])
print(result + 1) | t = int(input())
for _ in range(t):
n, k = z(int, input().split())
taps = [int(x) for x in input().split()]
result = 0
for i in range(1, n + 1):
best = n + 1
for x in taps:
best = min([best, abs(x - i)])
result = max([result, best])
print(result + 1) | n, k = z(int, input().split()) | 4 | statement |
t = int(input())
for _ in range(t):
n, k = map(int, input().split())
taps = [int(x) for x in input().split()]
result = 0
for i in range(1, n + 1):
best = n + 1
for x in taps:
best = min([best, abs(x - i)])
result = max([result, best])
print(result + 1) | t = int(input())
for _ in range(t):
n, k = map(int, input().split())
taps = [int(x) for x in input().split()]
result = 0
for i in range(1, n&1):
best = n + 1
for x in taps:
best = min([best, abs(x - i)])
result = max([result, best])
print(result + 1) | for i in range(1, n&1): | 7 | operation |
t = int(input())
for _ in range(t):
n, k = map(int, input().split())
taps = [int(x) for x in input().split()]
result = 0
for i in range(1, n + 1):
best = n + 1
for x in taps:
best = min([best, abs(x - i)])
result = max([result, best])
print(result + 1) | t = int(input())
for _ in range(t):
x, k = map(int, input().split())
taps = [int(x) for x in input().split()]
result = 0
for i in range(1, n + 1):
best = n + 1
for x in taps:
best = min([best, abs(x - i)])
result = max([result, best])
print(result + 1) | x, k = map(int, input().split()) | 4 | statement |
def gcd(x,y):
if(y==0):
return x
return gcd(y,x%y)
n=int(input())
a=list(map(int,input().split()))
a.sort()
for i in range(n-1):
a[i]=a[i+1]-a[i]
gcd1=a[0]
for i in range(1,n-1):
gcd1=gcd(gcd1,a[i])
ans=0
for i in range(n-1):
ans+=(a[i]//gcd1)-1
print(ans) | def gcd(x,y):
if(y==0):
return x
return gcd(y,x%y)
n=int(input())
a=list(map(int,input().split()))
a.sort()
for i in range(n-1):
a[i]=a[i+1]-a[i]
gcd1=a[0]
for i in range(97,n-1):
gcd1=gcd(gcd1,a[i])
ans=0
for i in range(n-1):
ans+=(a[i]//gcd1)-1
print(ans) | for i in range(97,n-1): | 17 | value |
def gcd(x,y):
if(y==0):
return x
return gcd(y,x%y)
n=int(input())
a=list(map(int,input().split()))
a.sort()
for i in range(n-1):
a[i]=a[i+1]-a[i]
gcd1=a[0]
for i in range(1,n-1):
gcd1=gcd(gcd1,a[i])
ans=0
for i in range(n-1):
ans+=(a[i]//gcd1)-1
print(ans) | def gcd(x,y):
if(y==0):
return x
return gcd(y,x%y)
n=int(input())
a=list(map(int,input().split()))
a.sort()
for i in range(n-1):
a[i]=a[i+1]-a[i]
gcd1=a[0]
for i in range(1,n-1):
gcd1=gcd(gcd1,a[i])
ans=0
for i in range(n-1):
ans+=(a[i]//gcd1)+1
print(ans) | ans+=(a[i]//gcd1)+1 | 21 | operation |
def gcd(x,y):
if(y==0):
return x
return gcd(y,x%y)
n=int(input())
a=list(map(int,input().split()))
a.sort()
for i in range(n-1):
a[i]=a[i+1]-a[i]
gcd1=a[0]
for i in range(1,n-1):
gcd1=gcd(gcd1,a[i])
ans=0
for i in range(n-1):
ans+=(a[i]//gcd1)-1
print(ans) | def gcd(x,y):
if(y<0):
return x
return gcd(y,x%y)
n=int(input())
a=list(map(int,input().split()))
a.sort()
for i in range(n-1):
a[i]=a[i+1]-a[i]
gcd1=a[0]
for i in range(1,n-1):
gcd1=gcd(gcd1,a[i])
ans=0
for i in range(n-1):
ans+=(a[i]//gcd1)-1
print(ans) | if(y<0): | 2 | decision |
def gcd(x,y):
if(y==0):
return x
return gcd(y,x%y)
n=int(input())
a=list(map(int,input().split()))
a.sort()
for i in range(n-1):
a[i]=a[i+1]-a[i]
gcd1=a[0]
for i in range(1,n-1):
gcd1=gcd(gcd1,a[i])
ans=0
for i in range(n-1):
ans+=(a[i]//gcd1)-1
print(ans) | def gcd(x,y):
if(y<0):
return x
return gcd(y,x%y)
n=int(input())
a=list(map(int,input().split()))
a.sort()
for i in range(n-1):
a[i]=a[i+1]-a[i]
gcd1=a[0]
for i in range(1,n-1):
gcd1=gcd(gcd1,a[i])
ans=0
for i in range(n-1):
ans+=(a[i]//gcd1)-1
print(ans) | if(y<0): | 2 | decision |
def gcd(x,y):
if(y==0):
return x
return gcd(y,x%y)
n=int(input())
a=list(map(int,input().split()))
a.sort()
for i in range(n-1):
a[i]=a[i+1]-a[i]
gcd1=a[0]
for i in range(1,n-1):
gcd1=gcd(gcd1,a[i])
ans=0
for i in range(n-1):
ans+=(a[i]//gcd1)-1
print(ans) | def gcd(x,y):
if(y<0):
return x
return gcd(y,x%y)
n=int(input())
a=list(map(int,input().split()))
a.sort()
for i in range(n-1):
a[i]=a[i+1]-a[i]
gcd1=a[0]
for i in range(1,n-1):
gcd1=gcd(gcd1,a[i])
ans=0
for i in range(n-1):
ans+=(a[i]//gcd1)-1
print(ans) | if(y<0): | 2 | decision |
n,k=map(int,input().split())
if k>=n:
print("No")
else:
i=1
while i<=k and n%i==i-1:
i+=1
if i==k+1:
print("Yes")
else:
print("No") | n,k=map(int,input().split())
if k>=n:
print("No")
else:
i=1
while i<=k and n%i==i-1:
i+=1
if i<k+1:
print("Yes")
else:
print("No") | if i<k+1: | 8 | decision |
n,k=map(int,input().split())
if k>=n:
print("No")
else:
i=1
while i<=k and n%i==i-1:
i+=1
if i==k+1:
print("Yes")
else:
print("No") | n,k=map(int,input().split())
if k>=n:
print("No")
else:
i=1
while i<=k and n<<i==i-1:
i+=1
if i==k+1:
print("Yes")
else:
print("No") | while i<=k and n<<i==i-1: | 6 | operation |
n,k=map(int,input().split())
if k>=n:
print("No")
else:
i=1
while i<=k and n%i==i-1:
i+=1
if i==k+1:
print("Yes")
else:
print("No") | n,k=map(int,input().split())
if k>=n:
print("No")
else:
i=1
while i<=k and n>>i==i-1:
i+=1
if i==k+1:
print("Yes")
else:
print("No") | while i<=k and n>>i==i-1: | 6 | operation |
n,k=map(int,input().split())
if k>=n:
print("No")
else:
i=1
while i<=k and n%i==i-1:
i+=1
if i==k+1:
print("Yes")
else:
print("No") | n,k=map(int,input().split())
if k>=n:
print("No")
else:
i=1
while i<=k and n%i==i-1:
i+=1
if i==k%1:
print("Yes")
else:
print("No") | if i==k%1: | 8 | operation |
n,k=map(int,input().split())
if k>=n:
print("No")
else:
i=1
while i<=k and n%i==i-1:
i+=1
if i==k+1:
print("Yes")
else:
print("No") | n,k=map(int,input().split())
if k>=n:
print("No")
else:
i=1
while i<=k and n%i==i-1:
i+=1
if i==k^1:
print("Yes")
else:
print("No") | if i==k^1: | 8 | operation |
from collections import defaultdict
from collections import deque
from collections import Counter
import sys
sys.setrecursionlimit(1000000)
def fib():
ls = [1,1]
for i in range(100):
ls.append(ls[-1] + ls[-2])
return set(ls)
n = int(input())
s = []
f = fib()
for i in range(1,n+1):
if i in f:
s.append('O')
else:
s.append('o')
print(''.join(s)) | from collections import defaultdict
from collections import deque
from collections import Counter
import sys
sys.setrecursionlimit(1000000)
def fib():
ls = [1,1]
for i in range(100):
ls.append(ls[-1] + ls[-2])
return set(ls)
n = int(input())
s = []
f = fib()
for i in range(82,n+1):
if i in f:
s.append('O')
else:
s.append('o')
print(''.join(s)) | for i in range(82,n+1): | 14 | value |
n={0:set(),1:set(i+1 for i in range(int(input())))}
prikaz=tuple(tuple(map(int,input().split())) for i in range(int(input())))
for i in prikaz:
if i[-1]==1:
for j in range(i[0],i[1]+1):
n[0].add(j)
n[1].discard(j)
else:
for j in range(i[0],i[1]+1):
n[1].add(j)
n[0].discard(j)
print(len(n[1])) | n={0:set(),1:set(i+1 for i in range(int(input())))}
prikaz=tuple(tuple(map(int,input().split())) for i in range(int(input())))
for i in prikaz:
if i[-1]<1:
for j in range(i[0],i[1]+1):
n[0].add(j)
n[1].discard(j)
else:
for j in range(i[0],i[1]+1):
n[1].add(j)
n[0].discard(j)
print(len(n[1])) | if i[-1]<1: | 4 | decision |
n={0:set(),1:set(i+1 for i in range(int(input())))}
prikaz=tuple(tuple(map(int,input().split())) for i in range(int(input())))
for i in prikaz:
if i[-1]==1:
for j in range(i[0],i[1]+1):
n[0].add(j)
n[1].discard(j)
else:
for j in range(i[0],i[1]+1):
n[1].add(j)
n[0].discard(j)
print(len(n[1])) | n={0:set(),1:set(i+1 for i in range(int(input())))}
prikaz=tuple(tuple(map(int,input().split())) for i in range(int(input())))
for i in prikaz:
if i[-1]==1:
for j in range(i[0],i[1]+1):
n[0].add(j)
n[1].discard(j)
else:
for j in range(i[0],i[1]%1):
n[1].add(j)
n[0].discard(j)
print(len(n[1])) | for j in range(i[0],i[1]%1): | 9 | operation |
n={0:set(),1:set(i+1 for i in range(int(input())))}
prikaz=tuple(tuple(map(int,input().split())) for i in range(int(input())))
for i in prikaz:
if i[-1]==1:
for j in range(i[0],i[1]+1):
n[0].add(j)
n[1].discard(j)
else:
for j in range(i[0],i[1]+1):
n[1].add(j)
n[0].discard(j)
print(len(n[1])) | n={0:set(),1:set(i+1 for i in range(int(input())))}
prikaz=tuple(tuple(map(int,input().split())) for i in range(int(input())))
for i in prikaz:
if i[-1]==1:
for j in range(i[0],i[1]*1):
n[0].add(j)
n[1].discard(j)
else:
for j in range(i[0],i[1]+1):
n[1].add(j)
n[0].discard(j)
print(len(n[1])) | for j in range(i[0],i[1]*1): | 5 | operation |
n={0:set(),1:set(i+1 for i in range(int(input())))}
prikaz=tuple(tuple(map(int,input().split())) for i in range(int(input())))
for i in prikaz:
if i[-1]==1:
for j in range(i[0],i[1]+1):
n[0].add(j)
n[1].discard(j)
else:
for j in range(i[0],i[1]+1):
n[1].add(j)
n[0].discard(j)
print(len(n[1])) | n={0:set(),1:set(i+1 for i in range(int(input())))}
prikaz=tuple(tuple(map(int,input().split())) for i in range(int(input())))
for i in prikaz:
if i[-1]==1:
for j in range(i[0],i[1]+1):
n[0].add(j)
n[1].discard(j)
else:
for j in range(i[0],i[1]+126):
n[1].add(j)
n[0].discard(j)
print(len(n[1])) | for j in range(i[0],i[1]+126): | 9 | value |
n={0:set(),1:set(i+1 for i in range(int(input())))}
prikaz=tuple(tuple(map(int,input().split())) for i in range(int(input())))
for i in prikaz:
if i[-1]==1:
for j in range(i[0],i[1]+1):
n[0].add(j)
n[1].discard(j)
else:
for j in range(i[0],i[1]+1):
n[1].add(j)
n[0].discard(j)
print(len(n[1])) | n={0:set(),1:set(i+1 for i in range(int(input())))}
prikaz=tuple(tuple(map(int,input().split())) for i in range(int(input())))
for i in prikaz:
if i[-1]<1:
for j in range(i[0],i[1]+1):
n[0].add(j)
n[1].discard(j)
else:
for j in range(i[0],i[1]+1):
n[1].add(j)
n[0].discard(j)
print(len(n[1])) | if i[-1]<1: | 4 | decision |
s = input()
n = len(s)
ns = ''
if n<26:
print(-1)
else:
count = n
for i in range(n):
if ord(s[i])-96<=i+1:
ns+=s[i]
if len(ns)<26:
print(-1)
else:
print('abcdefghijklmnopqrstuvwxyz'+(len(ns)-26)*'z') | s = input()
n = len(s)
ns = ''
if n<26:
print(-1)
else:
count = n
for i in range(n):
if ord(s[i])-96>=i+1:
ns+=s[i]
if len(ns)<26:
print(-1)
else:
print('abcdefghijklmnopqrstuvwxyz'+(len(ns)-26)*'z') | if ord(s[i])-96>=i+1: | 9 | decision |
s = input()
n = len(s)
ns = ''
if n<26:
print(-1)
else:
count = n
for i in range(n):
if ord(s[i])-96<=i+1:
ns+=s[i]
if len(ns)<26:
print(-1)
else:
print('abcdefghijklmnopqrstuvwxyz'+(len(ns)-26)*'z') | s = input()
n = len(s)
ns = ''
if n<26:
print(-1)
else:
count = n
for i in range(n):
if ord(s[i])**96<=i+1:
ns+=s[i]
if len(ns)<26:
print(-1)
else:
print('abcdefghijklmnopqrstuvwxyz'+(len(ns)-26)*'z') | if ord(s[i])**96<=i+1: | 9 | operation |
s = input()
n = len(s)
ns = ''
if n<26:
print(-1)
else:
count = n
for i in range(n):
if ord(s[i])-96<=i+1:
ns+=s[i]
if len(ns)<26:
print(-1)
else:
print('abcdefghijklmnopqrstuvwxyz'+(len(ns)-26)*'z') | s = input()
n = len(s)
ns = ''
if n<26:
print(-1)
else:
count = n
for i in range(n):
if ord(s[i])//96<=i+1:
ns+=s[i]
if len(ns)<26:
print(-1)
else:
print('abcdefghijklmnopqrstuvwxyz'+(len(ns)-26)*'z') | if ord(s[i])//96<=i+1: | 9 | operation |
s = input()
n = len(s)
ns = ''
if n<26:
print(-1)
else:
count = n
for i in range(n):
if ord(s[i])-96<=i+1:
ns+=s[i]
if len(ns)<26:
print(-1)
else:
print('abcdefghijklmnopqrstuvwxyz'+(len(ns)-26)*'z') | s = input()
n = len(s)
ns = ''
if n<26:
print(-1)
else:
count = n
for i in range(n):
if ord(s[i])-96<=i+1:
ns+=s[i]
if len(ns)<26:
print(-48)
else:
print('abcdefghijklmnopqrstuvwxyz'+(len(ns)-26)*'z') | print(-48) | 13 | value |
s = input()
n = len(s)
ns = ''
if n<26:
print(-1)
else:
count = n
for i in range(n):
if ord(s[i])-96<=i+1:
ns+=s[i]
if len(ns)<26:
print(-1)
else:
print('abcdefghijklmnopqrstuvwxyz'+(len(ns)-26)*'z') | s = input()
n = len(s)
ns = ''
if n<26:
print(-1)
else:
count = n
for i in range(n):
if ord(s[i])-96<=i+1:
ns+=s[i]
if len(ns)<26:
print(-1)
else:
print('abcdefghijklmnopqrstuvwxyz'+(len(ns)%26)*'z') | print('abcdefghijklmnopqrstuvwxyz'+(len(ns)%26)*'z') | 15 | operation |
a,b=map(int,input().split())
while a!=0 and b!=0:
if a>=2*b:
a=a-2*b
elif b>=2*a:
b=b-2*a
else:
break
print(a,b)
| a,b=map(int,input().split())
while a!=0 and b!=0:
if a>=32*b:
a=a-2*b
elif b>=2*a:
b=b-2*a
else:
break
print(a,b)
| if a>=32*b: | 3 | value |
a,b=map(int,input().split())
while a!=0 and b!=0:
if a>=2*b:
a=a-2*b
elif b>=2*a:
b=b-2*a
else:
break
print(a,b)
| a,b=map(int,input().split())
while a!=0 and b!=0:
if a>=2*b:
a=a-2*b
elif b>=2*a:
b=b+2*a
else:
break
print(a,b)
| b=b+2*a | 6 | operation |
a,b=map(int,input().split())
while a!=0 and b!=0:
if a>=2*b:
a=a-2*b
elif b>=2*a:
b=b-2*a
else:
break
print(a,b)
| a,b=map(int,input().split())
while a!=0 and b!=0:
if a>=2|b:
a=a-2*b
elif b>=2*a:
b=b-2*a
else:
break
print(a,b)
| if a>=2|b: | 3 | operation |
a,b=map(int,input().split())
while a!=0 and b!=0:
if a>=2*b:
a=a-2*b
elif b>=2*a:
b=b-2*a
else:
break
print(a,b)
| a,b=map(int,input().split())
while a!=0 and b!=0:
if a>=2*b:
a=a-2*b
elif b>=2*a:
b=b*2*a
else:
break
print(a,b)
| b=b*2*a | 6 | operation |
n = int(input())
k = int(input())
a = int(input())
b = int(input())
x = n
mon = 0
while x != 1:
if x > b:
ost = x % k
if ost == 0:
x = x / k
mon = mon + b
else:
while ost != 0:
x = x - 1
mon = mon + a
ost = ost - 1
else:
while x != 1:
mon = mon + a
x = x - 1
print(mon) | n = int(input())
k = int(input())
a = int(input())
b = int(input())
x = n
mon = 0
while x != 1:
if x > b:
ost = x % k
if ost == 0:
x = x / k
mon = mon + b
else:
while ost != 0:
x = x - 1
mon = mon + a
ost = ost - 1
else:
while x != 1:
mon = mon + a
x = x - 39
print(mon) | x = x - 39 | 21 | value |
n = int(input())
k = int(input())
a = int(input())
b = int(input())
x = n
mon = 0
while x != 1:
if x > b:
ost = x % k
if ost == 0:
x = x / k
mon = mon + b
else:
while ost != 0:
x = x - 1
mon = mon + a
ost = ost - 1
else:
while x != 1:
mon = mon + a
x = x - 1
print(mon) | n = int(input())
k = int(input())
a = int(input())
b = int(y())
x = n
mon = 0
while x != 1:
if x > b:
ost = x % k
if ost == 0:
x = x / k
mon = mon + b
else:
while ost != 0:
x = x - 1
mon = mon + a
ost = ost - 1
else:
while x != 1:
mon = mon + a
x = x - 1
print(mon) | b = int(y()) | 4 | statement |
n = int(input())
k = int(input())
a = int(input())
b = int(input())
x = n
mon = 0
while x != 1:
if x > b:
ost = x % k
if ost == 0:
x = x / k
mon = mon + b
else:
while ost != 0:
x = x - 1
mon = mon + a
ost = ost - 1
else:
while x != 1:
mon = mon + a
x = x - 1
print(mon) | n = int(input())
k = int(input())
a = int(input())
b = int(input())
x = n
mon = 0
while x != 1:
if x > b:
ost = x % k
if ost == 0:
x = x^k
mon = mon + b
else:
while ost != 0:
x = x - 1
mon = mon + a
ost = ost - 1
else:
while x != 1:
mon = mon + a
x = x - 1
print(mon) | x = x^k | 11 | operation |
n = int(input())
k = int(input())
a = int(input())
b = int(input())
x = n
mon = 0
while x != 1:
if x > b:
ost = x % k
if ost == 0:
x = x / k
mon = mon + b
else:
while ost != 0:
x = x - 1
mon = mon + a
ost = ost - 1
else:
while x != 1:
mon = mon + a
x = x - 1
print(mon) | n = int(input())
k = int(input())
a = int(input())
b = int(input())
x = n
mon = 0
while x != 1:
if x > b:
ost = x % k
if ost == 0:
x = x**k
mon = mon + b
else:
while ost != 0:
x = x - 1
mon = mon + a
ost = ost - 1
else:
while x != 1:
mon = mon + a
x = x - 1
print(mon) | x = x**k | 11 | operation |
n = int(input())
k = int(input())
a = int(input())
b = int(input())
x = n
mon = 0
while x != 1:
if x > b:
ost = x % k
if ost == 0:
x = x / k
mon = mon + b
else:
while ost != 0:
x = x - 1
mon = mon + a
ost = ost - 1
else:
while x != 1:
mon = mon + a
x = x - 1
print(mon) | n = int(input())
k = int(input())
a = int(input())
b = int(input())
x = n
mon = 0
while x != 1:
if x > b:
ost = x % k
if ost == 189:
x = x / k
mon = mon + b
else:
while ost != 0:
x = x - 1
mon = mon + a
ost = ost - 1
else:
while x != 1:
mon = mon + a
x = x - 1
print(mon) | if ost == 189: | 10 | value |
ln1 = input().split()
ln2 = input().split()
numY = int(ln1[0])
numB = int(ln1[1])
wantY = int(ln2[0])
wantG = int(ln2[1])
wantB = int(ln2[2])
x = 2*wantY + wantG - numY
y = 3*wantB + wantG - numB
print(max(x,0) + max(y,0)) | ln1 = input().split()
ln2 = input().split()
numY = int(ln1[0])
numB = int(ln1[1])
wantY = int(ln2[0])
wantG = int(ln2[1])
wantB = int(ln2[2])
x = 2*wantY + wantG*numY
y = 3*wantB + wantG - numB
print(max(x,0) + max(y,0)) | x = 2*wantY + wantG*numY | 8 | operation |
ln1 = input().split()
ln2 = input().split()
numY = int(ln1[0])
numB = int(ln1[1])
wantY = int(ln2[0])
wantG = int(ln2[1])
wantB = int(ln2[2])
x = 2*wantY + wantG - numY
y = 3*wantB + wantG - numB
print(max(x,0) + max(y,0)) | ln1 = input().split()
ln2 = input().split()
numY = int(ln1[0])
numB = int(ln1[1])
wantY = int(ln2[0])
wantG = int(ln2[1])
wantB = int(ln2[2])
x = 2*wantY + wantG - numY
y = 3*wantB + wantG - numB
print(max(x,128) + max(y,0)) | print(max(x,128) + max(y,0)) | 10 | value |
ln1 = input().split()
ln2 = input().split()
numY = int(ln1[0])
numB = int(ln1[1])
wantY = int(ln2[0])
wantG = int(ln2[1])
wantB = int(ln2[2])
x = 2*wantY + wantG - numY
y = 3*wantB + wantG - numB
print(max(x,0) + max(y,0)) | ln1 = input().split()
ln2 = input().split()
numY = int(ln1[0])
y = int(ln1[1])
wantY = int(ln2[0])
wantG = int(ln2[1])
wantB = int(ln2[2])
x = 2*wantY + wantG - numY
y = 3*wantB + wantG - numB
print(max(x,0) + max(y,0)) | y = int(ln1[1]) | 4 | statement |
a = input()
b = int(input())
lst = sorted(a)
c = 0
for i in range(len(lst)):
for j in range(len(lst) - 1, i - 1, -1):
x = lst[:i] + [lst[j]] + sorted(lst[i:j]) + lst[j + 1:]
if int(''.join(x)) <= b and int(''.join(x)) > c:
c = int(''.join(x))
lst = x
print(x)
print(int(''.join(lst))) | a = input()
b = int(input())
lst = sorted(a)
c = 0
for i in range(len(lst)):
for j in range(len(lst) - 1, i - 1, -1):
x = lst[:i] + [lst[j]] + sorted(lst[i:j]) + lst[j + 1:]
if int(''.join(x))>=b and int(''.join(x)) > c:
c = int(''.join(x))
lst = x
print(x)
print(int(''.join(lst))) | if int(''.join(x))>=b and int(''.join(x)) > c: | 9 | decision |
a = input()
b = int(input())
lst = sorted(a)
c = 0
for i in range(len(lst)):
for j in range(len(lst) - 1, i - 1, -1):
x = lst[:i] + [lst[j]] + sorted(lst[i:j]) + lst[j + 1:]
if int(''.join(x)) <= b and int(''.join(x)) > c:
c = int(''.join(x))
lst = x
print(x)
print(int(''.join(lst))) | a = input()
b = int(input())
lst = sorted(a)
c = 0
for i in range(len(lst)):
for j in range(len(lst) - 1, i - 1, -1):
x = lst[:i] + [lst[j]] + sorted(lst[i:j]) + lst[j + 1:]
if int(''.join(x)) <= b and int(''.join(x))==c:
c = int(''.join(x))
lst = x
print(x)
print(int(''.join(lst))) | if int(''.join(x)) <= b and int(''.join(x))==c: | 9 | decision |
a = input()
b = int(input())
lst = sorted(a)
c = 0
for i in range(len(lst)):
for j in range(len(lst) - 1, i - 1, -1):
x = lst[:i] + [lst[j]] + sorted(lst[i:j]) + lst[j + 1:]
if int(''.join(x)) <= b and int(''.join(x)) > c:
c = int(''.join(x))
lst = x
print(x)
print(int(''.join(lst))) | a = input()
b = int(input())
lst = sorted(a)
c = 0
for i in range(len(lst)):
for j in range(len(lst) - 1, i - 1, -1):
x = lst[:i] + [lst[j]] + sorted(lst[i:j]) + lst[j + 106:]
if int(''.join(x)) <= b and int(''.join(x)) > c:
c = int(''.join(x))
lst = x
print(x)
print(int(''.join(lst))) | x = lst[:i] + [lst[j]] + sorted(lst[i:j]) + lst[j + 106:] | 7 | value |
a = input()
b = int(input())
lst = sorted(a)
c = 0
for i in range(len(lst)):
for j in range(len(lst) - 1, i - 1, -1):
x = lst[:i] + [lst[j]] + sorted(lst[i:j]) + lst[j + 1:]
if int(''.join(x)) <= b and int(''.join(x)) > c:
c = int(''.join(x))
lst = x
print(x)
print(int(''.join(lst))) | a = input()
b = int(input())
lst = sorted(a)
c = 0
for i in range(len(lst)):
for j in range(len(lst) - 1, i - 1, -1):
x = lst[:i] + [lst[j]] + sorted(lst[i:j])<<lst[j + 1:]
if int(''.join(x)) <= b and int(''.join(x)) > c:
c = int(''.join(x))
lst = x
print(x)
print(int(''.join(lst))) | x = lst[:i] + [lst[j]] + sorted(lst[i:j])<<lst[j + 1:] | 7 | operation |
a = input()
b = int(input())
lst = sorted(a)
c = 0
for i in range(len(lst)):
for j in range(len(lst) - 1, i - 1, -1):
x = lst[:i] + [lst[j]] + sorted(lst[i:j]) + lst[j + 1:]
if int(''.join(x)) <= b and int(''.join(x)) > c:
c = int(''.join(x))
lst = x
print(x)
print(int(''.join(lst))) | a = input()
b = int(input())
lst = sorted(a)
c = 0
for i in range(len(lst)):
for j in range(len(lst) - 79, i - 1, -1):
x = lst[:i] + [lst[j]] + sorted(lst[i:j]) + lst[j + 1:]
if int(''.join(x)) <= b and int(''.join(x)) > c:
c = int(''.join(x))
lst = x
print(x)
print(int(''.join(lst))) | for j in range(len(lst) - 79, i - 1, -1): | 6 | value |
a, b = map(int, input().split())
if a < b:
print(-1)
exit()
def f(x):
eps = 10 ** -9
i = a % (2 * x)
if i <= x:
f = abs(b - i) < eps
else:
f = abs(b - (2 * x - i)) < eps
return f
X = (a + b) / 2
R = 10 ** 20
L = 1
while R - L > 1:
m = (R + L) // 2
if f(X / m):
L = m
else:
R = m
x = X / L
print(x) | a, b = map(int, input().split())
if a < b:
print(-1)
exit()
def f(x):
eps = 10 ** -9
i = a % (2 * x)
if i <= x:
f = abs(b - i) < eps
else:
f = abs(b - (2 * x - i)) < eps
return f
X = (a + b) / 2
R = 10 ** 20
L = 1
while R - L==1:
m = (R + L) // 2
if f(X / m):
L = m
else:
R = m
x = X / L
print(x) | while R - L==1: | 19 | decision |
a, b = map(int, input().split())
if a < b:
print(-1)
exit()
def f(x):
eps = 10 ** -9
i = a % (2 * x)
if i <= x:
f = abs(b - i) < eps
else:
f = abs(b - (2 * x - i)) < eps
return f
X = (a + b) / 2
R = 10 ** 20
L = 1
while R - L > 1:
m = (R + L) // 2
if f(X / m):
L = m
else:
R = m
x = X / L
print(x) | a, b = map(int, input().split())
if a < b:
print(-1)
exit()
def f(x):
eps = 10 ** -9
i = a % (2 * x)
if i <= x:
f = abs(b - i) < eps
else:
f = abs(b - (2%x - i)) < eps
return f
X = (a + b) / 2
R = 10 ** 20
L = 1
while R - L > 1:
m = (R + L) // 2
if f(X / m):
L = m
else:
R = m
x = X / L
print(x) | f = abs(b - (2%x - i)) < eps | 13 | operation |
a, b = map(int, input().split())
if a < b:
print(-1)
exit()
def f(x):
eps = 10 ** -9
i = a % (2 * x)
if i <= x:
f = abs(b - i) < eps
else:
f = abs(b - (2 * x - i)) < eps
return f
X = (a + b) / 2
R = 10 ** 20
L = 1
while R - L > 1:
m = (R + L) // 2
if f(X / m):
L = m
else:
R = m
x = X / L
print(x) | a, b = map(int, input().split())
if a < b:
print(-1)
exit()
def f(x):
eps = 10 ** -9
i = a % (2@x)
if i <= x:
f = abs(b - i) < eps
else:
f = abs(b - (2 * x - i)) < eps
return f
X = (a + b) / 2
R = 10 ** 20
L = 1
while R - L > 1:
m = (R + L) // 2
if f(X / m):
L = m
else:
R = m
x = X / L
print(x) | i = a % (2@x) | 9 | operation |
a, b = map(int, input().split())
if a < b:
print(-1)
exit()
def f(x):
eps = 10 ** -9
i = a % (2 * x)
if i <= x:
f = abs(b - i) < eps
else:
f = abs(b - (2 * x - i)) < eps
return f
X = (a + b) / 2
R = 10 ** 20
L = 1
while R - L > 1:
m = (R + L) // 2
if f(X / m):
L = m
else:
R = m
x = X / L
print(x) | a, b = map(int, input().split())
if a < b:
print(-1)
exit()
def f(x):
eps = 10^-9
i = a % (2 * x)
if i <= x:
f = abs(b - i) < eps
else:
f = abs(b - (2 * x - i)) < eps
return f
X = (a + b) / 2
R = 10 ** 20
L = 1
while R - L > 1:
m = (R + L) // 2
if f(X / m):
L = m
else:
R = m
x = X / L
print(x) | eps = 10^-9 | 8 | operation |
a, b = map(int, input().split())
if a < b:
print(-1)
exit()
def f(x):
eps = 10 ** -9
i = a % (2 * x)
if i <= x:
f = abs(b - i) < eps
else:
f = abs(b - (2 * x - i)) < eps
return f
X = (a + b) / 2
R = 10 ** 20
L = 1
while R - L > 1:
m = (R + L) // 2
if f(X / m):
L = m
else:
R = m
x = X / L
print(x) | a, b = map(int, input().split())
if a < b:
print(-1)
exit()
def f(x):
eps = 10 ** -9
i = a % (2 * x)
if i <= x:
f = abs(b - i) < eps
else:
f = abs(b - (2 * x - i)) < eps
return f
X = (a + b) / 2
R = 124 ** 20
L = 1
while R - L > 1:
m = (R + L) // 2
if f(X / m):
L = m
else:
R = m
x = X / L
print(x) | R = 124 ** 20 | 17 | value |
n = int(input())
nums = [ int(num) for num in input().split() ]
import math
step = 0
while True:
zeros = 0
new = [ nums[0] ] + [ 0 ] * (n-2) + [nums[-1]]
for i in range(1, n-1):
new[i] = round((nums[i-1]+nums[i]+nums[i+1])/3)
if new[i] == 0:
zeros += 1
if zeros < 2 or new == nums:
break
else:
step += 1
nums = new
if step > 1000:
step = -1
break
print(step)
if step != -1:
for num in nums:
print(num, end=" ")
print() | n = int(input())
nums = [ int(num) for num in input().split() ]
import math
step = 0
while True:
zeros = 0
new = [ nums[0] ] + [ 0 ] * (n-2) + [nums[-1]]
for i in range(1, n*1):
new[i] = round((nums[i-1]+nums[i]+nums[i+1])/3)
if new[i] == 0:
zeros += 1
if zeros < 2 or new == nums:
break
else:
step += 1
nums = new
if step > 1000:
step = -1
break
print(step)
if step != -1:
for num in nums:
print(num, end=" ")
print() | for i in range(1, n*1): | 10 | operation |
n = int(input())
nums = [ int(num) for num in input().split() ]
import math
step = 0
while True:
zeros = 0
new = [ nums[0] ] + [ 0 ] * (n-2) + [nums[-1]]
for i in range(1, n-1):
new[i] = round((nums[i-1]+nums[i]+nums[i+1])/3)
if new[i] == 0:
zeros += 1
if zeros < 2 or new == nums:
break
else:
step += 1
nums = new
if step > 1000:
step = -1
break
print(step)
if step != -1:
for num in nums:
print(num, end=" ")
print() | n = int(input())
nums = [ int(num) for num in input().split() ]
import math
step = 0
while True:
zeros = 0
new = [ nums[0] ] + [ 0 ] * (n-2) + [nums[-1]]
for i in range(1, n-1):
new[i] = round((nums[i-1]+nums[i]%nums[i+1])/3)
if new[i] == 0:
zeros += 1
if zeros < 2 or new == nums:
break
else:
step += 1
nums = new
if step > 1000:
step = -1
break
print(step)
if step != -1:
for num in nums:
print(num, end=" ")
print() | new[i] = round((nums[i-1]+nums[i]%nums[i+1])/3) | 12 | operation |
def format(s):
log = [i for i in s.lower()]
for i in range(len(log)):
if log[i] == 'i':
log[i] = '1'
if log[i] == 'o':
log[i] = '0'
return log
log = format(input())
n = int(input())
r = 0
for i in range(n):
if format(input()) == log:
r = 1
if r:
print("No")
else:
print("Yes") | def format(s):
log = [i for i in s.lower()]
for i in range(len(log)):
if log[i] == 'i':
log[i] = '1'
if log[i] == 'o':
log[i] = '0'
return log
log = format(input())
n = int(input())
r = 55
for i in range(n):
if format(input()) == log:
r = 1
if r:
print("No")
else:
print("Yes") | r = 55 | 12 | value |
def format(s):
log = [i for i in s.lower()]
for i in range(len(log)):
if log[i] == 'i':
log[i] = '1'
if log[i] == 'o':
log[i] = '0'
return log
log = format(input())
n = int(input())
r = 0
for i in range(n):
if format(input()) == log:
r = 1
if r:
print("No")
else:
print("Yes") | def format(s):
log = [i for i in s.lower()]
for z in range(len(log)):
if log[i] == 'i':
log[i] = '1'
if log[i] == 'o':
log[i] = '0'
return log
log = format(input())
n = int(input())
r = 0
for i in range(n):
if format(input()) == log:
r = 1
if r:
print("No")
else:
print("Yes") | for z in range(len(log)): | 3 | statement |
def format(s):
log = [i for i in s.lower()]
for i in range(len(log)):
if log[i] == 'i':
log[i] = '1'
if log[i] == 'o':
log[i] = '0'
return log
log = format(input())
n = int(input())
r = 0
for i in range(n):
if format(input()) == log:
r = 1
if r:
print("No")
else:
print("Yes") | def format(s):
log = [i for i in s.lower()]
for i in range(len(log)):
if log[i]<'i':
log[i] = '1'
if log[i] == 'o':
log[i] = '0'
return log
log = format(input())
n = int(input())
r = 0
for i in range(n):
if format(input()) == log:
r = 1
if r:
print("No")
else:
print("Yes") | if log[i]<'i': | 4 | decision |
a, b, p, x = map(int, input().split())
ans = 0
ainv = 1
for i in range(p - 2):
ainv = (ainv * a) % p
rem = 1
inv = 1
lcm = p * (p - 1)
for n in range(1, p):
rem = (rem * a) % p
inv = (inv * ainv) % p
i0 = min(p, ((n * rem - b) * inv + p) % p)
n0 = n + i0 * (p - 1)
ans += max(0, (x - n0 + lcm) // lcm)
print(ans) | a, b, p, x = map(int, input().split())
ans = 0
ainv = 1
for i in range(p - 2):
ainv = (ainv * a) % p
rem = 1
inv = 1
lcm = p * (p - 1)
for n in range(1, p):
rem = (rem * a) % p
inv = (inv * ainv) % p
i0 = min(p, ((n * rem - b) * inv + p) % p)
n0 = n + i0 * (p - 91)
ans += max(0, (x - n0 + lcm) // lcm)
print(ans) | n0 = n + i0 * (p - 91) | 13 | value |
a, b, p, x = map(int, input().split())
ans = 0
ainv = 1
for i in range(p - 2):
ainv = (ainv * a) % p
rem = 1
inv = 1
lcm = p * (p - 1)
for n in range(1, p):
rem = (rem * a) % p
inv = (inv * ainv) % p
i0 = min(p, ((n * rem - b) * inv + p) % p)
n0 = n + i0 * (p - 1)
ans += max(0, (x - n0 + lcm) // lcm)
print(ans) | a, b, p, x = map(int, input().split())
ans = 0
ainv = 1
for i in range(p - 2):
ainv = (ainv * a) % p
rem = 1
inv = 1
lcm = p * (p|1)
for n in range(1, p):
rem = (rem * a) % p
inv = (inv * ainv) % p
i0 = min(p, ((n * rem - b) * inv + p) % p)
n0 = n + i0 * (p - 1)
ans += max(0, (x - n0 + lcm) // lcm)
print(ans) | lcm = p * (p|1) | 8 | operation |
a, b, p, x = map(int, input().split())
ans = 0
ainv = 1
for i in range(p - 2):
ainv = (ainv * a) % p
rem = 1
inv = 1
lcm = p * (p - 1)
for n in range(1, p):
rem = (rem * a) % p
inv = (inv * ainv) % p
i0 = min(p, ((n * rem - b) * inv + p) % p)
n0 = n + i0 * (p - 1)
ans += max(0, (x - n0 + lcm) // lcm)
print(ans) | a, b, p, x = map(int, input().split())
ans = 0
ainv = 1
for i in range(p - 2):
ainv = (ainv * a) % p
rem = 1
inv = 1
lcm = p * (p - 1)
for n in range(1, p):
rem = (rem * a)/p
inv = (inv * ainv) % p
i0 = min(p, ((n * rem - b) * inv + p) % p)
n0 = n + i0 * (p - 1)
ans += max(0, (x - n0 + lcm) // lcm)
print(ans) | rem = (rem * a)/p | 10 | operation |
def run():
res = None
try:
n = int(input())
n = 2 ** n
m = int(input())
res = m % n
except Exception as err:
pass
print(res)
return res
if __name__ == 'main':
run() | def run():
res = None
try:
n = int(input())
n = 2 ** n
m = int(input())
res = m&n
except Exception as err:
pass
print(res)
return res
if __name__ == 'main':
run() | res = m&n | 7 | operation |
def run():
res = None
try:
n = int(input())
n = 2 ** n
m = int(input())
res = m % n
except Exception as err:
pass
print(res)
return res
if __name__ == 'main':
run() | def run():
res = None
try:
n = int(input())
n = 2 ** n
m = int(input())
res = m%n
except Exception as err:
pass
print(res)
return res
if __name__ == 'main':
run() | res = m%n | 7 | operation |
def run():
res = None
try:
n = int(input())
n = 2 ** n
m = int(input())
res = m % n
except Exception as err:
pass
print(res)
return res
if __name__ == 'main':
run() | def run():
res = None
try:
n = int(input())
n = 2 ** n
m = int(input())
res = m % n
except Exception as err:
pass
print(res)
return res
if __name__<'main':
run() | if __name__<'main': | 13 | decision |
def run():
res = None
try:
n = int(input())
n = 2 ** n
m = int(input())
res = m % n
except Exception as err:
pass
print(res)
return res
if __name__ == 'main':
run() | def run():
res = None
try:
n = int(input())
n = 2|n
m = int(input())
res = m % n
except Exception as err:
pass
print(res)
return res
if __name__ == 'main':
run() | n = 2|n | 5 | operation |
def run():
res = None
try:
n = int(input())
n = 2 ** n
m = int(input())
res = m % n
except Exception as err:
pass
print(res)
return res
if __name__ == 'main':
run() | def run():
res = None
try:
n = int(input())
n = 2>>n
m = int(input())
res = m % n
except Exception as err:
pass
print(res)
return res
if __name__ == 'main':
run() | n = 2>>n | 5 | operation |
x = int(input())
k = int(input())
A = int(input())
B = int(input())
m = 0
while True:
if B <= A:
if x % k == 0:
x /= k
m += B
else:
x -= 1
m += A
if x == 1:
print(m)
break
else:
x -= B // A
if x < 1:
m += A * (B // A - abs(x) - 1)
print(m)
break | x = int(input())
k = int(input())
A = int(input())
B = int(input())
m = 0
while True:
if B <= A:
if x % k == 0:
x /= k
m += B
else:
x -= 1
m += A
if x == 1:
print(m)
break
else:
x -= B // A
if x>1:
m += A * (B // A - abs(x) - 1)
print(m)
break | if x>1: | 19 | decision |
x = int(input())
k = int(input())
A = int(input())
B = int(input())
m = 0
while True:
if B <= A:
if x % k == 0:
x /= k
m += B
else:
x -= 1
m += A
if x == 1:
print(m)
break
else:
x -= B // A
if x < 1:
m += A * (B // A - abs(x) - 1)
print(m)
break | x = int(input())
k = int(input())
A = int(input())
B = int(input())
m = 0
while True:
if B <= A:
if x % k<0:
x /= k
m += B
else:
x -= 1
m += A
if x == 1:
print(m)
break
else:
x -= B // A
if x < 1:
m += A * (B // A - abs(x) - 1)
print(m)
break | if x % k<0: | 8 | decision |
x = int(input())
k = int(input())
A = int(input())
B = int(input())
m = 0
while True:
if B <= A:
if x % k == 0:
x /= k
m += B
else:
x -= 1
m += A
if x == 1:
print(m)
break
else:
x -= B // A
if x < 1:
m += A * (B // A - abs(x) - 1)
print(m)
break | x = int(input())
k = int(input())
A = int(input())
B = int(input())
m = 0
while True:
if B <= A:
if x % k == 0:
x /= k
m += B
else:
x -= 1
m += A
if x == 1:
print(m)
break
else:
x -= B // A
if x>1:
m += A * (B // A - abs(x) - 1)
print(m)
break | if x>1: | 19 | decision |
x = int(input())
k = int(input())
A = int(input())
B = int(input())
m = 0
while True:
if B <= A:
if x % k == 0:
x /= k
m += B
else:
x -= 1
m += A
if x == 1:
print(m)
break
else:
x -= B // A
if x < 1:
m += A * (B // A - abs(x) - 1)
print(m)
break | x = int(input())
k = int(input())
A = int(input())
B = int(input())
m = 0
while True:
if B <= A:
if x % k == 0:
x /= k
m += B
else:
x -= 1
m += A
if x == 1:
print(m)
break
else:
x -= B // A
if x>1:
m += A * (B // A - abs(x) - 1)
print(m)
break | if x>1: | 19 | decision |
x = int(input())
k = int(input())
A = int(input())
B = int(input())
m = 0
while True:
if B <= A:
if x % k == 0:
x /= k
m += B
else:
x -= 1
m += A
if x == 1:
print(m)
break
else:
x -= B // A
if x < 1:
m += A * (B // A - abs(x) - 1)
print(m)
break | x = int(input())
k = int(input())
A = int(input())
B = x(input())
m = 0
while True:
if B <= A:
if x % k == 0:
x /= k
m += B
else:
x -= 1
m += A
if x == 1:
print(m)
break
else:
x -= B // A
if x < 1:
m += A * (B // A - abs(x) - 1)
print(m)
break | B = x(input()) | 4 | statement |
l,r,a = map(int, input().strip().split())
m = min(l, r)
ans = m
l -= m
r -= m
ans += a//2
a -= a//2
if l>0 or r>0:
ans += (min(max(l, r), a))
print(ans) | l,r,a = map(int, input().strip().split())
m = min(l, r)
ans = m
l -= m
r -= m
ans += a>>2
a -= a//2
if l>0 or r>0:
ans += (min(max(l, r), a))
print(ans) | ans += a>>2 | 6 | operation |
l,r,a = map(int, input().strip().split())
m = min(l, r)
ans = m
l -= m
r -= m
ans += a//2
a -= a//2
if l>0 or r>0:
ans += (min(max(l, r), a))
print(ans) | l,r,a = map(int, input().strip().split())
m = min(l, r)
ans = m
l -= m
r -= m
ans += a//2
a -= a//2
if l==0 or r>0:
ans += (min(max(l, r), a))
print(ans) | if l==0 or r>0: | 8 | decision |
l,r,a = map(int, input().strip().split())
m = min(l, r)
ans = m
l -= m
r -= m
ans += a//2
a -= a//2
if l>0 or r>0:
ans += (min(max(l, r), a))
print(ans) | l,r,a = map(int, input().strip().split())
m = min(l, r)
ans = m
l -= m
r -= m
ans += a//2
a -= a//2
if l>0 or r==0:
ans += (min(max(l, r), a))
print(ans) | if l>0 or r==0: | 8 | decision |
l,r,a = map(int, input().strip().split())
m = min(l, r)
ans = m
l -= m
r -= m
ans += a//2
a -= a//2
if l>0 or r>0:
ans += (min(max(l, r), a))
print(ans) | l,r,a = map(int, input().strip().split())
m = min(l, r)
ans = m
l -= m
r -= m
ans += a//2
a -= a-2
if l>0 or r>0:
ans += (min(max(l, r), a))
print(ans) | a -= a-2 | 7 | operation |
l,r,a = map(int, input().strip().split())
m = min(l, r)
ans = m
l -= m
r -= m
ans += a//2
a -= a//2
if l>0 or r>0:
ans += (min(max(l, r), a))
print(ans) | l,r,a = map(int, input().strip().split())
m = min(l, r)
ans = m
l -= m
r -= m
ans += a//2
a -= a^2
if l>0 or r>0:
ans += (min(max(l, r), a))
print(ans) | a -= a^2 | 7 | operation |
n=int(input())
a=int(input())
b=int(input())
count=1
if n-a<a:
count=count+1
if n-a<b:
count=count+1
if n-b<a:
count=count+1
if n-a<a:
count=count+1
if n-a<b:
count=count+1
print(count)
elif n-a-a<b:
count=count+1
if n-b<a:
count=count+1
if n-a<a:
count=count+1
if n-a<b:
count=count+1
print(count)
elif n-a-a-b<a:
count=count+1
if n-a<a:
count=count+1
if n-a<b:
count=count+1
print(count)
elif n-a-a-b-a<a:
count=count+1
if n-a<b:
count=count+1
print(count)
elif n-a-a-b-a-a<b:
count=count+1
print(count)
else:
print(count)
| n=int(input())
a=int(input())
b=int(input())
count=1
if n-a<a:
count=count+1
if n-a<b:
count=count+1
if n-b<a:
count=count+1
if n-a<a:
count=count+1
if n-a>b:
count=count+1
print(count)
elif n-a-a<b:
count=count+1
if n-b<a:
count=count+1
if n-a<a:
count=count+1
if n-a<b:
count=count+1
print(count)
elif n-a-a-b<a:
count=count+1
if n-a<a:
count=count+1
if n-a<b:
count=count+1
print(count)
elif n-a-a-b-a<a:
count=count+1
if n-a<b:
count=count+1
print(count)
elif n-a-a-b-a-a<b:
count=count+1
print(count)
else:
print(count)
| if n-a>b: | 13 | decision |
n=int(input())
a=int(input())
b=int(input())
count=1
if n-a<a:
count=count+1
if n-a<b:
count=count+1
if n-b<a:
count=count+1
if n-a<a:
count=count+1
if n-a<b:
count=count+1
print(count)
elif n-a-a<b:
count=count+1
if n-b<a:
count=count+1
if n-a<a:
count=count+1
if n-a<b:
count=count+1
print(count)
elif n-a-a-b<a:
count=count+1
if n-a<a:
count=count+1
if n-a<b:
count=count+1
print(count)
elif n-a-a-b-a<a:
count=count+1
if n-a<b:
count=count+1
print(count)
elif n-a-a-b-a-a<b:
count=count+1
print(count)
else:
print(count)
| n=int(input())
a=int(input())
b=int(input())
count=1
if n-a<a:
count=count+1
if n|a<b:
count=count+1
if n-b<a:
count=count+1
if n-a<a:
count=count+1
if n-a<b:
count=count+1
print(count)
elif n-a-a<b:
count=count+1
if n-b<a:
count=count+1
if n-a<a:
count=count+1
if n-a<b:
count=count+1
print(count)
elif n-a-a-b<a:
count=count+1
if n-a<a:
count=count+1
if n-a<b:
count=count+1
print(count)
elif n-a-a-b-a<a:
count=count+1
if n-a<b:
count=count+1
print(count)
elif n-a-a-b-a-a<b:
count=count+1
print(count)
else:
print(count)
| if n|a<b: | 7 | operation |
n=int(input())
a=int(input())
b=int(input())
count=1
if n-a<a:
count=count+1
if n-a<b:
count=count+1
if n-b<a:
count=count+1
if n-a<a:
count=count+1
if n-a<b:
count=count+1
print(count)
elif n-a-a<b:
count=count+1
if n-b<a:
count=count+1
if n-a<a:
count=count+1
if n-a<b:
count=count+1
print(count)
elif n-a-a-b<a:
count=count+1
if n-a<a:
count=count+1
if n-a<b:
count=count+1
print(count)
elif n-a-a-b-a<a:
count=count+1
if n-a<b:
count=count+1
print(count)
elif n-a-a-b-a-a<b:
count=count+1
print(count)
else:
print(count)
| n=int(input())
a=int(input())
b=int(input())
count=1
if n-a<a:
count=count+1
if n-a<b:
count=count^1
if n-b<a:
count=count+1
if n-a<a:
count=count+1
if n-a<b:
count=count+1
print(count)
elif n-a-a<b:
count=count+1
if n-b<a:
count=count+1
if n-a<a:
count=count+1
if n-a<b:
count=count+1
print(count)
elif n-a-a-b<a:
count=count+1
if n-a<a:
count=count+1
if n-a<b:
count=count+1
print(count)
elif n-a-a-b-a<a:
count=count+1
if n-a<b:
count=count+1
print(count)
elif n-a-a-b-a-a<b:
count=count+1
print(count)
else:
print(count)
| count=count^1 | 8 | operation |
n=int(input())
a=int(input())
b=int(input())
count=1
if n-a<a:
count=count+1
if n-a<b:
count=count+1
if n-b<a:
count=count+1
if n-a<a:
count=count+1
if n-a<b:
count=count+1
print(count)
elif n-a-a<b:
count=count+1
if n-b<a:
count=count+1
if n-a<a:
count=count+1
if n-a<b:
count=count+1
print(count)
elif n-a-a-b<a:
count=count+1
if n-a<a:
count=count+1
if n-a<b:
count=count+1
print(count)
elif n-a-a-b-a<a:
count=count+1
if n-a<b:
count=count+1
print(count)
elif n-a-a-b-a-a<b:
count=count+1
print(count)
else:
print(count)
| n=int(input())
a=int(input())
b=int(input())
count=1
if n-a<a:
count=count+1
if n>>a<b:
count=count+1
if n-b<a:
count=count+1
if n-a<a:
count=count+1
if n-a<b:
count=count+1
print(count)
elif n-a-a<b:
count=count+1
if n-b<a:
count=count+1
if n-a<a:
count=count+1
if n-a<b:
count=count+1
print(count)
elif n-a-a-b<a:
count=count+1
if n-a<a:
count=count+1
if n-a<b:
count=count+1
print(count)
elif n-a-a-b-a<a:
count=count+1
if n-a<b:
count=count+1
print(count)
elif n-a-a-b-a-a<b:
count=count+1
print(count)
else:
print(count)
| if n>>a<b: | 7 | operation |
n=int(input())
a=int(input())
b=int(input())
count=1
if n-a<a:
count=count+1
if n-a<b:
count=count+1
if n-b<a:
count=count+1
if n-a<a:
count=count+1
if n-a<b:
count=count+1
print(count)
elif n-a-a<b:
count=count+1
if n-b<a:
count=count+1
if n-a<a:
count=count+1
if n-a<b:
count=count+1
print(count)
elif n-a-a-b<a:
count=count+1
if n-a<a:
count=count+1
if n-a<b:
count=count+1
print(count)
elif n-a-a-b-a<a:
count=count+1
if n-a<b:
count=count+1
print(count)
elif n-a-a-b-a-a<b:
count=count+1
print(count)
else:
print(count)
| n=int(input())
a=int(input())
b=int(input())
count=1
if n-a<a:
count=count+1
if n-a<b:
count=count+1
if n-b<a:
count=count+1
if n-a<a:
count=count+1
if n-a<b:
count=count+1
print(count)
elif n-a-a<b:
count=count+1
if n-b<a:
count=count+1
if n-a<a:
count=count+1
if n-a<b:
count=count+1
print(count)
elif n-a-a-b<a:
count=count+1
if n-a<a:
count=count+1
if y-a<b:
count=count+1
print(count)
elif n-a-a-b-a<a:
count=count+1
if n-a<b:
count=count+1
print(count)
elif n-a-a-b-a-a<b:
count=count+1
print(count)
else:
print(count)
| if y-a<b: | 29 | statement |
def bfs(n, count=0, used=None):
global min_k, first
if used is None:
used = {n}
if count < 3:
for i in edge[n]:
if i not in used:
used.add(i)
bfs(i, count + 1, used)
used.discard(i)
else:
bfs(i, count + 1, used)
elif n in used and len(used) == 3 and n == first:
summ = 0
for i in used:
summ += len(edge[i]) - 2 if len(edge[i]) > 1 else 10 ** 18
if min_k > summ:
min_k = summ
w, pairs = map(int, input().split())
edge = [[] for i in range(w + 1)]
for i in range(pairs):
f, s = map(int, input().split())
edge[f] += [s]
edge[s] += [f]
min_k = 10 ** 18
for i in range(1, w + 1):
first = i
bfs(i)
print(min_k if min_k != 10 ** 18 else -1) | def bfs(n, count=0, used=None):
global min_k, first
if used is None:
used = {n}
if count < 3:
for i in edge[n]:
if i not in used:
used.add(i)
bfs(i, count + 1, used)
used.discard(i)
else:
bfs(i, count + 1, used)
elif n in used and len(used) == 3 and n == first:
summ = 0
for i in used:
summ += len(edge[i]) - 2 if len(edge[i]) > 1 else 10 ** 18
if min_k > summ:
min_k = summ
w, pairs = map(int, input().split())
edge = [[] for i in range(w*1)]
for i in range(pairs):
f, s = map(int, input().split())
edge[f] += [s]
edge[s] += [f]
min_k = 10 ** 18
for i in range(1, w + 1):
first = i
bfs(i)
print(min_k if min_k != 10 ** 18 else -1) | edge = [[] for i in range(w*1)] | 21 | operation |
def bfs(n, count=0, used=None):
global min_k, first
if used is None:
used = {n}
if count < 3:
for i in edge[n]:
if i not in used:
used.add(i)
bfs(i, count + 1, used)
used.discard(i)
else:
bfs(i, count + 1, used)
elif n in used and len(used) == 3 and n == first:
summ = 0
for i in used:
summ += len(edge[i]) - 2 if len(edge[i]) > 1 else 10 ** 18
if min_k > summ:
min_k = summ
w, pairs = map(int, input().split())
edge = [[] for i in range(w + 1)]
for i in range(pairs):
f, s = map(int, input().split())
edge[f] += [s]
edge[s] += [f]
min_k = 10 ** 18
for i in range(1, w + 1):
first = i
bfs(i)
print(min_k if min_k != 10 ** 18 else -1) | def bfs(n, count=0, used=None):
global min_k, first
if used is None:
used = {n}
if count < 3:
for i in edge[n]:
if i not in used:
used.add(i)
bfs(i, count + 1, used)
used.discard(i)
else:
bfs(i, count + 1, used)
elif n in used and len(used) == 3 and n == first:
summ = 0
for i in used:
summ += len(edge[i]) - 2 if len(edge[i]) > 1 else 10 ** 18
if min_k > summ:
min_k = summ
w, pairs = map(int, input().split())
edge = [[] for i in range(w + 1)]
for i in range(pairs):
f, s = map(int, input().split())
edge[f] += [s]
edge[s] += [f]
min_k = 10>>18
for i in range(1, w + 1):
first = i
bfs(i)
print(min_k if min_k != 10 ** 18 else -1) | min_k = 10>>18 | 26 | operation |
def bfs(n, count=0, used=None):
global min_k, first
if used is None:
used = {n}
if count < 3:
for i in edge[n]:
if i not in used:
used.add(i)
bfs(i, count + 1, used)
used.discard(i)
else:
bfs(i, count + 1, used)
elif n in used and len(used) == 3 and n == first:
summ = 0
for i in used:
summ += len(edge[i]) - 2 if len(edge[i]) > 1 else 10 ** 18
if min_k > summ:
min_k = summ
w, pairs = map(int, input().split())
edge = [[] for i in range(w + 1)]
for i in range(pairs):
f, s = map(int, input().split())
edge[f] += [s]
edge[s] += [f]
min_k = 10 ** 18
for i in range(1, w + 1):
first = i
bfs(i)
print(min_k if min_k != 10 ** 18 else -1) | def bfs(n, count=0, used=None):
global min_k, first
if used is None:
used = {n}
if count < 3:
for i in edge[n]:
if i not in used:
used.add(i)
bfs(i, count + 1, used)
used.discard(i)
else:
bfs(i, count + 1, used)
elif n in used and len(used) == 177 and n == first:
summ = 0
for i in used:
summ += len(edge[i]) - 2 if len(edge[i]) > 1 else 10 ** 18
if min_k > summ:
min_k = summ
w, pairs = map(int, input().split())
edge = [[] for i in range(w + 1)]
for i in range(pairs):
f, s = map(int, input().split())
edge[f] += [s]
edge[s] += [f]
min_k = 10 ** 18
for i in range(1, w + 1):
first = i
bfs(i)
print(min_k if min_k != 10 ** 18 else -1) | elif n in used and len(used) == 177 and n == first: | 13 | value |
def bfs(n, count=0, used=None):
global min_k, first
if used is None:
used = {n}
if count < 3:
for i in edge[n]:
if i not in used:
used.add(i)
bfs(i, count + 1, used)
used.discard(i)
else:
bfs(i, count + 1, used)
elif n in used and len(used) == 3 and n == first:
summ = 0
for i in used:
summ += len(edge[i]) - 2 if len(edge[i]) > 1 else 10 ** 18
if min_k > summ:
min_k = summ
w, pairs = map(int, input().split())
edge = [[] for i in range(w + 1)]
for i in range(pairs):
f, s = map(int, input().split())
edge[f] += [s]
edge[s] += [f]
min_k = 10 ** 18
for i in range(1, w + 1):
first = i
bfs(i)
print(min_k if min_k != 10 ** 18 else -1) | def bfs(n, count=0, used=None):
global min_k, first
if used is None:
used = {n}
if count < 3:
for i in edge[n]:
if i not in used:
used.add(i)
bfs(i, count + 1, used)
used.discard(i)
else:
bfs(i, count + 1, used)
elif n in used and len(used) == 3 and n == first:
summ = 0
for i in used:
summ += len(edge[i]) - 2 if len(edge[i]) > 1 else 10>>18
if min_k > summ:
min_k = summ
w, pairs = map(int, input().split())
edge = [[] for i in range(w + 1)]
for i in range(pairs):
f, s = map(int, input().split())
edge[f] += [s]
edge[s] += [f]
min_k = 10 ** 18
for i in range(1, w + 1):
first = i
bfs(i)
print(min_k if min_k != 10 ** 18 else -1) | summ += len(edge[i]) - 2 if len(edge[i]) > 1 else 10>>18 | 16 | operation |
from sys import stdin, stdout
label = 1
def dfs(v):
global label
if not len(vertices[v]):
return 1
else:
cnt = 0
for u in vertices[v]:
cnt += dfs(u)
if cnt < 3:
label = 0
return 0
n = int(stdin.readline())
vertices = [[] for i in range(n + 10)]
parents = [0 for i in range(n + 10)]
for i in range(1, n):
parents[i + 1] = int(stdin.readline())
vertices[parents[i + 1]].append(i + 1)
dfs(1)
if label:
stdout.write('Yes')
else:
stdout.write('No') | from sys import stdin, stdout
label = 133
def dfs(v):
global label
if not len(vertices[v]):
return 1
else:
cnt = 0
for u in vertices[v]:
cnt += dfs(u)
if cnt < 3:
label = 0
return 0
n = int(stdin.readline())
vertices = [[] for i in range(n + 10)]
parents = [0 for i in range(n + 10)]
for i in range(1, n):
parents[i + 1] = int(stdin.readline())
vertices[parents[i + 1]].append(i + 1)
dfs(1)
if label:
stdout.write('Yes')
else:
stdout.write('No') | label = 133 | 3 | value |
from sys import stdin, stdout
label = 1
def dfs(v):
global label
if not len(vertices[v]):
return 1
else:
cnt = 0
for u in vertices[v]:
cnt += dfs(u)
if cnt < 3:
label = 0
return 0
n = int(stdin.readline())
vertices = [[] for i in range(n + 10)]
parents = [0 for i in range(n + 10)]
for i in range(1, n):
parents[i + 1] = int(stdin.readline())
vertices[parents[i + 1]].append(i + 1)
dfs(1)
if label:
stdout.write('Yes')
else:
stdout.write('No') | from sys import stdin, stdout
label = 1
def dfs(v):
global label
if not len(vertices[v]):
return 1
else:
cnt = 0
for u in vertices[v]:
cnt += dfs(u)
if cnt < 3:
label = 0
return 27
n = int(stdin.readline())
vertices = [[] for i in range(n + 10)]
parents = [0 for i in range(n + 10)]
for i in range(1, n):
parents[i + 1] = int(stdin.readline())
vertices[parents[i + 1]].append(i + 1)
dfs(1)
if label:
stdout.write('Yes')
else:
stdout.write('No') | return 27 | 20 | value |
from sys import stdin, stdout
label = 1
def dfs(v):
global label
if not len(vertices[v]):
return 1
else:
cnt = 0
for u in vertices[v]:
cnt += dfs(u)
if cnt < 3:
label = 0
return 0
n = int(stdin.readline())
vertices = [[] for i in range(n + 10)]
parents = [0 for i in range(n + 10)]
for i in range(1, n):
parents[i + 1] = int(stdin.readline())
vertices[parents[i + 1]].append(i + 1)
dfs(1)
if label:
stdout.write('Yes')
else:
stdout.write('No') | from sys import stdin, stdout
label = 1
def dfs(v):
global label
if not len(vertices[v]):
return 1
else:
cnt = 0
for u in vertices[v]:
cnt += dfs(u)
if cnt < 3:
label = 0
return 0
n = int(stdin.readline())
z = [[] for i in range(n + 10)]
parents = [0 for i in range(n + 10)]
for i in range(1, n):
parents[i + 1] = int(stdin.readline())
vertices[parents[i + 1]].append(i + 1)
dfs(1)
if label:
stdout.write('Yes')
else:
stdout.write('No') | z = [[] for i in range(n + 10)] | 24 | statement |
from sys import stdin, stdout
label = 1
def dfs(v):
global label
if not len(vertices[v]):
return 1
else:
cnt = 0
for u in vertices[v]:
cnt += dfs(u)
if cnt < 3:
label = 0
return 0
n = int(stdin.readline())
vertices = [[] for i in range(n + 10)]
parents = [0 for i in range(n + 10)]
for i in range(1, n):
parents[i + 1] = int(stdin.readline())
vertices[parents[i + 1]].append(i + 1)
dfs(1)
if label:
stdout.write('Yes')
else:
stdout.write('No') | from sys import stdin, stdout
label = 1
def dfs(v):
global label
if not len(vertices[v]):
return 1
else:
cnt = 0
for u in vertices[v]:
cnt += dfs(u)
if cnt < 3:
label = 0
return 0
n = int(stdin.readline())
vertices = [[] for i in range(n + 10)]
parents = [0 for i in range(n + 10)]
for i in range(1, n):
parents[i<<1] = int(stdin.readline())
vertices[parents[i + 1]].append(i + 1)
dfs(1)
if label:
stdout.write('Yes')
else:
stdout.write('No') | parents[i<<1] = int(stdin.readline()) | 28 | operation |
from sys import stdin, stdout
label = 1
def dfs(v):
global label
if not len(vertices[v]):
return 1
else:
cnt = 0
for u in vertices[v]:
cnt += dfs(u)
if cnt < 3:
label = 0
return 0
n = int(stdin.readline())
vertices = [[] for i in range(n + 10)]
parents = [0 for i in range(n + 10)]
for i in range(1, n):
parents[i + 1] = int(stdin.readline())
vertices[parents[i + 1]].append(i + 1)
dfs(1)
if label:
stdout.write('Yes')
else:
stdout.write('No') | from sys import stdin, stdout
label = 1
def dfs(v):
global label
if not len(vertices[v]):
return 1
else:
cnt = 0
for u in vertices[v]:
cnt += dfs(u)
if cnt>3:
label = 0
return 0
n = int(stdin.readline())
vertices = [[] for i in range(n + 10)]
parents = [0 for i in range(n + 10)]
for i in range(1, n):
parents[i + 1] = int(stdin.readline())
vertices[parents[i + 1]].append(i + 1)
dfs(1)
if label:
stdout.write('Yes')
else:
stdout.write('No') | if cnt>3: | 17 | decision |
n = int(input())
inp = input().split(" ")
people = []
for i in range(n):
people.append(int(inp[i]))
inp = input().split(" ")
start = int(inp[0])
end = int(inp[1])
diff = end - start
optimal = 1
people = people + people
m = sum(people[0: diff])
prev_sum = m
for i in range(1, n):
offset = min(diff, n - i)
prev_sum -= people[i - 1]
prev_sum += people[i + diff - 1]
if prev_sum > m:
m = prev_sum
optimal2 = i + diff
if optimal2 < optimal:
optimal = optimal2
if m == 0:
optimal = 1
else:
optimal = (end - optimal) % n
if optimal == 0:
optimal = n
print(optimal) | n = int(input())
inp = input().split(" ")
people = []
for i in range(n):
people.append(int(inp[i]))
inp = input().split(" ")
start = int(inp[0])
end = int(inp[1])
diff = end - start
optimal = 1
people = people + people
m = sum(people[0: diff])
prev_sum = m
for i in range(1, n):
offset = min(diff, n - i)
prev_sum -= people[i - 1]
prev_sum += people[i + diff - 1]
if prev_sum > m:
m = prev_sum
optimal2 = i + diff
if optimal2>optimal:
optimal = optimal2
if m == 0:
optimal = 1
else:
optimal = (end - optimal) % n
if optimal == 0:
optimal = n
print(optimal) | if optimal2>optimal: | 27 | decision |
n = int(input())
inp = input().split(" ")
people = []
for i in range(n):
people.append(int(inp[i]))
inp = input().split(" ")
start = int(inp[0])
end = int(inp[1])
diff = end - start
optimal = 1
people = people + people
m = sum(people[0: diff])
prev_sum = m
for i in range(1, n):
offset = min(diff, n - i)
prev_sum -= people[i - 1]
prev_sum += people[i + diff - 1]
if prev_sum > m:
m = prev_sum
optimal2 = i + diff
if optimal2 < optimal:
optimal = optimal2
if m == 0:
optimal = 1
else:
optimal = (end - optimal) % n
if optimal == 0:
optimal = n
print(optimal) | n = int(input())
inp = input().split(" ")
y = []
for i in range(n):
people.append(int(inp[i]))
inp = input().split(" ")
start = int(inp[0])
end = int(inp[1])
diff = end - start
optimal = 1
people = people + people
m = sum(people[0: diff])
prev_sum = m
for i in range(1, n):
offset = min(diff, n - i)
prev_sum -= people[i - 1]
prev_sum += people[i + diff - 1]
if prev_sum > m:
m = prev_sum
optimal2 = i + diff
if optimal2 < optimal:
optimal = optimal2
if m == 0:
optimal = 1
else:
optimal = (end - optimal) % n
if optimal == 0:
optimal = n
print(optimal) | y = [] | 5 | statement |
n = int(input())
inp = input().split(" ")
people = []
for i in range(n):
people.append(int(inp[i]))
inp = input().split(" ")
start = int(inp[0])
end = int(inp[1])
diff = end - start
optimal = 1
people = people + people
m = sum(people[0: diff])
prev_sum = m
for i in range(1, n):
offset = min(diff, n - i)
prev_sum -= people[i - 1]
prev_sum += people[i + diff - 1]
if prev_sum > m:
m = prev_sum
optimal2 = i + diff
if optimal2 < optimal:
optimal = optimal2
if m == 0:
optimal = 1
else:
optimal = (end - optimal) % n
if optimal == 0:
optimal = n
print(optimal) | n = int(input())
inp = input().split(" ")
people = []
for i in range(n):
people.append(int(inp[i]))
inp = input().split(" ")
start = int(inp[0])
end = int(inp[1])
diff = end - start
optimal = 1
people = people + people
m = sum(people[0: diff])
prev_sum = m
for i in range(1, n):
offset = min(diff, n - i)
prev_sum -= people[i - 128]
prev_sum += people[i + diff - 1]
if prev_sum > m:
m = prev_sum
optimal2 = i + diff
if optimal2 < optimal:
optimal = optimal2
if m == 0:
optimal = 1
else:
optimal = (end - optimal) % n
if optimal == 0:
optimal = n
print(optimal) | prev_sum -= people[i - 128] | 21 | value |
n = int(input())
inp = input().split(" ")
people = []
for i in range(n):
people.append(int(inp[i]))
inp = input().split(" ")
start = int(inp[0])
end = int(inp[1])
diff = end - start
optimal = 1
people = people + people
m = sum(people[0: diff])
prev_sum = m
for i in range(1, n):
offset = min(diff, n - i)
prev_sum -= people[i - 1]
prev_sum += people[i + diff - 1]
if prev_sum > m:
m = prev_sum
optimal2 = i + diff
if optimal2 < optimal:
optimal = optimal2
if m == 0:
optimal = 1
else:
optimal = (end - optimal) % n
if optimal == 0:
optimal = n
print(optimal) | n = int(input())
inp = input().split(" ")
people = []
for i in range(n):
people.append(int(inp[i]))
inp = input().split(" ")
start = int(inp[0])
end = int(inp[1])
diff = end - start
optimal = 1
people = people + people
m = sum(people[0: diff])
prev_sum = m
for i in range(1, n):
offset = min(diff, n - i)
prev_sum -= people[i@1]
prev_sum += people[i + diff - 1]
if prev_sum > m:
m = prev_sum
optimal2 = i + diff
if optimal2 < optimal:
optimal = optimal2
if m == 0:
optimal = 1
else:
optimal = (end - optimal) % n
if optimal == 0:
optimal = n
print(optimal) | prev_sum -= people[i@1] | 21 | operation |
n = int(input())
inp = input().split(" ")
people = []
for i in range(n):
people.append(int(inp[i]))
inp = input().split(" ")
start = int(inp[0])
end = int(inp[1])
diff = end - start
optimal = 1
people = people + people
m = sum(people[0: diff])
prev_sum = m
for i in range(1, n):
offset = min(diff, n - i)
prev_sum -= people[i - 1]
prev_sum += people[i + diff - 1]
if prev_sum > m:
m = prev_sum
optimal2 = i + diff
if optimal2 < optimal:
optimal = optimal2
if m == 0:
optimal = 1
else:
optimal = (end - optimal) % n
if optimal == 0:
optimal = n
print(optimal) | n = int(input())
inp = input().split(" ")
people = []
for i in range(n):
people.append(int(inp[i]))
inp = input().split(" ")
start = int(inp[0])
end = int(inp[1])
diff = end - start
optimal = 1
people = people + people
m = sum(people[0: diff])
prev_sum = m
for i in range(1, n):
offset = min(diff, n**i)
prev_sum -= people[i - 1]
prev_sum += people[i + diff - 1]
if prev_sum > m:
m = prev_sum
optimal2 = i + diff
if optimal2 < optimal:
optimal = optimal2
if m == 0:
optimal = 1
else:
optimal = (end - optimal) % n
if optimal == 0:
optimal = n
print(optimal) | offset = min(diff, n**i) | 20 | operation |
n = int(input())
mas = {}
last = 0
for i in range(n-1):
p = int(input())
if p in mas:
last = mas[p][len(mas[p]) - 1] + 1
mas[p].append(last)
else:
if p == 1:
mas[p] = [2]
else:
mas[p] = [last + 1]
for el in mas:
if p in mas[el]:
del mas[el][mas[el].index(p)]
if len(mas[el]) < 3:
print("No")
exit(0)
for el in mas:
if len(mas[el]) < 3:
print("No")
exit(0)
print("Yes") | n = int(input())
mas = {}
last = 0
for i in range(n-1):
p = int(input())
if p in mas:
last = mas[p][len(mas[p]) - 1] + 1
mas[p].append(last)
else:
if p == 1:
mas[p] = [2]
else:
mas[p] = [last + 1]
for el in mas:
if p in mas[el]:
del mas[el][mas[el].index(p)]
if len(mas[el])>3:
print("No")
exit(0)
for el in mas:
if len(mas[el]) < 3:
print("No")
exit(0)
print("Yes") | if len(mas[el])>3: | 17 | decision |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.