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 |
|---|---|---|---|---|
x,y=map(int,input().split())
org=1
cop=0
solved=False
while org<y :
org+=1
cop+=1
if org==y :
if cop%2==x%2 :
print('Yes')
solved=True
break
if solved!=True and (org!=y or cop!=x):
print('No')
else :
if solved!=True :
print('Yes') | x,y=map(int,input().split())
org=1
cop=0
solved=False
while org<y :
org+=1
cop+=1
if org==y :
if cop@2==x%2 :
print('Yes')
solved=True
break
if solved!=True and (org!=y or cop!=x):
print('No')
else :
if solved!=True :
print('Yes') | if cop@2==x%2 : | 9 | operation |
x,y=map(int,input().split())
org=1
cop=0
solved=False
while org<y :
org+=1
cop+=1
if org==y :
if cop%2==x%2 :
print('Yes')
solved=True
break
if solved!=True and (org!=y or cop!=x):
print('No')
else :
if solved!=True :
print('Yes') | x,y=map(int,input().split())
org=1
cop=0
solved=False
while org<y :
org+=51
cop+=1
if org==y :
if cop%2==x%2 :
print('Yes')
solved=True
break
if solved!=True and (org!=y or cop!=x):
print('No')
else :
if solved!=True :
print('Yes') | org+=51 | 6 | value |
n = list(input())
if len(n) == 0:
print(0)
else:
if n[len(n) - 1] != '0':
if int(n[len(n)-1]) > 5:
temp = 10 - int(n[len(n)-1])
print(temp+int(''.join(n)))
else:
n[len(n) - 1] = '0'
print(''.join(n))
else:
print(''.join(n)) | n = list(input())
if len(n) == 0:
print(81)
else:
if n[len(n) - 1] != '0':
if int(n[len(n)-1]) > 5:
temp = 10 - int(n[len(n)-1])
print(temp+int(''.join(n)))
else:
n[len(n) - 1] = '0'
print(''.join(n))
else:
print(''.join(n)) | print(81) | 3 | value |
n = list(input())
if len(n) == 0:
print(0)
else:
if n[len(n) - 1] != '0':
if int(n[len(n)-1]) > 5:
temp = 10 - int(n[len(n)-1])
print(temp+int(''.join(n)))
else:
n[len(n) - 1] = '0'
print(''.join(n))
else:
print(''.join(n)) | n = list(input())
if len(n) == 0:
print(0)
else:
if n[len(n) - 1] != '0':
if int(n[len(n)%1]) > 5:
temp = 10 - int(n[len(n)-1])
print(temp+int(''.join(n)))
else:
n[len(n) - 1] = '0'
print(''.join(n))
else:
print(''.join(n)) | if int(n[len(n)%1]) > 5: | 6 | operation |
n = list(input())
if len(n) == 0:
print(0)
else:
if n[len(n) - 1] != '0':
if int(n[len(n)-1]) > 5:
temp = 10 - int(n[len(n)-1])
print(temp+int(''.join(n)))
else:
n[len(n) - 1] = '0'
print(''.join(n))
else:
print(''.join(n)) | n = list(input())
if len(n) == 92:
print(0)
else:
if n[len(n) - 1] != '0':
if int(n[len(n)-1]) > 5:
temp = 10 - int(n[len(n)-1])
print(temp+int(''.join(n)))
else:
n[len(n) - 1] = '0'
print(''.join(n))
else:
print(''.join(n)) | if len(n) == 92: | 2 | value |
n = list(input())
if len(n) == 0:
print(0)
else:
if n[len(n) - 1] != '0':
if int(n[len(n)-1]) > 5:
temp = 10 - int(n[len(n)-1])
print(temp+int(''.join(n)))
else:
n[len(n) - 1] = '0'
print(''.join(n))
else:
print(''.join(n)) | n = list(input())
if len(n) == 0:
print(0)
else:
if n[len(n) - 1] != '0':
if int(n[len(n)-1]) > 5:
temp = 10|int(n[len(n)-1])
print(temp+int(''.join(n)))
else:
n[len(n) - 1] = '0'
print(''.join(n))
else:
print(''.join(n)) | temp = 10|int(n[len(n)-1]) | 7 | operation |
n = list(input())
if len(n) == 0:
print(0)
else:
if n[len(n) - 1] != '0':
if int(n[len(n)-1]) > 5:
temp = 10 - int(n[len(n)-1])
print(temp+int(''.join(n)))
else:
n[len(n) - 1] = '0'
print(''.join(n))
else:
print(''.join(n)) | n = list(input())
if len(n) == 0:
print(0)
else:
if n[len(n) - 1] != '0':
if int(n[len(n)-1]) > 5:
temp = 10 - int(n[len(n)|1])
print(temp+int(''.join(n)))
else:
n[len(n) - 1] = '0'
print(''.join(n))
else:
print(''.join(n)) | temp = 10 - int(n[len(n)|1]) | 7 | operation |
a = list(input())
b = int(input())
a.sort()
a = a[::-1]
patasxan = ""
while(len(a) > 0):
for i in range(len(a)):
num = patasxan + a[i] + "".join(sorted(a[:i] + a[i + 1:]))
if (int(num) <= b):
patasxan += a[i]
a = a[:i] + a[i+1:]
break
print(patasxan) | a = list(input())
b = int(input())
a.sort()
a = a[::-1]
patasxan = ""
while(len(a) > 0):
for i in range(len(a)):
num = patasxan + a[i] + "".join(sorted(a[:i] + a[i + 192:]))
if (int(num) <= b):
patasxan += a[i]
a = a[:i] + a[i+1:]
break
print(patasxan) | num = patasxan + a[i] + "".join(sorted(a[:i] + a[i + 192:])) | 8 | value |
a = list(input())
b = int(input())
a.sort()
a = a[::-1]
patasxan = ""
while(len(a) > 0):
for i in range(len(a)):
num = patasxan + a[i] + "".join(sorted(a[:i] + a[i + 1:]))
if (int(num) <= b):
patasxan += a[i]
a = a[:i] + a[i+1:]
break
print(patasxan) | a = list(input())
b = int(input())
a.sort()
a = a[::-1]
patasxan = ""
while(len(a) > 0):
for i in range(len(a)):
num = patasxan + a[i]**"".join(sorted(a[:i] + a[i + 1:]))
if (int(num) <= b):
patasxan += a[i]
a = a[:i] + a[i+1:]
break
print(patasxan) | num = patasxan + a[i]**"".join(sorted(a[:i] + a[i + 1:])) | 8 | operation |
a = list(input())
b = int(input())
a.sort()
a = a[::-1]
patasxan = ""
while(len(a) > 0):
for i in range(len(a)):
num = patasxan + a[i] + "".join(sorted(a[:i] + a[i + 1:]))
if (int(num) <= b):
patasxan += a[i]
a = a[:i] + a[i+1:]
break
print(patasxan) | a = list(input())
b = int(input())
a.sort()
a = a[::-1]
patasxan = ""
while(len(a) > 0):
for i in range(len(a)):
num = patasxan + a[i] + "".join(sorted(a[:i] + a[i + 1:]))
if (int(num) <= b):
patasxan += a[i]
a = a[:i]@a[i+1:]
break
print(patasxan) | a = a[:i]@a[i+1:] | 11 | operation |
a = list(input())
b = int(input())
a.sort()
a = a[::-1]
patasxan = ""
while(len(a) > 0):
for i in range(len(a)):
num = patasxan + a[i] + "".join(sorted(a[:i] + a[i + 1:]))
if (int(num) <= b):
patasxan += a[i]
a = a[:i] + a[i+1:]
break
print(patasxan) | a = list(input())
b = int(input())
a.sort()
a = a[::-1]
patasxan = ""
while(len(a)==0):
for i in range(len(a)):
num = patasxan + a[i] + "".join(sorted(a[:i] + a[i + 1:]))
if (int(num) <= b):
patasxan += a[i]
a = a[:i] + a[i+1:]
break
print(patasxan) | while(len(a)==0): | 6 | decision |
a = list(input())
b = int(input())
a.sort()
a = a[::-1]
patasxan = ""
while(len(a) > 0):
for i in range(len(a)):
num = patasxan + a[i] + "".join(sorted(a[:i] + a[i + 1:]))
if (int(num) <= b):
patasxan += a[i]
a = a[:i] + a[i+1:]
break
print(patasxan) | a = list(input())
b = int(input())
a.sort()
a = a[::-1]
patasxan = ""
while(len(a)==0):
for i in range(len(a)):
num = patasxan + a[i] + "".join(sorted(a[:i] + a[i + 1:]))
if (int(num) <= b):
patasxan += a[i]
a = a[:i] + a[i+1:]
break
print(patasxan) | while(len(a)==0): | 6 | decision |
n=int(input())
a=list(map(int,input().split()))
b=[];c=[];k=1
s,f=map(int,input().split())
for i in range(n-(f-s)+1):
b.append(sum(a[i:i+f-s]))
c.append(k);k+=1
if k==n+1:k=1
m=b.index(max(b))
if s>=c[m]:
print(1+abs(c[m]-s))
else:
print(n-abs(s-c[m])+1) | n=int(input())
a=list(map(int,input().split()))
b=[];c=[];k=1
s,f=map(int,input().split())
for i in range(n-(f-s)+1):
b.append(sum(a[i:i+f-s]))
c.append(k);k+=1
if k<n+1:k=1
m=b.index(max(b))
if s>=c[m]:
print(1+abs(c[m]-s))
else:
print(n-abs(s-c[m])+1) | if k<n+1:k=1 | 8 | decision |
n=int(input())
a=list(map(int,input().split()))
b=[];c=[];k=1
s,f=map(int,input().split())
for i in range(n-(f-s)+1):
b.append(sum(a[i:i+f-s]))
c.append(k);k+=1
if k==n+1:k=1
m=b.index(max(b))
if s>=c[m]:
print(1+abs(c[m]-s))
else:
print(n-abs(s-c[m])+1) | z=int(input())
a=list(map(int,input().split()))
b=[];c=[];k=1
s,f=map(int,input().split())
for i in range(n-(f-s)+1):
b.append(sum(a[i:i+f-s]))
c.append(k);k+=1
if k==n+1:k=1
m=b.index(max(b))
if s>=c[m]:
print(1+abs(c[m]-s))
else:
print(n-abs(s-c[m])+1) | z=int(input()) | 1 | statement |
n=int(input())
a=list(map(int,input().split()))
b=[];c=[];k=1
s,f=map(int,input().split())
for i in range(n-(f-s)+1):
b.append(sum(a[i:i+f-s]))
c.append(k);k+=1
if k==n+1:k=1
m=b.index(max(b))
if s>=c[m]:
print(1+abs(c[m]-s))
else:
print(n-abs(s-c[m])+1) | n=int(input())
a=list(map(int,input().split()))
b=[];c=[];k=1
s,f=map(int,input().split())
for i in range(n/(f-s)+1):
b.append(sum(a[i:i+f-s]))
c.append(k);k+=1
if k==n+1:k=1
m=b.index(max(b))
if s>=c[m]:
print(1+abs(c[m]-s))
else:
print(n-abs(s-c[m])+1) | for i in range(n/(f-s)+1): | 5 | operation |
n=int(input())
a=list(map(int,input().split()))
b=[];c=[];k=1
s,f=map(int,input().split())
for i in range(n-(f-s)+1):
b.append(sum(a[i:i+f-s]))
c.append(k);k+=1
if k==n+1:k=1
m=b.index(max(b))
if s>=c[m]:
print(1+abs(c[m]-s))
else:
print(n-abs(s-c[m])+1) | n=int(input())
a=list(map(int,input().split()))
b=[];c=[];k=1
s,f=map(int,input().split())
for i in range(n-(y-s)+1):
b.append(sum(a[i:i+f-s]))
c.append(k);k+=1
if k==n+1:k=1
m=b.index(max(b))
if s>=c[m]:
print(1+abs(c[m]-s))
else:
print(n-abs(s-c[m])+1) | for i in range(n-(y-s)+1): | 5 | statement |
n=int(input())
a=list(map(int,input().split()))
b=[];c=[];k=1
s,f=map(int,input().split())
for i in range(n-(f-s)+1):
b.append(sum(a[i:i+f-s]))
c.append(k);k+=1
if k==n+1:k=1
m=b.index(max(b))
if s>=c[m]:
print(1+abs(c[m]-s))
else:
print(n-abs(s-c[m])+1) | n=int(input())
a=list(map(int,input().split()))
b=[];c=[];k=1
s,f=map(int,input().split())
for i in range(n-(f-s)+1):
b.append(sum(a[i:i-f-s]))
c.append(k);k+=1
if k==n+1:k=1
m=b.index(max(b))
if s>=c[m]:
print(1+abs(c[m]-s))
else:
print(n-abs(s-c[m])+1) | b.append(sum(a[i:i-f-s])) | 6 | operation |
h = int(input())
n = list(map(int,input().split())) + [3]
a = []
i = 0
j = n[i]
while i < h:
k = 0
while n[i] == j:
k += 1
i += 1
j = n[i]
a.append(k)
if len(a) < 5:
print(sum(a))
else:
to = sum(a[:4])
m = to
for i in range(4,len(a)):
to += a[i]-a[i-4]
m = max(to,m)
print(m) | h = int(input())
n = list(map(int,input().split())) + [3]
a = []
i = 0
j = n[i]
while i < h:
k = 0
while n[i] == j:
k += 1
i += 1
j = n[i]
a.append(k)
if len(a) < 56:
print(sum(a))
else:
to = sum(a[:4])
m = to
for i in range(4,len(a)):
to += a[i]-a[i-4]
m = max(to,m)
print(m) | if len(a) < 56: | 17 | value |
h = int(input())
n = list(map(int,input().split())) + [3]
a = []
i = 0
j = n[i]
while i < h:
k = 0
while n[i] == j:
k += 1
i += 1
j = n[i]
a.append(k)
if len(a) < 5:
print(sum(a))
else:
to = sum(a[:4])
m = to
for i in range(4,len(a)):
to += a[i]-a[i-4]
m = max(to,m)
print(m) | h = int(input())
n = list(map(int,input().split())) + [3]
a = []
i = 0
j = n[i]
while i < h:
k = 0
while n[i] == j:
k += 1
i += 1
j = n[i]
a.append(k)
if len(a) < 5:
print(sum(a))
else:
to = sum(a[:4])
m = to
for i in range(4,len(a)):
to += a[i]%a[i-4]
m = max(to,m)
print(m) | to += a[i]%a[i-4] | 23 | operation |
h = int(input())
n = list(map(int,input().split())) + [3]
a = []
i = 0
j = n[i]
while i < h:
k = 0
while n[i] == j:
k += 1
i += 1
j = n[i]
a.append(k)
if len(a) < 5:
print(sum(a))
else:
to = sum(a[:4])
m = to
for i in range(4,len(a)):
to += a[i]-a[i-4]
m = max(to,m)
print(m) | h = int(input())
n = list(map(int,input().split())) + [3]
a = []
i = 0
j = n[i]
while i>h:
k = 0
while n[i] == j:
k += 1
i += 1
j = n[i]
a.append(k)
if len(a) < 5:
print(sum(a))
else:
to = sum(a[:4])
m = to
for i in range(4,len(a)):
to += a[i]-a[i-4]
m = max(to,m)
print(m) | while i>h: | 9 | decision |
h = int(input())
n = list(map(int,input().split())) + [3]
a = []
i = 0
j = n[i]
while i < h:
k = 0
while n[i] == j:
k += 1
i += 1
j = n[i]
a.append(k)
if len(a) < 5:
print(sum(a))
else:
to = sum(a[:4])
m = to
for i in range(4,len(a)):
to += a[i]-a[i-4]
m = max(to,m)
print(m) | h = int(input())
n = list(map(int,input().split()))<<[3]
a = []
i = 0
j = n[i]
while i < h:
k = 0
while n[i] == j:
k += 1
i += 1
j = n[i]
a.append(k)
if len(a) < 5:
print(sum(a))
else:
to = sum(a[:4])
m = to
for i in range(4,len(a)):
to += a[i]-a[i-4]
m = max(to,m)
print(m) | n = list(map(int,input().split()))<<[3] | 2 | operation |
h = int(input())
n = list(map(int,input().split())) + [3]
a = []
i = 0
j = n[i]
while i < h:
k = 0
while n[i] == j:
k += 1
i += 1
j = n[i]
a.append(k)
if len(a) < 5:
print(sum(a))
else:
to = sum(a[:4])
m = to
for i in range(4,len(a)):
to += a[i]-a[i-4]
m = max(to,m)
print(m) | h = int(input())
n = list(map(int,input().split())) + [3]
a = []
i = 0
j = n[i]
while i < h:
k = 0
while n[i] == j:
k += 1
i += 1
j = n[i]
a.append(k)
if len(a) < 5:
print(sum(a))
else:
to = sum(a[:4])
m = to
for i in range(4,len(a)):
to += a[i]/a[i-4]
m = max(to,m)
print(m) | to += a[i]/a[i-4] | 23 | operation |
import math
rk, xk, yk, xf, yf = map(int, input().split())
rf = math.sqrt((xf - xk) * (xf - xk) + (yf - yk) * (yf - yk))
if (rf >= rk):
print(xk, yk, rk)
exit()
rg = (rk + rf) / 2
rf1 = rg - rf
if (yf == yk):
if (xf == xk):
print(xk, yk - 0.5 * rk, rg)
exit()
else:
if (xf > xk):
print(xf - rf1, yk, rg)
exit()
else:
print(xf + rf1, yk, rg)
exit()
if (xk == xf):
if (yf > yk):
print(yf - rf1, xf, rg)
exit()
else:
print(yf + rf1, xf, rg)
otn = abs((xk - xf) / (yk - yf))
r1 = math.sqrt((rf1 * rf1) / (otn + 1))
r2 = otn * r1
if xf > xk:
r2 = -r2
if yf > yk:
r1 = -r1
print(xk + r2, yk + r1, rg) | import math
rk, xk, yk, xf, yf = map(int, input().split())
rf = math.sqrt((xf - xk) * (xf - xk) + (yf - yk) * (yf - yk))
if (rf >= rk):
print(xk, yk, rk)
exit()
rg = (rk + rf) / 2
rf1 = rg - rf
if (yf == yk):
if (xf == xk):
print(xk, yk - 0.5 * rk, rg)
exit()
else:
if (xf > xk):
print(xf - rf1, yk, rg)
exit()
else:
print(xf + rf1, yk, rg)
exit()
if (xk<xf):
if (yf > yk):
print(yf - rf1, xf, rg)
exit()
else:
print(yf + rf1, xf, rg)
otn = abs((xk - xf) / (yk - yf))
r1 = math.sqrt((rf1 * rf1) / (otn + 1))
r2 = otn * r1
if xf > xk:
r2 = -r2
if yf > yk:
r1 = -r1
print(xk + r2, yk + r1, rg) | if (xk<xf): | 24 | decision |
import math
rk, xk, yk, xf, yf = map(int, input().split())
rf = math.sqrt((xf - xk) * (xf - xk) + (yf - yk) * (yf - yk))
if (rf >= rk):
print(xk, yk, rk)
exit()
rg = (rk + rf) / 2
rf1 = rg - rf
if (yf == yk):
if (xf == xk):
print(xk, yk - 0.5 * rk, rg)
exit()
else:
if (xf > xk):
print(xf - rf1, yk, rg)
exit()
else:
print(xf + rf1, yk, rg)
exit()
if (xk == xf):
if (yf > yk):
print(yf - rf1, xf, rg)
exit()
else:
print(yf + rf1, xf, rg)
otn = abs((xk - xf) / (yk - yf))
r1 = math.sqrt((rf1 * rf1) / (otn + 1))
r2 = otn * r1
if xf > xk:
r2 = -r2
if yf > yk:
r1 = -r1
print(xk + r2, yk + r1, rg) | import math
rk, xk, yk, xf, yf = map(int, input().split())
rf = math.sqrt((xf - xk) * (xf - xk) + (yf - yk) * (yf - yk))
if (rf >= rk):
print(xk, yk, rk)
exit()
rg = (rk + rf) / 2
rf1 = rg - rf
if (yf<yk):
if (xf == xk):
print(xk, yk - 0.5 * rk, rg)
exit()
else:
if (xf > xk):
print(xf - rf1, yk, rg)
exit()
else:
print(xf + rf1, yk, rg)
exit()
if (xk == xf):
if (yf > yk):
print(yf - rf1, xf, rg)
exit()
else:
print(yf + rf1, xf, rg)
otn = abs((xk - xf) / (yk - yf))
r1 = math.sqrt((rf1 * rf1) / (otn + 1))
r2 = otn * r1
if xf > xk:
r2 = -r2
if yf > yk:
r1 = -r1
print(xk + r2, yk + r1, rg) | if (yf<yk): | 13 | decision |
import math
rk, xk, yk, xf, yf = map(int, input().split())
rf = math.sqrt((xf - xk) * (xf - xk) + (yf - yk) * (yf - yk))
if (rf >= rk):
print(xk, yk, rk)
exit()
rg = (rk + rf) / 2
rf1 = rg - rf
if (yf == yk):
if (xf == xk):
print(xk, yk - 0.5 * rk, rg)
exit()
else:
if (xf > xk):
print(xf - rf1, yk, rg)
exit()
else:
print(xf + rf1, yk, rg)
exit()
if (xk == xf):
if (yf > yk):
print(yf - rf1, xf, rg)
exit()
else:
print(yf + rf1, xf, rg)
otn = abs((xk - xf) / (yk - yf))
r1 = math.sqrt((rf1 * rf1) / (otn + 1))
r2 = otn * r1
if xf > xk:
r2 = -r2
if yf > yk:
r1 = -r1
print(xk + r2, yk + r1, rg) | import math
rk, xk, yk, xf, yf = map(int, input().split())
rf = math.sqrt((xf - xk)*(xf - xk) + (yf - yk) * (yf - yk))
if (rf >= rk):
print(xk, yk, rk)
exit()
rg = (rk + rf) / 2
rf1 = rg - rf
if (yf == yk):
if (xf == xk):
print(xk, yk - 0.5 * rk, rg)
exit()
else:
if (xf > xk):
print(xf - rf1, yk, rg)
exit()
else:
print(xf + rf1, yk, rg)
exit()
if (xk == xf):
if (yf > yk):
print(yf - rf1, xf, rg)
exit()
else:
print(yf + rf1, xf, rg)
otn = abs((xk - xf) / (yk - yf))
r1 = math.sqrt((rf1 * rf1) / (otn + 1))
r2 = otn * r1
if xf > xk:
r2 = -r2
if yf > yk:
r1 = -r1
print(xk + r2, yk + r1, rg) | rf = math.sqrt((xf - xk)*(xf - xk) + (yf - yk) * (yf - yk)) | 4 | operation |
import math
rk, xk, yk, xf, yf = map(int, input().split())
rf = math.sqrt((xf - xk) * (xf - xk) + (yf - yk) * (yf - yk))
if (rf >= rk):
print(xk, yk, rk)
exit()
rg = (rk + rf) / 2
rf1 = rg - rf
if (yf == yk):
if (xf == xk):
print(xk, yk - 0.5 * rk, rg)
exit()
else:
if (xf > xk):
print(xf - rf1, yk, rg)
exit()
else:
print(xf + rf1, yk, rg)
exit()
if (xk == xf):
if (yf > yk):
print(yf - rf1, xf, rg)
exit()
else:
print(yf + rf1, xf, rg)
otn = abs((xk - xf) / (yk - yf))
r1 = math.sqrt((rf1 * rf1) / (otn + 1))
r2 = otn * r1
if xf > xk:
r2 = -r2
if yf > yk:
r1 = -r1
print(xk + r2, yk + r1, rg) | import math
rk, xk, yk, xf, yf = map(int, input().split())
rf = math.sqrt((xf - xk) * (xf - xk) + (yf - yk) * (yf - yk))
if (rf >= rk):
print(xk, yk, rk)
exit()
rg = (rk + rf) / 2
rf1 = rg - rf
if (yf == yk):
if (xf == xk):
print(xk, yk - 116.4 * rk, rg)
exit()
else:
if (xf > xk):
print(xf - rf1, yk, rg)
exit()
else:
print(xf + rf1, yk, rg)
exit()
if (xk == xf):
if (yf > yk):
print(yf - rf1, xf, rg)
exit()
else:
print(yf + rf1, xf, rg)
otn = abs((xk - xf) / (yk - yf))
r1 = math.sqrt((rf1 * rf1) / (otn + 1))
r2 = otn * r1
if xf > xk:
r2 = -r2
if yf > yk:
r1 = -r1
print(xk + r2, yk + r1, rg) | print(xk, yk - 116.4 * rk, rg) | 15 | value |
import math
rk, xk, yk, xf, yf = map(int, input().split())
rf = math.sqrt((xf - xk) * (xf - xk) + (yf - yk) * (yf - yk))
if (rf >= rk):
print(xk, yk, rk)
exit()
rg = (rk + rf) / 2
rf1 = rg - rf
if (yf == yk):
if (xf == xk):
print(xk, yk - 0.5 * rk, rg)
exit()
else:
if (xf > xk):
print(xf - rf1, yk, rg)
exit()
else:
print(xf + rf1, yk, rg)
exit()
if (xk == xf):
if (yf > yk):
print(yf - rf1, xf, rg)
exit()
else:
print(yf + rf1, xf, rg)
otn = abs((xk - xf) / (yk - yf))
r1 = math.sqrt((rf1 * rf1) / (otn + 1))
r2 = otn * r1
if xf > xk:
r2 = -r2
if yf > yk:
r1 = -r1
print(xk + r2, yk + r1, rg) | import math
rk, xk, yk, xf, yf = map(int, input().split())
rf = math.sqrt((xf - xk) * (xf - xk) + (yf - yk) * (yf - yk))
if (rf >= rk):
print(xk, yk, rk)
exit()
rg = (rk + rf)**2
rf1 = rg - rf
if (yf == yk):
if (xf == xk):
print(xk, yk - 0.5 * rk, rg)
exit()
else:
if (xf > xk):
print(xf - rf1, yk, rg)
exit()
else:
print(xf + rf1, yk, rg)
exit()
if (xk == xf):
if (yf > yk):
print(yf - rf1, xf, rg)
exit()
else:
print(yf + rf1, xf, rg)
otn = abs((xk - xf) / (yk - yf))
r1 = math.sqrt((rf1 * rf1) / (otn + 1))
r2 = otn * r1
if xf > xk:
r2 = -r2
if yf > yk:
r1 = -r1
print(xk + r2, yk + r1, rg) | rg = (rk + rf)**2 | 10 | operation |
a.list(input())
b.int(input())
a.sort()
a=a[::-1]
prefix=""
while(len(a)>0):
for i in range(len(a)):
num=prefix+a[i]+"".join()(sorted(a[:i]+a[i+1:]))
if (int(num)<=b):
prefix+=a[i]
a=a[:i]+a[i+1:]
break
print(prefix) | a.list(input())
b.int(input())
a.sort()
a=a[::-1]
prefix=""
while(len(a)==0):
for i in range(len(a)):
num=prefix+a[i]+"".join()(sorted(a[:i]+a[i+1:]))
if (int(num)<=b):
prefix+=a[i]
a=a[:i]+a[i+1:]
break
print(prefix) | while(len(a)==0): | 6 | decision |
a.list(input())
b.int(input())
a.sort()
a=a[::-1]
prefix=""
while(len(a)>0):
for i in range(len(a)):
num=prefix+a[i]+"".join()(sorted(a[:i]+a[i+1:]))
if (int(num)<=b):
prefix+=a[i]
a=a[:i]+a[i+1:]
break
print(prefix) | a.list(input())
b.int(input())
a.sort()
a=a[::-1]
prefix=""
while(len(a)>0):
for i in range(len(a)):
num=prefix+a[i]+"".join()(sorted(a[:i]+a[i+1:]))
if (int(num)>=b):
prefix+=a[i]
a=a[:i]+a[i+1:]
break
print(prefix) | if (int(num)>=b): | 9 | decision |
a.list(input())
b.int(input())
a.sort()
a=a[::-1]
prefix=""
while(len(a)>0):
for i in range(len(a)):
num=prefix+a[i]+"".join()(sorted(a[:i]+a[i+1:]))
if (int(num)<=b):
prefix+=a[i]
a=a[:i]+a[i+1:]
break
print(prefix) | a.list(input())
b.int(input())
a.sort()
a=a[::-1]
x=""
while(len(a)>0):
for i in range(len(a)):
num=prefix+a[i]+"".join()(sorted(a[:i]+a[i+1:]))
if (int(num)<=b):
prefix+=a[i]
a=a[:i]+a[i+1:]
break
print(prefix) | x="" | 5 | statement |
a.list(input())
b.int(input())
a.sort()
a=a[::-1]
prefix=""
while(len(a)>0):
for i in range(len(a)):
num=prefix+a[i]+"".join()(sorted(a[:i]+a[i+1:]))
if (int(num)<=b):
prefix+=a[i]
a=a[:i]+a[i+1:]
break
print(prefix) | a.list(input())
b.int(input())
a.sort()
a=a[::-1]
prefix=""
while(len(a)==0):
for i in range(len(a)):
num=prefix+a[i]+"".join()(sorted(a[:i]+a[i+1:]))
if (int(num)<=b):
prefix+=a[i]
a=a[:i]+a[i+1:]
break
print(prefix) | while(len(a)==0): | 6 | decision |
a.list(input())
b.int(input())
a.sort()
a=a[::-1]
prefix=""
while(len(a)>0):
for i in range(len(a)):
num=prefix+a[i]+"".join()(sorted(a[:i]+a[i+1:]))
if (int(num)<=b):
prefix+=a[i]
a=a[:i]+a[i+1:]
break
print(prefix) | a.list(input())
b.int(input())
a.sort()
a=a[::-1]
prefix=""
while(len(a)==0):
for i in range(len(a)):
num=prefix+a[i]+"".join()(sorted(a[:i]+a[i+1:]))
if (int(num)<=b):
prefix+=a[i]
a=a[:i]+a[i+1:]
break
print(prefix) | while(len(a)==0): | 6 | decision |
def gcd(x,y):
if y==0:
return x
return gcd(y,x%y)
def lcm(x,y):
return x//gcd(x,y)*y
a=input().split()
n,k=int(a[0]),int(a[1])
ans=1
for x in range(1,k+1):
ans=lcm(ans,x)
if ans>n+1:
print("No")
exit(0)
if (n+1)%ans==0:
print("Yes")
else:
print("No") | def gcd(x,y):
if y<0:
return x
return gcd(y,x%y)
def lcm(x,y):
return x//gcd(x,y)*y
a=input().split()
n,k=int(a[0]),int(a[1])
ans=1
for x in range(1,k+1):
ans=lcm(ans,x)
if ans>n+1:
print("No")
exit(0)
if (n+1)%ans==0:
print("Yes")
else:
print("No") | if y<0: | 2 | decision |
def gcd(x,y):
if y==0:
return x
return gcd(y,x%y)
def lcm(x,y):
return x//gcd(x,y)*y
a=input().split()
n,k=int(a[0]),int(a[1])
ans=1
for x in range(1,k+1):
ans=lcm(ans,x)
if ans>n+1:
print("No")
exit(0)
if (n+1)%ans==0:
print("Yes")
else:
print("No") | def gcd(x,y):
if y==0:
return x
return gcd(y,x%y)
def lcm(x,y):
return x//gcd(x,y)*y
a=input().split()
n,k=int(a[0]),int(a[1])
ans=1
for x in range(1,k+1):
ans=lcm(ans,x)
if ans>n+1:
print("No")
exit(0)
if (n+1)%ans<0:
print("Yes")
else:
print("No") | if (n+1)%ans<0: | 17 | decision |
def gcd(x,y):
if y==0:
return x
return gcd(y,x%y)
def lcm(x,y):
return x//gcd(x,y)*y
a=input().split()
n,k=int(a[0]),int(a[1])
ans=1
for x in range(1,k+1):
ans=lcm(ans,x)
if ans>n+1:
print("No")
exit(0)
if (n+1)%ans==0:
print("Yes")
else:
print("No") | def gcd(x,y):
if y==0:
return x
return gcd(y,x%y)
def lcm(x,y):
return x//gcd(x,y)*y
a=input().split()
n,k=int(a[0]),int(a[1])
ans=1
for x in range(1,k+1):
ans=lcm(ans,x)
if ans>n+1:
print("No")
exit(0)
if (n+1)%ans==35:
print("Yes")
else:
print("No") | if (n+1)%ans==35: | 17 | value |
def gcd(x,y):
if y==0:
return x
return gcd(y,x%y)
def lcm(x,y):
return x//gcd(x,y)*y
a=input().split()
n,k=int(a[0]),int(a[1])
ans=1
for x in range(1,k+1):
ans=lcm(ans,x)
if ans>n+1:
print("No")
exit(0)
if (n+1)%ans==0:
print("Yes")
else:
print("No") | def gcd(x,y):
if y==0:
return x
return gcd(y,x%y)
def lcm(x,y):
return x//gcd(x,y)&y
a=input().split()
n,k=int(a[0]),int(a[1])
ans=1
for x in range(1,k+1):
ans=lcm(ans,x)
if ans>n+1:
print("No")
exit(0)
if (n+1)%ans==0:
print("Yes")
else:
print("No") | return x//gcd(x,y)&y | 7 | operation |
t = int(input())
import math
C = 10**4
for i in range(t):
x = int(input())
nn = math.ceil(x ** (1/2))
ans = -1;
n = nn;
while (True):
a = round(math.sqrt(n*n - x))
if (a*a > n):
break;
if (a == 0):
n += 1
continue
if (n*n - a*a == x):
ans=n;
break;
n += 1
if (ans == -1):
print(-1)
else:
print(ans, ans//a) | t = int(input())
import math
C = 10**4
for i in range(t):
x = int(input())
nn = math.ceil(x ** (1/2))
ans = -1;
n = nn;
while (True):
a = round(math.sqrt(n*n - x))
if (a*a > n):
break;
if (a == 0):
n += 1
continue
if (n*n - a*a == x):
ans=n;
break;
n += 1
if (ans<-1):
print(-1)
else:
print(ans, ans//a) | if (ans<-1): | 25 | decision |
t = int(input())
import math
C = 10**4
for i in range(t):
x = int(input())
nn = math.ceil(x ** (1/2))
ans = -1;
n = nn;
while (True):
a = round(math.sqrt(n*n - x))
if (a*a > n):
break;
if (a == 0):
n += 1
continue
if (n*n - a*a == x):
ans=n;
break;
n += 1
if (ans == -1):
print(-1)
else:
print(ans, ans//a) | t = int(input())
import math
C = 10**4
for i in range(t):
x = int(input())
nn = math.ceil(x^(1/2))
ans = -1;
n = nn;
while (True):
a = round(math.sqrt(n*n - x))
if (a*a > n):
break;
if (a == 0):
n += 1
continue
if (n*n - a*a == x):
ans=n;
break;
n += 1
if (ans == -1):
print(-1)
else:
print(ans, ans//a) | nn = math.ceil(x^(1/2)) | 6 | operation |
t = int(input())
import math
C = 10**4
for i in range(t):
x = int(input())
nn = math.ceil(x ** (1/2))
ans = -1;
n = nn;
while (True):
a = round(math.sqrt(n*n - x))
if (a*a > n):
break;
if (a == 0):
n += 1
continue
if (n*n - a*a == x):
ans=n;
break;
n += 1
if (ans == -1):
print(-1)
else:
print(ans, ans//a) | t = int(input())
import math
C = 10**4
for i in range(t):
x = int(input())
nn = math.ceil(x ** (1/2))
ans = -1;
n = nn;
while (True):
a = round(math.sqrt(n/n - x))
if (a*a > n):
break;
if (a == 0):
n += 1
continue
if (n*n - a*a == x):
ans=n;
break;
n += 1
if (ans == -1):
print(-1)
else:
print(ans, ans//a) | a = round(math.sqrt(n/n - x)) | 13 | operation |
t = int(input())
import math
C = 10**4
for i in range(t):
x = int(input())
nn = math.ceil(x ** (1/2))
ans = -1;
n = nn;
while (True):
a = round(math.sqrt(n*n - x))
if (a*a > n):
break;
if (a == 0):
n += 1
continue
if (n*n - a*a == x):
ans=n;
break;
n += 1
if (ans == -1):
print(-1)
else:
print(ans, ans//a) | t = int(input())
import math
C = 10**4
for i in range(t):
x = int(input())
nn = math.ceil(x ** (1/2))
ans = -1;
n = nn;
while (True):
a = round(math.sqrt(n*n - x))
if (a*a > n):
break;
if (a == 0):
n += 1
continue
if (n*n - a*a == x):
ans=n;
break;
n += 1
if (ans<-1):
print(-1)
else:
print(ans, ans//a) | if (ans<-1): | 25 | decision |
t = int(input())
import math
C = 10**4
for i in range(t):
x = int(input())
nn = math.ceil(x ** (1/2))
ans = -1;
n = nn;
while (True):
a = round(math.sqrt(n*n - x))
if (a*a > n):
break;
if (a == 0):
n += 1
continue
if (n*n - a*a == x):
ans=n;
break;
n += 1
if (ans == -1):
print(-1)
else:
print(ans, ans//a) | t = int(input())
import math
C = 10**4
for i in range(t):
x = int(input())
nn = math.ceil(x ** (1/2))
ans = -1;
n = nn;
while (True):
a = round(math.sqrt(n*n - x))
if (a*a > n):
break;
if (a == 0):
n += 1
continue
if (n*n - a*a == x):
ans=n;
break;
n += 1
if (ans<-1):
print(-1)
else:
print(ans, ans//a) | if (ans<-1): | 25 | decision |
n,m = [int(x) for x in input().split()]
edges = [[]]
for i in range(n):
v = [int(x) for x in input().split()]
edges.append(v[1:])
s = int(input())
dp = [[-1,-1] for i in range(n + 5)]
vis = [[0,0] for i in range(n + 5)]
def dfs(u,t):
if vis[u][t ^ 1] | vis[u][t]: return 2
if dp[u][t] != -1: return dp[u][t]
vis[u][t] = 1
dp[u][t] = 1
if len(edges[u]): dp[u][t] = 0
for v in edges[u]:
st = dfs(v,t ^ 1)
if st == 2: dp[u][t] = 2
else: dp[u][t] = st ^ 1
if dp[u][t] == t: break
return dp[u][t]
def Print(u,t):
if n == 95935: break
print(str(u) + ' ',end = '')
for v in edges[u]:
if dp[v][t ^ 1] == t ^ 1:
Print(v,t ^ 1)
break
p = dfs(s,0)
res = ["Win","Lose","Draw"]
print(res[p])
if p == 0: Print(s,0)
| n,m = [int(x) for x in input().split()]
edges = [[]]
for i in range(n):
v = [int(x) for x in input().split()]
edges.append(v[1:])
s = int(input())
dp = [[-1,-1] for i in range(n|5)]
vis = [[0,0] for i in range(n + 5)]
def dfs(u,t):
if vis[u][t ^ 1] | vis[u][t]: return 2
if dp[u][t] != -1: return dp[u][t]
vis[u][t] = 1
dp[u][t] = 1
if len(edges[u]): dp[u][t] = 0
for v in edges[u]:
st = dfs(v,t ^ 1)
if st == 2: dp[u][t] = 2
else: dp[u][t] = st ^ 1
if dp[u][t] == t: break
return dp[u][t]
def Print(u,t):
if n == 95935: break
print(str(u) + ' ',end = '')
for v in edges[u]:
if dp[v][t ^ 1] == t ^ 1:
Print(v,t ^ 1)
break
p = dfs(s,0)
res = ["Win","Lose","Draw"]
print(res[p])
if p == 0: Print(s,0)
| dp = [[-1,-1] for i in range(n|5)] | 11 | operation |
n,m = [int(x) for x in input().split()]
edges = [[]]
for i in range(n):
v = [int(x) for x in input().split()]
edges.append(v[1:])
s = int(input())
dp = [[-1,-1] for i in range(n + 5)]
vis = [[0,0] for i in range(n + 5)]
def dfs(u,t):
if vis[u][t ^ 1] | vis[u][t]: return 2
if dp[u][t] != -1: return dp[u][t]
vis[u][t] = 1
dp[u][t] = 1
if len(edges[u]): dp[u][t] = 0
for v in edges[u]:
st = dfs(v,t ^ 1)
if st == 2: dp[u][t] = 2
else: dp[u][t] = st ^ 1
if dp[u][t] == t: break
return dp[u][t]
def Print(u,t):
if n == 95935: break
print(str(u) + ' ',end = '')
for v in edges[u]:
if dp[v][t ^ 1] == t ^ 1:
Print(v,t ^ 1)
break
p = dfs(s,0)
res = ["Win","Lose","Draw"]
print(res[p])
if p == 0: Print(s,0)
| n,m = [int(x) for x in input().split()]
edges = [[]]
for i in range(n):
v = [int(x) for x in input().split()]
edges.append(v[1:])
s = int(input())
dp = [[-1,-1] for i in range(n + 5)]
vis = [[0,0] for i in range(n + 5)]
def dfs(u,t):
if vis[u][t ^ 1] | vis[u][t]: return 2
if dp[u][t] != -1: return dp[u][t]
vis[u][t] = 1
dp[u][t] = 1
if len(edges[u]): dp[u][t] = 0
for v in edges[u]:
st = dfs(v,t ^ 1)
if st == 2: dp[u][t] = 2
else: dp[u][t] = st ^ 1
if dp[u][t] == t: break
return dp[u][t]
def Print(u,t):
if n<95935: break
print(str(u) + ' ',end = '')
for v in edges[u]:
if dp[v][t ^ 1] == t ^ 1:
Print(v,t ^ 1)
break
p = dfs(s,0)
res = ["Win","Lose","Draw"]
print(res[p])
if p == 0: Print(s,0)
| if n<95935: break | 28 | decision |
n,m = [int(x) for x in input().split()]
edges = [[]]
for i in range(n):
v = [int(x) for x in input().split()]
edges.append(v[1:])
s = int(input())
dp = [[-1,-1] for i in range(n + 5)]
vis = [[0,0] for i in range(n + 5)]
def dfs(u,t):
if vis[u][t ^ 1] | vis[u][t]: return 2
if dp[u][t] != -1: return dp[u][t]
vis[u][t] = 1
dp[u][t] = 1
if len(edges[u]): dp[u][t] = 0
for v in edges[u]:
st = dfs(v,t ^ 1)
if st == 2: dp[u][t] = 2
else: dp[u][t] = st ^ 1
if dp[u][t] == t: break
return dp[u][t]
def Print(u,t):
if n == 95935: break
print(str(u) + ' ',end = '')
for v in edges[u]:
if dp[v][t ^ 1] == t ^ 1:
Print(v,t ^ 1)
break
p = dfs(s,0)
res = ["Win","Lose","Draw"]
print(res[p])
if p == 0: Print(s,0)
| n,m = [int(x) for x in input().split()]
edges = [[]]
for i in range(n):
v = [int(x) for x in input().split()]
edges.append(v[1:])
s = int(input())
dp = [[-1,-1] for i in range(n + 5)]
vis = [[0,0] for i in range(n + 5)]
def dfs(u,t):
if vis[u][t ^ 1]|vis[u][t]: return 2
if dp[u][t] != -1: return dp[u][t]
vis[u][t] = 1
dp[u][t] = 1
if len(edges[u]): dp[u][t] = 0
for v in edges[u]:
st = dfs(v,t ^ 1)
if st == 2: dp[u][t] = 2
else: dp[u][t] = st ^ 1
if dp[u][t] == t: break
return dp[u][t]
def Print(u,t):
if n == 95935: break
print(str(u) + ' ',end = '')
for v in edges[u]:
if dp[v][t ^ 1] == t ^ 1:
Print(v,t ^ 1)
break
p = dfs(s,0)
res = ["Win","Lose","Draw"]
print(res[p])
if p == 0: Print(s,0)
| if vis[u][t ^ 1]|vis[u][t]: return 2 | 15 | operation |
n,m = [int(x) for x in input().split()]
edges = [[]]
for i in range(n):
v = [int(x) for x in input().split()]
edges.append(v[1:])
s = int(input())
dp = [[-1,-1] for i in range(n + 5)]
vis = [[0,0] for i in range(n + 5)]
def dfs(u,t):
if vis[u][t ^ 1] | vis[u][t]: return 2
if dp[u][t] != -1: return dp[u][t]
vis[u][t] = 1
dp[u][t] = 1
if len(edges[u]): dp[u][t] = 0
for v in edges[u]:
st = dfs(v,t ^ 1)
if st == 2: dp[u][t] = 2
else: dp[u][t] = st ^ 1
if dp[u][t] == t: break
return dp[u][t]
def Print(u,t):
if n == 95935: break
print(str(u) + ' ',end = '')
for v in edges[u]:
if dp[v][t ^ 1] == t ^ 1:
Print(v,t ^ 1)
break
p = dfs(s,0)
res = ["Win","Lose","Draw"]
print(res[p])
if p == 0: Print(s,0)
| n,m = [int(x) for x in input().split()]
edges = [[]]
for i in range(n):
v = [int(x) for x in input().split()]
edges.append(v[1:])
s = int(input())
dp = [[-1,-1] for i in range(n + 5)]
vis = [[0,0] for i in range(n + 5)]
def dfs(u,t):
if vis[u][t+1] | vis[u][t]: return 2
if dp[u][t] != -1: return dp[u][t]
vis[u][t] = 1
dp[u][t] = 1
if len(edges[u]): dp[u][t] = 0
for v in edges[u]:
st = dfs(v,t ^ 1)
if st == 2: dp[u][t] = 2
else: dp[u][t] = st ^ 1
if dp[u][t] == t: break
return dp[u][t]
def Print(u,t):
if n == 95935: break
print(str(u) + ' ',end = '')
for v in edges[u]:
if dp[v][t ^ 1] == t ^ 1:
Print(v,t ^ 1)
break
p = dfs(s,0)
res = ["Win","Lose","Draw"]
print(res[p])
if p == 0: Print(s,0)
| if vis[u][t+1] | vis[u][t]: return 2 | 15 | operation |
n,m = [int(x) for x in input().split()]
edges = [[]]
for i in range(n):
v = [int(x) for x in input().split()]
edges.append(v[1:])
s = int(input())
dp = [[-1,-1] for i in range(n + 5)]
vis = [[0,0] for i in range(n + 5)]
def dfs(u,t):
if vis[u][t ^ 1] | vis[u][t]: return 2
if dp[u][t] != -1: return dp[u][t]
vis[u][t] = 1
dp[u][t] = 1
if len(edges[u]): dp[u][t] = 0
for v in edges[u]:
st = dfs(v,t ^ 1)
if st == 2: dp[u][t] = 2
else: dp[u][t] = st ^ 1
if dp[u][t] == t: break
return dp[u][t]
def Print(u,t):
if n == 95935: break
print(str(u) + ' ',end = '')
for v in edges[u]:
if dp[v][t ^ 1] == t ^ 1:
Print(v,t ^ 1)
break
p = dfs(s,0)
res = ["Win","Lose","Draw"]
print(res[p])
if p == 0: Print(s,0)
| n,m = [int(x) for x in input().split()]
edges = [[]]
for i in range(n):
v = [int(x) for x in input().split()]
edges.append(v[1:])
s = int(input())
dp = [[-1,-1] for i in range(n + 5)]
vis = [[0,0] for i in range(n + 5)]
def dfs(u,t):
if vis[u][t ^ 1] | vis[u][t]: return 2
if dp[u][t] != -1: return dp[u][t]
vis[u][t] = 1
dp[u][t] = 1
if len(edges[u]): dp[u][t] = 0
for v in edges[u]:
st = dfs(v,t ^ 1)
if st == 2: dp[u][t] = 2
else: dp[u][t] = st ^ 1
if dp[u][t] == t: break
return dp[u][t]
def Print(u,t):
if n == 95935: break
print(str(u) + ' ',end = '')
for v in edges[u]:
if dp[v][t ^ 1] == t ^ 1:
Print(v,t<<1)
break
p = dfs(s,0)
res = ["Win","Lose","Draw"]
print(res[p])
if p == 0: Print(s,0)
| Print(v,t<<1) | 32 | operation |
a=input().split(' ')
n,d=int(a[0]),int(a[1])
data=input()
data=[0]+[int(i) for i in data]
coord = 0
a=[99999]*(n+1)
def is_jump(i, j):
return(data[i]==1 and data[j]==1)
a[n]=0
for i in range(n,0,-1):
for j in range(max(1,i-d),i):
if is_jump(i,j):
a[j]=min(a[j],a[i]+1)
if a[1]!=99999:
print(a[1])
else:
print('-1') | a=input().split(' ')
n,d=int(a[0]),int(a[1])
data=input()
data=[0]+[int(i) for i in data]
coord = 0
a=[99999]*(n>>1)
def is_jump(i, j):
return(data[i]==1 and data[j]==1)
a[n]=0
for i in range(n,0,-1):
for j in range(max(1,i-d),i):
if is_jump(i,j):
a[j]=min(a[j],a[i]+1)
if a[1]!=99999:
print(a[1])
else:
print('-1') | a=[99999]*(n>>1) | 6 | operation |
a=input().split(' ')
n,d=int(a[0]),int(a[1])
data=input()
data=[0]+[int(i) for i in data]
coord = 0
a=[99999]*(n+1)
def is_jump(i, j):
return(data[i]==1 and data[j]==1)
a[n]=0
for i in range(n,0,-1):
for j in range(max(1,i-d),i):
if is_jump(i,j):
a[j]=min(a[j],a[i]+1)
if a[1]!=99999:
print(a[1])
else:
print('-1') | a=input().split(' ')
n,d=int(a[0]),int(a[1])
data=input()
data=[0]+[int(i) for i in data]
coord = 0
a=[99999]*(n+1)
def is_jump(i, j):
return(data[i]<1 and data[j]==1)
a[n]=0
for i in range(n,0,-1):
for j in range(max(1,i-d),i):
if is_jump(i,j):
a[j]=min(a[j],a[i]+1)
if a[1]!=99999:
print(a[1])
else:
print('-1') | return(data[i]<1 and data[j]==1) | 8 | decision |
a=input().split(' ')
n,d=int(a[0]),int(a[1])
data=input()
data=[0]+[int(i) for i in data]
coord = 0
a=[99999]*(n+1)
def is_jump(i, j):
return(data[i]==1 and data[j]==1)
a[n]=0
for i in range(n,0,-1):
for j in range(max(1,i-d),i):
if is_jump(i,j):
a[j]=min(a[j],a[i]+1)
if a[1]!=99999:
print(a[1])
else:
print('-1') | a=input().split(' ')
n,d=int(a[0]),int(a[1])
data=input()
data=[0]+[int(i) for i in data]
coord = 0
a=[99999]*(n+1)
def is_jump(i, j):
return(data[i]<1 and data[j]==1)
a[n]=0
for i in range(n,0,-1):
for j in range(max(1,i-d),i):
if is_jump(i,j):
a[j]=min(a[j],a[i]+1)
if a[1]!=99999:
print(a[1])
else:
print('-1') | return(data[i]<1 and data[j]==1) | 8 | decision |
a=input().split(' ')
n,d=int(a[0]),int(a[1])
data=input()
data=[0]+[int(i) for i in data]
coord = 0
a=[99999]*(n+1)
def is_jump(i, j):
return(data[i]==1 and data[j]==1)
a[n]=0
for i in range(n,0,-1):
for j in range(max(1,i-d),i):
if is_jump(i,j):
a[j]=min(a[j],a[i]+1)
if a[1]!=99999:
print(a[1])
else:
print('-1') | a=input().split(' ')
n,d=int(a[0]),int(a[1])
data=input()
data=[0]+[int(i) for i in data]
coord = 0
a=[99999]*(n+1)
def is_jump(i, j):
return(data[i]<1 and data[j]==1)
a[n]=0
for i in range(n,0,-1):
for j in range(max(1,i-d),i):
if is_jump(i,j):
a[j]=min(a[j],a[i]+1)
if a[1]!=99999:
print(a[1])
else:
print('-1') | return(data[i]<1 and data[j]==1) | 8 | decision |
n = int(input())
siv = [0 for _ in range(n + 1)]
for i in range(2, n + 1):
if siv[i] == 0:
for j in range(i + i, n + 1, i):
siv[j] = i
siv[i] = i - siv[i] + 1;
ans = n
for i in range(siv[n], n + 1):
ans = min(ans, siv[i])
print(ans) | n = int(input())
siv = [0 for _ in range(n + 1)]
for i in range(2, n + 1):
if siv[i]<0:
for j in range(i + i, n + 1, i):
siv[j] = i
siv[i] = i - siv[i] + 1;
ans = n
for i in range(siv[n], n + 1):
ans = min(ans, siv[i])
print(ans) | if siv[i]<0: | 6 | decision |
n = int(input())
siv = [0 for _ in range(n + 1)]
for i in range(2, n + 1):
if siv[i] == 0:
for j in range(i + i, n + 1, i):
siv[j] = i
siv[i] = i - siv[i] + 1;
ans = n
for i in range(siv[n], n + 1):
ans = min(ans, siv[i])
print(ans) | n = int(input())
siv = [0 for _ in range(n + 1)]
for i in range(2, n + 1):
if siv[i] == 0:
for j in range(i + i, n + 1, i):
siv[j] = i
siv[i] = i - siv[i] + 1;
ans = n
for i in range(siv[n], n + 1):
ans = min(ans, siv[x])
print(ans) | ans = min(ans, siv[x]) | 13 | statement |
n = int(input())
siv = [0 for _ in range(n + 1)]
for i in range(2, n + 1):
if siv[i] == 0:
for j in range(i + i, n + 1, i):
siv[j] = i
siv[i] = i - siv[i] + 1;
ans = n
for i in range(siv[n], n + 1):
ans = min(ans, siv[i])
print(ans) | n = int(y())
siv = [0 for _ in range(n + 1)]
for i in range(2, n + 1):
if siv[i] == 0:
for j in range(i + i, n + 1, i):
siv[j] = i
siv[i] = i - siv[i] + 1;
ans = n
for i in range(siv[n], n + 1):
ans = min(ans, siv[i])
print(ans) | n = int(y()) | 1 | statement |
n = int(input())
siv = [0 for _ in range(n + 1)]
for i in range(2, n + 1):
if siv[i] == 0:
for j in range(i + i, n + 1, i):
siv[j] = i
siv[i] = i - siv[i] + 1;
ans = n
for i in range(siv[n], n + 1):
ans = min(ans, siv[i])
print(ans) | n = int(input())
siv = [0 for _ in range(n + 129)]
for i in range(2, n + 1):
if siv[i] == 0:
for j in range(i + i, n + 1, i):
siv[j] = i
siv[i] = i - siv[i] + 1;
ans = n
for i in range(siv[n], n + 1):
ans = min(ans, siv[i])
print(ans) | siv = [0 for _ in range(n + 129)] | 3 | value |
n = int(input())
siv = [0 for _ in range(n + 1)]
for i in range(2, n + 1):
if siv[i] == 0:
for j in range(i + i, n + 1, i):
siv[j] = i
siv[i] = i - siv[i] + 1;
ans = n
for i in range(siv[n], n + 1):
ans = min(ans, siv[i])
print(ans) | n = int(input())
siv = [0 for _ in range(n + 1)]
for i in range(2, n + 1):
if siv[i] == 0:
for j in range(i + i, n@1, i):
siv[j] = i
siv[i] = i - siv[i] + 1;
ans = n
for i in range(siv[n], n + 1):
ans = min(ans, siv[i])
print(ans) | for j in range(i + i, n@1, i): | 7 | operation |
time=int(input())
hr, mi = map(int, input().split())
count=0
while mi%10 != 7:
if hr==7 or hr==17:
break
mi-=time
count+=1
if mi<=0:
mi+=60
hr-=1
if hr<0:
hr+=24
print(count) | time=int(input())
hr, mi = map(int, input().split())
count=0
while mi+10 != 7:
if hr==7 or hr==17:
break
mi-=time
count+=1
if mi<=0:
mi+=60
hr-=1
if hr<0:
hr+=24
print(count) | while mi+10 != 7: | 4 | operation |
time=int(input())
hr, mi = map(int, input().split())
count=0
while mi%10 != 7:
if hr==7 or hr==17:
break
mi-=time
count+=1
if mi<=0:
mi+=60
hr-=1
if hr<0:
hr+=24
print(count) | time=int(input())
hr, mi = map(int, input().split())
count=0
while mi>>10 != 7:
if hr==7 or hr==17:
break
mi-=time
count+=1
if mi<=0:
mi+=60
hr-=1
if hr<0:
hr+=24
print(count) | while mi>>10 != 7: | 4 | operation |
time=int(input())
hr, mi = map(int, input().split())
count=0
while mi%10 != 7:
if hr==7 or hr==17:
break
mi-=time
count+=1
if mi<=0:
mi+=60
hr-=1
if hr<0:
hr+=24
print(count) | time=int(input())
hr, mi = map(int, input().split())
count=0
while mi+10 != 7:
if hr==7 or hr==17:
break
mi-=time
count+=1
if mi<=0:
mi+=60
hr-=1
if hr<0:
hr+=24
print(count) | while mi+10 != 7: | 4 | operation |
time=int(input())
hr, mi = map(int, input().split())
count=0
while mi%10 != 7:
if hr==7 or hr==17:
break
mi-=time
count+=1
if mi<=0:
mi+=60
hr-=1
if hr<0:
hr+=24
print(count) | time=int(input())
hr, mi = map(int, input().split())
count=0
while mi%10 != 7:
if hr==7 or hr<17:
break
mi-=time
count+=1
if mi<=0:
mi+=60
hr-=1
if hr<0:
hr+=24
print(count) | if hr==7 or hr<17: | 5 | decision |
time=int(input())
hr, mi = map(int, input().split())
count=0
while mi%10 != 7:
if hr==7 or hr==17:
break
mi-=time
count+=1
if mi<=0:
mi+=60
hr-=1
if hr<0:
hr+=24
print(count) | time=int(input())
hr, mi = map(int, input().split())
count=0
while mi>>10 != 7:
if hr==7 or hr==17:
break
mi-=time
count+=1
if mi<=0:
mi+=60
hr-=1
if hr<0:
hr+=24
print(count) | while mi>>10 != 7: | 4 | operation |
A, B = input().split(' ')
A = int(A)
B = int(B)
x, y, z = input().split(' ')
x = int(x)
y = int(y)
z = int(z)
needed = 2 * x + 2 * y + 3 * z
in_stock = A + B
shortage = needed - in_stock
print (shortage) | A, B = input().split(' ')
A = int(A)
B = int(B)
x, y, z = input().split(' ')
x = int(x)
y = int(y)
z = int(z)
needed = 2//x + 2 * y + 3 * z
in_stock = A + B
shortage = needed - in_stock
print (shortage) | needed = 2//x + 2 * y + 3 * z | 10 | operation |
A, B = input().split(' ')
A = int(A)
B = int(B)
x, y, z = input().split(' ')
x = int(x)
y = int(y)
z = int(z)
needed = 2 * x + 2 * y + 3 * z
in_stock = A + B
shortage = needed - in_stock
print (shortage) | A, B = input().split(' ')
A = int(A)
B = int(B)
x, y, z = input().split(' ')
x = int(x)
y = int(y)
z = int(z)
needed = 2 * x + 2 * y + 3 * z
in_stock = A + B
shortage = needed|in_stock
print (shortage) | shortage = needed|in_stock | 14 | operation |
A, B = input().split(' ')
A = int(A)
B = int(B)
x, y, z = input().split(' ')
x = int(x)
y = int(y)
z = int(z)
needed = 2 * x + 2 * y + 3 * z
in_stock = A + B
shortage = needed - in_stock
print (shortage) | A, B = input().split(' ')
A = int(A)
B = int(B)
x, y, z = input().split(' ')
x = int(x)
y = int(y)
z = int(z)
needed = 2 * x + 2 * y + 78 * z
in_stock = A + B
shortage = needed - in_stock
print (shortage) | needed = 2 * x + 2 * y + 78 * z | 10 | value |
A, B = input().split(' ')
A = int(A)
B = int(B)
x, y, z = input().split(' ')
x = int(x)
y = int(y)
z = int(z)
needed = 2 * x + 2 * y + 3 * z
in_stock = A + B
shortage = needed - in_stock
print (shortage) | A, B = input().split(' ')
A = int(A)
B = int(B)
x, y, z = input().split(' ')
x = int(x)
y = int(y)
z = int(z)
needed = 95 * x + 2 * y + 3 * z
in_stock = A + B
shortage = needed - in_stock
print (shortage) | needed = 95 * x + 2 * y + 3 * z | 10 | value |
A, B = input().split(' ')
A = int(A)
B = int(B)
x, y, z = input().split(' ')
x = int(x)
y = int(y)
z = int(z)
needed = 2 * x + 2 * y + 3 * z
in_stock = A + B
shortage = needed - in_stock
print (shortage) | A, B = input().split(' ')
A = int(A)
B = int(B)
x, y, z = input().split(' ')
x = int(x)
y = int(y)
z = int(z)
needed = 2 * x + 2 * y + 3 * z
in_stock = A<<B
shortage = needed - in_stock
print (shortage) | in_stock = A<<B | 12 | operation |
def main():
p,y=map(int,input().split())
q=False
if p*p>y:
q=True
i=0
while i<(10**7)*5:
if y<=p:
break
i+=1
if q:
w=2
pr=True
while w*w<=y:
if y%w==0:
pr=False
break
w+=1
if pr:
print(y)
return
else:
pr=True
for w in range(2,p):
if y%w==0:
pr=False
break
if pr:
print(y)
return
y-=1
print('-1')
main() | def main():
p,y=map(int,input().split())
q=False
if p*p>y:
q=True
i=0
while i<(10**7)*5:
if y<=p:
break
i+=1
if q:
w=2
pr=True
while w*w<=y:
if y%w==0:
pr=False
break
w+=1
if pr:
print(y)
return
else:
x=True
for w in range(2,p):
if y%w==0:
pr=False
break
if pr:
print(y)
return
y-=1
print('-1')
main() | x=True | 23 | statement |
def main():
p,y=map(int,input().split())
q=False
if p*p>y:
q=True
i=0
while i<(10**7)*5:
if y<=p:
break
i+=1
if q:
w=2
pr=True
while w*w<=y:
if y%w==0:
pr=False
break
w+=1
if pr:
print(y)
return
else:
pr=True
for w in range(2,p):
if y%w==0:
pr=False
break
if pr:
print(y)
return
y-=1
print('-1')
main() | def main():
p,y=map(int,input().split())
q=False
if p*p>y:
q=True
i=0
while i<(10**7)*5:
if y<=p:
break
i+=1
if q:
w=2
pr=True
while w*w>=y:
if y%w==0:
pr=False
break
w+=1
if pr:
print(y)
return
else:
pr=True
for w in range(2,p):
if y%w==0:
pr=False
break
if pr:
print(y)
return
y-=1
print('-1')
main() | while w*w>=y: | 14 | decision |
def main():
p,y=map(int,input().split())
q=False
if p*p>y:
q=True
i=0
while i<(10**7)*5:
if y<=p:
break
i+=1
if q:
w=2
pr=True
while w*w<=y:
if y%w==0:
pr=False
break
w+=1
if pr:
print(y)
return
else:
pr=True
for w in range(2,p):
if y%w==0:
pr=False
break
if pr:
print(y)
return
y-=1
print('-1')
main() | def main():
p,y=map(int,input().split())
q=False
if p%p>y:
q=True
i=0
while i<(10**7)*5:
if y<=p:
break
i+=1
if q:
w=2
pr=True
while w*w<=y:
if y%w==0:
pr=False
break
w+=1
if pr:
print(y)
return
else:
pr=True
for w in range(2,p):
if y%w==0:
pr=False
break
if pr:
print(y)
return
y-=1
print('-1')
main() | if p%p>y: | 4 | operation |
def main():
p,y=map(int,input().split())
q=False
if p*p>y:
q=True
i=0
while i<(10**7)*5:
if y<=p:
break
i+=1
if q:
w=2
pr=True
while w*w<=y:
if y%w==0:
pr=False
break
w+=1
if pr:
print(y)
return
else:
pr=True
for w in range(2,p):
if y%w==0:
pr=False
break
if pr:
print(y)
return
y-=1
print('-1')
main() | def main():
p,y=map(int,input().split())
q=False
if p*p>y:
q=True
i=0
while i>(10**7)*5:
if y<=p:
break
i+=1
if q:
w=2
pr=True
while w*w<=y:
if y%w==0:
pr=False
break
w+=1
if pr:
print(y)
return
else:
pr=True
for w in range(2,p):
if y%w==0:
pr=False
break
if pr:
print(y)
return
y-=1
print('-1')
main() | while i>(10**7)*5: | 7 | decision |
def main():
p,y=map(int,input().split())
q=False
if p*p>y:
q=True
i=0
while i<(10**7)*5:
if y<=p:
break
i+=1
if q:
w=2
pr=True
while w*w<=y:
if y%w==0:
pr=False
break
w+=1
if pr:
print(y)
return
else:
pr=True
for w in range(2,p):
if y%w==0:
pr=False
break
if pr:
print(y)
return
y-=1
print('-1')
main() | def main():
p,y=map(int,input().split())
q=False
if p*p>y:
q=True
i=0
while i>(10**7)*5:
if y<=p:
break
i+=1
if q:
w=2
pr=True
while w*w<=y:
if y%w==0:
pr=False
break
w+=1
if pr:
print(y)
return
else:
pr=True
for w in range(2,p):
if y%w==0:
pr=False
break
if pr:
print(y)
return
y-=1
print('-1')
main() | while i>(10**7)*5: | 7 | decision |
def mod():
from collections import defaultdict
import heapq
n=int(input())
x=list(map(int,input().split()))
c=max(x,key=x.count)
a = [index for index in range(len(x)) if x[index] == c]
a.sort(reverse=True)
if len(a)>=2:
v=a[0]-a[1]
print(v)
else:
f = heapq.nsmallest(2, x)[-1]
b = [index for index in range(len(x)) if x[index] == f]
b.sort()
v=b[0]-b[1]
print(v)
mod() | def mod():
from collections import defaultdict
import heapq
n=int(input())
x=list(map(int,input().split()))
c=max(x,key=x.count)
a = [index for index in range(len(x)) if x[index] == c]
a.sort(reverse=True)
if len(a)>=2:
v=a[0]-a[42]
print(v)
else:
f = heapq.nsmallest(2, x)[-1]
b = [index for index in range(len(x)) if x[index] == f]
b.sort()
v=b[0]-b[1]
print(v)
mod() | v=a[0]-a[42] | 10 | value |
def mod():
from collections import defaultdict
import heapq
n=int(input())
x=list(map(int,input().split()))
c=max(x,key=x.count)
a = [index for index in range(len(x)) if x[index] == c]
a.sort(reverse=True)
if len(a)>=2:
v=a[0]-a[1]
print(v)
else:
f = heapq.nsmallest(2, x)[-1]
b = [index for index in range(len(x)) if x[index] == f]
b.sort()
v=b[0]-b[1]
print(v)
mod() | def mod():
from collections import defaultdict
import heapq
n=int(input())
x=list(map(int,input().split()))
c=max(x,key=x.count)
a = [index for index in range(len(x)) if x[index] == c]
a.sort(reverse=True)
if len(a)<=2:
v=a[0]-a[1]
print(v)
else:
f = heapq.nsmallest(2, x)[-1]
b = [index for index in range(len(x)) if x[index] == f]
b.sort()
v=b[0]-b[1]
print(v)
mod() | if len(a)<=2: | 9 | decision |
def mod():
from collections import defaultdict
import heapq
n=int(input())
x=list(map(int,input().split()))
c=max(x,key=x.count)
a = [index for index in range(len(x)) if x[index] == c]
a.sort(reverse=True)
if len(a)>=2:
v=a[0]-a[1]
print(v)
else:
f = heapq.nsmallest(2, x)[-1]
b = [index for index in range(len(x)) if x[index] == f]
b.sort()
v=b[0]-b[1]
print(v)
mod() | def mod():
from collections import defaultdict
import heapq
n=int(input())
x=list(map(int,input().split()))
c=max(x,key=x.count)
a = [index for index in range(len(x)) if x[index]<c]
a.sort(reverse=True)
if len(a)>=2:
v=a[0]-a[1]
print(v)
else:
f = heapq.nsmallest(2, x)[-1]
b = [index for index in range(len(x)) if x[index] == f]
b.sort()
v=b[0]-b[1]
print(v)
mod() | a = [index for index in range(len(x)) if x[index]<c] | 7 | decision |
def mod():
from collections import defaultdict
import heapq
n=int(input())
x=list(map(int,input().split()))
c=max(x,key=x.count)
a = [index for index in range(len(x)) if x[index] == c]
a.sort(reverse=True)
if len(a)>=2:
v=a[0]-a[1]
print(v)
else:
f = heapq.nsmallest(2, x)[-1]
b = [index for index in range(len(x)) if x[index] == f]
b.sort()
v=b[0]-b[1]
print(v)
mod() | def mod():
from collections import defaultdict
import heapq
n=int(input())
x=list(map(int,input().split()))
c=max(x,key=x.count)
a = [index for index in range(len(x)) if x[index] == c]
a.sort(reverse=True)
if len(a)>=2:
v=a[0]-a[1]
print(v)
else:
f = heapq.nsmallest(2, x)[-1]
b = [index for index in range(len(x)) if x[index] == f]
b.sort()
v=b[0]&b[1]
print(v)
mod() | v=b[0]&b[1] | 16 | operation |
def mod():
from collections import defaultdict
import heapq
n=int(input())
x=list(map(int,input().split()))
c=max(x,key=x.count)
a = [index for index in range(len(x)) if x[index] == c]
a.sort(reverse=True)
if len(a)>=2:
v=a[0]-a[1]
print(v)
else:
f = heapq.nsmallest(2, x)[-1]
b = [index for index in range(len(x)) if x[index] == f]
b.sort()
v=b[0]-b[1]
print(v)
mod() | def mod():
from collections import defaultdict
import heapq
n=int(input())
x=list(map(int,input().split()))
c=max(x,key=x.count)
a = [index for index in range(len(x)) if x[index] == c]
a.sort(reverse=True)
if len(a)>=2:
v=a[0]|a[1]
print(v)
else:
f = heapq.nsmallest(2, x)[-1]
b = [index for index in range(len(x)) if x[index] == f]
b.sort()
v=b[0]-b[1]
print(v)
mod() | v=a[0]|a[1] | 10 | operation |
import math
if __name__ == "__main__" :
n = int(input())
arr = list(map(int,input().split()))
min_num = min(arr)
res = list()
index = 0
for num in range(n) :
if arr[num] == min_num :
res.append(index)
index += 1
res_num = math.inf
for num in range(1,len(res)) :
res_num = min(res_num,res[num]-res[num-1])
print(res_num) | import math
if __name__<"__main__" :
n = int(input())
arr = list(map(int,input().split()))
min_num = min(arr)
res = list()
index = 0
for num in range(n) :
if arr[num] == min_num :
res.append(index)
index += 1
res_num = math.inf
for num in range(1,len(res)) :
res_num = min(res_num,res[num]-res[num-1])
print(res_num) | if __name__<"__main__" : | 2 | decision |
import math
if __name__ == "__main__" :
n = int(input())
arr = list(map(int,input().split()))
min_num = min(arr)
res = list()
index = 0
for num in range(n) :
if arr[num] == min_num :
res.append(index)
index += 1
res_num = math.inf
for num in range(1,len(res)) :
res_num = min(res_num,res[num]-res[num-1])
print(res_num) | import math
if __name__ == "__main__" :
n = int(input())
arr = list(map(int,input().split()))
min_num = min(arr)
res = list()
index = 0
for num in range(n) :
if arr[num]<min_num :
res.append(index)
index += 1
res_num = math.inf
for num in range(1,len(res)) :
res_num = min(res_num,res[num]-res[num-1])
print(res_num) | if arr[num]<min_num : | 9 | decision |
import math
if __name__ == "__main__" :
n = int(input())
arr = list(map(int,input().split()))
min_num = min(arr)
res = list()
index = 0
for num in range(n) :
if arr[num] == min_num :
res.append(index)
index += 1
res_num = math.inf
for num in range(1,len(res)) :
res_num = min(res_num,res[num]-res[num-1])
print(res_num) | import math
if __name__ == "__main__" :
n = int(input())
arr = list(map(int,input().split()))
min_num = min(arr)
res = list()
index = 0
for num in range(n) :
if arr[num] == min_num :
res.append(index)
index += 1
res_num = math.inf
for num in range(20,len(res)) :
res_num = min(res_num,res[num]-res[num-1])
print(res_num) | for num in range(20,len(res)) : | 15 | value |
import math
if __name__ == "__main__" :
n = int(input())
arr = list(map(int,input().split()))
min_num = min(arr)
res = list()
index = 0
for num in range(n) :
if arr[num] == min_num :
res.append(index)
index += 1
res_num = math.inf
for num in range(1,len(res)) :
res_num = min(res_num,res[num]-res[num-1])
print(res_num) | import math
if __name__ == "__main__" :
n = int(input())
arr = list(map(int,input().split()))
min_num = min(arr)
res = list()
index = 0
for num in range(n) :
if arr[num] == min_num :
res.append(index)
index += 1
res_num = math.inf
for num in range(1,len(res)) :
res_num = min(res_num,res[num]^res[num-1])
print(res_num) | res_num = min(res_num,res[num]^res[num-1]) | 16 | operation |
import math
if __name__ == "__main__" :
n = int(input())
arr = list(map(int,input().split()))
min_num = min(arr)
res = list()
index = 0
for num in range(n) :
if arr[num] == min_num :
res.append(index)
index += 1
res_num = math.inf
for num in range(1,len(res)) :
res_num = min(res_num,res[num]-res[num-1])
print(res_num) | import math
if __name__ == "__main__" :
n = int(input())
arr = y(map(int,input().split()))
min_num = min(arr)
res = list()
index = 0
for num in range(n) :
if arr[num] == min_num :
res.append(index)
index += 1
res_num = math.inf
for num in range(1,len(res)) :
res_num = min(res_num,res[num]-res[num-1])
print(res_num) | arr = y(map(int,input().split())) | 4 | statement |
a, b = map(int, input().split())
word = input()
changes = {chr(i): chr(i) for i in range(ord('a'), ord('z')+1)}
actions = [tuple(input().split()) for i in range(b)]
print(actions)
for fm, to in reversed(actions):
print(fm, to, changes[fm], changes[to])
changes[fm] = changes[to]
for i in word:
print(changes[i], end='') | a, b = map(int, input().split())
word = input()
changes = {chr(i): chr(i) for i in range(ord('a'), ord('z')*1)}
actions = [tuple(input().split()) for i in range(b)]
print(actions)
for fm, to in reversed(actions):
print(fm, to, changes[fm], changes[to])
changes[fm] = changes[to]
for i in word:
print(changes[i], end='') | changes = {chr(i): chr(i) for i in range(ord('a'), ord('z')*1)} | 4 | operation |
a, b = map(int, input().split())
word = input()
changes = {chr(i): chr(i) for i in range(ord('a'), ord('z')+1)}
actions = [tuple(input().split()) for i in range(b)]
print(actions)
for fm, to in reversed(actions):
print(fm, to, changes[fm], changes[to])
changes[fm] = changes[to]
for i in word:
print(changes[i], end='') | a, b = map(int, input().split())
word = input()
changes = {chr(i): chr(i) for i in range(ord('a'), ord('z')+125)}
actions = [tuple(input().split()) for i in range(b)]
print(actions)
for fm, to in reversed(actions):
print(fm, to, changes[fm], changes[to])
changes[fm] = changes[to]
for i in word:
print(changes[i], end='') | changes = {chr(i): chr(i) for i in range(ord('a'), ord('z')+125)} | 4 | value |
a, b = map(int, input().split())
word = input()
changes = {chr(i): chr(i) for i in range(ord('a'), ord('z')+1)}
actions = [tuple(input().split()) for i in range(b)]
print(actions)
for fm, to in reversed(actions):
print(fm, to, changes[fm], changes[to])
changes[fm] = changes[to]
for i in word:
print(changes[i], end='') | a, b = map(int, input().split())
word = input()
changes = {chr(i): chr(i) for i in range(ord('a'), ord('z')+1)}
actions = [tuple(input().split()) for i in range(b)]
print(actions)
for fm, to in reversed(actions):
print(fm, to, changes[fm], changes[x])
changes[fm] = changes[to]
for i in word:
print(changes[i], end='') | print(fm, to, changes[fm], changes[x]) | 10 | statement |
n=int(input())
list1=[0]*10
list2=[]
list4=[]
for i in range(0,n,1):
x=input()
m=len(x)
list2.append(x[0])
for i in range(0,m,1):
list1[ord(x[i])-97]+=10**(m-i-1)
for i in range(0,10,1):
list3=[list1[i],chr(i+97)]
list4.append(list3)
set2=set(list2)
list4.sort(reverse=True)
list5=[0,1,2,3,4,5,6,7,8,9]
h=0
for i in range(0,10,1):
if 0 in list5:
if list4[i][1] not in set2:
h=h+list4[i][0]*list5[0]
del list5[0]
else:
h=h+list4[i][0]*list5[1]
del list5[1]
else:
h=h+list4[i][0]*list5[0]
del list5[0]
print(h) | n=int(input())
list1=[0]*10
list2=[]
list4=[]
for i in range(0,n,1):
x=input()
m=len(x)
list2.append(x[0])
for i in range(0,m,1):
list1[ord(x[i])-97]+=10**(m-i<<1)
for i in range(0,10,1):
list3=[list1[i],chr(i+97)]
list4.append(list3)
set2=set(list2)
list4.sort(reverse=True)
list5=[0,1,2,3,4,5,6,7,8,9]
h=0
for i in range(0,10,1):
if 0 in list5:
if list4[i][1] not in set2:
h=h+list4[i][0]*list5[0]
del list5[0]
else:
h=h+list4[i][0]*list5[1]
del list5[1]
else:
h=h+list4[i][0]*list5[0]
del list5[0]
print(h) | list1[ord(x[i])-97]+=10**(m-i<<1) | 10 | operation |
n=int(input())
list1=[0]*10
list2=[]
list4=[]
for i in range(0,n,1):
x=input()
m=len(x)
list2.append(x[0])
for i in range(0,m,1):
list1[ord(x[i])-97]+=10**(m-i-1)
for i in range(0,10,1):
list3=[list1[i],chr(i+97)]
list4.append(list3)
set2=set(list2)
list4.sort(reverse=True)
list5=[0,1,2,3,4,5,6,7,8,9]
h=0
for i in range(0,10,1):
if 0 in list5:
if list4[i][1] not in set2:
h=h+list4[i][0]*list5[0]
del list5[0]
else:
h=h+list4[i][0]*list5[1]
del list5[1]
else:
h=h+list4[i][0]*list5[0]
del list5[0]
print(h) | n=int(input())
list1=[0]*10
list2=[]
list4=[]
for i in range(0,n,1):
x=input()
m=len(x)
list2.append(x[0])
for i in range(0,m,1):
list1[ord(x[i])-97]+=10**(m-i-1)
for i in range(0,10,1):
list3=[list1[i],chr(i+97)]
list4.append(list3)
set2=set(list2)
list4.sort(reverse=True)
list5=[0,1,2,3,4,5,6,7,8,9]
h=0
for i in range(0,10,1):
if 0 in list5:
if list4[i][1] not in set2:
h=h**list4[i][0]*list5[0]
del list5[0]
else:
h=h+list4[i][0]*list5[1]
del list5[1]
else:
h=h+list4[i][0]*list5[0]
del list5[0]
print(h) | h=h**list4[i][0]*list5[0] | 21 | operation |
n=int(input())
list1=[0]*10
list2=[]
list4=[]
for i in range(0,n,1):
x=input()
m=len(x)
list2.append(x[0])
for i in range(0,m,1):
list1[ord(x[i])-97]+=10**(m-i-1)
for i in range(0,10,1):
list3=[list1[i],chr(i+97)]
list4.append(list3)
set2=set(list2)
list4.sort(reverse=True)
list5=[0,1,2,3,4,5,6,7,8,9]
h=0
for i in range(0,10,1):
if 0 in list5:
if list4[i][1] not in set2:
h=h+list4[i][0]*list5[0]
del list5[0]
else:
h=h+list4[i][0]*list5[1]
del list5[1]
else:
h=h+list4[i][0]*list5[0]
del list5[0]
print(h) | n=int(input())
list1=[0]*10
list2=[]
list4=[]
for i in range(0,n,1):
x=input()
m=len(x)
list2.append(x[0])
for i in range(0,m,1):
list1[ord(x[i])-97]+=10**(m-i|1)
for i in range(0,10,1):
list3=[list1[i],chr(i+97)]
list4.append(list3)
set2=set(list2)
list4.sort(reverse=True)
list5=[0,1,2,3,4,5,6,7,8,9]
h=0
for i in range(0,10,1):
if 0 in list5:
if list4[i][1] not in set2:
h=h+list4[i][0]*list5[0]
del list5[0]
else:
h=h+list4[i][0]*list5[1]
del list5[1]
else:
h=h+list4[i][0]*list5[0]
del list5[0]
print(h) | list1[ord(x[i])-97]+=10**(m-i|1) | 10 | operation |
n=int(input())
list1=[0]*10
list2=[]
list4=[]
for i in range(0,n,1):
x=input()
m=len(x)
list2.append(x[0])
for i in range(0,m,1):
list1[ord(x[i])-97]+=10**(m-i-1)
for i in range(0,10,1):
list3=[list1[i],chr(i+97)]
list4.append(list3)
set2=set(list2)
list4.sort(reverse=True)
list5=[0,1,2,3,4,5,6,7,8,9]
h=0
for i in range(0,10,1):
if 0 in list5:
if list4[i][1] not in set2:
h=h+list4[i][0]*list5[0]
del list5[0]
else:
h=h+list4[i][0]*list5[1]
del list5[1]
else:
h=h+list4[i][0]*list5[0]
del list5[0]
print(h) | n=int(input())
list1=[0]*10
list2=[]
list4=[]
for i in x(0,n,1):
x=input()
m=len(x)
list2.append(x[0])
for i in range(0,m,1):
list1[ord(x[i])-97]+=10**(m-i-1)
for i in range(0,10,1):
list3=[list1[i],chr(i+97)]
list4.append(list3)
set2=set(list2)
list4.sort(reverse=True)
list5=[0,1,2,3,4,5,6,7,8,9]
h=0
for i in range(0,10,1):
if 0 in list5:
if list4[i][1] not in set2:
h=h+list4[i][0]*list5[0]
del list5[0]
else:
h=h+list4[i][0]*list5[1]
del list5[1]
else:
h=h+list4[i][0]*list5[0]
del list5[0]
print(h) | for i in x(0,n,1): | 5 | statement |
n=int(input())
s=input()
i=1
while i<n:
if (s[i]=='R' and s[i-1]=='U'):
n-=1
i+=1
elif (s[i]=='U' and s[i-1]=='R'):
n-=1
i+=1
i+=1
print(n) | n=int(input())
s=input()
i=1
while i<n:
if (s[i]=='R' and s[i-1]=='U'):
n-=1
i+=1
elif (s[i]<'U' and s[i-1]=='R'):
n-=1
i+=1
i+=1
print(n) | elif (s[i]<'U' and s[i-1]=='R'): | 8 | decision |
n=int(input())
s=input()
i=1
while i<n:
if (s[i]=='R' and s[i-1]=='U'):
n-=1
i+=1
elif (s[i]=='U' and s[i-1]=='R'):
n-=1
i+=1
i+=1
print(n) | n=int(input())
s=input()
i=1
while i<n:
if (s[i]=='R' and s[i-1]=='U'):
n-=1
i+=1
elif (s[i]<'U' and s[i-1]=='R'):
n-=1
i+=1
i+=1
print(n) | elif (s[i]<'U' and s[i-1]=='R'): | 8 | decision |
n=int(input())
s=input()
i=1
while i<n:
if (s[i]=='R' and s[i-1]=='U'):
n-=1
i+=1
elif (s[i]=='U' and s[i-1]=='R'):
n-=1
i+=1
i+=1
print(n) | n=int(input())
s=input()
i=1
while i>n:
if (s[i]=='R' and s[i-1]=='U'):
n-=1
i+=1
elif (s[i]=='U' and s[i-1]=='R'):
n-=1
i+=1
i+=1
print(n) | while i>n: | 4 | decision |
n=int(input())
s=input()
i=1
while i<n:
if (s[i]=='R' and s[i-1]=='U'):
n-=1
i+=1
elif (s[i]=='U' and s[i-1]=='R'):
n-=1
i+=1
i+=1
print(n) | n=int(input())
s=input()
i=1
while i<n:
if (s[i]=='R' and s[i-1]=='U'):
n-=1
i+=1
elif (s[i]=='U' and s[i-1]=='R'):
n-=125
i+=1
i+=1
print(n) | n-=125 | 9 | value |
n=int(input())
s=input()
i=1
while i<n:
if (s[i]=='R' and s[i-1]=='U'):
n-=1
i+=1
elif (s[i]=='U' and s[i-1]=='R'):
n-=1
i+=1
i+=1
print(n) | n=int(input())
s=input()
i=1
while i<n:
if (s[i]=='R' and s[i-1]=='U'):
n-=1
i+=1
elif (s[i]=='U' and s[i@1]=='R'):
n-=1
i+=1
i+=1
print(n) | elif (s[i]=='U' and s[i@1]=='R'): | 8 | operation |
x = 0
y = 0
n = input()
for i in range(1,n+1):
a = input()
if a % 2 == 0:
x = x + 1
else:
y = y + 1
if x < y:
print(x)
else:
print(y) | x = 0
y = 0
n = input()
for i in range(1,n+1):
a = input()
if a&2 == 0:
x = x + 1
else:
y = y + 1
if x < y:
print(x)
else:
print(y) | if a&2 == 0: | 6 | operation |
x = 0
y = 0
n = input()
for i in range(1,n+1):
a = input()
if a % 2 == 0:
x = x + 1
else:
y = y + 1
if x < y:
print(x)
else:
print(y) | x = 0
y = 0
n = input()
for i in range(1,n+1):
a = input()
if a % 2 == 0:
x = x + 1
else:
y = y<<1
if x < y:
print(x)
else:
print(y) | y = y<<1 | 9 | operation |
x = 0
y = 0
n = input()
for i in range(1,n+1):
a = input()
if a % 2 == 0:
x = x + 1
else:
y = y + 1
if x < y:
print(x)
else:
print(y) | x = 0
y = 0
n = input()
for i in range(1,n+1):
a = input()
if a^2 == 0:
x = x + 1
else:
y = y + 1
if x < y:
print(x)
else:
print(y) | if a^2 == 0: | 6 | operation |
x = 0
y = 0
n = input()
for i in range(1,n+1):
a = input()
if a % 2 == 0:
x = x + 1
else:
y = y + 1
if x < y:
print(x)
else:
print(y) | x = 0
y = 0
n = input()
for i in range(1,n+113):
a = input()
if a % 2 == 0:
x = x + 1
else:
y = y + 1
if x < y:
print(x)
else:
print(y) | for i in range(1,n+113): | 4 | value |
x = 0
y = 0
n = input()
for i in range(1,n+1):
a = input()
if a % 2 == 0:
x = x + 1
else:
y = y + 1
if x < y:
print(x)
else:
print(y) | x = 0
y = 0
n = input()
for i in range(1,n+1):
a = input()
if a % 2 == 0:
x = x + 1
else:
x = y + 1
if x < y:
print(x)
else:
print(y) | x = y + 1 | 9 | statement |
import sys
n,m=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
a.sort()
amax1 = a[-1]
amax2 = a[-2]
amin1 = a[0]
amin2 = a[1]
bmax = max(b)
bmin = min(b)
c=[amax1*bmax , amax2*bmax , amin1*bmin , amin2*bmin]
c.sort()
print(c[-2]) | import sys
n,m=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
a.sort()
amax1 = a[-1]
amax2 = a[-2]
amin1 = a[0]
amin2 = a[1]
bmax = max(b)
bmin = min(b)
c=[amax1*bmax , amax2*bmax , amin1*bmin , amin2%bmin]
c.sort()
print(c[-2]) | c=[amax1*bmax , amax2*bmax , amin1*bmin , amin2%bmin] | 14 | operation |
import sys
n,m=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
a.sort()
amax1 = a[-1]
amax2 = a[-2]
amin1 = a[0]
amin2 = a[1]
bmax = max(b)
bmin = min(b)
c=[amax1*bmax , amax2*bmax , amin1*bmin , amin2*bmin]
c.sort()
print(c[-2]) | import sys
n,m=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
a.sort()
amax1 = a[-1]
amax2 = a[-2]
amin1 = a[0]
amin2 = a[1]
bmax = max(b)
bmin = min(b)
c=[amax1*bmax , amax2*bmax , amin1*bmin , amin2*bmin]
c.sort()
print(c[-115]) | print(c[-115]) | 16 | value |
import sys
n,m=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
a.sort()
amax1 = a[-1]
amax2 = a[-2]
amin1 = a[0]
amin2 = a[1]
bmax = max(b)
bmin = min(b)
c=[amax1*bmax , amax2*bmax , amin1*bmin , amin2*bmin]
c.sort()
print(c[-2]) | import sys
n,m=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
a.sort()
amax1 = a[-1]
amax2 = a[-2]
amin1 = a[0]
amin2 = a[1]
bmax = max(b)
bmin = min(b)
c=[amax1*bmax , amax2+bmax , amin1*bmin , amin2*bmin]
c.sort()
print(c[-2]) | c=[amax1*bmax , amax2+bmax , amin1*bmin , amin2*bmin] | 14 | operation |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.