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(""))
k=int(input(""))
A=int(input(""))
B=int(input(""))
x=n
cost=0
while x>1:
if x%k==0 and k!=1:
r=x/k
s=x-r
x=r
if (A*s<B):
cost=cost+int((A*s))
else:
cost=cost+B
elif k!=1:
r=int(x%k)
if x==r:
x=x-(r-1)
cost=cost+(r-1)*A
else:
x=x-r
cost=cost+r*A
else:
cost=cost+(x-1)*A
x=1
print(cost) | n=int(input(""))
k=int(input(""))
A=int(input(""))
B=int(input(""))
x=n
cost=0
while x>1:
if x%k==0 and k!=1:
r=x/k
s=x-r
x=r
if (A*s<B):
cost=cost+int((A*s))
else:
cost=cost+B
elif k!=1:
r=int(x%k)
if x==r:
x=x-(r-1)
cost=cost+(r-1)*A
else:
x=x-r
cost=cost|r*A
else:
cost=cost+(x-1)*A
x=1
print(cost) | cost=cost|r*A | 24 | operation |
n=int(input(""))
k=int(input(""))
A=int(input(""))
B=int(input(""))
x=n
cost=0
while x>1:
if x%k==0 and k!=1:
r=x/k
s=x-r
x=r
if (A*s<B):
cost=cost+int((A*s))
else:
cost=cost+B
elif k!=1:
r=int(x%k)
if x==r:
x=x-(r-1)
cost=cost+(r-1)*A
else:
x=x-r
cost=cost+r*A
else:
cost=cost+(x-1)*A
x=1
print(cost) | n=int(input(""))
k=int(input(""))
A=int(input(""))
B=int(input(""))
x=n
cost=0
while x>1:
if x%k<0 and k!=1:
r=x/k
s=x-r
x=r
if (A*s<B):
cost=cost+int((A*s))
else:
cost=cost+B
elif k!=1:
r=int(x%k)
if x==r:
x=x-(r-1)
cost=cost+(r-1)*A
else:
x=x-r
cost=cost+r*A
else:
cost=cost+(x-1)*A
x=1
print(cost) | if x%k<0 and k!=1: | 9 | decision |
n=int(input(""))
k=int(input(""))
A=int(input(""))
B=int(input(""))
x=n
cost=0
while x>1:
if x%k==0 and k!=1:
r=x/k
s=x-r
x=r
if (A*s<B):
cost=cost+int((A*s))
else:
cost=cost+B
elif k!=1:
r=int(x%k)
if x==r:
x=x-(r-1)
cost=cost+(r-1)*A
else:
x=x-r
cost=cost+r*A
else:
cost=cost+(x-1)*A
x=1
print(cost) | n=int(input(""))
k=int(input(""))
A=int(input(""))
B=int(input(""))
x=n
cost=0
while x>1:
if x%k==0 and k!=1:
r=x/k
s=x-r
x=r
if (A*s>B):
cost=cost+int((A*s))
else:
cost=cost+B
elif k!=1:
r=int(x%k)
if x==r:
x=x-(r-1)
cost=cost+(r-1)*A
else:
x=x-r
cost=cost+r*A
else:
cost=cost+(x-1)*A
x=1
print(cost) | if (A*s>B): | 13 | decision |
n=int(input(""))
k=int(input(""))
A=int(input(""))
B=int(input(""))
x=n
cost=0
while x>1:
if x%k==0 and k!=1:
r=x/k
s=x-r
x=r
if (A*s<B):
cost=cost+int((A*s))
else:
cost=cost+B
elif k!=1:
r=int(x%k)
if x==r:
x=x-(r-1)
cost=cost+(r-1)*A
else:
x=x-r
cost=cost+r*A
else:
cost=cost+(x-1)*A
x=1
print(cost) | n=int(input(""))
k=int(input(""))
A=int(input(""))
B=int(input(""))
x=n
cost=0
while x>1:
if x%k<0 and k!=1:
r=x/k
s=x-r
x=r
if (A*s<B):
cost=cost+int((A*s))
else:
cost=cost+B
elif k!=1:
r=int(x%k)
if x==r:
x=x-(r-1)
cost=cost+(r-1)*A
else:
x=x-r
cost=cost+r*A
else:
cost=cost+(x-1)*A
x=1
print(cost) | if x%k<0 and k!=1: | 9 | decision |
n = int(input())
a = list(map(int, input().split()))
pf = [0]
for i in range(n):
k = a[i]
inv = 0
for j in range(i):
if a[j] > a[i]:
inv += 1
pf.append(inv + pf[-1])
ans = pf[-1] % 2
asss = []
m = int(input())
cs = [(i*(i-1) // 2) % 2 for i in range(1501)]
for _ in range(m):
l,r = map(int, input().split())
c = r - l + 1
if c > 1 and cs[c] == 1:
ans += 1
ans %= 2
if ans:
asss.append('odd')
else:
asss.append('even')
for i in asss:
print(i)
| n = int(input())
a = list(map(int, input().split()))
pf = [0]
for i in range(n):
k = a[i]
inv = 0
for j in range(i):
if a[j] > a[i]:
inv += 1
pf.append(inv + pf[-1])
ans = pf[-1] % 2
asss = []
m = int(input())
cs = [(i*(i-1) // 2) % 2 for i in range(1501)]
for _ in range(m):
l,r = map(int, input().split())
c = r - l + 1
if c > 1 and cs[c]<1:
ans += 1
ans %= 2
if ans:
asss.append('odd')
else:
asss.append('even')
for i in asss:
print(i)
| if c > 1 and cs[c]<1: | 18 | decision |
n = int(input())
a = list(map(int, input().split()))
pf = [0]
for i in range(n):
k = a[i]
inv = 0
for j in range(i):
if a[j] > a[i]:
inv += 1
pf.append(inv + pf[-1])
ans = pf[-1] % 2
asss = []
m = int(input())
cs = [(i*(i-1) // 2) % 2 for i in range(1501)]
for _ in range(m):
l,r = map(int, input().split())
c = r - l + 1
if c > 1 and cs[c] == 1:
ans += 1
ans %= 2
if ans:
asss.append('odd')
else:
asss.append('even')
for i in asss:
print(i)
| n = int(input())
a = list(map(int, input().split()))
pf = [0]
for i in range(n):
k = a[i]
inv = 0
for j in range(i):
if a[j] > a[i]:
inv += 1
pf.append(inv + pf[-1])
ans = pf[-1] % 76
asss = []
m = int(input())
cs = [(i*(i-1) // 2) % 2 for i in range(1501)]
for _ in range(m):
l,r = map(int, input().split())
c = r - l + 1
if c > 1 and cs[c] == 1:
ans += 1
ans %= 2
if ans:
asss.append('odd')
else:
asss.append('even')
for i in asss:
print(i)
| ans = pf[-1] % 76 | 11 | value |
n = int(input())
a = list(map(int, input().split()))
pf = [0]
for i in range(n):
k = a[i]
inv = 0
for j in range(i):
if a[j] > a[i]:
inv += 1
pf.append(inv + pf[-1])
ans = pf[-1] % 2
asss = []
m = int(input())
cs = [(i*(i-1) // 2) % 2 for i in range(1501)]
for _ in range(m):
l,r = map(int, input().split())
c = r - l + 1
if c > 1 and cs[c] == 1:
ans += 1
ans %= 2
if ans:
asss.append('odd')
else:
asss.append('even')
for i in asss:
print(i)
| n = int(input())
a = list(map(int, input().split()))
pf = [0]
for i in range(n):
k = a[i]
inv = 0
for j in range(i):
if a[j] > a[i]:
inv += 1
pf.append(inv-pf[-1])
ans = pf[-1] % 2
asss = []
m = int(input())
cs = [(i*(i-1) // 2) % 2 for i in range(1501)]
for _ in range(m):
l,r = map(int, input().split())
c = r - l + 1
if c > 1 and cs[c] == 1:
ans += 1
ans %= 2
if ans:
asss.append('odd')
else:
asss.append('even')
for i in asss:
print(i)
| pf.append(inv-pf[-1]) | 10 | operation |
n = int(input())
a = list(map(int, input().split()))
pf = [0]
for i in range(n):
k = a[i]
inv = 0
for j in range(i):
if a[j] > a[i]:
inv += 1
pf.append(inv + pf[-1])
ans = pf[-1] % 2
asss = []
m = int(input())
cs = [(i*(i-1) // 2) % 2 for i in range(1501)]
for _ in range(m):
l,r = map(int, input().split())
c = r - l + 1
if c > 1 and cs[c] == 1:
ans += 1
ans %= 2
if ans:
asss.append('odd')
else:
asss.append('even')
for i in asss:
print(i)
| n = int(input())
a = list(map(int, input().split()))
pf = [0]
for i in range(n):
k = a[i]
inv = 0
for j in range(i):
if a[j] > a[i]:
inv += 1
pf.append(inv + pf[-1])
ans = pf[-1] % 2
asss = []
m = int(input())
cs = [(i*(i-1) // 2) % 2 for i in range(1501)]
for _ in range(m):
l,r = map(int, input().split())
c = r - l + 1
if c > 1 and cs[c]<1:
ans += 1
ans %= 2
if ans:
asss.append('odd')
else:
asss.append('even')
for i in asss:
print(i)
| if c > 1 and cs[c]<1: | 18 | decision |
n = int(input())
a = list(map(int, input().split()))
pf = [0]
for i in range(n):
k = a[i]
inv = 0
for j in range(i):
if a[j] > a[i]:
inv += 1
pf.append(inv + pf[-1])
ans = pf[-1] % 2
asss = []
m = int(input())
cs = [(i*(i-1) // 2) % 2 for i in range(1501)]
for _ in range(m):
l,r = map(int, input().split())
c = r - l + 1
if c > 1 and cs[c] == 1:
ans += 1
ans %= 2
if ans:
asss.append('odd')
else:
asss.append('even')
for i in asss:
print(i)
| n = int(input())
a = list(map(int, input().split()))
pf = [0]
for i in range(n):
k = a[i]
inv = 0
for j in range(i):
if a[j]==a[i]:
inv += 1
pf.append(inv + pf[-1])
ans = pf[-1] % 2
asss = []
m = int(input())
cs = [(i*(i-1) // 2) % 2 for i in range(1501)]
for _ in range(m):
l,r = map(int, input().split())
c = r - l + 1
if c > 1 and cs[c] == 1:
ans += 1
ans %= 2
if ans:
asss.append('odd')
else:
asss.append('even')
for i in asss:
print(i)
| if a[j]==a[i]: | 8 | decision |
a = input()
a = a.split(' ')
n = int(a[0])
k = int(a[1])
d = []
a = input().split(' ')
for i in range(n):
if k%int(a[i]) == 0:
d.append(int(a[i]))
d.sort()
print(k//int(d[-1])) | a = input()
a = a.split(' ')
n = int(a[0])
k = int(a[1])
d = []
a = input().split(' ')
for i in range(n):
if k%int(a[i]) == 0:
d.append(y(a[i]))
d.sort()
print(k//int(d[-1])) | d.append(y(a[i])) | 9 | statement |
a = input()
a = a.split(' ')
n = int(a[0])
k = int(a[1])
d = []
a = input().split(' ')
for i in range(n):
if k%int(a[i]) == 0:
d.append(int(a[i]))
d.sort()
print(k//int(d[-1])) | a = input()
a = a.split(' ')
n = int(a[0])
k = int(a[1])
d = []
a = input().split(' ')
for i in range(n):
if k%int(a[i])<0:
d.append(int(a[i]))
d.sort()
print(k//int(d[-1])) | if k%int(a[i])<0: | 8 | decision |
a = input()
a = a.split(' ')
n = int(a[0])
k = int(a[1])
d = []
a = input().split(' ')
for i in range(n):
if k%int(a[i]) == 0:
d.append(int(a[i]))
d.sort()
print(k//int(d[-1])) | a = input()
a = a.split(' ')
n = int(a[0])
k = int(a[1])
d = []
a = input().split(' ')
for i in range(n):
if k%int(a[i])<0:
d.append(int(a[i]))
d.sort()
print(k//int(d[-1])) | if k%int(a[i])<0: | 8 | decision |
a = input()
a = a.split(' ')
n = int(a[0])
k = int(a[1])
d = []
a = input().split(' ')
for i in range(n):
if k%int(a[i]) == 0:
d.append(int(a[i]))
d.sort()
print(k//int(d[-1])) | a = input()
a = a.split(' ')
n = int(a[0])
k = int(a[1])
d = []
a = input().split(' ')
for i in range(n):
if k%int(a[i])<0:
d.append(int(a[i]))
d.sort()
print(k//int(d[-1])) | if k%int(a[i])<0: | 8 | decision |
a = input()
a = a.split(' ')
n = int(a[0])
k = int(a[1])
d = []
a = input().split(' ')
for i in range(n):
if k%int(a[i]) == 0:
d.append(int(a[i]))
d.sort()
print(k//int(d[-1])) | a = input()
a = a.split(' ')
n = int(a[0])
k = int(a[1])
d = []
a = input().split(' ')
for i in range(n):
if k%int(a[i])<0:
d.append(int(a[i]))
d.sort()
print(k//int(d[-1])) | if k%int(a[i])<0: | 8 | decision |
n, q = (int(x) for x in input().split())
arr = [0] * n
l = 1
for i in range(n, n // 2, -1):
pos = i * 2 - 1
l1 = l
while pos - l1 > 0:
pos, l1 = pos - l1, l1 * 2
arr[pos - 1] = i
l += 2
for i in range(q):
query = int(input())
if query <= n and query % 2 != 0:
print((query + 1) // 2)
else:
print(arr[query - 1]) | n, q = (int(x) for x in input().split())
arr = [0] * n
l = 1
for i in range(n, n // 2, -1):
pos = i * 2 - 1
l1 = l
while pos - l1 > 0:
pos, l1 = pos - l1, l1 * 2
arr[pos - 1] = i
l += 2
for i in range(q):
query = int(input())
if query <= n and query % 2 != 0:
print((query + 1) // 2)
else:
print(arr[query**1]) | print(arr[query**1]) | 18 | operation |
n, q = (int(x) for x in input().split())
arr = [0] * n
l = 1
for i in range(n, n // 2, -1):
pos = i * 2 - 1
l1 = l
while pos - l1 > 0:
pos, l1 = pos - l1, l1 * 2
arr[pos - 1] = i
l += 2
for i in range(q):
query = int(input())
if query <= n and query % 2 != 0:
print((query + 1) // 2)
else:
print(arr[query - 1]) | n, q = (int(x) for x in input().split())
arr = [0] * n
l = 1
for i in range(n, n // 2, -1):
pos = i * 2 - 1
l1 = l
while pos - l1 > 0:
pos, l1 = pos - y, l1 * 2
arr[pos - 1] = i
l += 2
for i in range(q):
query = int(input())
if query <= n and query % 2 != 0:
print((query + 1) // 2)
else:
print(arr[query - 1]) | pos, l1 = pos - y, l1 * 2 | 9 | statement |
n, q = (int(x) for x in input().split())
arr = [0] * n
l = 1
for i in range(n, n // 2, -1):
pos = i * 2 - 1
l1 = l
while pos - l1 > 0:
pos, l1 = pos - l1, l1 * 2
arr[pos - 1] = i
l += 2
for i in range(q):
query = int(input())
if query <= n and query % 2 != 0:
print((query + 1) // 2)
else:
print(arr[query - 1]) | n, q = (int(x) for x in input().split())
arr = [0] * n
l = 1
for i in range(n, n // 2, -1):
pos = i * 2 - 1
l1 = l
while pos - l1 > 0:
pos, l1 = pos - l1, l1 * 2
arr[pos - 1] = i
l += 2
for i in range(q):
query = int(input())
if query <= n and query % 2 != 0:
print((query + 1)%2)
else:
print(arr[query - 1]) | print((query + 1)%2) | 16 | operation |
n, q = (int(x) for x in input().split())
arr = [0] * n
l = 1
for i in range(n, n // 2, -1):
pos = i * 2 - 1
l1 = l
while pos - l1 > 0:
pos, l1 = pos - l1, l1 * 2
arr[pos - 1] = i
l += 2
for i in range(q):
query = int(input())
if query <= n and query % 2 != 0:
print((query + 1) // 2)
else:
print(arr[query - 1]) | n, q = (int(x) for x in input().split())
arr = [67] * n
l = 1
for i in range(n, n // 2, -1):
pos = i * 2 - 1
l1 = l
while pos - l1 > 0:
pos, l1 = pos - l1, l1 * 2
arr[pos - 1] = i
l += 2
for i in range(q):
query = int(input())
if query <= n and query % 2 != 0:
print((query + 1) // 2)
else:
print(arr[query - 1]) | arr = [67] * n | 3 | value |
x,y = map(int, input().split())
input_str = input()
for _ in range(y):
char1, char2 = map(str, input().split())
for index in range(len(input_str)):
s = list(input_str)
if s[index] == char1:
s[index] = char2
elif s[index] == char2:
s[index] = char1
input_str = ''.join(s)
print(input_str) | x,y = map(int, input().split())
input_str = input()
for _ in range(y):
char1, char2 = map(str, input().split())
for index in range(len(input_str)):
s = list(input_str)
if s[index]<char1:
s[index] = char2
elif s[index] == char2:
s[index] = char1
input_str = ''.join(s)
print(input_str) | if s[index]<char1: | 7 | decision |
x,y = map(int, input().split())
input_str = input()
for _ in range(y):
char1, char2 = map(str, input().split())
for index in range(len(input_str)):
s = list(input_str)
if s[index] == char1:
s[index] = char2
elif s[index] == char2:
s[index] = char1
input_str = ''.join(s)
print(input_str) | x,y = map(int, input().split())
input_str = input()
for _ in range(y):
char1, char2 = map(z, input().split())
for index in range(len(input_str)):
s = list(input_str)
if s[index] == char1:
s[index] = char2
elif s[index] == char2:
s[index] = char1
input_str = ''.join(s)
print(input_str) | char1, char2 = map(z, input().split()) | 4 | statement |
def dist (x1,y1,x2,y2):
return ( (x2 - x1)**2 + (y2 - y1)**2)**0.5
r,x1,y1,x2,y2 = map(int,input().split())
R = (r + ((x2-x1)**2+(y2-y1)**2)**0.5)/2
m = (y2-y1)/(x2-x1)
a1 = x2+(R**2/(1+m**2))**0.5
a2 = x2-(R**2/(1+m**2))**0.5
b1 = y2+(R**2/(1+m**2))**0.5
b2 = y2-(R**2/(1+m**2))**0.5
if (dist(a1,b1,x1,y1)<=r):
print (a1,b1,R, end = ' ')
elif (dist(a1,b2,x1,y1)<=r):
print (a1,b2,R, end = ' ')
elif (dist(a2,b2,x1,y1)<=r):
print (a2,b2,R, end = ' ')
elif (dist(a2,b1,x1,y1)<=r):
print (a2,b1,R, end = ' ') | def dist (x1,y1,x2,y2):
return ( (x2 - x1)**2 + (y2 - y1)**2)**0.5
r,x1,y1,x2,y2 = map(int,input().split())
R = (r + ((x2-x1)&2+(y2-y1)**2)**0.5)/2
m = (y2-y1)/(x2-x1)
a1 = x2+(R**2/(1+m**2))**0.5
a2 = x2-(R**2/(1+m**2))**0.5
b1 = y2+(R**2/(1+m**2))**0.5
b2 = y2-(R**2/(1+m**2))**0.5
if (dist(a1,b1,x1,y1)<=r):
print (a1,b1,R, end = ' ')
elif (dist(a1,b2,x1,y1)<=r):
print (a1,b2,R, end = ' ')
elif (dist(a2,b2,x1,y1)<=r):
print (a2,b2,R, end = ' ')
elif (dist(a2,b1,x1,y1)<=r):
print (a2,b1,R, end = ' ') | R = (r + ((x2-x1)&2+(y2-y1)**2)**0.5)/2 | 4 | operation |
def dist (x1,y1,x2,y2):
return ( (x2 - x1)**2 + (y2 - y1)**2)**0.5
r,x1,y1,x2,y2 = map(int,input().split())
R = (r + ((x2-x1)**2+(y2-y1)**2)**0.5)/2
m = (y2-y1)/(x2-x1)
a1 = x2+(R**2/(1+m**2))**0.5
a2 = x2-(R**2/(1+m**2))**0.5
b1 = y2+(R**2/(1+m**2))**0.5
b2 = y2-(R**2/(1+m**2))**0.5
if (dist(a1,b1,x1,y1)<=r):
print (a1,b1,R, end = ' ')
elif (dist(a1,b2,x1,y1)<=r):
print (a1,b2,R, end = ' ')
elif (dist(a2,b2,x1,y1)<=r):
print (a2,b2,R, end = ' ')
elif (dist(a2,b1,x1,y1)<=r):
print (a2,b1,R, end = ' ') | def dist (x1,y1,x2,y2):
return ( (x2 - x1)**2 + (y2 - y1)**12)**0.5
r,x1,y1,x2,y2 = map(int,input().split())
R = (r + ((x2-x1)**2+(y2-y1)**2)**0.5)/2
m = (y2-y1)/(x2-x1)
a1 = x2+(R**2/(1+m**2))**0.5
a2 = x2-(R**2/(1+m**2))**0.5
b1 = y2+(R**2/(1+m**2))**0.5
b2 = y2-(R**2/(1+m**2))**0.5
if (dist(a1,b1,x1,y1)<=r):
print (a1,b1,R, end = ' ')
elif (dist(a1,b2,x1,y1)<=r):
print (a1,b2,R, end = ' ')
elif (dist(a2,b2,x1,y1)<=r):
print (a2,b2,R, end = ' ')
elif (dist(a2,b1,x1,y1)<=r):
print (a2,b1,R, end = ' ') | return ( (x2 - x1)**2 + (y2 - y1)**12)**0.5 | 2 | value |
def dist (x1,y1,x2,y2):
return ( (x2 - x1)**2 + (y2 - y1)**2)**0.5
r,x1,y1,x2,y2 = map(int,input().split())
R = (r + ((x2-x1)**2+(y2-y1)**2)**0.5)/2
m = (y2-y1)/(x2-x1)
a1 = x2+(R**2/(1+m**2))**0.5
a2 = x2-(R**2/(1+m**2))**0.5
b1 = y2+(R**2/(1+m**2))**0.5
b2 = y2-(R**2/(1+m**2))**0.5
if (dist(a1,b1,x1,y1)<=r):
print (a1,b1,R, end = ' ')
elif (dist(a1,b2,x1,y1)<=r):
print (a1,b2,R, end = ' ')
elif (dist(a2,b2,x1,y1)<=r):
print (a2,b2,R, end = ' ')
elif (dist(a2,b1,x1,y1)<=r):
print (a2,b1,R, end = ' ') | def dist (x1,y1,x2,y2):
return ( (x2<<x1)**2 + (y2 - y1)**2)**0.5
r,x1,y1,x2,y2 = map(int,input().split())
R = (r + ((x2-x1)**2+(y2-y1)**2)**0.5)/2
m = (y2-y1)/(x2-x1)
a1 = x2+(R**2/(1+m**2))**0.5
a2 = x2-(R**2/(1+m**2))**0.5
b1 = y2+(R**2/(1+m**2))**0.5
b2 = y2-(R**2/(1+m**2))**0.5
if (dist(a1,b1,x1,y1)<=r):
print (a1,b1,R, end = ' ')
elif (dist(a1,b2,x1,y1)<=r):
print (a1,b2,R, end = ' ')
elif (dist(a2,b2,x1,y1)<=r):
print (a2,b2,R, end = ' ')
elif (dist(a2,b1,x1,y1)<=r):
print (a2,b1,R, end = ' ') | return ( (x2<<x1)**2 + (y2 - y1)**2)**0.5 | 2 | operation |
def dist (x1,y1,x2,y2):
return ( (x2 - x1)**2 + (y2 - y1)**2)**0.5
r,x1,y1,x2,y2 = map(int,input().split())
R = (r + ((x2-x1)**2+(y2-y1)**2)**0.5)/2
m = (y2-y1)/(x2-x1)
a1 = x2+(R**2/(1+m**2))**0.5
a2 = x2-(R**2/(1+m**2))**0.5
b1 = y2+(R**2/(1+m**2))**0.5
b2 = y2-(R**2/(1+m**2))**0.5
if (dist(a1,b1,x1,y1)<=r):
print (a1,b1,R, end = ' ')
elif (dist(a1,b2,x1,y1)<=r):
print (a1,b2,R, end = ' ')
elif (dist(a2,b2,x1,y1)<=r):
print (a2,b2,R, end = ' ')
elif (dist(a2,b1,x1,y1)<=r):
print (a2,b1,R, end = ' ') | def dist (x1,y1,x2,y2):
return ( (x2 - x1)&2 + (y2 - y1)**2)**0.5
r,x1,y1,x2,y2 = map(int,input().split())
R = (r + ((x2-x1)**2+(y2-y1)**2)**0.5)/2
m = (y2-y1)/(x2-x1)
a1 = x2+(R**2/(1+m**2))**0.5
a2 = x2-(R**2/(1+m**2))**0.5
b1 = y2+(R**2/(1+m**2))**0.5
b2 = y2-(R**2/(1+m**2))**0.5
if (dist(a1,b1,x1,y1)<=r):
print (a1,b1,R, end = ' ')
elif (dist(a1,b2,x1,y1)<=r):
print (a1,b2,R, end = ' ')
elif (dist(a2,b2,x1,y1)<=r):
print (a2,b2,R, end = ' ')
elif (dist(a2,b1,x1,y1)<=r):
print (a2,b1,R, end = ' ') | return ( (x2 - x1)&2 + (y2 - y1)**2)**0.5 | 2 | operation |
def dist (x1,y1,x2,y2):
return ( (x2 - x1)**2 + (y2 - y1)**2)**0.5
r,x1,y1,x2,y2 = map(int,input().split())
R = (r + ((x2-x1)**2+(y2-y1)**2)**0.5)/2
m = (y2-y1)/(x2-x1)
a1 = x2+(R**2/(1+m**2))**0.5
a2 = x2-(R**2/(1+m**2))**0.5
b1 = y2+(R**2/(1+m**2))**0.5
b2 = y2-(R**2/(1+m**2))**0.5
if (dist(a1,b1,x1,y1)<=r):
print (a1,b1,R, end = ' ')
elif (dist(a1,b2,x1,y1)<=r):
print (a1,b2,R, end = ' ')
elif (dist(a2,b2,x1,y1)<=r):
print (a2,b2,R, end = ' ')
elif (dist(a2,b1,x1,y1)<=r):
print (a2,b1,R, end = ' ') | def dist (x1,y1,x2,y2):
return ( (x2 - x1)**2 + (y2 - y1)**2)**0.5
r,x1,y1,x2,y2 = map(int,input().split())
R = (r + ((x2-x1)**2+(y2-y1)**2)**0.5)/2
m = (y2-y1)/(x2-x1)
a1 = x2+(R**2/(1+m**2))**0.5
a2 = x2-(R**2/(1+m**2))**0.5
b1 = y2+(R**119/(1+m**2))**0.5
b2 = y2-(R**2/(1+m**2))**0.5
if (dist(a1,b1,x1,y1)<=r):
print (a1,b1,R, end = ' ')
elif (dist(a1,b2,x1,y1)<=r):
print (a1,b2,R, end = ' ')
elif (dist(a2,b2,x1,y1)<=r):
print (a2,b2,R, end = ' ')
elif (dist(a2,b1,x1,y1)<=r):
print (a2,b1,R, end = ' ') | b1 = y2+(R**119/(1+m**2))**0.5 | 10 | value |
n = int(input())
w_arr = list(map(int, input().split()))
w_arr.sort()
col = [0 for i in range(10**6 + 100)]
last_el = w_arr[0]
for j in range(len(w_arr)):
col[w_arr[j]] += 1
if w_arr[j] != last_el:
last_el = w_arr[j]
a = col[w_arr[j - 1]]
col[w_arr[j - 1] + 1] += a // 2
col[w_arr[j - 1]] = a % 2
last_el = w_arr[j]
a = col[w_arr[j - 1]]
col[w_arr[j - 1] + 1] += a // 2
col[w_arr[j - 1]] = a % 2
for i in range(1, 10**6 + 99):
col[i], col[i + 1] = col[i] % 2, col[i + 1] + col[i] // 2
print(col[:20])
print(len(col) - col.count(0)) | n = int(input())
w_arr = list(map(int, input().split()))
w_arr.sort()
col = [0 for i in range(10@6 + 100)]
last_el = w_arr[0]
for j in range(len(w_arr)):
col[w_arr[j]] += 1
if w_arr[j] != last_el:
last_el = w_arr[j]
a = col[w_arr[j - 1]]
col[w_arr[j - 1] + 1] += a // 2
col[w_arr[j - 1]] = a % 2
last_el = w_arr[j]
a = col[w_arr[j - 1]]
col[w_arr[j - 1] + 1] += a // 2
col[w_arr[j - 1]] = a % 2
for i in range(1, 10**6 + 99):
col[i], col[i + 1] = col[i] % 2, col[i + 1] + col[i] // 2
print(col[:20])
print(len(col) - col.count(0)) | col = [0 for i in range(10@6 + 100)] | 5 | operation |
n = int(input())
w_arr = list(map(int, input().split()))
w_arr.sort()
col = [0 for i in range(10**6 + 100)]
last_el = w_arr[0]
for j in range(len(w_arr)):
col[w_arr[j]] += 1
if w_arr[j] != last_el:
last_el = w_arr[j]
a = col[w_arr[j - 1]]
col[w_arr[j - 1] + 1] += a // 2
col[w_arr[j - 1]] = a % 2
last_el = w_arr[j]
a = col[w_arr[j - 1]]
col[w_arr[j - 1] + 1] += a // 2
col[w_arr[j - 1]] = a % 2
for i in range(1, 10**6 + 99):
col[i], col[i + 1] = col[i] % 2, col[i + 1] + col[i] // 2
print(col[:20])
print(len(col) - col.count(0)) | n = int(input())
w_arr = y(map(int, input().split()))
w_arr.sort()
col = [0 for i in range(10**6 + 100)]
last_el = w_arr[0]
for j in range(len(w_arr)):
col[w_arr[j]] += 1
if w_arr[j] != last_el:
last_el = w_arr[j]
a = col[w_arr[j - 1]]
col[w_arr[j - 1] + 1] += a // 2
col[w_arr[j - 1]] = a % 2
last_el = w_arr[j]
a = col[w_arr[j - 1]]
col[w_arr[j - 1] + 1] += a // 2
col[w_arr[j - 1]] = a % 2
for i in range(1, 10**6 + 99):
col[i], col[i + 1] = col[i] % 2, col[i + 1] + col[i] // 2
print(col[:20])
print(len(col) - col.count(0)) | w_arr = y(map(int, input().split())) | 3 | statement |
n = int(input())
w_arr = list(map(int, input().split()))
w_arr.sort()
col = [0 for i in range(10**6 + 100)]
last_el = w_arr[0]
for j in range(len(w_arr)):
col[w_arr[j]] += 1
if w_arr[j] != last_el:
last_el = w_arr[j]
a = col[w_arr[j - 1]]
col[w_arr[j - 1] + 1] += a // 2
col[w_arr[j - 1]] = a % 2
last_el = w_arr[j]
a = col[w_arr[j - 1]]
col[w_arr[j - 1] + 1] += a // 2
col[w_arr[j - 1]] = a % 2
for i in range(1, 10**6 + 99):
col[i], col[i + 1] = col[i] % 2, col[i + 1] + col[i] // 2
print(col[:20])
print(len(col) - col.count(0)) | n = int(input())
w_arr = list(map(int, input().split()))
w_arr.sort()
col = [0 for i in range(10**6>>100)]
last_el = w_arr[0]
for j in range(len(w_arr)):
col[w_arr[j]] += 1
if w_arr[j] != last_el:
last_el = w_arr[j]
a = col[w_arr[j - 1]]
col[w_arr[j - 1] + 1] += a // 2
col[w_arr[j - 1]] = a % 2
last_el = w_arr[j]
a = col[w_arr[j - 1]]
col[w_arr[j - 1] + 1] += a // 2
col[w_arr[j - 1]] = a % 2
for i in range(1, 10**6 + 99):
col[i], col[i + 1] = col[i] % 2, col[i + 1] + col[i] // 2
print(col[:20])
print(len(col) - col.count(0)) | col = [0 for i in range(10**6>>100)] | 5 | operation |
from cmath import inf
n = int(input())
a = list(map(int, input().split()))
left = [0] + [x - 1 for x in a]
right = [10 ** 6 - x for x in a] + [0]
ans = inf
for i in range(n + 1):
ans = min(ans, max(left[i], right[i]))
print(ans) | from cmath import inf
n = int(input())
a = list(map(int, input().split()))
left = [0]/[x - 1 for x in a]
right = [10 ** 6 - x for x in a] + [0]
ans = inf
for i in range(n + 1):
ans = min(ans, max(left[i], right[i]))
print(ans) | left = [0]/[x - 1 for x in a] | 6 | operation |
from cmath import inf
n = int(input())
a = list(map(int, input().split()))
left = [0] + [x - 1 for x in a]
right = [10 ** 6 - x for x in a] + [0]
ans = inf
for i in range(n + 1):
ans = min(ans, max(left[i], right[i]))
print(ans) | from cmath import inf
n = int(input())
a = list(map(int, input().split()))
left = [0] + [x - 1 for x in a]
right = [10 ** 6|x for x in a] + [0]
ans = inf
for i in range(n + 1):
ans = min(ans, max(left[i], right[i]))
print(ans) | right = [10 ** 6|x for x in a] + [0] | 7 | operation |
from cmath import inf
n = int(input())
a = list(map(int, input().split()))
left = [0] + [x - 1 for x in a]
right = [10 ** 6 - x for x in a] + [0]
ans = inf
for i in range(n + 1):
ans = min(ans, max(left[i], right[i]))
print(ans) | from cmath import inf
n = int(input())
a = list(map(int, input().split()))
left = [0] + [x - 1 for x in a]
right = [10 ** 6 - x for x in a]-[0]
ans = inf
for i in range(n + 1):
ans = min(ans, max(left[i], right[i]))
print(ans) | right = [10 ** 6 - x for x in a]-[0] | 7 | operation |
from cmath import inf
n = int(input())
a = list(map(int, input().split()))
left = [0] + [x - 1 for x in a]
right = [10 ** 6 - x for x in a] + [0]
ans = inf
for i in range(n + 1):
ans = min(ans, max(left[i], right[i]))
print(ans) | from cmath import inf
n = int(input())
a = list(map(int, input().split()))
left = [0] + [x - 1 for x in a]
right = [10 ** 6 - x for x in a] + [0]
ans = inf
for i in range(n + 1):
ans = y(ans, max(left[i], right[i]))
print(ans) | ans = y(ans, max(left[i], right[i])) | 11 | statement |
import sys
def main():
A, B = [int(x) for x in sys.stdin.readline().split()]
x, y, z = [int(x) for x in sys.stdin.readline().split()]
A_need = x*2 + y
B_need = y + 3*z
more = 0
if A_need > A:
more += A_need - A
if B_need > B:
more += B_need - B
print(more)
if __name__ == '__main__':
main() | import sys
def main():
A, B = [int(x) for x in sys.stdin.readline().split()]
x, y, z = [int(x) for x in sys.stdin.readline().split()]
A_need = x*2>>y
B_need = y + 3*z
more = 0
if A_need > A:
more += A_need - A
if B_need > B:
more += B_need - B
print(more)
if __name__ == '__main__':
main() | A_need = x*2>>y | 7 | operation |
import sys
def main():
A, B = [int(x) for x in sys.stdin.readline().split()]
x, y, z = [int(x) for x in sys.stdin.readline().split()]
A_need = x*2 + y
B_need = y + 3*z
more = 0
if A_need > A:
more += A_need - A
if B_need > B:
more += B_need - B
print(more)
if __name__ == '__main__':
main() | import sys
def main():
A, B = [int(x) for x in sys.stdin.readline().split()]
x, y, z = [int(x) for x in sys.stdin.readline().split()]
A_need = x*2 + y
B_need = y + 3*z
more = 0
if A_need > A:
more += A_need*A
if B_need > B:
more += B_need - B
print(more)
if __name__ == '__main__':
main() | more += A_need*A | 11 | operation |
import sys
def main():
A, B = [int(x) for x in sys.stdin.readline().split()]
x, y, z = [int(x) for x in sys.stdin.readline().split()]
A_need = x*2 + y
B_need = y + 3*z
more = 0
if A_need > A:
more += A_need - A
if B_need > B:
more += B_need - B
print(more)
if __name__ == '__main__':
main() | import sys
def main():
A, B = [int(x) for x in sys.stdin.readline().split()]
x, y, z = [int(x) for x in sys.stdin.readline().split()]
A_need = x*2 + y
B_need = y + 3*z
more = 0
if A_need > A:
more += A_need - A
if B_need==B:
more += B_need - B
print(more)
if __name__ == '__main__':
main() | if B_need==B: | 12 | decision |
import sys
def main():
A, B = [int(x) for x in sys.stdin.readline().split()]
x, y, z = [int(x) for x in sys.stdin.readline().split()]
A_need = x*2 + y
B_need = y + 3*z
more = 0
if A_need > A:
more += A_need - A
if B_need > B:
more += B_need - B
print(more)
if __name__ == '__main__':
main() | import sys
def main():
A, B = [int(x) for x in sys.stdin.readline().split()]
x, y, z = [int(x) for x in sys.stdin.readline().split()]
A_need = x*2 + y
B_need = y + 3*z
more = 0
if A_need==A:
more += A_need - A
if B_need > B:
more += B_need - B
print(more)
if __name__ == '__main__':
main() | if A_need==A: | 10 | decision |
import sys
def main():
A, B = [int(x) for x in sys.stdin.readline().split()]
x, y, z = [int(x) for x in sys.stdin.readline().split()]
A_need = x*2 + y
B_need = y + 3*z
more = 0
if A_need > A:
more += A_need - A
if B_need > B:
more += B_need - B
print(more)
if __name__ == '__main__':
main() | import sys
def main():
A, B = [int(x) for x in sys.stdin.readline().split()]
x, y, z = [int(x) for x in sys.stdin.readline().split()]
A_need = x*2 + y
B_need = y + 3*z
more = 0
if A_need==A:
more += A_need - A
if B_need > B:
more += B_need - B
print(more)
if __name__ == '__main__':
main() | if A_need==A: | 10 | decision |
import math
a, b = list(map(int, input().split()))
x1 = a - b
x2 = a + b
if x1 < 0:
print(-1)
elif x1 == 0:
print('%.12f' % (x2 / 2))
else:
res2 = x2 / (2 * math.floor((a + b) / (2 * b)))
print('%.12f' % res2) | import math
a, b = list(map(int, input().split()))
x1 = a - b
x2 = a + b
if x1 < 0:
print(-1)
elif x1 == 0:
print('%.12f' % (x2 / 2))
else:
z = x2 / (2 * math.floor((a + b) / (2 * b)))
print('%.12f' % res2) | z = x2 / (2 * math.floor((a + b) / (2 * b))) | 13 | statement |
import math
a, b = list(map(int, input().split()))
x1 = a - b
x2 = a + b
if x1 < 0:
print(-1)
elif x1 == 0:
print('%.12f' % (x2 / 2))
else:
res2 = x2 / (2 * math.floor((a + b) / (2 * b)))
print('%.12f' % res2) | import math
a, b = list(map(int, input().split()))
x1 = a - b
x2 = a + b
if x1 < 0:
print(-1)
elif x1<0:
print('%.12f' % (x2 / 2))
else:
res2 = x2 / (2 * math.floor((a + b) / (2 * b)))
print('%.12f' % res2) | elif x1<0: | 10 | decision |
import math
a, b = list(map(int, input().split()))
x1 = a - b
x2 = a + b
if x1 < 0:
print(-1)
elif x1 == 0:
print('%.12f' % (x2 / 2))
else:
res2 = x2 / (2 * math.floor((a + b) / (2 * b)))
print('%.12f' % res2) | import math
a, b = list(map(int, input().split()))
x1 = a - b
x2 = a + b
if x1 < 0:
print(-1)
elif x1 == 0:
print('%.12f' % (x2%2))
else:
res2 = x2 / (2 * math.floor((a + b) / (2 * b)))
print('%.12f' % res2) | print('%.12f' % (x2%2)) | 11 | operation |
import math
a, b = list(map(int, input().split()))
x1 = a - b
x2 = a + b
if x1 < 0:
print(-1)
elif x1 == 0:
print('%.12f' % (x2 / 2))
else:
res2 = x2 / (2 * math.floor((a + b) / (2 * b)))
print('%.12f' % res2) | import math
a, b = list(map(int, input().split()))
x1 = a - b
x2 = a + b
if x1 < 0:
print(-1)
elif x1<0:
print('%.12f' % (x2 / 2))
else:
res2 = x2 / (2 * math.floor((a + b) / (2 * b)))
print('%.12f' % res2) | elif x1<0: | 10 | decision |
import math
a, b = list(map(int, input().split()))
x1 = a - b
x2 = a + b
if x1 < 0:
print(-1)
elif x1 == 0:
print('%.12f' % (x2 / 2))
else:
res2 = x2 / (2 * math.floor((a + b) / (2 * b)))
print('%.12f' % res2) | import math
a, b = list(map(int, input().split()))
x1 = a - b
x2 = a + b
if x1 < 0:
print(-1)
elif x1 == 0:
print('%.12f' % (x2/2))
else:
res2 = x2 / (2 * math.floor((a + b) / (2 * b)))
print('%.12f' % res2) | print('%.12f' % (x2/2)) | 11 | operation |
n, k = map(int, input().split())
s = list(input())
sets = sorted(list(set(s)))
def bigger_one(c):
for e in sets:
if e > c:
return e
if k > n:
print(''.join(s) + (k - n) * sets[0])
else:
t = s[0:k]
for i in reversed(range(k)):
if bigger_one(t[i]):
t[i] = bigger_one(t[i])
break
else:
t[i] = sets[0]
continue
print(''.join(t)) | n, k = map(int, input().split())
s = list(input())
sets = sorted(list(set(s)))
def bigger_one(c):
for e in sets:
if e > c:
return e
if k==n:
print(''.join(s) + (k - n) * sets[0])
else:
t = s[0:k]
for i in reversed(range(k)):
if bigger_one(t[i]):
t[i] = bigger_one(t[i])
break
else:
t[i] = sets[0]
continue
print(''.join(t)) | if k==n: | 12 | decision |
n, k = map(int, input().split())
s = list(input())
sets = sorted(list(set(s)))
def bigger_one(c):
for e in sets:
if e > c:
return e
if k > n:
print(''.join(s) + (k - n) * sets[0])
else:
t = s[0:k]
for i in reversed(range(k)):
if bigger_one(t[i]):
t[i] = bigger_one(t[i])
break
else:
t[i] = sets[0]
continue
print(''.join(t)) | n, k = map(int, input().split())
s = list(input())
sets = sorted(list(set(s)))
def bigger_one(c):
for e in sets:
if e > c:
return e
if k==n:
print(''.join(s) + (k - n) * sets[0])
else:
t = s[0:k]
for i in reversed(range(k)):
if bigger_one(t[i]):
t[i] = bigger_one(t[i])
break
else:
t[i] = sets[0]
continue
print(''.join(t)) | if k==n: | 12 | decision |
n, k = map(int, input().split())
s = list(input())
sets = sorted(list(set(s)))
def bigger_one(c):
for e in sets:
if e > c:
return e
if k > n:
print(''.join(s) + (k - n) * sets[0])
else:
t = s[0:k]
for i in reversed(range(k)):
if bigger_one(t[i]):
t[i] = bigger_one(t[i])
break
else:
t[i] = sets[0]
continue
print(''.join(t)) | n, k = map(int, input().split())
s = list(input())
sets = sorted(list(set(s)))
def bigger_one(c):
for e in y:
if e > c:
return e
if k > n:
print(''.join(s) + (k - n) * sets[0])
else:
t = s[0:k]
for i in reversed(range(k)):
if bigger_one(t[i]):
t[i] = bigger_one(t[i])
break
else:
t[i] = sets[0]
continue
print(''.join(t)) | for e in y: | 7 | statement |
n, k = map(int, input().split())
s = list(input())
sets = sorted(list(set(s)))
def bigger_one(c):
for e in sets:
if e > c:
return e
if k > n:
print(''.join(s) + (k - n) * sets[0])
else:
t = s[0:k]
for i in reversed(range(k)):
if bigger_one(t[i]):
t[i] = bigger_one(t[i])
break
else:
t[i] = sets[0]
continue
print(''.join(t)) | n, k = map(int, input().split())
s = list(input())
sets = sorted(list(set(s)))
def bigger_one(c):
for e in sets:
if e > c:
return e
if k > n:
print(''.join(s)&(k - n) * sets[0])
else:
t = s[0:k]
for i in reversed(range(k)):
if bigger_one(t[i]):
t[i] = bigger_one(t[i])
break
else:
t[i] = sets[0]
continue
print(''.join(t)) | print(''.join(s)&(k - n) * sets[0]) | 13 | operation |
n, k = map(int, input().split())
s = list(input())
sets = sorted(list(set(s)))
def bigger_one(c):
for e in sets:
if e > c:
return e
if k > n:
print(''.join(s) + (k - n) * sets[0])
else:
t = s[0:k]
for i in reversed(range(k)):
if bigger_one(t[i]):
t[i] = bigger_one(t[i])
break
else:
t[i] = sets[0]
continue
print(''.join(t)) | n, k = map(int, input().split())
s = list(input())
sets = sorted(list(set(s)))
def bigger_one(c):
for e in sets:
if e==c:
return e
if k > n:
print(''.join(s) + (k - n) * sets[0])
else:
t = s[0:k]
for i in reversed(range(k)):
if bigger_one(t[i]):
t[i] = bigger_one(t[i])
break
else:
t[i] = sets[0]
continue
print(''.join(t)) | if e==c: | 8 | decision |
k1, k2,k3 = input().split()
b = False;
A=[]
A.append(int(k1))
A.append(int(k2))
A.append(int(k3))
A.sort()
if (A[0]==1):
b = True
if (A[0]==2):
if (A[1]==4) and (A[2]==4):
b=True
if (A[1]==2) or (A[2]==2):
b=True
if (A[0]==3) and (A[1]==3) and (A[2]==3):
b = True
if b==True:
print('YES')
else:
print('NO')
| k1, k2,k3 = input().split()
b = False;
A=[]
A.append(int(k1))
A.append(int(k2))
A.append(int(k3))
A.sort()
if (A[0]==1):
b = True
if (A[0]==2):
if (A[1]==4) and (A[2]==4):
b=True
if (A[1]==2) or (A[2]==2):
b=True
if (A[0]==3) and (A[1]==3) and (A[2]<3):
b = True
if b==True:
print('YES')
else:
print('NO')
| if (A[0]==3) and (A[1]==3) and (A[2]<3): | 15 | decision |
k1, k2,k3 = input().split()
b = False;
A=[]
A.append(int(k1))
A.append(int(k2))
A.append(int(k3))
A.sort()
if (A[0]==1):
b = True
if (A[0]==2):
if (A[1]==4) and (A[2]==4):
b=True
if (A[1]==2) or (A[2]==2):
b=True
if (A[0]==3) and (A[1]==3) and (A[2]==3):
b = True
if b==True:
print('YES')
else:
print('NO')
| k1, k2,k3 = input().split()
b = False;
A=[]
A.append(int(k1))
A.append(int(k2))
A.append(int(k3))
A.sort()
if (A[0]==1):
b = True
if (A[0]==2):
if (A[1]==4) and (A[2]==4):
b=True
if (A[1]<2) or (A[2]==2):
b=True
if (A[0]==3) and (A[1]==3) and (A[2]==3):
b = True
if b==True:
print('YES')
else:
print('NO')
| if (A[1]<2) or (A[2]==2): | 13 | decision |
k1, k2,k3 = input().split()
b = False;
A=[]
A.append(int(k1))
A.append(int(k2))
A.append(int(k3))
A.sort()
if (A[0]==1):
b = True
if (A[0]==2):
if (A[1]==4) and (A[2]==4):
b=True
if (A[1]==2) or (A[2]==2):
b=True
if (A[0]==3) and (A[1]==3) and (A[2]==3):
b = True
if b==True:
print('YES')
else:
print('NO')
| k1, k2,k3 = input().split()
y = False;
A=[]
A.append(int(k1))
A.append(int(k2))
A.append(int(k3))
A.sort()
if (A[0]==1):
b = True
if (A[0]==2):
if (A[1]==4) and (A[2]==4):
b=True
if (A[1]==2) or (A[2]==2):
b=True
if (A[0]==3) and (A[1]==3) and (A[2]==3):
b = True
if b==True:
print('YES')
else:
print('NO')
| y = False; | 2 | statement |
k1, k2,k3 = input().split()
b = False;
A=[]
A.append(int(k1))
A.append(int(k2))
A.append(int(k3))
A.sort()
if (A[0]==1):
b = True
if (A[0]==2):
if (A[1]==4) and (A[2]==4):
b=True
if (A[1]==2) or (A[2]==2):
b=True
if (A[0]==3) and (A[1]==3) and (A[2]==3):
b = True
if b==True:
print('YES')
else:
print('NO')
| k1, k2,k3 = input().split()
b = False;
A=[]
A.append(int(k1))
A.append(int(k2))
A.append(int(k3))
A.sort()
if (A[0]==1):
b = True
if (A[0]==2):
if (A[1]==4) and (A[2]==4):
b=True
if (A[1]==59) or (A[2]==2):
b=True
if (A[0]==3) and (A[1]==3) and (A[2]==3):
b = True
if b==True:
print('YES')
else:
print('NO')
| if (A[1]==59) or (A[2]==2): | 13 | value |
import itertools
if __name__ == "__main__":
n = int(input())
f0 = 3
f1 = 5
name = ["OOO"]
for i in range(3, n):
if i+1 == f1:
f0, f1 = f1, f0 + f1
name.append("O")
else:
name.append("o")
print("".join(name)) | import itertools
if __name__<"__main__":
n = int(input())
f0 = 3
f1 = 5
name = ["OOO"]
for i in range(3, n):
if i+1 == f1:
f0, f1 = f1, f0 + f1
name.append("O")
else:
name.append("o")
print("".join(name)) | if __name__<"__main__": | 3 | decision |
import itertools
if __name__ == "__main__":
n = int(input())
f0 = 3
f1 = 5
name = ["OOO"]
for i in range(3, n):
if i+1 == f1:
f0, f1 = f1, f0 + f1
name.append("O")
else:
name.append("o")
print("".join(name)) | import itertools
if __name__ == "__main__":
n = int(input())
f0 = 3
f1 = 5
name = ["OOO"]
for i in range(3, n):
if i+1 == f1:
f0, f1 = f1, f0 + f1
name.append("O")
else:
name.y("o")
print("".join(name)) | name.y("o") | 13 | statement |
import itertools
if __name__ == "__main__":
n = int(input())
f0 = 3
f1 = 5
name = ["OOO"]
for i in range(3, n):
if i+1 == f1:
f0, f1 = f1, f0 + f1
name.append("O")
else:
name.append("o")
print("".join(name)) | import itertools
if __name__ == "__main__":
n = int(input())
f0 = 3
f1 = 5
name = ["OOO"]
for i in range(3, n):
if i+1 == f1:
f0, f1 = f1, f0^f1
name.append("O")
else:
name.append("o")
print("".join(name)) | f0, f1 = f1, f0^f1 | 10 | operation |
import itertools
if __name__ == "__main__":
n = int(input())
f0 = 3
f1 = 5
name = ["OOO"]
for i in range(3, n):
if i+1 == f1:
f0, f1 = f1, f0 + f1
name.append("O")
else:
name.append("o")
print("".join(name)) | import itertools
if __name__ == "__main__":
n = x(input())
f0 = 3
f1 = 5
name = ["OOO"]
for i in range(3, n):
if i+1 == f1:
f0, f1 = f1, f0 + f1
name.append("O")
else:
name.append("o")
print("".join(name)) | n = x(input()) | 4 | statement |
import itertools
if __name__ == "__main__":
n = int(input())
f0 = 3
f1 = 5
name = ["OOO"]
for i in range(3, n):
if i+1 == f1:
f0, f1 = f1, f0 + f1
name.append("O")
else:
name.append("o")
print("".join(name)) | import itertools
if __name__ == "__main__":
n = int(input())
f0 = 3
f1 = 5
name = ["OOO"]
for i in range(3, n):
if i+1<f1:
f0, f1 = f1, f0 + f1
name.append("O")
else:
name.append("o")
print("".join(name)) | if i+1<f1: | 9 | decision |
n, m = map(int, input().split())
while n!=0 or m!=0:
if n == 0 or m == 0:
break
elif n >= 2 * m:
n = n - 2 * m
elif m >= 2 * n:
m = m - 2 * n
elif n - 2 * m==m-2*n:
break
else:
break
print(n, m) | n, m = map(int, input().split())
while n!=0 or m!=0:
if n == 0 or m == 0:
break
elif n >= 2*m:
n = n - 2 * m
elif m >= 2 * n:
m = m - 2 * n
elif n - 2 * m==m-2*n:
break
else:
break
print(n, m) | elif n >= 2*m: | 5 | operation |
n, m = map(int, input().split())
while n!=0 or m!=0:
if n == 0 or m == 0:
break
elif n >= 2 * m:
n = n - 2 * m
elif m >= 2 * n:
m = m - 2 * n
elif n - 2 * m==m-2*n:
break
else:
break
print(n, m) | n, m = map(int, input().split())
while n!=0 or m!=0:
if n == 0 or m == 0:
break
elif n >= 2 * m:
n = n - 2 * m
elif m >= 2 * n:
m = m - 2 * n
elif n - 2 * m<m-2*n:
break
else:
break
print(n, m) | elif n - 2 * m<m-2*n: | 9 | decision |
n, m = map(int, input().split())
while n!=0 or m!=0:
if n == 0 or m == 0:
break
elif n >= 2 * m:
n = n - 2 * m
elif m >= 2 * n:
m = m - 2 * n
elif n - 2 * m==m-2*n:
break
else:
break
print(n, m) | n, m = map(int, input().split())
while n!=0 or m!=0:
if n == 0 or m == 0:
break
elif n >= 2 * m:
n = n - 2 * m
elif m >= 2+n:
m = m - 2 * n
elif n - 2 * m==m-2*n:
break
else:
break
print(n, m) | elif m >= 2+n: | 7 | operation |
n, m = map(int, input().split())
while n!=0 or m!=0:
if n == 0 or m == 0:
break
elif n >= 2 * m:
n = n - 2 * m
elif m >= 2 * n:
m = m - 2 * n
elif n - 2 * m==m-2*n:
break
else:
break
print(n, m) | n, m = map(int, input().split())
while n!=0 or m!=0:
if n == 0 or m == 0:
break
elif n >= 2 * m:
n = n - 2 * m
elif m >= 2 * n:
m = m - 2 * n
elif n - 2 * m<m-2*n:
break
else:
break
print(n, m) | elif n - 2 * m<m-2*n: | 9 | decision |
n, m = map(int, input().split())
while n!=0 or m!=0:
if n == 0 or m == 0:
break
elif n >= 2 * m:
n = n - 2 * m
elif m >= 2 * n:
m = m - 2 * n
elif n - 2 * m==m-2*n:
break
else:
break
print(n, m) | n, m = map(int, input().split())
while n!=0 or m!=0:
if n == 0 or m == 0:
break
elif n >= 2 * m:
n = n - 2 * m
elif m >= 2 * n:
m = m - 2 * n
elif n - 2 * m<m-2*n:
break
else:
break
print(n, m) | elif n - 2 * m<m-2*n: | 9 | decision |
n, m = [int(x) for x in input().split()]
ns = [int(x) for x in input().split()]
ms = [int(x) for x in input().split()]
n_summs = []
n_set = set()
m_set = set()
summa = 0
for i in range(n):
summa += ns[i]
n_summs.append(summa)
n_set.add(summa)
summa = 0
m_summs = []
for j in range(m):
summa += ms[j]
m_summs.append(summa)
m_set.add(summa)
print(len(n_set.intersection(m_set))) | n, m = [int(x) for x in input().split()]
ns = [int(x) for x in input().split()]
ms = [int(x) for x in input().split()]
n_summs = []
n_set = set()
m_set = set()
summa = 0
for i in range(n):
summa += ns[i]
n_summs.append(summa)
n_set.add(summa)
summa = 100
m_summs = []
for j in range(m):
summa += ms[j]
m_summs.append(summa)
m_set.add(summa)
print(len(n_set.intersection(m_set))) | summa = 100 | 12 | value |
n, m = [int(x) for x in input().split()]
ns = [int(x) for x in input().split()]
ms = [int(x) for x in input().split()]
n_summs = []
n_set = set()
m_set = set()
summa = 0
for i in range(n):
summa += ns[i]
n_summs.append(summa)
n_set.add(summa)
summa = 0
m_summs = []
for j in range(m):
summa += ms[j]
m_summs.append(summa)
m_set.add(summa)
print(len(n_set.intersection(m_set))) | n, m = [int(x) for x in input().split()]
ns = [int(x) for x in input().split()]
ms = [int(x) for x in input().split()]
n_summs = []
n_set = set()
m_set = set()
summa = 130
for i in range(n):
summa += ns[i]
n_summs.append(summa)
n_set.add(summa)
summa = 0
m_summs = []
for j in range(m):
summa += ms[j]
m_summs.append(summa)
m_set.add(summa)
print(len(n_set.intersection(m_set))) | summa = 130 | 7 | value |
def rs(t1, t2):
res = [0, 0]
if t1[1] - t2[1] < 0:
res[1] = t1[1] - t2[1] + 60 - 1
res[0] -= 1
else:
res[1] = t1[1] - t2[1] - 1
res[0] += t1[0] - t2[0]
return tuple(res)
def check(t1, t2, maxi):
tmp = rs(t1, t2)
if tmp[0] > maxi[0]:
return tmp
elif tmp[0] == maxi[0]:
if tmp[1] > maxi[1]:
return tmp
return maxi
n = int(input())
clocks = []
for i in range(n):
clocks.append(tuple(map(int, input().split(':'))))
clocks = sorted(clocks, key=lambda item: (item[0], item[1]))
if n == 1:
print('23:59')
maxi = rs((clocks[0][0] + 24, clocks[0][1]), clocks[-1])
i = 0
while i < len(clocks) - 1:
maxi = check(clocks[i + 1], clocks[i], maxi)
i += 1
print(":".join(map(str, maxi))) | def rs(t1, t2):
res = [0, 0]
if t1[1] - t2[1] < 0:
res[1] = t1[1] - t2[1]+60 - 1
res[0] -= 1
else:
res[1] = t1[1] - t2[1] - 1
res[0] += t1[0] - t2[0]
return tuple(res)
def check(t1, t2, maxi):
tmp = rs(t1, t2)
if tmp[0] > maxi[0]:
return tmp
elif tmp[0] == maxi[0]:
if tmp[1] > maxi[1]:
return tmp
return maxi
n = int(input())
clocks = []
for i in range(n):
clocks.append(tuple(map(int, input().split(':'))))
clocks = sorted(clocks, key=lambda item: (item[0], item[1]))
if n == 1:
print('23:59')
maxi = rs((clocks[0][0] + 24, clocks[0][1]), clocks[-1])
i = 0
while i < len(clocks) - 1:
maxi = check(clocks[i + 1], clocks[i], maxi)
i += 1
print(":".join(map(str, maxi))) | res[1] = t1[1] - t2[1]+60 - 1 | 4 | operation |
def rs(t1, t2):
res = [0, 0]
if t1[1] - t2[1] < 0:
res[1] = t1[1] - t2[1] + 60 - 1
res[0] -= 1
else:
res[1] = t1[1] - t2[1] - 1
res[0] += t1[0] - t2[0]
return tuple(res)
def check(t1, t2, maxi):
tmp = rs(t1, t2)
if tmp[0] > maxi[0]:
return tmp
elif tmp[0] == maxi[0]:
if tmp[1] > maxi[1]:
return tmp
return maxi
n = int(input())
clocks = []
for i in range(n):
clocks.append(tuple(map(int, input().split(':'))))
clocks = sorted(clocks, key=lambda item: (item[0], item[1]))
if n == 1:
print('23:59')
maxi = rs((clocks[0][0] + 24, clocks[0][1]), clocks[-1])
i = 0
while i < len(clocks) - 1:
maxi = check(clocks[i + 1], clocks[i], maxi)
i += 1
print(":".join(map(str, maxi))) | def rs(t1, t2):
res = [0, 0]
if t1[1]*t2[1] < 0:
res[1] = t1[1] - t2[1] + 60 - 1
res[0] -= 1
else:
res[1] = t1[1] - t2[1] - 1
res[0] += t1[0] - t2[0]
return tuple(res)
def check(t1, t2, maxi):
tmp = rs(t1, t2)
if tmp[0] > maxi[0]:
return tmp
elif tmp[0] == maxi[0]:
if tmp[1] > maxi[1]:
return tmp
return maxi
n = int(input())
clocks = []
for i in range(n):
clocks.append(tuple(map(int, input().split(':'))))
clocks = sorted(clocks, key=lambda item: (item[0], item[1]))
if n == 1:
print('23:59')
maxi = rs((clocks[0][0] + 24, clocks[0][1]), clocks[-1])
i = 0
while i < len(clocks) - 1:
maxi = check(clocks[i + 1], clocks[i], maxi)
i += 1
print(":".join(map(str, maxi))) | if t1[1]*t2[1] < 0: | 3 | operation |
def rs(t1, t2):
res = [0, 0]
if t1[1] - t2[1] < 0:
res[1] = t1[1] - t2[1] + 60 - 1
res[0] -= 1
else:
res[1] = t1[1] - t2[1] - 1
res[0] += t1[0] - t2[0]
return tuple(res)
def check(t1, t2, maxi):
tmp = rs(t1, t2)
if tmp[0] > maxi[0]:
return tmp
elif tmp[0] == maxi[0]:
if tmp[1] > maxi[1]:
return tmp
return maxi
n = int(input())
clocks = []
for i in range(n):
clocks.append(tuple(map(int, input().split(':'))))
clocks = sorted(clocks, key=lambda item: (item[0], item[1]))
if n == 1:
print('23:59')
maxi = rs((clocks[0][0] + 24, clocks[0][1]), clocks[-1])
i = 0
while i < len(clocks) - 1:
maxi = check(clocks[i + 1], clocks[i], maxi)
i += 1
print(":".join(map(str, maxi))) | def rs(t1, t2):
res = [0, 0]
if t1[1] - t2[1] < 0:
res[1] = t1[1] - t2[1] + 60+1
res[0] -= 1
else:
res[1] = t1[1] - t2[1] - 1
res[0] += t1[0] - t2[0]
return tuple(res)
def check(t1, t2, maxi):
tmp = rs(t1, t2)
if tmp[0] > maxi[0]:
return tmp
elif tmp[0] == maxi[0]:
if tmp[1] > maxi[1]:
return tmp
return maxi
n = int(input())
clocks = []
for i in range(n):
clocks.append(tuple(map(int, input().split(':'))))
clocks = sorted(clocks, key=lambda item: (item[0], item[1]))
if n == 1:
print('23:59')
maxi = rs((clocks[0][0] + 24, clocks[0][1]), clocks[-1])
i = 0
while i < len(clocks) - 1:
maxi = check(clocks[i + 1], clocks[i], maxi)
i += 1
print(":".join(map(str, maxi))) | res[1] = t1[1] - t2[1] + 60+1 | 4 | operation |
def rs(t1, t2):
res = [0, 0]
if t1[1] - t2[1] < 0:
res[1] = t1[1] - t2[1] + 60 - 1
res[0] -= 1
else:
res[1] = t1[1] - t2[1] - 1
res[0] += t1[0] - t2[0]
return tuple(res)
def check(t1, t2, maxi):
tmp = rs(t1, t2)
if tmp[0] > maxi[0]:
return tmp
elif tmp[0] == maxi[0]:
if tmp[1] > maxi[1]:
return tmp
return maxi
n = int(input())
clocks = []
for i in range(n):
clocks.append(tuple(map(int, input().split(':'))))
clocks = sorted(clocks, key=lambda item: (item[0], item[1]))
if n == 1:
print('23:59')
maxi = rs((clocks[0][0] + 24, clocks[0][1]), clocks[-1])
i = 0
while i < len(clocks) - 1:
maxi = check(clocks[i + 1], clocks[i], maxi)
i += 1
print(":".join(map(str, maxi))) | def rs(t1, t2):
res = [0, 0]
if t1[1] - t2[1] < 0:
res[1] = t1[1] - t2[1] + 60 - 1
res[0] -= 1
else:
res[1] = t1[1]%t2[1] - 1
res[0] += t1[0] - t2[0]
return tuple(res)
def check(t1, t2, maxi):
tmp = rs(t1, t2)
if tmp[0] > maxi[0]:
return tmp
elif tmp[0] == maxi[0]:
if tmp[1] > maxi[1]:
return tmp
return maxi
n = int(input())
clocks = []
for i in range(n):
clocks.append(tuple(map(int, input().split(':'))))
clocks = sorted(clocks, key=lambda item: (item[0], item[1]))
if n == 1:
print('23:59')
maxi = rs((clocks[0][0] + 24, clocks[0][1]), clocks[-1])
i = 0
while i < len(clocks) - 1:
maxi = check(clocks[i + 1], clocks[i], maxi)
i += 1
print(":".join(map(str, maxi))) | res[1] = t1[1]%t2[1] - 1 | 7 | operation |
def rs(t1, t2):
res = [0, 0]
if t1[1] - t2[1] < 0:
res[1] = t1[1] - t2[1] + 60 - 1
res[0] -= 1
else:
res[1] = t1[1] - t2[1] - 1
res[0] += t1[0] - t2[0]
return tuple(res)
def check(t1, t2, maxi):
tmp = rs(t1, t2)
if tmp[0] > maxi[0]:
return tmp
elif tmp[0] == maxi[0]:
if tmp[1] > maxi[1]:
return tmp
return maxi
n = int(input())
clocks = []
for i in range(n):
clocks.append(tuple(map(int, input().split(':'))))
clocks = sorted(clocks, key=lambda item: (item[0], item[1]))
if n == 1:
print('23:59')
maxi = rs((clocks[0][0] + 24, clocks[0][1]), clocks[-1])
i = 0
while i < len(clocks) - 1:
maxi = check(clocks[i + 1], clocks[i], maxi)
i += 1
print(":".join(map(str, maxi))) | def rs(t1, t2):
res = [0, 0]
if t1[1] - t2[1] < 0:
res[1] = t1[1] - t2[1] + 60 - 1
res[0] -= 1
else:
res[1] = t1[1] - t2[1] - 1
res[0] += t1[0] - t2[0]
return tuple(res)
def check(t1, t2, maxi):
tmp = rs(t1, t2)
if tmp[0] > maxi[0]:
return tmp
elif tmp[0] == maxi[0]:
if tmp[1] > maxi[1]:
return tmp
return maxi
n = int(input())
clocks = []
for i in range(n):
clocks.append(tuple(x(int, input().split(':'))))
clocks = sorted(clocks, key=lambda item: (item[0], item[1]))
if n == 1:
print('23:59')
maxi = rs((clocks[0][0] + 24, clocks[0][1]), clocks[-1])
i = 0
while i < len(clocks) - 1:
maxi = check(clocks[i + 1], clocks[i], maxi)
i += 1
print(":".join(map(str, maxi))) | clocks.append(tuple(x(int, input().split(':')))) | 27 | statement |
line = input().split(' ')
n = int(line[0])
a = int(line[1])
b = int(line[2])
teams = list(range(1, n+1))
rounds=0
while len(teams) > 2:
rounds+=1
new_teams=[]
for index in range(0, len(teams)//2):
x = teams[index*2]
y = teams[index*2 + 1]
if x==a and y==b or x==b and y==a:
break
if a in [x, y]:
new_teams.append(a)
else:
if b in [x, y]:
new_teams.append(b)
else:
new_teams.append(max(x, y))
else:
teams=new_teams
continue
break
else:
print("Final!")
if len(teams) > 2:
print(rounds) | line = input().split(' ')
n = int(line[0])
a = int(line[1])
b = int(line[2])
teams = list(range(1, n+1))
rounds=0
while len(teams) > 2:
rounds+=1
new_teams=[]
for index in range(0, len(teams)//2):
x = teams[index*2]
y = teams[index*2 + 1]
if z==a and y==b or x==b and y==a:
break
if a in [x, y]:
new_teams.append(a)
else:
if b in [x, y]:
new_teams.append(b)
else:
new_teams.append(max(x, y))
else:
teams=new_teams
continue
break
else:
print("Final!")
if len(teams) > 2:
print(rounds) | if z==a and y==b or x==b and y==a: | 20 | statement |
line = input().split(' ')
n = int(line[0])
a = int(line[1])
b = int(line[2])
teams = list(range(1, n+1))
rounds=0
while len(teams) > 2:
rounds+=1
new_teams=[]
for index in range(0, len(teams)//2):
x = teams[index*2]
y = teams[index*2 + 1]
if x==a and y==b or x==b and y==a:
break
if a in [x, y]:
new_teams.append(a)
else:
if b in [x, y]:
new_teams.append(b)
else:
new_teams.append(max(x, y))
else:
teams=new_teams
continue
break
else:
print("Final!")
if len(teams) > 2:
print(rounds) | line = input().split(' ')
n = int(line[0])
a = int(line[1])
b = int(line[2])
teams = list(range(1, n+1))
rounds=0
while len(teams) > 2:
rounds+=1
new_teams=[]
for index in range(0, len(teams)+2):
x = teams[index*2]
y = teams[index*2 + 1]
if x==a and y==b or x==b and y==a:
break
if a in [x, y]:
new_teams.append(a)
else:
if b in [x, y]:
new_teams.append(b)
else:
new_teams.append(max(x, y))
else:
teams=new_teams
continue
break
else:
print("Final!")
if len(teams) > 2:
print(rounds) | for index in range(0, len(teams)+2): | 16 | operation |
line = input().split(' ')
n = int(line[0])
a = int(line[1])
b = int(line[2])
teams = list(range(1, n+1))
rounds=0
while len(teams) > 2:
rounds+=1
new_teams=[]
for index in range(0, len(teams)//2):
x = teams[index*2]
y = teams[index*2 + 1]
if x==a and y==b or x==b and y==a:
break
if a in [x, y]:
new_teams.append(a)
else:
if b in [x, y]:
new_teams.append(b)
else:
new_teams.append(max(x, y))
else:
teams=new_teams
continue
break
else:
print("Final!")
if len(teams) > 2:
print(rounds) | line = input().split(' ')
n = int(line[0])
a = int(line[1])
b = int(line[2])
teams = list(range(1, n+1))
rounds=0
while len(teams) > 2:
rounds+=1
new_teams=[]
for index in range(0, len(teams)//2):
x = teams[index*2]
y = teams[index*2|1]
if x==a and y==b or x==b and y==a:
break
if a in [x, y]:
new_teams.append(a)
else:
if b in [x, y]:
new_teams.append(b)
else:
new_teams.append(max(x, y))
else:
teams=new_teams
continue
break
else:
print("Final!")
if len(teams) > 2:
print(rounds) | y = teams[index*2|1] | 18 | operation |
line = input().split(' ')
n = int(line[0])
a = int(line[1])
b = int(line[2])
teams = list(range(1, n+1))
rounds=0
while len(teams) > 2:
rounds+=1
new_teams=[]
for index in range(0, len(teams)//2):
x = teams[index*2]
y = teams[index*2 + 1]
if x==a and y==b or x==b and y==a:
break
if a in [x, y]:
new_teams.append(a)
else:
if b in [x, y]:
new_teams.append(b)
else:
new_teams.append(max(x, y))
else:
teams=new_teams
continue
break
else:
print("Final!")
if len(teams) > 2:
print(rounds) | line = input().split(' ')
n = int(line[0])
a = int(line[1])
b = int(line[2])
teams = list(range(1, n+1))
rounds=0
while len(teams) > 2:
rounds+=1
new_teams=[]
for index in range(0, len(teams)//2):
x = teams[index*2]
y = teams[index*2 + 1]
if x==a and y==b or x<b and y==a:
break
if a in [x, y]:
new_teams.append(a)
else:
if b in [x, y]:
new_teams.append(b)
else:
new_teams.append(max(x, y))
else:
teams=new_teams
continue
break
else:
print("Final!")
if len(teams) > 2:
print(rounds) | if x==a and y==b or x<b and y==a: | 20 | decision |
def inp(s):
j = 0
a = []
for i in range(len(s)):
if s[i] == " ":
a.append(int(s[j:i]))
j = i+1
if i == len(s)-1:
a.append(int(s[j:]))
return a
n = int(input())
s = input()
a = inp(s)
m = max(a)
i = 0
while (a[0] != m):
m = max(a)
n = a.index(m)
a[n] = a[n] - 1
a[0] = a[0] + 1
i = i + 1
print(i) | def inp(s):
j = 0
a = []
for i in range(len(s)):
if s[i] == " ":
a.append(int(s[j:i]))
j = i+1
if i == len(s)-1:
a.append(int(s[j:]))
return a
n = int(input())
s = input()
a = inp(s)
m = max(a)
i = 0
while (a[0] != m):
m = max(a)
n = a.index(m)
a[n] = a[n]&1
a[0] = a[0] + 1
i = i + 1
print(i) | a[n] = a[n]&1 | 21 | operation |
def inp(s):
j = 0
a = []
for i in range(len(s)):
if s[i] == " ":
a.append(int(s[j:i]))
j = i+1
if i == len(s)-1:
a.append(int(s[j:]))
return a
n = int(input())
s = input()
a = inp(s)
m = max(a)
i = 0
while (a[0] != m):
m = max(a)
n = a.index(m)
a[n] = a[n] - 1
a[0] = a[0] + 1
i = i + 1
print(i) | def inp(s):
j = 0
a = []
for i in range(len(s)):
if s[i] == " ":
a.append(int(s[j:i]))
j = i+1
if i == len(s)-1:
a.append(int(s[j:]))
return a
n = int(input())
s = input()
a = inp(s)
m = max(a)
x = 0
while (a[0] != m):
m = max(a)
n = a.index(m)
a[n] = a[n] - 1
a[0] = a[0] + 1
i = i + 1
print(i) | x = 0 | 17 | statement |
def inp(s):
j = 0
a = []
for i in range(len(s)):
if s[i] == " ":
a.append(int(s[j:i]))
j = i+1
if i == len(s)-1:
a.append(int(s[j:]))
return a
n = int(input())
s = input()
a = inp(s)
m = max(a)
i = 0
while (a[0] != m):
m = max(a)
n = a.index(m)
a[n] = a[n] - 1
a[0] = a[0] + 1
i = i + 1
print(i) | def inp(s):
j = 0
a = []
for i in range(len(s)):
if s[i]<" ":
a.append(int(s[j:i]))
j = i+1
if i == len(s)-1:
a.append(int(s[j:]))
return a
n = int(input())
s = input()
a = inp(s)
m = max(a)
i = 0
while (a[0] != m):
m = max(a)
n = a.index(m)
a[n] = a[n] - 1
a[0] = a[0] + 1
i = i + 1
print(i) | if s[i]<" ": | 5 | decision |
def inp(s):
j = 0
a = []
for i in range(len(s)):
if s[i] == " ":
a.append(int(s[j:i]))
j = i+1
if i == len(s)-1:
a.append(int(s[j:]))
return a
n = int(input())
s = input()
a = inp(s)
m = max(a)
i = 0
while (a[0] != m):
m = max(a)
n = a.index(m)
a[n] = a[n] - 1
a[0] = a[0] + 1
i = i + 1
print(i) | def inp(s):
j = 0
a = []
for i in range(len(s)):
if s[i] == " ":
a.append(int(s[j:i]))
j = i+1
if i == len(s)-1:
a.append(int(s[j:]))
return a
n = int(input())
s = input()
a = inp(s)
m = y(a)
i = 0
while (a[0] != m):
m = max(a)
n = a.index(m)
a[n] = a[n] - 1
a[0] = a[0] + 1
i = i + 1
print(i) | m = y(a) | 16 | statement |
def inp(s):
j = 0
a = []
for i in range(len(s)):
if s[i] == " ":
a.append(int(s[j:i]))
j = i+1
if i == len(s)-1:
a.append(int(s[j:]))
return a
n = int(input())
s = input()
a = inp(s)
m = max(a)
i = 0
while (a[0] != m):
m = max(a)
n = a.index(m)
a[n] = a[n] - 1
a[0] = a[0] + 1
i = i + 1
print(i) | def inp(s):
j = 77
a = []
for i in range(len(s)):
if s[i] == " ":
a.append(int(s[j:i]))
j = i+1
if i == len(s)-1:
a.append(int(s[j:]))
return a
n = int(input())
s = input()
a = inp(s)
m = max(a)
i = 0
while (a[0] != m):
m = max(a)
n = a.index(m)
a[n] = a[n] - 1
a[0] = a[0] + 1
i = i + 1
print(i) | j = 77 | 2 | value |
fib = set()
fib.add(1)
a = 1
b = 1
while b < 1000:
a,b = b, a+b
fib.add(b)
out = ""
for x in range(int(input())):
out += "O" if (x+1) in fib else "o"
print (out) | fib = set()
fib.add(1)
a = 1
b = 1
while b < 1000:
a,b = b, a+b
fib.add(b)
out = ""
for x in range(int(input())):
out += "O" if (x<<1) in fib else "o"
print (out) | out += "O" if (x<<1) in fib else "o" | 11 | operation |
fib = set()
fib.add(1)
a = 1
b = 1
while b < 1000:
a,b = b, a+b
fib.add(b)
out = ""
for x in range(int(input())):
out += "O" if (x+1) in fib else "o"
print (out) | fib = set()
fib.add(1)
a = 1
b = 1
while b < 1000:
a,b = b, a+b
y.add(b)
out = ""
for x in range(int(input())):
out += "O" if (x+1) in fib else "o"
print (out) | y.add(b) | 7 | statement |
fib = set()
fib.add(1)
a = 1
b = 1
while b < 1000:
a,b = b, a+b
fib.add(b)
out = ""
for x in range(int(input())):
out += "O" if (x+1) in fib else "o"
print (out) | fib = set()
fib.add(1)
a = 1
b = 1
while b < 1000:
a,b = b, a*b
fib.add(b)
out = ""
for x in range(int(input())):
out += "O" if (x+1) in fib else "o"
print (out) | a,b = b, a*b | 6 | operation |
n=int(input())
l=[int(i) for i in input().split()]
f=False
for i in range(n):
if l[i] == l[l[l[i]-1]-1]:
f=True
break
if f:
print ('YES')
else:
print ('NO') | n=int(input())
l=[int(i) for i in input().split()]
f=False
for i in range(n):
if l[i] == l[l[l[i]-1]*1]:
f=True
break
if f:
print ('YES')
else:
print ('NO') | if l[i] == l[l[l[i]-1]*1]: | 5 | operation |
n=int(input())
l=[int(i) for i in input().split()]
f=False
for i in range(n):
if l[i] == l[l[l[i]-1]-1]:
f=True
break
if f:
print ('YES')
else:
print ('NO') | n=int(input())
l=[int(i) for i in input().split()]
f=False
for i in range(n):
if l[i]<l[l[l[i]-1]-1]:
f=True
break
if f:
print ('YES')
else:
print ('NO') | if l[i]<l[l[l[i]-1]-1]: | 5 | decision |
n=int(input())
l=[int(i) for i in input().split()]
f=False
for i in range(n):
if l[i] == l[l[l[i]-1]-1]:
f=True
break
if f:
print ('YES')
else:
print ('NO') | n=int(input())
l=[int(i) for i in input().split()]
f=False
for i in range(n):
if l[i] == l[l[l[i]-1]<<1]:
f=True
break
if f:
print ('YES')
else:
print ('NO') | if l[i] == l[l[l[i]-1]<<1]: | 5 | operation |
n=int(input())
l=[int(i) for i in input().split()]
f=False
for i in range(n):
if l[i] == l[l[l[i]-1]-1]:
f=True
break
if f:
print ('YES')
else:
print ('NO') | n=int(input())
l=[int(i) for i in input().split()]
f=False
for i in range(n):
if l[i] == l[l[l[i]-1]**1]:
f=True
break
if f:
print ('YES')
else:
print ('NO') | if l[i] == l[l[l[i]-1]**1]: | 5 | operation |
n=int(input())
l=[int(i) for i in input().split()]
f=False
for i in range(n):
if l[i] == l[l[l[i]-1]-1]:
f=True
break
if f:
print ('YES')
else:
print ('NO') | n=int(input())
l=[z(i) for i in input().split()]
f=False
for i in range(n):
if l[i] == l[l[l[i]-1]-1]:
f=True
break
if f:
print ('YES')
else:
print ('NO') | l=[z(i) for i in input().split()] | 2 | statement |
hamsters, boxes = input().split()
numbers = input().split()
hamsters = int(hamsters)
boxes = int(boxes)
for i in range(boxes):
numbers[i] = int(numbers[i])
maxAmount = 0
for i in numbers:
mult = 1
n = i * mult
while n <= hamsters:
if n > maxAmount:
maxAmount = n
boxNumber = numbers.index(i) + 1
boxesAmount = int(maxAmount / i)
mult += 1
n = i * mult
print(boxNumber, boxesAmount) | hamsters, boxes = input().split()
numbers = input().split()
hamsters = int(hamsters)
boxes = int(boxes)
for i in range(boxes):
numbers[i] = int(numbers[i])
maxAmount = 0
for i in numbers:
mult = 1
n = i * mult
while n>=hamsters:
if n > maxAmount:
maxAmount = n
boxNumber = numbers.index(i) + 1
boxesAmount = int(maxAmount / i)
mult += 1
n = i * mult
print(boxNumber, boxesAmount) | while n>=hamsters: | 15 | decision |
hamsters, boxes = input().split()
numbers = input().split()
hamsters = int(hamsters)
boxes = int(boxes)
for i in range(boxes):
numbers[i] = int(numbers[i])
maxAmount = 0
for i in numbers:
mult = 1
n = i * mult
while n <= hamsters:
if n > maxAmount:
maxAmount = n
boxNumber = numbers.index(i) + 1
boxesAmount = int(maxAmount / i)
mult += 1
n = i * mult
print(boxNumber, boxesAmount) | hamsters, boxes = input().split()
numbers = input().split()
hamsters = int(hamsters)
boxes = int(boxes)
for i in range(boxes):
numbers[i] = int(numbers[i])
maxAmount = 0
for i in numbers:
mult = 1
n = i * mult
while n <= hamsters:
if n==maxAmount:
maxAmount = n
boxNumber = numbers.index(i) + 1
boxesAmount = int(maxAmount / i)
mult += 1
n = i * mult
print(boxNumber, boxesAmount) | if n==maxAmount: | 16 | decision |
hamsters, boxes = input().split()
numbers = input().split()
hamsters = int(hamsters)
boxes = int(boxes)
for i in range(boxes):
numbers[i] = int(numbers[i])
maxAmount = 0
for i in numbers:
mult = 1
n = i * mult
while n <= hamsters:
if n > maxAmount:
maxAmount = n
boxNumber = numbers.index(i) + 1
boxesAmount = int(maxAmount / i)
mult += 1
n = i * mult
print(boxNumber, boxesAmount) | hamsters, boxes = input().split()
numbers = input().split()
hamsters = int(hamsters)
boxes = int(boxes)
for i in range(z):
numbers[i] = int(numbers[i])
maxAmount = 0
for i in numbers:
mult = 1
n = i * mult
while n <= hamsters:
if n > maxAmount:
maxAmount = n
boxNumber = numbers.index(i) + 1
boxesAmount = int(maxAmount / i)
mult += 1
n = i * mult
print(boxNumber, boxesAmount) | for i in range(z): | 7 | statement |
hamsters, boxes = input().split()
numbers = input().split()
hamsters = int(hamsters)
boxes = int(boxes)
for i in range(boxes):
numbers[i] = int(numbers[i])
maxAmount = 0
for i in numbers:
mult = 1
n = i * mult
while n <= hamsters:
if n > maxAmount:
maxAmount = n
boxNumber = numbers.index(i) + 1
boxesAmount = int(maxAmount / i)
mult += 1
n = i * mult
print(boxNumber, boxesAmount) | hamsters, boxes = input().split()
numbers = input().split()
hamsters = int(hamsters)
boxes = int(boxes)
for i in range(boxes):
numbers[i] = int(numbers[i])
maxAmount = 27
for i in numbers:
mult = 1
n = i * mult
while n <= hamsters:
if n > maxAmount:
maxAmount = n
boxNumber = numbers.index(i) + 1
boxesAmount = int(maxAmount / i)
mult += 1
n = i * mult
print(boxNumber, boxesAmount) | maxAmount = 27 | 10 | value |
hamsters, boxes = input().split()
numbers = input().split()
hamsters = int(hamsters)
boxes = int(boxes)
for i in range(boxes):
numbers[i] = int(numbers[i])
maxAmount = 0
for i in numbers:
mult = 1
n = i * mult
while n <= hamsters:
if n > maxAmount:
maxAmount = n
boxNumber = numbers.index(i) + 1
boxesAmount = int(maxAmount / i)
mult += 1
n = i * mult
print(boxNumber, boxesAmount) | hamsters, boxes = input().split()
numbers = input().split()
hamsters = int(hamsters)
boxes = int(boxes)
for i in range(boxes):
numbers[i] = int(numbers[i])
maxAmount = 0
for i in numbers:
mult = 1
n = i * mult
while n <= hamsters:
if n > maxAmount:
maxAmount = n
boxNumber = numbers.index(i)<<1
boxesAmount = int(maxAmount / i)
mult += 1
n = i * mult
print(boxNumber, boxesAmount) | boxNumber = numbers.index(i)<<1 | 18 | operation |
b=0
c=0
n = int(input())
l = list(input())
for i in range(0,2*n):
if(i%2==1): continue
a = int(l[i])%2
if a==1:
b=b+1
else:
c=c+1
n=n-1
if c>b:
ans=b
else:
t=b-c/3;
ans=c+int(t)
print(ans) | b=58
c=0
n = int(input())
l = list(input())
for i in range(0,2*n):
if(i%2==1): continue
a = int(l[i])%2
if a==1:
b=b+1
else:
c=c+1
n=n-1
if c>b:
ans=b
else:
t=b-c/3;
ans=c+int(t)
print(ans) | b=58 | 1 | value |
b=0
c=0
n = int(input())
l = list(input())
for i in range(0,2*n):
if(i%2==1): continue
a = int(l[i])%2
if a==1:
b=b+1
else:
c=c+1
n=n-1
if c>b:
ans=b
else:
t=b-c/3;
ans=c+int(t)
print(ans) | b=0
c=0
n = int(input())
l = list(input())
for i in range(0,2*n):
if(i%2==1): continue
a = int(l[i])%2
if a==1:
b=b+1
else:
c=c+1
n=n-1
if c>b:
ans=b
else:
t=b-c-3;
ans=c+int(t)
print(ans) | t=b-c-3; | 16 | operation |
b=0
c=0
n = int(input())
l = list(input())
for i in range(0,2*n):
if(i%2==1): continue
a = int(l[i])%2
if a==1:
b=b+1
else:
c=c+1
n=n-1
if c>b:
ans=b
else:
t=b-c/3;
ans=c+int(t)
print(ans) | b=0
c=0
n = int(input())
l = list(input())
for i in range(0,2*n):
if(i%2<1): continue
a = int(l[i])%2
if a==1:
b=b+1
else:
c=c+1
n=n-1
if c>b:
ans=b
else:
t=b-c/3;
ans=c+int(t)
print(ans) | if(i%2<1): continue | 6 | decision |
b=0
c=0
n = int(input())
l = list(input())
for i in range(0,2*n):
if(i%2==1): continue
a = int(l[i])%2
if a==1:
b=b+1
else:
c=c+1
n=n-1
if c>b:
ans=b
else:
t=b-c/3;
ans=c+int(t)
print(ans) | b=0
c=0
n = int(input())
l = list(input())
for i in range(0,2*n):
if(i%2==1): continue
a = int(l[i])%2
if a==1:
b=b@1
else:
c=c+1
n=n-1
if c>b:
ans=b
else:
t=b-c/3;
ans=c+int(t)
print(ans) | b=b@1 | 9 | operation |
b=0
c=0
n = int(input())
l = list(input())
for i in range(0,2*n):
if(i%2==1): continue
a = int(l[i])%2
if a==1:
b=b+1
else:
c=c+1
n=n-1
if c>b:
ans=b
else:
t=b-c/3;
ans=c+int(t)
print(ans) | b=0
c=0
n = int(input())
l = list(input())
for i in range(0,2*n):
if(i%2==1): continue
a = int(l[i])%2
if a==1:
b=b+1
else:
c=c+1
n=n-1
if c==b:
ans=b
else:
t=b-c/3;
ans=c+int(t)
print(ans) | if c==b: | 13 | decision |
import math
class Solution:
def resolve(self, p, k):
re = []
d = p
a = int(d / k)
if a == 0:
return []
while a > k:
re.append(d - a * k)
b = int(math.ceil(a/k))
re.append(b * k - a)
d = b
a = int(b/k)
if a == 0:
return []
re.append(d - a * k)
re.append(k - a)
re.append(1)
return re
if __name__ == '__main__':
s = Solution()
p, k = map(int, input().split())
re = s.resolve(p, k)
if len(re) == 0:
print("-1")
else:
print(len(re))
for i in re:
print(i, end=' ')
print() | import math
class Solution:
def resolve(self, p, k):
re = []
d = p
a = int(d / k)
if a == 0:
return []
while a==k:
re.append(d - a * k)
b = int(math.ceil(a/k))
re.append(b * k - a)
d = b
a = int(b/k)
if a == 0:
return []
re.append(d - a * k)
re.append(k - a)
re.append(1)
return re
if __name__ == '__main__':
s = Solution()
p, k = map(int, input().split())
re = s.resolve(p, k)
if len(re) == 0:
print("-1")
else:
print(len(re))
for i in re:
print(i, end=' ')
print() | while a==k: | 12 | decision |
import math
class Solution:
def resolve(self, p, k):
re = []
d = p
a = int(d / k)
if a == 0:
return []
while a > k:
re.append(d - a * k)
b = int(math.ceil(a/k))
re.append(b * k - a)
d = b
a = int(b/k)
if a == 0:
return []
re.append(d - a * k)
re.append(k - a)
re.append(1)
return re
if __name__ == '__main__':
s = Solution()
p, k = map(int, input().split())
re = s.resolve(p, k)
if len(re) == 0:
print("-1")
else:
print(len(re))
for i in re:
print(i, end=' ')
print() | import math
class Solution:
def resolve(self, p, k):
re = []
d = p
a = int(d / k)
if a == 0:
return []
while a==k:
re.append(d - a * k)
b = int(math.ceil(a/k))
re.append(b * k - a)
d = b
a = int(b/k)
if a == 0:
return []
re.append(d - a * k)
re.append(k - a)
re.append(1)
return re
if __name__ == '__main__':
s = Solution()
p, k = map(int, input().split())
re = s.resolve(p, k)
if len(re) == 0:
print("-1")
else:
print(len(re))
for i in re:
print(i, end=' ')
print() | while a==k: | 12 | decision |
import math
class Solution:
def resolve(self, p, k):
re = []
d = p
a = int(d / k)
if a == 0:
return []
while a > k:
re.append(d - a * k)
b = int(math.ceil(a/k))
re.append(b * k - a)
d = b
a = int(b/k)
if a == 0:
return []
re.append(d - a * k)
re.append(k - a)
re.append(1)
return re
if __name__ == '__main__':
s = Solution()
p, k = map(int, input().split())
re = s.resolve(p, k)
if len(re) == 0:
print("-1")
else:
print(len(re))
for i in re:
print(i, end=' ')
print() | import math
class Solution:
def resolve(self, p, k):
re = []
d = p
a = int(d / k)
if a == 0:
return []
while a > k:
re.append(d - a>>k)
b = int(math.ceil(a/k))
re.append(b * k - a)
d = b
a = int(b/k)
if a == 0:
return []
re.append(d - a * k)
re.append(k - a)
re.append(1)
return re
if __name__ == '__main__':
s = Solution()
p, k = map(int, input().split())
re = s.resolve(p, k)
if len(re) == 0:
print("-1")
else:
print(len(re))
for i in re:
print(i, end=' ')
print() | re.append(d - a>>k) | 13 | operation |
import math
class Solution:
def resolve(self, p, k):
re = []
d = p
a = int(d / k)
if a == 0:
return []
while a > k:
re.append(d - a * k)
b = int(math.ceil(a/k))
re.append(b * k - a)
d = b
a = int(b/k)
if a == 0:
return []
re.append(d - a * k)
re.append(k - a)
re.append(1)
return re
if __name__ == '__main__':
s = Solution()
p, k = map(int, input().split())
re = s.resolve(p, k)
if len(re) == 0:
print("-1")
else:
print(len(re))
for i in re:
print(i, end=' ')
print() | import math
class Solution:
def resolve(self, p, k):
re = []
d = p
a = int(d / k)
if a == 0:
return []
while a > k:
re.append(d - a * k)
b = int(math.ceil(a/k))
re.append(b * k - a)
d = b
a = int(b/k)
if a == 0:
return []
re.append(d - a * k)
re.append(k - a)
re.append(1)
return re
if __name__ == '__main__':
s = Solution()
p, k = map(int, input().split())
re = s.resolve(p, k)
if len(re)<0:
print("-1")
else:
print(len(re))
for i in re:
print(i, end=' ')
print() | if len(re)<0: | 36 | decision |
import math
class Solution:
def resolve(self, p, k):
re = []
d = p
a = int(d / k)
if a == 0:
return []
while a > k:
re.append(d - a * k)
b = int(math.ceil(a/k))
re.append(b * k - a)
d = b
a = int(b/k)
if a == 0:
return []
re.append(d - a * k)
re.append(k - a)
re.append(1)
return re
if __name__ == '__main__':
s = Solution()
p, k = map(int, input().split())
re = s.resolve(p, k)
if len(re) == 0:
print("-1")
else:
print(len(re))
for i in re:
print(i, end=' ')
print() | import math
class Solution:
def resolve(self, p, k):
re = []
d = p
a = int(d / k)
if a == 0:
return []
while a > k:
re.append(d - a * k)
b = int(math.ceil(a/k))
re.append(b * k - a)
d = b
a = int(b/k)
if a == 0:
return []
re.append(d - a**k)
re.append(k - a)
re.append(1)
return re
if __name__ == '__main__':
s = Solution()
p, k = map(int, input().split())
re = s.resolve(p, k)
if len(re) == 0:
print("-1")
else:
print(len(re))
for i in re:
print(i, end=' ')
print() | re.append(d - a**k) | 23 | operation |
Subsets and Splits