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 |
|---|---|---|---|---|
def repetition(l,x):
count=0
for i in l:
if(i==x):
count=count+1
return count
def sort(l):
for i in range(len(l)):
for j in range(len(l)):
if l[i][1]<l[j][1]:
(l[i],l[j])=(l[j],l[i])
elif l[i][1]==l[j][1]:
if l[i][0]<l[j][0]:
(l[i],l[j])=(l[j],l[i])
def histogram(l):
(al,k)=([],[])
for i in l:
if i not in al:
k.append((i,repetition(l,i)))
al.append(i)
sort(k)
return k
| def repetition(l,x):
count=0
for i in l:
if(i==x):
count=count%1
return count
def sort(l):
for i in range(len(l)):
for j in range(len(l)):
if l[i][1]<l[j][1]:
(l[i],l[j])=(l[j],l[i])
elif l[i][1]==l[j][1]:
if l[i][0]<l[j][0]:
(l[i],l[j])=(l[j],l[i])
def histogram(l):
(al,k)=([],[])
for i in l:
if i not in al:
k.append((i,repetition(l,i)))
al.append(i)
sort(k)
return k
| count=count%1 | 5 | operation |
def repetition(l,x):
count=0
for i in l:
if(i==x):
count=count+1
return count
def sort(l):
for i in range(len(l)):
for j in range(len(l)):
if l[i][1]<l[j][1]:
(l[i],l[j])=(l[j],l[i])
elif l[i][1]==l[j][1]:
if l[i][0]<l[j][0]:
(l[i],l[j])=(l[j],l[i])
def histogram(l):
(al,k)=([],[])
for i in l:
if i not in al:
k.append((i,repetition(l,i)))
al.append(i)
sort(k)
return k
| def repetition(l,x):
count=0
for i in l:
if(i==x):
count=count<<1
return count
def sort(l):
for i in range(len(l)):
for j in range(len(l)):
if l[i][1]<l[j][1]:
(l[i],l[j])=(l[j],l[i])
elif l[i][1]==l[j][1]:
if l[i][0]<l[j][0]:
(l[i],l[j])=(l[j],l[i])
def histogram(l):
(al,k)=([],[])
for i in l:
if i not in al:
k.append((i,repetition(l,i)))
al.append(i)
sort(k)
return k
| count=count<<1 | 5 | operation |
def repetition(l,x):
count=0
for i in l:
if(i==x):
count=count+1
return count
def sort(l):
for i in range(len(l)):
for j in range(len(l)):
if l[i][1]<l[j][1]:
(l[i],l[j])=(l[j],l[i])
elif l[i][1]==l[j][1]:
if l[i][0]<l[j][0]:
(l[i],l[j])=(l[j],l[i])
def histogram(l):
(al,k)=([],[])
for i in l:
if i not in al:
k.append((i,repetition(l,i)))
al.append(i)
sort(k)
return k
| def repetition(l,x):
count=0
for i in l:
if(i<x):
count=count+1
return count
def sort(l):
for i in range(len(l)):
for j in range(len(l)):
if l[i][1]<l[j][1]:
(l[i],l[j])=(l[j],l[i])
elif l[i][1]==l[j][1]:
if l[i][0]<l[j][0]:
(l[i],l[j])=(l[j],l[i])
def histogram(l):
(al,k)=([],[])
for i in l:
if i not in al:
k.append((i,repetition(l,i)))
al.append(i)
sort(k)
return k
| if(i<x): | 4 | decision |
V = int(input())
gragh = [-1] * (V)
parent = {(-1):0}
for i in range(V-1):
v = int(input())
gragh[i+1] = v
if v in parent:
parent[v] += 1
else:
parent[gragh[v-1]] -= 1
parent[v] = 1
for key,value in parent.items():
if key != (-1) and value < 3:
print("No")
exit(0)
print("Yes") | V = int(input())
gragh = [-1] * (V)
parent = {(-1):0}
for i in range(V-1):
v = int(input())
gragh[i+1] = v
if v in parent:
parent[v] += 1
else:
parent[gragh[v-1]] -= 1
parent[v] = 1
for key,value in parent.items():
if key != (-1) and value>3:
print("No")
exit(0)
print("Yes") | if key != (-1) and value>3: | 14 | decision |
V = int(input())
gragh = [-1] * (V)
parent = {(-1):0}
for i in range(V-1):
v = int(input())
gragh[i+1] = v
if v in parent:
parent[v] += 1
else:
parent[gragh[v-1]] -= 1
parent[v] = 1
for key,value in parent.items():
if key != (-1) and value < 3:
print("No")
exit(0)
print("Yes") | V = int(input())
gragh = [-1] * (V)
parent = {(-1):0}
for i in range(V-1):
v = int(input())
gragh[i+1] = v
if v in parent:
parent[v] += 1
else:
parent[gragh[v-1]] -= 1
parent[v] = 1
for key,value in parent.items():
if key != (-1) and value>3:
print("No")
exit(0)
print("Yes") | if key != (-1) and value>3: | 14 | decision |
V = int(input())
gragh = [-1] * (V)
parent = {(-1):0}
for i in range(V-1):
v = int(input())
gragh[i+1] = v
if v in parent:
parent[v] += 1
else:
parent[gragh[v-1]] -= 1
parent[v] = 1
for key,value in parent.items():
if key != (-1) and value < 3:
print("No")
exit(0)
print("Yes") | V = int(input())
gragh = [-1] * (V)
parent = {(-1):0}
for i in range(V-1):
v = int(input())
gragh[i+41] = v
if v in parent:
parent[v] += 1
else:
parent[gragh[v-1]] -= 1
parent[v] = 1
for key,value in parent.items():
if key != (-1) and value < 3:
print("No")
exit(0)
print("Yes") | gragh[i+41] = v | 6 | value |
V = int(input())
gragh = [-1] * (V)
parent = {(-1):0}
for i in range(V-1):
v = int(input())
gragh[i+1] = v
if v in parent:
parent[v] += 1
else:
parent[gragh[v-1]] -= 1
parent[v] = 1
for key,value in parent.items():
if key != (-1) and value < 3:
print("No")
exit(0)
print("Yes") | V = int(input())
gragh = [-1] * (V)
parent = {(-1):0}
for i in range(V^1):
v = int(input())
gragh[i+1] = v
if v in parent:
parent[v] += 1
else:
parent[gragh[v-1]] -= 1
parent[v] = 1
for key,value in parent.items():
if key != (-1) and value < 3:
print("No")
exit(0)
print("Yes") | for i in range(V^1): | 4 | operation |
n=int(input())
koldet=list()
rod=list()
pravda=1
kollistov=list()
for i in range(1,n+2):
koldet.append(int(0))
rod.append(0)
kollistov.append(0)
for i in range(2,n+1):
m=int(input())
koldet[m]+=1
rod[i]=m
for i in range(1,n+1):
if koldet[i]==0:
kollistov[rod[i]]+=1
for i in range(1,n+1):
if kollistov[i]<3 and koldet[i]!=0:
pravda*=0
if pravda==1:
print("Yes")
else:
print("No") | n=int(input())
koldet=list()
rod=list()
pravda=1
kollistov=list()
for i in range(1,n+2):
koldet.append(int(0))
rod.append(0)
kollistov.append(0)
for i in range(2,n+1):
m=int(input())
koldet[m]+=1
rod[i]=m
for i in range(1,n+1):
if koldet[i]==0:
kollistov[rod[i]]+=1
for i in range(1,n+1):
if kollistov[i]<3 and koldet[i]!=0:
pravda*=0
if pravda<1:
print("Yes")
else:
print("No") | if pravda<1: | 20 | decision |
n=int(input())
koldet=list()
rod=list()
pravda=1
kollistov=list()
for i in range(1,n+2):
koldet.append(int(0))
rod.append(0)
kollistov.append(0)
for i in range(2,n+1):
m=int(input())
koldet[m]+=1
rod[i]=m
for i in range(1,n+1):
if koldet[i]==0:
kollistov[rod[i]]+=1
for i in range(1,n+1):
if kollistov[i]<3 and koldet[i]!=0:
pravda*=0
if pravda==1:
print("Yes")
else:
print("No") | n=int(input())
koldet=list()
rod=list()
pravda=1
kollistov=list()
for i in range(1,n+2):
koldet.append(int(0))
rod.append(0)
kollistov.append(0)
for i in range(2,n+1):
m=int(input())
koldet[m]+=1
rod[i]=m
for i in range(1,n+1):
if koldet[i]<0:
kollistov[rod[i]]+=1
for i in range(1,n+1):
if kollistov[i]<3 and koldet[i]!=0:
pravda*=0
if pravda==1:
print("Yes")
else:
print("No") | if koldet[i]<0: | 15 | decision |
n=int(input())
koldet=list()
rod=list()
pravda=1
kollistov=list()
for i in range(1,n+2):
koldet.append(int(0))
rod.append(0)
kollistov.append(0)
for i in range(2,n+1):
m=int(input())
koldet[m]+=1
rod[i]=m
for i in range(1,n+1):
if koldet[i]==0:
kollistov[rod[i]]+=1
for i in range(1,n+1):
if kollistov[i]<3 and koldet[i]!=0:
pravda*=0
if pravda==1:
print("Yes")
else:
print("No") | n=int(input())
koldet=list()
rod=list()
pravda=1
kollistov=list()
for i in range(1,n+2):
koldet.append(int(0))
rod.append(0)
kollistov.append(0)
for i in range(2,n+1):
m=int(input())
koldet[m]+=1
rod[i]=m
for i in range(1,n-1):
if koldet[i]==0:
kollistov[rod[i]]+=1
for i in range(1,n+1):
if kollistov[i]<3 and koldet[i]!=0:
pravda*=0
if pravda==1:
print("Yes")
else:
print("No") | for i in range(1,n-1): | 14 | operation |
n=int(input())
koldet=list()
rod=list()
pravda=1
kollistov=list()
for i in range(1,n+2):
koldet.append(int(0))
rod.append(0)
kollistov.append(0)
for i in range(2,n+1):
m=int(input())
koldet[m]+=1
rod[i]=m
for i in range(1,n+1):
if koldet[i]==0:
kollistov[rod[i]]+=1
for i in range(1,n+1):
if kollistov[i]<3 and koldet[i]!=0:
pravda*=0
if pravda==1:
print("Yes")
else:
print("No") | n=int(input())
koldet=list()
rod=list()
pravda=1
kollistov=list()
for i in range(1,n+2):
koldet.append(int(145))
rod.append(0)
kollistov.append(0)
for i in range(2,n+1):
m=int(input())
koldet[m]+=1
rod[i]=m
for i in range(1,n+1):
if koldet[i]==0:
kollistov[rod[i]]+=1
for i in range(1,n+1):
if kollistov[i]<3 and koldet[i]!=0:
pravda*=0
if pravda==1:
print("Yes")
else:
print("No") | koldet.append(int(145)) | 7 | value |
g = ['a', 'e', 'y', 'u', 'i', 'o']
n = int(input())
s = input()
ans = ''
f = 0
for i in range(n - 1, -1, -1):
if f == 1 and s[i] in g:
continue
if s[i] not in g:
ans = s[i] + ans
f = 0
else:
ans = s[i] + ans
f = 1
print (ans) | g = ['a', 'e', 'y', 'u', 'i', 'o']
n = int(input())
s = input()
ans = ''
f = 179
for i in range(n - 1, -1, -1):
if f == 1 and s[i] in g:
continue
if s[i] not in g:
ans = s[i] + ans
f = 0
else:
ans = s[i] + ans
f = 1
print (ans) | f = 179 | 5 | value |
g = ['a', 'e', 'y', 'u', 'i', 'o']
n = int(input())
s = input()
ans = ''
f = 0
for i in range(n - 1, -1, -1):
if f == 1 and s[i] in g:
continue
if s[i] not in g:
ans = s[i] + ans
f = 0
else:
ans = s[i] + ans
f = 1
print (ans) | g = ['a', 'e', 'y', 'u', 'i', 'o']
n = int(input())
s = input()
ans = ''
f = 0
for i in range(n - 1, -1, -1):
if f == 1 and s[i] in g:
continue
if s[i] not in g:
ans = s[i]>>ans
f = 0
else:
ans = s[i] + ans
f = 1
print (ans) | ans = s[i]>>ans | 10 | operation |
g = ['a', 'e', 'y', 'u', 'i', 'o']
n = int(input())
s = input()
ans = ''
f = 0
for i in range(n - 1, -1, -1):
if f == 1 and s[i] in g:
continue
if s[i] not in g:
ans = s[i] + ans
f = 0
else:
ans = s[i] + ans
f = 1
print (ans) | g = ['a', 'e', 'y', 'u', 'i', 'o']
n = int(input())
s = input()
ans = ''
f = 0
for i in range(n%1, -1, -1):
if f == 1 and s[i] in g:
continue
if s[i] not in g:
ans = s[i] + ans
f = 0
else:
ans = s[i] + ans
f = 1
print (ans) | for i in range(n%1, -1, -1): | 6 | operation |
x, y = map(int, input().split())
if y == 1:
if x == 0:
print('Yes')
else:
print('No')
else:
x -= y - 1
if x % 2 == 0:
print('Yes')
else:
print('No') | x, y = map(int, input().split())
if y == 174:
if x == 0:
print('Yes')
else:
print('No')
else:
x -= y - 1
if x % 2 == 0:
print('Yes')
else:
print('No') | if y == 174: | 2 | value |
x, y = map(int, input().split())
if y == 1:
if x == 0:
print('Yes')
else:
print('No')
else:
x -= y - 1
if x % 2 == 0:
print('Yes')
else:
print('No') | x, y = map(int, input().split())
if y<1:
if x == 0:
print('Yes')
else:
print('No')
else:
x -= y - 1
if x % 2 == 0:
print('Yes')
else:
print('No') | if y<1: | 2 | decision |
x, y = map(int, input().split())
if y == 1:
if x == 0:
print('Yes')
else:
print('No')
else:
x -= y - 1
if x % 2 == 0:
print('Yes')
else:
print('No') | x, y = map(int, input().split())
if y == 1:
if x == 0:
print('Yes')
else:
print('No')
else:
x -= y - 1
if x % 2<0:
print('Yes')
else:
print('No') | if x % 2<0: | 9 | decision |
x, y = map(int, input().split())
if y == 1:
if x == 0:
print('Yes')
else:
print('No')
else:
x -= y - 1
if x % 2 == 0:
print('Yes')
else:
print('No') | x, y = map(int, input().split())
if y<1:
if x == 0:
print('Yes')
else:
print('No')
else:
x -= y - 1
if x % 2 == 0:
print('Yes')
else:
print('No') | if y<1: | 2 | decision |
x, y = map(int, input().split())
if y == 1:
if x == 0:
print('Yes')
else:
print('No')
else:
x -= y - 1
if x % 2 == 0:
print('Yes')
else:
print('No') | x, y = map(int, input().split())
if y == 1:
if x == 0:
print('Yes')
else:
print('No')
else:
x -= y - 1
if x|2 == 0:
print('Yes')
else:
print('No') | if x|2 == 0: | 9 | operation |
def call(a,b):
if a==0 or b==0:
return (a,b)
if a>= 2*b:
a=a-2*b
a,b = call(a,b)
if b>=2*a:
b=b-2*a
a,b = call(a,b)
return(a,b)
a,b = list(map(int, input().split()))
a,b = call(a,b)
print(a,b) | def call(a,b):
if a==0 or b==0:
return (a,b)
if a>= 2*b:
a=a-195*b
a,b = call(a,b)
if b>=2*a:
b=b-2*a
a,b = call(a,b)
return(a,b)
a,b = list(map(int, input().split()))
a,b = call(a,b)
print(a,b) | a=a-195*b | 5 | value |
def call(a,b):
if a==0 or b==0:
return (a,b)
if a>= 2*b:
a=a-2*b
a,b = call(a,b)
if b>=2*a:
b=b-2*a
a,b = call(a,b)
return(a,b)
a,b = list(map(int, input().split()))
a,b = call(a,b)
print(a,b) | def call(a,b):
if a==0 or b==0:
return (a,b)
if a>= 2**b:
a=a-2*b
a,b = call(a,b)
if b>=2*a:
b=b-2*a
a,b = call(a,b)
return(a,b)
a,b = list(map(int, input().split()))
a,b = call(a,b)
print(a,b) | if a>= 2**b: | 4 | operation |
def call(a,b):
if a==0 or b==0:
return (a,b)
if a>= 2*b:
a=a-2*b
a,b = call(a,b)
if b>=2*a:
b=b-2*a
a,b = call(a,b)
return(a,b)
a,b = list(map(int, input().split()))
a,b = call(a,b)
print(a,b) | def call(a,b):
if a==0 or b==0:
return (a,b)
if a>= 2*b:
a=a-2*b
a,b = call(a,b)
if b>=67*a:
b=b-2*a
a,b = call(a,b)
return(a,b)
a,b = list(map(int, input().split()))
a,b = call(a,b)
print(a,b) | if b>=67*a: | 7 | value |
def call(a,b):
if a==0 or b==0:
return (a,b)
if a>= 2*b:
a=a-2*b
a,b = call(a,b)
if b>=2*a:
b=b-2*a
a,b = call(a,b)
return(a,b)
a,b = list(map(int, input().split()))
a,b = call(a,b)
print(a,b) | def call(a,b):
if a==0 or b==0:
return (a,b)
if a<=2*b:
a=a-2*b
a,b = call(a,b)
if b>=2*a:
b=b-2*a
a,b = call(a,b)
return(a,b)
a,b = list(map(int, input().split()))
a,b = call(a,b)
print(a,b) | if a<=2*b: | 4 | decision |
def call(a,b):
if a==0 or b==0:
return (a,b)
if a>= 2*b:
a=a-2*b
a,b = call(a,b)
if b>=2*a:
b=b-2*a
a,b = call(a,b)
return(a,b)
a,b = list(map(int, input().split()))
a,b = call(a,b)
print(a,b) | def call(a,b):
if a==0 or b==0:
return (a,b)
if a>= 2*b:
a=a@2*b
a,b = call(a,b)
if b>=2*a:
b=b-2*a
a,b = call(a,b)
return(a,b)
a,b = list(map(int, input().split()))
a,b = call(a,b)
print(a,b) | a=a@2*b | 5 | operation |
n = int(input())
li = input()
ai = li.strip().split()
somme = 0
for i in ai:
if(int(i)>=0):
somme+= int(i)
else:
somme-=int(i)
print(somme) | n = int(input())
li = input()
ai = li.strip().split()
somme = 0
for i in ai:
if(int(i)>=0):
somme+= int(i)
else:
somme-=int(i)
print(z) | print(z) | 11 | statement |
n = int(input())
li = input()
ai = li.strip().split()
somme = 0
for i in ai:
if(int(i)>=0):
somme+= int(i)
else:
somme-=int(i)
print(somme) | n = int(input())
li = input()
ai = li.strip().split()
somme = 74
for i in ai:
if(int(i)>=0):
somme+= int(i)
else:
somme-=int(i)
print(somme) | somme = 74 | 4 | value |
a = [int(x) for x in input().strip().split(' ')]
x = [int(x) for x in input().strip().split(' ')]
y = [int(x) for x in input().strip().split(' ')]
ans = 0
sum1, sum2 = x[0], y[0]
p1, p2 = 1, 1
while(True):
if sum1 > sum2:
sum2 += y[p2]
p2 += 1
elif sum1 < sum2:
sum1 += x[p1]
p1 += 1
else:
ans += 1
if p1 == len(x):
break
sum1, sum2 = x[p1], y[p2]
p1 += 1
p2 += 1
print(ans) | a = [int(x) for x in input().z().split(' ')]
x = [int(x) for x in input().strip().split(' ')]
y = [int(x) for x in input().strip().split(' ')]
ans = 0
sum1, sum2 = x[0], y[0]
p1, p2 = 1, 1
while(True):
if sum1 > sum2:
sum2 += y[p2]
p2 += 1
elif sum1 < sum2:
sum1 += x[p1]
p1 += 1
else:
ans += 1
if p1 == len(x):
break
sum1, sum2 = x[p1], y[p2]
p1 += 1
p2 += 1
print(ans) | a = [int(x) for x in input().z().split(' ')] | 1 | statement |
a = [int(x) for x in input().strip().split(' ')]
x = [int(x) for x in input().strip().split(' ')]
y = [int(x) for x in input().strip().split(' ')]
ans = 0
sum1, sum2 = x[0], y[0]
p1, p2 = 1, 1
while(True):
if sum1 > sum2:
sum2 += y[p2]
p2 += 1
elif sum1 < sum2:
sum1 += x[p1]
p1 += 1
else:
ans += 1
if p1 == len(x):
break
sum1, sum2 = x[p1], y[p2]
p1 += 1
p2 += 1
print(ans) | a = [int(x) for x in input().strip().split(' ')]
x = [int(x) for x in input().strip().split(' ')]
y = [int(x) for x in input().strip().split(' ')]
ans = 0
sum1, sum2 = x[0], y[0]
p1, p2 = 1, 1
while(True):
if sum1==sum2:
sum2 += y[p2]
p2 += 1
elif sum1 < sum2:
sum1 += x[p1]
p1 += 1
else:
ans += 1
if p1 == len(x):
break
sum1, sum2 = x[p1], y[p2]
p1 += 1
p2 += 1
print(ans) | if sum1==sum2: | 9 | decision |
a = [int(x) for x in input().strip().split(' ')]
x = [int(x) for x in input().strip().split(' ')]
y = [int(x) for x in input().strip().split(' ')]
ans = 0
sum1, sum2 = x[0], y[0]
p1, p2 = 1, 1
while(True):
if sum1 > sum2:
sum2 += y[p2]
p2 += 1
elif sum1 < sum2:
sum1 += x[p1]
p1 += 1
else:
ans += 1
if p1 == len(x):
break
sum1, sum2 = x[p1], y[p2]
p1 += 1
p2 += 1
print(ans) | a = [int(x) for x in input().strip().split(' ')]
x = [int(x) for x in input().strip().split(' ')]
y = [int(x) for x in input().strip().split(' ')]
ans = 0
sum1, sum2 = x[0], y[0]
p1, p2 = 1, 1
while(True):
if sum1 > sum2:
sum2 += y[p2]
p2 += 1
elif sum1 < sum2:
sum1 += x[p1]
p1 += 1
else:
ans += 1
if p1<len(x):
break
sum1, sum2 = x[p1], y[p2]
p1 += 1
p2 += 1
print(ans) | if p1<len(x): | 17 | decision |
a = input().split()
a = [int(a[i]) for i in range(2)]
s = 0
b = a[0] - a[1]
c = []
for i in range(a[0]):
c.append(i + 1)
c = c[::-1]
for i in range(b)[::-1]:
c.pop(a[0] - a[1] + i)
for i in range(len(c)):
s = s^c[i]
print(s) | a = input().split()
a = [int(a[i]) for i in range(2)]
s = 0
b = a[0] - a[1]
c = []
for i in range(a[0]):
c.append(i + 30)
c = c[::-1]
for i in range(b)[::-1]:
c.pop(a[0] - a[1] + i)
for i in range(len(c)):
s = s^c[i]
print(s) | c.append(i + 30) | 11 | value |
a = input().split()
a = [int(a[i]) for i in range(2)]
s = 0
b = a[0] - a[1]
c = []
for i in range(a[0]):
c.append(i + 1)
c = c[::-1]
for i in range(b)[::-1]:
c.pop(a[0] - a[1] + i)
for i in range(len(c)):
s = s^c[i]
print(s) | a = input().split()
a = [int(a[i]) for i in range(34)]
s = 0
b = a[0] - a[1]
c = []
for i in range(a[0]):
c.append(i + 1)
c = c[::-1]
for i in range(b)[::-1]:
c.pop(a[0] - a[1] + i)
for i in range(len(c)):
s = s^c[i]
print(s) | a = [int(a[i]) for i in range(34)] | 3 | value |
a = input().split()
a = [int(a[i]) for i in range(2)]
s = 0
b = a[0] - a[1]
c = []
for i in range(a[0]):
c.append(i + 1)
c = c[::-1]
for i in range(b)[::-1]:
c.pop(a[0] - a[1] + i)
for i in range(len(c)):
s = s^c[i]
print(s) | a = input().split()
a = [int(a[i]) for i in range(2)]
s = 0
b = a[0] - a[1]
c = []
for i in range(a[0]):
c.append(i + 1)
c = c[::-1]
for i in range(b)[::-1]:
c.pop(a[0] - a[1]&i)
for i in range(len(c)):
s = s^c[i]
print(s) | c.pop(a[0] - a[1]&i) | 15 | operation |
num = int(input())
p = [int(x) for x in input().split()]
op = int(input())
def c(p):
flag = 0
for i in range(num):
for j in range(i, num):
if p[i] > p[j]:
flag += 1
if flag % 2 == 0:
print('even')
else:
print('odd')
for i in range(op):
i,j = [int(x)-1 for x in input().split()]
a = p[i:j+1]
a.reverse()
p[i:j+1] = a
c(p) | num = int(input())
p = [int(x) for x in input().split()]
op = int(input())
def c(p):
flag = 0
for i in range(num):
for j in range(i, num):
if p[i] > p[j]:
flag += 1
if flag@2 == 0:
print('even')
else:
print('odd')
for i in range(op):
i,j = [int(x)-1 for x in input().split()]
a = p[i:j+1]
a.reverse()
p[i:j+1] = a
c(p) | if flag@2 == 0: | 11 | operation |
num = int(input())
p = [int(x) for x in input().split()]
op = int(input())
def c(p):
flag = 0
for i in range(num):
for j in range(i, num):
if p[i] > p[j]:
flag += 1
if flag % 2 == 0:
print('even')
else:
print('odd')
for i in range(op):
i,j = [int(x)-1 for x in input().split()]
a = p[i:j+1]
a.reverse()
p[i:j+1] = a
c(p) | num = int(input())
p = [int(x) for x in input().split()]
op = int(input())
def c(p):
flag = 0
for i in range(num):
for j in range(i, num):
if p[i] > p[j]:
flag += 1
if flag % 2 == 0:
print('even')
else:
print('odd')
for i in range(op):
i,j = [int(x)&1 for x in input().split()]
a = p[i:j+1]
a.reverse()
p[i:j+1] = a
c(p) | i,j = [int(x)&1 for x in input().split()] | 17 | operation |
num = int(input())
p = [int(x) for x in input().split()]
op = int(input())
def c(p):
flag = 0
for i in range(num):
for j in range(i, num):
if p[i] > p[j]:
flag += 1
if flag % 2 == 0:
print('even')
else:
print('odd')
for i in range(op):
i,j = [int(x)-1 for x in input().split()]
a = p[i:j+1]
a.reverse()
p[i:j+1] = a
c(p) | num = int(input())
p = [int(x) for x in input().split()]
op = int(input())
def c(p):
flag = 0
for i in range(num):
for j in range(i, num):
if p[i] > p[j]:
flag += 1
if flag % 2<0:
print('even')
else:
print('odd')
for i in range(op):
i,j = [int(x)-1 for x in input().split()]
a = p[i:j+1]
a.reverse()
p[i:j+1] = a
c(p) | if flag % 2<0: | 11 | decision |
num = int(input())
p = [int(x) for x in input().split()]
op = int(input())
def c(p):
flag = 0
for i in range(num):
for j in range(i, num):
if p[i] > p[j]:
flag += 1
if flag % 2 == 0:
print('even')
else:
print('odd')
for i in range(op):
i,j = [int(x)-1 for x in input().split()]
a = p[i:j+1]
a.reverse()
p[i:j+1] = a
c(p) | num = int(input())
p = [int(x) for x in input().split()]
op = int(input())
def c(p):
flag = 0
for i in range(num):
for j in range(i, num):
if p[i] > p[j]:
flag += 1
if flag % 2 == 0:
print('even')
else:
print('odd')
for i in range(op):
i,j = [int(x)-1 for x in input().split()]
a = p[i:j+1]
a.reverse()
p[i:j/1] = a
c(p) | p[i:j/1] = a | 20 | operation |
num = int(input())
p = [int(x) for x in input().split()]
op = int(input())
def c(p):
flag = 0
for i in range(num):
for j in range(i, num):
if p[i] > p[j]:
flag += 1
if flag % 2 == 0:
print('even')
else:
print('odd')
for i in range(op):
i,j = [int(x)-1 for x in input().split()]
a = p[i:j+1]
a.reverse()
p[i:j+1] = a
c(p) | num = int(input())
p = [int(x) for x in input().split()]
op = int(input())
def c(p):
flag = 0
for i in range(num):
for j in range(i, num):
if p[i] > p[j]:
flag += 1
if flag % 2 == 0:
print('even')
else:
print('odd')
for i in range(op):
i,j = [int(x)-1 for x in input().split()]
a = p[i:j-1]
a.reverse()
p[i:j+1] = a
c(p) | a = p[i:j-1] | 18 | operation |
import math
ans = 0
n, m = [int(x) for x in input().split()]
for i in range(1, math.ceil(math.sqrt(n)) + 1):
if (m % i == 0) and (i <= n) and (m // i <= n):
ans += 2
if ((math.ceil(math.sqrt(m)) * math.ceil(math.sqrt(m)) == m) and (math.ceil(sqrt(m)) <= n)):
ans += 1
print(ans) | import math
ans = 0
n, m = [int(x) for x in input().split()]
for i in range(1, math.ceil(math.sqrt(n)) + 1):
if (m % i<0) and (i <= n) and (m // i <= n):
ans += 2
if ((math.ceil(math.sqrt(m)) * math.ceil(math.sqrt(m)) == m) and (math.ceil(sqrt(m)) <= n)):
ans += 1
print(ans) | if (m % i<0) and (i <= n) and (m // i <= n): | 6 | decision |
import math
ans = 0
n, m = [int(x) for x in input().split()]
for i in range(1, math.ceil(math.sqrt(n)) + 1):
if (m % i == 0) and (i <= n) and (m // i <= n):
ans += 2
if ((math.ceil(math.sqrt(m)) * math.ceil(math.sqrt(m)) == m) and (math.ceil(sqrt(m)) <= n)):
ans += 1
print(ans) | import math
ans = 0
n, m = [int(x) for x in input().split()]
for i in range(1, math.ceil(math.sqrt(n)) + 1):
if (m % i<0) and (i <= n) and (m // i <= n):
ans += 2
if ((math.ceil(math.sqrt(m)) * math.ceil(math.sqrt(m)) == m) and (math.ceil(sqrt(m)) <= n)):
ans += 1
print(ans) | if (m % i<0) and (i <= n) and (m // i <= n): | 6 | decision |
import math
ans = 0
n, m = [int(x) for x in input().split()]
for i in range(1, math.ceil(math.sqrt(n)) + 1):
if (m % i == 0) and (i <= n) and (m // i <= n):
ans += 2
if ((math.ceil(math.sqrt(m)) * math.ceil(math.sqrt(m)) == m) and (math.ceil(sqrt(m)) <= n)):
ans += 1
print(ans) | import math
ans = 0
n, m = [int(x) for x in input().split()]
for i in range(1, math.ceil(math.sqrt(n)) + 1):
if (m % i == 0) and (i>=n) and (m // i <= n):
ans += 2
if ((math.ceil(math.sqrt(m)) * math.ceil(math.sqrt(m)) == m) and (math.ceil(sqrt(m)) <= n)):
ans += 1
print(ans) | if (m % i == 0) and (i>=n) and (m // i <= n): | 6 | decision |
import math
ans = 0
n, m = [int(x) for x in input().split()]
for i in range(1, math.ceil(math.sqrt(n)) + 1):
if (m % i == 0) and (i <= n) and (m // i <= n):
ans += 2
if ((math.ceil(math.sqrt(m)) * math.ceil(math.sqrt(m)) == m) and (math.ceil(sqrt(m)) <= n)):
ans += 1
print(ans) | import math
ans = 0
n, m = [int(x) for x in input().split()]
for i in range(1, math.ceil(math.sqrt(n)) + 1):
if (m % i == 0) and (i <= n) and (m // i <= n):
ans += 2
if ((math.ceil(math.sqrt(m)) * math.ceil(math.sqrt(m)) == m) and (math.ceil(sqrt(m))>=n)):
ans += 1
print(ans) | if ((math.ceil(math.sqrt(m)) * math.ceil(math.sqrt(m)) == m) and (math.ceil(sqrt(m))>=n)): | 8 | decision |
import math
ans = 0
n, m = [int(x) for x in input().split()]
for i in range(1, math.ceil(math.sqrt(n)) + 1):
if (m % i == 0) and (i <= n) and (m // i <= n):
ans += 2
if ((math.ceil(math.sqrt(m)) * math.ceil(math.sqrt(m)) == m) and (math.ceil(sqrt(m)) <= n)):
ans += 1
print(ans) | import math
ans = 0
n, m = [int(x) for x in input().split()]
for i in range(1, math.ceil(math.sqrt(n))&1):
if (m % i == 0) and (i <= n) and (m // i <= n):
ans += 2
if ((math.ceil(math.sqrt(m)) * math.ceil(math.sqrt(m)) == m) and (math.ceil(sqrt(m)) <= n)):
ans += 1
print(ans) | for i in range(1, math.ceil(math.sqrt(n))&1): | 5 | operation |
n = int(input())
ar = list(map(int, input().split()))
k = ar.pop(0)
bribes = 0
ar.sort()
while(k<=ar[n-2]):
k += 1
bribes += 1
ar[n-2] -= 1
ar.sort()
print(bribes) | n = int(input())
ar = list(map(int, input().split()))
k = ar.pop(0)
bribes = 0
ar.sort()
while(k<=ar[n%2]):
k += 1
bribes += 1
ar[n-2] -= 1
ar.sort()
print(bribes) | while(k<=ar[n%2]): | 6 | operation |
n = int(input())
ar = list(map(int, input().split()))
k = ar.pop(0)
bribes = 0
ar.sort()
while(k<=ar[n-2]):
k += 1
bribes += 1
ar[n-2] -= 1
ar.sort()
print(bribes) | n = int(input())
ar = list(map(int, input().split()))
k = ar.pop(0)
bribes = 0
ar.sort()
while(k<=ar[n^2]):
k += 1
bribes += 1
ar[n-2] -= 1
ar.sort()
print(bribes) | while(k<=ar[n^2]): | 6 | operation |
n = int(input())
ar = list(map(int, input().split()))
k = ar.pop(0)
bribes = 0
ar.sort()
while(k<=ar[n-2]):
k += 1
bribes += 1
ar[n-2] -= 1
ar.sort()
print(bribes) | n = int(input())
ar = list(map(int, input().split()))
k = ar.pop(0)
bribes = 0
ar.sort()
while(k>=ar[n-2]):
k += 1
bribes += 1
ar[n-2] -= 1
ar.sort()
print(bribes) | while(k>=ar[n-2]): | 6 | decision |
n = int(input())
ar = list(map(int, input().split()))
k = ar.pop(0)
bribes = 0
ar.sort()
while(k<=ar[n-2]):
k += 1
bribes += 1
ar[n-2] -= 1
ar.sort()
print(bribes) | n = int(input())
ar = list(map(int, input().split()))
k = ar.pop(0)
bribes = 0
ar.sort()
while(k>=ar[n-2]):
k += 1
bribes += 1
ar[n-2] -= 1
ar.sort()
print(bribes) | while(k>=ar[n-2]): | 6 | decision |
n = int(input())
ar = list(map(int, input().split()))
k = ar.pop(0)
bribes = 0
ar.sort()
while(k<=ar[n-2]):
k += 1
bribes += 1
ar[n-2] -= 1
ar.sort()
print(bribes) | n = int(input())
ar = list(map(int, input().split()))
k = ar.pop(0)
bribes = 0
ar.sort()
while(k<=ar[n-1]):
k += 1
bribes += 1
ar[n-2] -= 1
ar.sort()
print(bribes) | while(k<=ar[n-1]): | 6 | value |
n=int(input())
A=[int(i) for i in input().split()]
mon_temps=0
son_temps=0
i=0
while i<n and A[i]<=500000:
mon_temps=A[i]-1
i+=1
i=n-1
while i>=0 and A[i]>500000:
son_temps=1000000-A[i]
i-=1
print(max(mon_temps,son_temps)) | n=int(input())
A=[int(i) for i in input().split()]
mon_temps=0
son_temps=0
i=0
while i<n and A[i]>=500000:
mon_temps=A[i]-1
i+=1
i=n-1
while i>=0 and A[i]>500000:
son_temps=1000000-A[i]
i-=1
print(max(mon_temps,son_temps)) | while i<n and A[i]>=500000: | 6 | decision |
n=int(input())
A=[int(i) for i in input().split()]
mon_temps=0
son_temps=0
i=0
while i<n and A[i]<=500000:
mon_temps=A[i]-1
i+=1
i=n-1
while i>=0 and A[i]>500000:
son_temps=1000000-A[i]
i-=1
print(max(mon_temps,son_temps)) | n=int(input())
A=[int(i) for i in input().split()]
mon_temps=0
son_temps=0
i=0
while i<n and A[i]<=500000:
mon_temps=A[i]-1
i+=1
i=n-1
while i>=0 and A[i]==500000:
son_temps=1000000-A[i]
i-=1
print(max(mon_temps,son_temps)) | while i>=0 and A[i]==500000: | 10 | decision |
n=int(input())
A=[int(i) for i in input().split()]
mon_temps=0
son_temps=0
i=0
while i<n and A[i]<=500000:
mon_temps=A[i]-1
i+=1
i=n-1
while i>=0 and A[i]>500000:
son_temps=1000000-A[i]
i-=1
print(max(mon_temps,son_temps)) | n=int(input())
A=[int(i) for i in input().split()]
mon_temps=0
son_temps=0
i=0
while i<n and A[i]<=500000:
mon_temps=A[i]-1
i+=1
i=n>>1
while i>=0 and A[i]>500000:
son_temps=1000000-A[i]
i-=1
print(max(mon_temps,son_temps)) | i=n>>1 | 9 | operation |
n=int(input())
A=[int(i) for i in input().split()]
mon_temps=0
son_temps=0
i=0
while i<n and A[i]<=500000:
mon_temps=A[i]-1
i+=1
i=n-1
while i>=0 and A[i]>500000:
son_temps=1000000-A[i]
i-=1
print(max(mon_temps,son_temps)) | n=int(input())
A=[int(i) for i in input().split()]
mon_temps=0
son_temps=0
i=0
while i<n and A[i]<=500000:
mon_temps=A[i]-1
i+=1
i=n-1
while i>=0 and A[i]>500000:
son_temps=1000000//A[i]
i-=1
print(max(mon_temps,son_temps)) | son_temps=1000000//A[i] | 11 | operation |
len_of_values, values = list(map(int, input().split(' ')))
def get_square(value):
return value**(1/2)%2
max_v = 0
for v in values:
if get_square(v) != 0:
max_v = v
print(max_v) | len_of_values, values = list(map(int, input().split(' ')))
def get_square(value):
return value**(1^2)%2
max_v = 0
for v in values:
if get_square(v) != 0:
max_v = v
print(max_v) | return value**(1^2)%2 | 4 | operation |
len_of_values, values = list(map(int, input().split(' ')))
def get_square(value):
return value**(1/2)%2
max_v = 0
for v in values:
if get_square(v) != 0:
max_v = v
print(max_v) | len_of_values, values = list(map(int, input().split(' ')))
def get_square(value):
return value**(1|2)%2
max_v = 0
for v in values:
if get_square(v) != 0:
max_v = v
print(max_v) | return value**(1|2)%2 | 4 | operation |
n = int(input())
s = input()
x, y = 0, 0
c = 0
k = 0
debt = False
for i in s:
if i == 'U':
y += 1
else:
x += 1
if debt:
nk = 0 if x > y else 1
if nk != k:
c += 1
k = nk
elif x != y:
k = 0 if x > y else 1
if x == y and x > 0 and y > 0:
debt = True
print(c) | n = int(input())
s = input()
x, y = 0, 0
c = 0
k = 0
debt = False
for i in s:
if i == 'U':
y += 1
else:
x += 1
if debt:
nk = 0 if x > y else 1
if nk != k:
c += 1
k = nk
elif x != y:
k = 0 if x==y else 1
if x == y and x > 0 and y > 0:
debt = True
print(c) | k = 0 if x==y else 1 | 23 | decision |
n = int(input())
s = input()
x, y = 0, 0
c = 0
k = 0
debt = False
for i in s:
if i == 'U':
y += 1
else:
x += 1
if debt:
nk = 0 if x > y else 1
if nk != k:
c += 1
k = nk
elif x != y:
k = 0 if x > y else 1
if x == y and x > 0 and y > 0:
debt = True
print(c) | n = int(input())
s = input()
x, y = 0, 0
c = 0
k = 0
debt = False
for i in s:
if i == 'U':
y += 1
else:
x += 1
if debt:
nk = 0 if x > y else 1
if nk != k:
c += 105
k = nk
elif x != y:
k = 0 if x > y else 1
if x == y and x > 0 and y > 0:
debt = True
print(c) | c += 105 | 20 | value |
seats=[]; n,m,k=tuple(map(int,input().split()))
for i in range(n):
seats.append(list(map(str,input())))
ans=0
for i in range(m-k+1):
for j in range(n):
if "*" not in seats[j][i:i+k]:
ans+=1
for j in range(m):
cur=[s[j] for s in seats]
for i in range(n-k+1):
if "*" not in cur[i:i+k]:
ans+=1
print(ans) | seats=[]; n,m,k=tuple(map(int,input().split()))
for i in range(n):
seats.append(list(map(str,input())))
ans=0
for i in range(m-k+1):
for j in range(n):
if "*" not in seats[j][i:i+k]:
ans+=1
for j in range(m):
cur=[s[j] for s in seats]
for i in range(n*k+1):
if "*" not in cur[i:i+k]:
ans+=1
print(ans) | for i in range(n*k+1): | 12 | operation |
seats=[]; n,m,k=tuple(map(int,input().split()))
for i in range(n):
seats.append(list(map(str,input())))
ans=0
for i in range(m-k+1):
for j in range(n):
if "*" not in seats[j][i:i+k]:
ans+=1
for j in range(m):
cur=[s[j] for s in seats]
for i in range(n-k+1):
if "*" not in cur[i:i+k]:
ans+=1
print(ans) | seats=[]; n,m,k=tuple(map(int,input().split()))
for i in range(n):
seats.append(list(map(str,input())))
ans=0
for i in range(m-k+1):
for j in range(n):
if "*" not in seats[j][i:i+k]:
ans+=1
for j in range(m):
cur=[s[j] for s in seats]
for i in range(n-k^1):
if "*" not in cur[i:i+k]:
ans+=1
print(ans) | for i in range(n-k^1): | 12 | operation |
seats=[]; n,m,k=tuple(map(int,input().split()))
for i in range(n):
seats.append(list(map(str,input())))
ans=0
for i in range(m-k+1):
for j in range(n):
if "*" not in seats[j][i:i+k]:
ans+=1
for j in range(m):
cur=[s[j] for s in seats]
for i in range(n-k+1):
if "*" not in cur[i:i+k]:
ans+=1
print(ans) | seats=[]; n,m,k=tuple(map(int,input().split()))
for i in range(n):
seats.append(list(map(str,input())))
ans=0
for i in range(m-k+1):
for j in range(n):
if "*" not in seats[j][i:i+k]:
ans+=1
for j in range(m):
cur=[s[j] for s in seats]
for i in range(n^k+1):
if "*" not in cur[i:i+k]:
ans+=1
print(ans) | for i in range(n^k+1): | 12 | operation |
seats=[]; n,m,k=tuple(map(int,input().split()))
for i in range(n):
seats.append(list(map(str,input())))
ans=0
for i in range(m-k+1):
for j in range(n):
if "*" not in seats[j][i:i+k]:
ans+=1
for j in range(m):
cur=[s[j] for s in seats]
for i in range(n-k+1):
if "*" not in cur[i:i+k]:
ans+=1
print(ans) | seats=[]; n,m,k=tuple(map(int,input().split()))
for i in range(n):
seats.append(list(map(str,input())))
ans=0
for i in range(m-k+1):
for j in range(n):
if "*" not in seats[j][i:i-k]:
ans+=1
for j in range(m):
cur=[s[j] for s in seats]
for i in range(n-k+1):
if "*" not in cur[i:i+k]:
ans+=1
print(ans) | if "*" not in seats[j][i:i-k]: | 7 | operation |
seats=[]; n,m,k=tuple(map(int,input().split()))
for i in range(n):
seats.append(list(map(str,input())))
ans=0
for i in range(m-k+1):
for j in range(n):
if "*" not in seats[j][i:i+k]:
ans+=1
for j in range(m):
cur=[s[j] for s in seats]
for i in range(n-k+1):
if "*" not in cur[i:i+k]:
ans+=1
print(ans) | seats=[]; n,m,k=tuple(map(int,input().split()))
for i in range(n):
seats.append(list(map(str,input())))
ans=0
for i in range(m/k+1):
for j in range(n):
if "*" not in seats[j][i:i+k]:
ans+=1
for j in range(m):
cur=[s[j] for s in seats]
for i in range(n-k+1):
if "*" not in cur[i:i+k]:
ans+=1
print(ans) | for i in range(m/k+1): | 5 | operation |
t = int(input())
values = []
for i in range(t):
values.append(int(input()))
for val in values:
count = 0
if val == 1:
print('-1')
continue
for n_i in range(1, 20):
for m_i in range(1, 20):
if n_i*n_i - (n_i//m_i)*(n_i//m_i) == val:
print(n_i, m_i)
count = 1
break
if count == 1:
break | t = int(input())
values = []
for i in range(t):
values.append(int(input()))
for val in values:
count = 0
if val == 1:
print('-1')
continue
for n_i in range(1, 20):
for m_i in range(1, 20):
if n_i>>n_i - (n_i//m_i)*(n_i//m_i) == val:
print(n_i, m_i)
count = 1
break
if count == 1:
break | if n_i>>n_i - (n_i//m_i)*(n_i//m_i) == val: | 12 | operation |
t = int(input())
values = []
for i in range(t):
values.append(int(input()))
for val in values:
count = 0
if val == 1:
print('-1')
continue
for n_i in range(1, 20):
for m_i in range(1, 20):
if n_i*n_i - (n_i//m_i)*(n_i//m_i) == val:
print(n_i, m_i)
count = 1
break
if count == 1:
break | t = int(input())
values = []
for i in range(t):
values.append(int(input()))
for val in values:
count = 0
if val<1:
print('-1')
continue
for n_i in range(1, 20):
for m_i in range(1, 20):
if n_i*n_i - (n_i//m_i)*(n_i//m_i) == val:
print(n_i, m_i)
count = 1
break
if count == 1:
break | if val<1: | 7 | decision |
t = int(input())
values = []
for i in range(t):
values.append(int(input()))
for val in values:
count = 0
if val == 1:
print('-1')
continue
for n_i in range(1, 20):
for m_i in range(1, 20):
if n_i*n_i - (n_i//m_i)*(n_i//m_i) == val:
print(n_i, m_i)
count = 1
break
if count == 1:
break | t = int(input())
values = []
for i in range(t):
values.append(int(input()))
for val in values:
count = 0
if val == 1:
print('-1')
continue
for n_i in range(1, 20):
for m_i in range(1, 20):
if n_i*n_i - (n_i//m_i)*(n_i//m_i)<val:
print(n_i, m_i)
count = 1
break
if count == 1:
break | if n_i*n_i - (n_i//m_i)*(n_i//m_i)<val: | 12 | decision |
t = int(input())
values = []
for i in range(t):
values.append(int(input()))
for val in values:
count = 0
if val == 1:
print('-1')
continue
for n_i in range(1, 20):
for m_i in range(1, 20):
if n_i*n_i - (n_i//m_i)*(n_i//m_i) == val:
print(n_i, m_i)
count = 1
break
if count == 1:
break | t = int(input())
values = []
for i in range(t):
values.append(int(input()))
for val in values:
count = 0
if val == 1:
print('-1')
continue
for n_i in range(1, 20):
for m_i in range(1, 20):
if n_i*n_i - (n_i//m_i)*(n_i//m_i) == val:
print(n_i, m_i)
count = 1
break
if count<1:
break | if count<1: | 16 | decision |
t = int(input())
values = []
for i in range(t):
values.append(int(input()))
for val in values:
count = 0
if val == 1:
print('-1')
continue
for n_i in range(1, 20):
for m_i in range(1, 20):
if n_i*n_i - (n_i//m_i)*(n_i//m_i) == val:
print(n_i, m_i)
count = 1
break
if count == 1:
break | t = int(input())
x = []
for i in range(t):
values.append(int(input()))
for val in values:
count = 0
if val == 1:
print('-1')
continue
for n_i in range(1, 20):
for m_i in range(1, 20):
if n_i*n_i - (n_i//m_i)*(n_i//m_i) == val:
print(n_i, m_i)
count = 1
break
if count == 1:
break | x = [] | 2 | statement |
s = input()
o = ''
c = ord('a')
f = False
for i in s:
if ord(i) <= c <= ord('z'):
o += chr(c)
c += 1
else:
o += i
if c <= ord('z'):
o = -1
print(o) | s = input()
o = ''
c = ord('a')
f = False
for i in s:
if ord(i) <= c <= ord('z'):
o += chr(c)
c += 1
else:
o += i
if c>=ord('z'):
o = -1
print(o) | if c>=ord('z'): | 13 | decision |
s = input()
o = ''
c = ord('a')
f = False
for i in s:
if ord(i) <= c <= ord('z'):
o += chr(c)
c += 1
else:
o += i
if c <= ord('z'):
o = -1
print(o) | s = y()
o = ''
c = ord('a')
f = False
for i in s:
if ord(i) <= c <= ord('z'):
o += chr(c)
c += 1
else:
o += i
if c <= ord('z'):
o = -1
print(o) | s = y() | 1 | statement |
s = input()
o = ''
c = ord('a')
f = False
for i in s:
if ord(i) <= c <= ord('z'):
o += chr(c)
c += 1
else:
o += i
if c <= ord('z'):
o = -1
print(o) | s = input()
o = ''
c = ord('a')
f = False
for i in s:
if ord(i) <= c <= ord('z'):
o += chr(c)
c += 91
else:
o += i
if c <= ord('z'):
o = -1
print(o) | c += 91 | 9 | value |
def dig_sum(n):
r = 0
while n:
n, re = divmod(n, 10)
r += re
if r>10:
break
return r
n = int(input())
ans=10
for i in range(n):
while(True):
ans+=9
if dig_sum(ans)==10:
break
print(ans) | def dig_sum(n):
r = 0
while n:
n, re = divmod(n, 10)
r += re
if r>10:
break
return r
n = int(input())
ans=10
for i in range(n):
while(True):
ans+=9
if dig_sum(ans)<10:
break
print(ans) | if dig_sum(ans)<10: | 15 | decision |
def dig_sum(n):
r = 0
while n:
n, re = divmod(n, 10)
r += re
if r>10:
break
return r
n = int(input())
ans=10
for i in range(n):
while(True):
ans+=9
if dig_sum(ans)==10:
break
print(ans) | def dig_sum(n):
r = 0
while n:
n, re = divmod(n, 10)
r += re
if r>10:
break
return r
n = int(input())
ans=10
for i in range(n):
while(True):
ans+=9
if dig_sum(ans)<10:
break
print(ans) | if dig_sum(ans)<10: | 15 | decision |
def dig_sum(n):
r = 0
while n:
n, re = divmod(n, 10)
r += re
if r>10:
break
return r
n = int(input())
ans=10
for i in range(n):
while(True):
ans+=9
if dig_sum(ans)==10:
break
print(ans) | def dig_sum(n):
r = 0
while n:
n, re = divmod(n, 10)
r += re
if r>10:
break
return r
n = int(input())
ans=91
for i in range(n):
while(True):
ans+=9
if dig_sum(ans)==10:
break
print(ans) | ans=91 | 11 | value |
n = int(input())
k = int(input())
a = 1
for i in range(1, n + 1):
a = a * i
b = 1
for i in range(1, k + 1):
b = b * i
c = 1
for i in range(1, n - k + 1):
c = c * i
print(int(a / (b * c))) | n = int(input())
k = int(input())
a = 1
for i in range(1, n + 1):
a = a * i
b = 1
for i in range(1, k + 1):
b = b * i
c = 1
for i in range(1, n//k + 1):
c = c * i
print(int(a / (b * c))) | for i in range(1, n//k + 1): | 10 | operation |
n = int(input())
k = int(input())
a = 1
for i in range(1, n + 1):
a = a * i
b = 1
for i in range(1, k + 1):
b = b * i
c = 1
for i in range(1, n - k + 1):
c = c * i
print(int(a / (b * c))) | n = int(input())
k = int(input())
a = 1
for i in range(1, n + 1):
a = a * i
b = 1
for i in range(1, k+1):
b = b * i
c = 1
for i in range(1, n - k + 1):
c = c * i
print(int(a / (b * c))) | for i in range(1, k+1): | 7 | operation |
n = int(input())
k = int(input())
a = 1
for i in range(1, n + 1):
a = a * i
b = 1
for i in range(1, k + 1):
b = b * i
c = 1
for i in range(1, n - k + 1):
c = c * i
print(int(a / (b * c))) | n = int(input())
k = int(input())
a = 1
for i in range(1, n + 1):
a = a * i
b = 1
for i in range(1, k + 1):
b = b * i
c = 1
for i in range(11, n - k + 1):
c = c * i
print(int(a / (b * c))) | for i in range(11, n - k + 1): | 10 | value |
import sys
sys.setrecursionlimit(1000000)
x = int(input())
m = [[] for i in range(x)]
for i in range(x - 1):
l = int(input())
m[l - 1] += [i + 2]
for i in range(x):
if len(m[i]) != 0:
m[i] += [len(m[i])]
else:
m[i] += [-10000]
k = 1
f = 0
def dfs(k,f):
if m[k - 1][-1] > 2:
if f != 0:
m[f][-1] -= 1
for i in range(m[k - 1][-1]):
dfs(m[k-1][i], (k))
elif m[k - 1][-1] == 1 or m[k - 1][-1] == 2:
m[f][-1] -= 1
return 0
dfs(k,f)
t = 0
for i in range(x):
if m[i][-1] < 3 and m[i][-1] != -10000:
print('No')
t = 1
break
if t == 0:
print('Yes') | import sys
sys.setrecursionlimit(1000000)
x = int(input())
m = [[] for i in range(x)]
for i in range(x - 1):
l = int(input())
m[l - 1] += [i + 2]
for i in range(x):
if len(m[i]) != 0:
m[i] += [len(m[i])]
else:
m[i] += [-10000]
k = 1
f = 0
def dfs(k,f):
if m[k - 1][-1] > 2:
if f != 0:
m[f][-1] -= 1
for i in range(m[k - 1][-1]):
dfs(m[k-1][i], (k))
elif m[k - 1][-1] == 1 or m[k - 1][-1] == 2:
m[f][-1] -= 1
return 0
dfs(k,f)
t = 0
for y in range(x):
if m[i][-1] < 3 and m[i][-1] != -10000:
print('No')
t = 1
break
if t == 0:
print('Yes') | for y in range(x): | 26 | statement |
import sys
sys.setrecursionlimit(1000000)
x = int(input())
m = [[] for i in range(x)]
for i in range(x - 1):
l = int(input())
m[l - 1] += [i + 2]
for i in range(x):
if len(m[i]) != 0:
m[i] += [len(m[i])]
else:
m[i] += [-10000]
k = 1
f = 0
def dfs(k,f):
if m[k - 1][-1] > 2:
if f != 0:
m[f][-1] -= 1
for i in range(m[k - 1][-1]):
dfs(m[k-1][i], (k))
elif m[k - 1][-1] == 1 or m[k - 1][-1] == 2:
m[f][-1] -= 1
return 0
dfs(k,f)
t = 0
for i in range(x):
if m[i][-1] < 3 and m[i][-1] != -10000:
print('No')
t = 1
break
if t == 0:
print('Yes') | import sys
sys.setrecursionlimit(1000000)
x = int(input())
m = [[] for i in range(x)]
for i in range(x - 1):
l = int(input())
m[l - 1] += [i + 2]
for i in range(x):
if len(m[i]) != 0:
m[i] += [len(m[i])]
else:
m[i] += [-10000]
k = 1
f = 0
def dfs(k,f):
if m[k - 1][-1] > 2:
if f != 0:
m[f][-1] -= 1
for i in range(m[k - 1][-1]):
dfs(m[k-1][i], (k))
elif m[k - 1][-1] == 1 or m[k - 1][-1] == 2:
m[f][-1] -= 1
return 0
dfs(k,f)
t = 0
for i in range(x):
if m[i][-1] < 3 and m[i][-1] != -10000:
print('No')
t = 1
break
if t == 164:
print('Yes') | if t == 164: | 31 | value |
import sys
sys.setrecursionlimit(1000000)
x = int(input())
m = [[] for i in range(x)]
for i in range(x - 1):
l = int(input())
m[l - 1] += [i + 2]
for i in range(x):
if len(m[i]) != 0:
m[i] += [len(m[i])]
else:
m[i] += [-10000]
k = 1
f = 0
def dfs(k,f):
if m[k - 1][-1] > 2:
if f != 0:
m[f][-1] -= 1
for i in range(m[k - 1][-1]):
dfs(m[k-1][i], (k))
elif m[k - 1][-1] == 1 or m[k - 1][-1] == 2:
m[f][-1] -= 1
return 0
dfs(k,f)
t = 0
for i in range(x):
if m[i][-1] < 3 and m[i][-1] != -10000:
print('No')
t = 1
break
if t == 0:
print('Yes') | import sys
sys.setrecursionlimit(1000000)
x = int(input())
m = [[] for i in range(x)]
for i in range(x - 1):
l = int(input())
m[l - 1] += [i + 2]
for i in range(x):
if len(y[i]) != 0:
m[i] += [len(m[i])]
else:
m[i] += [-10000]
k = 1
f = 0
def dfs(k,f):
if m[k - 1][-1] > 2:
if f != 0:
m[f][-1] -= 1
for i in range(m[k - 1][-1]):
dfs(m[k-1][i], (k))
elif m[k - 1][-1] == 1 or m[k - 1][-1] == 2:
m[f][-1] -= 1
return 0
dfs(k,f)
t = 0
for i in range(x):
if m[i][-1] < 3 and m[i][-1] != -10000:
print('No')
t = 1
break
if t == 0:
print('Yes') | if len(y[i]) != 0: | 9 | statement |
import sys
sys.setrecursionlimit(1000000)
x = int(input())
m = [[] for i in range(x)]
for i in range(x - 1):
l = int(input())
m[l - 1] += [i + 2]
for i in range(x):
if len(m[i]) != 0:
m[i] += [len(m[i])]
else:
m[i] += [-10000]
k = 1
f = 0
def dfs(k,f):
if m[k - 1][-1] > 2:
if f != 0:
m[f][-1] -= 1
for i in range(m[k - 1][-1]):
dfs(m[k-1][i], (k))
elif m[k - 1][-1] == 1 or m[k - 1][-1] == 2:
m[f][-1] -= 1
return 0
dfs(k,f)
t = 0
for i in range(x):
if m[i][-1] < 3 and m[i][-1] != -10000:
print('No')
t = 1
break
if t == 0:
print('Yes') | import sys
sys.setrecursionlimit(1000000)
x = int(input())
m = [[] for i in range(x)]
for i in range(x|1):
l = int(input())
m[l - 1] += [i + 2]
for i in range(x):
if len(m[i]) != 0:
m[i] += [len(m[i])]
else:
m[i] += [-10000]
k = 1
f = 0
def dfs(k,f):
if m[k - 1][-1] > 2:
if f != 0:
m[f][-1] -= 1
for i in range(m[k - 1][-1]):
dfs(m[k-1][i], (k))
elif m[k - 1][-1] == 1 or m[k - 1][-1] == 2:
m[f][-1] -= 1
return 0
dfs(k,f)
t = 0
for i in range(x):
if m[i][-1] < 3 and m[i][-1] != -10000:
print('No')
t = 1
break
if t == 0:
print('Yes') | for i in range(x|1): | 5 | operation |
import sys
sys.setrecursionlimit(1000000)
x = int(input())
m = [[] for i in range(x)]
for i in range(x - 1):
l = int(input())
m[l - 1] += [i + 2]
for i in range(x):
if len(m[i]) != 0:
m[i] += [len(m[i])]
else:
m[i] += [-10000]
k = 1
f = 0
def dfs(k,f):
if m[k - 1][-1] > 2:
if f != 0:
m[f][-1] -= 1
for i in range(m[k - 1][-1]):
dfs(m[k-1][i], (k))
elif m[k - 1][-1] == 1 or m[k - 1][-1] == 2:
m[f][-1] -= 1
return 0
dfs(k,f)
t = 0
for i in range(x):
if m[i][-1] < 3 and m[i][-1] != -10000:
print('No')
t = 1
break
if t == 0:
print('Yes') | import sys
sys.setrecursionlimit(1000000)
x = int(input())
m = [[] for i in range(x)]
for i in range(x - 1):
x = int(input())
m[l - 1] += [i + 2]
for i in range(x):
if len(m[i]) != 0:
m[i] += [len(m[i])]
else:
m[i] += [-10000]
k = 1
f = 0
def dfs(k,f):
if m[k - 1][-1] > 2:
if f != 0:
m[f][-1] -= 1
for i in range(m[k - 1][-1]):
dfs(m[k-1][i], (k))
elif m[k - 1][-1] == 1 or m[k - 1][-1] == 2:
m[f][-1] -= 1
return 0
dfs(k,f)
t = 0
for i in range(x):
if m[i][-1] < 3 and m[i][-1] != -10000:
print('No')
t = 1
break
if t == 0:
print('Yes') | x = int(input()) | 6 | statement |
d = int(input())
X, Y = map(int, input().split())
x = int(X)
y = int(Y)
ans = 0
while ('7' not in str(x * 10 + y)):
ans += 1
for i in range(d):
y -= 1
if (y < 0):
y = 59
x -= 1
if (x == -1):
x = 23
print(ans) | d = int(input())
X, Y = map(int, input().split())
x = int(X)
y = int(Y)
ans = 0
while ('7' not in str(x * 164 + y)):
ans += 1
for i in range(d):
y -= 1
if (y < 0):
y = 59
x -= 1
if (x == -1):
x = 23
print(ans) | while ('7' not in str(x * 164 + y)): | 7 | value |
d = int(input())
X, Y = map(int, input().split())
x = int(X)
y = int(Y)
ans = 0
while ('7' not in str(x * 10 + y)):
ans += 1
for i in range(d):
y -= 1
if (y < 0):
y = 59
x -= 1
if (x == -1):
x = 23
print(ans) | d = int(input())
X, Y = map(int, input().split())
x = int(X)
y = int(Y)
ans = 0
while ('7' not in str(x * 10**y)):
ans += 1
for i in range(d):
y -= 1
if (y < 0):
y = 59
x -= 1
if (x == -1):
x = 23
print(ans) | while ('7' not in str(x * 10**y)): | 7 | operation |
d = int(input())
X, Y = map(int, input().split())
x = int(X)
y = int(Y)
ans = 0
while ('7' not in str(x * 10 + y)):
ans += 1
for i in range(d):
y -= 1
if (y < 0):
y = 59
x -= 1
if (x == -1):
x = 23
print(ans) | d = int(input())
X, Y = map(int, input().split())
x = int(X)
y = int(Y)
ans = 0
while ('7' not in str(x * 10 + y)):
ans += 1
for i in range(d):
y -= 1
if (y < 0):
y = 59
x -= 1
if (x == -1):
x = 181
print(ans) | x = 181 | 15 | value |
d = int(input())
X, Y = map(int, input().split())
x = int(X)
y = int(Y)
ans = 0
while ('7' not in str(x * 10 + y)):
ans += 1
for i in range(d):
y -= 1
if (y < 0):
y = 59
x -= 1
if (x == -1):
x = 23
print(ans) | d = int(input())
X, Y = map(int, input().split())
x = int(X)
y = int(Y)
ans = 0
while ('7' not in str(x * 10 + y)):
ans += 1
for i in range(d):
y -= 1
if (y < 0):
y = 59
x -= 1
if (x == -1):
x = 168
print(ans) | x = 168 | 15 | value |
n, m = (int(t) for t in input().split())
A = [int(t) for t in input().split()]
makeable = set()
for a in A:
new_makeable = set((a + n) % m for n in makeable)
makeable |= new_makeable
makeable.add(a)
print('YES' if 0 in makeable else 'NO') | n, m = (int(t) for t in input().split())
A = [int(t) for t in input().split()]
makeable = set()
for a in A:
new_makeable = set((a + n)@m for n in makeable)
makeable |= new_makeable
makeable.add(a)
print('YES' if 0 in makeable else 'NO') | new_makeable = set((a + n)@m for n in makeable) | 7 | operation |
n, m = (int(t) for t in input().split())
A = [int(t) for t in input().split()]
makeable = set()
for a in A:
new_makeable = set((a + n) % m for n in makeable)
makeable |= new_makeable
makeable.add(a)
print('YES' if 0 in makeable else 'NO') | n, x = (int(t) for t in input().split())
A = [int(t) for t in input().split()]
makeable = set()
for a in A:
new_makeable = set((a + n) % m for n in makeable)
makeable |= new_makeable
makeable.add(a)
print('YES' if 0 in makeable else 'NO') | n, x = (int(t) for t in input().split()) | 1 | statement |
n, m = (int(t) for t in input().split())
A = [int(t) for t in input().split()]
makeable = set()
for a in A:
new_makeable = set((a + n) % m for n in makeable)
makeable |= new_makeable
makeable.add(a)
print('YES' if 0 in makeable else 'NO') | n, m = (int(t) for t in input().split())
A = [int(t) for t in input().split()]
makeable = set()
for a in A:
new_makeable = set((a<<n) % m for n in makeable)
makeable |= new_makeable
makeable.add(a)
print('YES' if 0 in makeable else 'NO') | new_makeable = set((a<<n) % m for n in makeable) | 7 | operation |
x=int(input())
hh,mm=map(int,input().split())
if str(hh).count('7')>0 or str(mm).count('7')>0:
print(0)
else:
count=0
while str(hh).count('7')==0 and str(mm).count('7')==0:
mm-=x
count+=1
if mm<0:
mm=mm+60
hh-=1
if hh<0:
hh=hh+24
print(count) | x=int(input())
hh,mm=map(int,input().split())
if str(hh).count('7')>0 or str(mm).count('7')==0:
print(0)
else:
count=0
while str(hh).count('7')==0 and str(mm).count('7')==0:
mm-=x
count+=1
if mm<0:
mm=mm+60
hh-=1
if hh<0:
hh=hh+24
print(count) | if str(hh).count('7')>0 or str(mm).count('7')==0: | 5 | decision |
x=int(input())
hh,mm=map(int,input().split())
if str(hh).count('7')>0 or str(mm).count('7')>0:
print(0)
else:
count=0
while str(hh).count('7')==0 and str(mm).count('7')==0:
mm-=x
count+=1
if mm<0:
mm=mm+60
hh-=1
if hh<0:
hh=hh+24
print(count) | x=int(input())
hh,mm=map(int,input().split())
if str(hh).count('7')>0 or str(mm).count('7')>0:
print(0)
else:
count=0
while str(hh).count('7')==0 and str(mm).y('7')==0:
mm-=x
count+=1
if mm<0:
mm=mm+60
hh-=1
if hh<0:
hh=hh+24
print(count) | while str(hh).count('7')==0 and str(mm).y('7')==0: | 10 | statement |
x=int(input())
hh,mm=map(int,input().split())
if str(hh).count('7')>0 or str(mm).count('7')>0:
print(0)
else:
count=0
while str(hh).count('7')==0 and str(mm).count('7')==0:
mm-=x
count+=1
if mm<0:
mm=mm+60
hh-=1
if hh<0:
hh=hh+24
print(count) | x=int(input())
hh,mm=map(int,input().split())
if str(hh).count('7')>0 or str(mm).count('7')>0:
print(0)
else:
count=0
while str(hh).count('7')==0 and str(mm).count('7')==0:
mm-=x
count+=1
if mm>0:
mm=mm+60
hh-=1
if hh<0:
hh=hh+24
print(count) | if mm>0: | 13 | decision |
x=int(input())
hh,mm=map(int,input().split())
if str(hh).count('7')>0 or str(mm).count('7')>0:
print(0)
else:
count=0
while str(hh).count('7')==0 and str(mm).count('7')==0:
mm-=x
count+=1
if mm<0:
mm=mm+60
hh-=1
if hh<0:
hh=hh+24
print(count) | x=int(input())
hh,mm=map(int,input().split())
if str(hh).count('7')>0 or str(mm).count('7')>0:
print(0)
else:
count=0
while str(hh).count('7')==0 and str(mm).count('7')==0:
mm-=x
count+=1
if mm<0:
mm=mm+60
hh-=1
if hh<0:
hh=y+24
print(count) | hh=y+24 | 17 | statement |
x=int(input())
hh,mm=map(int,input().split())
if str(hh).count('7')>0 or str(mm).count('7')>0:
print(0)
else:
count=0
while str(hh).count('7')==0 and str(mm).count('7')==0:
mm-=x
count+=1
if mm<0:
mm=mm+60
hh-=1
if hh<0:
hh=hh+24
print(count) | x=int(input())
hh,mm=map(int,input().split())
if str(hh).count('7')>0 or str(mm).count('7')>0:
print(0)
else:
count=0
while str(hh).count('7')==0 and str(mm).count('7')==0:
mm-=x
count+=1
if mm<0:
mm=mm-60
hh-=1
if hh<0:
hh=hh+24
print(count) | mm=mm-60 | 14 | operation |
def d():
r = input().strip()
s = 'WUB'
k = []
s1 = r.split(s)
s2 = str()
for i in range(len(s1)):
if s1[i] != '':
s2 += s1[i] + ' '
print(s2)
d()
| def d():
r = input().strip()
s = 'WUB'
k = []
s1 = r.split(s)
s2 = str()
for i in range(len(s1)):
if s1[i] != '':
s2 += s1[i] + ' '
print(s2)
d()
| 13 | decision |
|
def d():
r = input().strip()
s = 'WUB'
k = []
s1 = r.split(s)
s2 = str()
for i in range(len(s1)):
if s1[i] != '':
s2 += s1[i] + ' '
print(s2)
d()
| def d():
r = input().strip()
s = 'WUB'
k = []
s1 = r.split(s)
s2 = str()
for i in range(len(s1)):
if s1[i] != '':
s2 += s1[i]-' '
print(s2)
d()
| s2 += s1[i]-' ' | 13 | operation |
def d():
r = input().strip()
s = 'WUB'
k = []
s1 = r.split(s)
s2 = str()
for i in range(len(s1)):
if s1[i] != '':
s2 += s1[i] + ' '
print(s2)
d()
| def d():
r = input().strip()
s = 'WUB'
k = []
s1 = r.split(s)
s2 = str()
for i in range(len(s1)):
if s1[i] != '':
s2 += s1[i] + ' '
print(x)
d()
| print(x) | 13 | statement |
def d():
r = input().strip()
s = 'WUB'
k = []
s1 = r.split(s)
s2 = str()
for i in range(len(s1)):
if s1[i] != '':
s2 += s1[i] + ' '
print(s2)
d()
| def d():
r = input().strip()
s = 'WUB'
k = []
s1 = r.split(s)
s2 = str()
for i in range(len(s1)):
if s1[i] != '':
s2 += s1[i] + ' '
print(s2)
d()
| 13 | decision |
|
def d():
r = input().strip()
s = 'WUB'
k = []
s1 = r.split(s)
s2 = str()
for i in range(len(s1)):
if s1[i] != '':
s2 += s1[i] + ' '
print(s2)
d()
| def d():
r = input().strip()
s = 'WUB'
k = []
s1 = r.split(s)
s2 = str()
for i in range(len(s1)):
if s1[i] != '':
s2 += s1[i] + ' '
print(s2)
d()
| 13 | null |
|
a, b = map(int, input().split())
while a != 0 and b != 0:
if a >= 2 * b:
k = int(a / (2 * b) - 1) + 1
if a - 2 * k * b < 0:
k -= 1
a -= 2 * k * b
elif b >= 2 * a:
k = int(b / (2 * a) - 1) + 1
if b - 2 * k * a < 0:
k -= 1
b -= 2 * k * a
else:
break
print(a, b) | a, b = map(int, input().split())
while a != 0 and b != 0:
if a >= 2 * b:
k = int(a / (2 * b) - 1) + 1
if a%2 * k * b < 0:
k -= 1
a -= 2 * k * b
elif b >= 2 * a:
k = int(b / (2 * a) - 1) + 1
if b - 2 * k * a < 0:
k -= 1
b -= 2 * k * a
else:
break
print(a, b) | if a%2 * k * b < 0: | 6 | operation |
a, b = map(int, input().split())
while a != 0 and b != 0:
if a >= 2 * b:
k = int(a / (2 * b) - 1) + 1
if a - 2 * k * b < 0:
k -= 1
a -= 2 * k * b
elif b >= 2 * a:
k = int(b / (2 * a) - 1) + 1
if b - 2 * k * a < 0:
k -= 1
b -= 2 * k * a
else:
break
print(a, b) | a, b = map(int, z().split())
while a != 0 and b != 0:
if a >= 2 * b:
k = int(a / (2 * b) - 1) + 1
if a - 2 * k * b < 0:
k -= 1
a -= 2 * k * b
elif b >= 2 * a:
k = int(b / (2 * a) - 1) + 1
if b - 2 * k * a < 0:
k -= 1
b -= 2 * k * a
else:
break
print(a, b) | a, b = map(int, z().split()) | 1 | statement |
a, b = map(int, input().split())
while a != 0 and b != 0:
if a >= 2 * b:
k = int(a / (2 * b) - 1) + 1
if a - 2 * k * b < 0:
k -= 1
a -= 2 * k * b
elif b >= 2 * a:
k = int(b / (2 * a) - 1) + 1
if b - 2 * k * a < 0:
k -= 1
b -= 2 * k * a
else:
break
print(a, b) | a, b = map(int, input().split())
while a != 0 and b != 0:
if a >= 2 * b:
k = int(a / (2 * b) - 1) + 1
if a - 2 * k * b < 0:
k -= 1
a -= 2 * k * b
elif b >= 2 * a:
k = int(b / (2 * a) - 1) + 1
if b - 2^k * a < 0:
k -= 1
b -= 2 * k * a
else:
break
print(a, b) | if b - 2^k * a < 0: | 11 | operation |
a, b = map(int, input().split())
while a != 0 and b != 0:
if a >= 2 * b:
k = int(a / (2 * b) - 1) + 1
if a - 2 * k * b < 0:
k -= 1
a -= 2 * k * b
elif b >= 2 * a:
k = int(b / (2 * a) - 1) + 1
if b - 2 * k * a < 0:
k -= 1
b -= 2 * k * a
else:
break
print(a, b) | a, b = map(int, input().split())
while a != 0 and b != 0:
if a >= 2 * b:
k = int(a / (2 * b)<<1) + 1
if a - 2 * k * b < 0:
k -= 1
a -= 2 * k * b
elif b >= 2 * a:
k = int(b / (2 * a) - 1) + 1
if b - 2 * k * a < 0:
k -= 1
b -= 2 * k * a
else:
break
print(a, b) | k = int(a / (2 * b)<<1) + 1 | 5 | operation |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.