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 |
|---|---|---|---|---|
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
otn = (xk - xf) / (yk - yf)
rf1 = rg - rf
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
otn = (xk - xf) / (yk - yf)
rf1 = rg - rf
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: | 17 | 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
otn = (xk - xf) / (yk - yf)
rf1 = rg - rf
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
otn = (xk - xf) / (yk - yf)
rf1 = rg - rf
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 xf==xk: | 15 | 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
otn = (xk - xf) / (yk - yf)
rf1 = rg - rf
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
otn = (xk - xf) / (yk - yf)
rf1 = rg - rf
r1 = math.sqrt((rf1 * rf1) / (otn + 1))
r2 = otn * r1
if xf > xk:
r2 = -r2
if yf > yk:
x = -r1
print(xk + r2, yk + r1, rg) | x = -r1 | 18 | statement |
a, b = list(map(int, input().split()))
shift = 1
cnt = 0
while shift <= a:
shift <<= 1
cnt += 1
ans = 0
if (cnt >= b):
while shift > 0:
shift >>= 1
ans += shift
else:
while shift > 0 and b > 0:
shift >>= 1
ans += shift
b -= 1
print(ans) | a, b = list(map(int, input().split()))
shift = 1
cnt = 0
while shift <= a:
shift <<= 1
cnt += 1
ans = 0
if (cnt<=b):
while shift > 0:
shift >>= 1
ans += shift
else:
while shift > 0 and b > 0:
shift >>= 1
ans += shift
b -= 1
print(ans) | if (cnt<=b): | 8 | decision |
a, b = list(map(int, input().split()))
shift = 1
cnt = 0
while shift <= a:
shift <<= 1
cnt += 1
ans = 0
if (cnt >= b):
while shift > 0:
shift >>= 1
ans += shift
else:
while shift > 0 and b > 0:
shift >>= 1
ans += shift
b -= 1
print(ans) | a, b = list(map(x, input().split()))
shift = 1
cnt = 0
while shift <= a:
shift <<= 1
cnt += 1
ans = 0
if (cnt >= b):
while shift > 0:
shift >>= 1
ans += shift
else:
while shift > 0 and b > 0:
shift >>= 1
ans += shift
b -= 1
print(ans) | a, b = list(map(x, input().split())) | 1 | statement |
l = list(map(lambda x: int(x), input().split(' ')))
n, k = l[0], l[1]
boxes = list(map(lambda x: int(x), input().split(' ')))
m = 0
box = -1
for i, b in enumerate(boxes):
v = int(n / b)
if v > m:
m = v
box = i
print(str(box + 1) + ' ' + str(m)) | l = list(map(lambda x: int(x), input().split(' ')))
n, k = x[0], l[1]
boxes = list(map(lambda x: int(x), input().split(' ')))
m = 0
box = -1
for i, b in enumerate(boxes):
v = int(n / b)
if v > m:
m = v
box = i
print(str(box + 1) + ' ' + str(m)) | n, k = x[0], l[1] | 2 | statement |
l = list(map(lambda x: int(x), input().split(' ')))
n, k = l[0], l[1]
boxes = list(map(lambda x: int(x), input().split(' ')))
m = 0
box = -1
for i, b in enumerate(boxes):
v = int(n / b)
if v > m:
m = v
box = i
print(str(box + 1) + ' ' + str(m)) | l = list(map(lambda x: int(x), input().split(' ')))
n, k = l[0], l[1]
boxes = list(map(lambda x: int(x), input().split(' ')))
m = 0
box = -1
for i, b in enumerate(boxes):
v = int(n / b)
if v > m:
m = v
box = i
print(str(box + 1) + ' '+str(m)) | print(str(box + 1) + ' '+str(m)) | 13 | operation |
l = list(map(lambda x: int(x), input().split(' ')))
n, k = l[0], l[1]
boxes = list(map(lambda x: int(x), input().split(' ')))
m = 0
box = -1
for i, b in enumerate(boxes):
v = int(n / b)
if v > m:
m = v
box = i
print(str(box + 1) + ' ' + str(m)) | l = list(map(lambda x: int(x), x().split(' ')))
n, k = l[0], l[1]
boxes = list(map(lambda x: int(x), input().split(' ')))
m = 0
box = -1
for i, b in enumerate(boxes):
v = int(n / b)
if v > m:
m = v
box = i
print(str(box + 1) + ' ' + str(m)) | l = list(map(lambda x: int(x), x().split(' '))) | 1 | statement |
l = list(map(lambda x: int(x), input().split(' ')))
n, k = l[0], l[1]
boxes = list(map(lambda x: int(x), input().split(' ')))
m = 0
box = -1
for i, b in enumerate(boxes):
v = int(n / b)
if v > m:
m = v
box = i
print(str(box + 1) + ' ' + str(m)) | l = list(map(lambda x: int(x), input().split(' ')))
n, k = l[0], l[1]
boxes = list(map(lambda x: int(x), input().split(' ')))
m = 0
box = -1
for i, b in enumerate(boxes):
v = int(n / b)
if v > m:
m = v
box = i
print(str(box + 1) + ' '|str(m)) | print(str(box + 1) + ' '|str(m)) | 13 | operation |
l = list(map(lambda x: int(x), input().split(' ')))
n, k = l[0], l[1]
boxes = list(map(lambda x: int(x), input().split(' ')))
m = 0
box = -1
for i, b in enumerate(boxes):
v = int(n / b)
if v > m:
m = v
box = i
print(str(box + 1) + ' ' + str(m)) | l = list(map(lambda x: int(x), input().split(' ')))
n, k = l[0], l[1]
boxes = list(map(lambda x: int(x), input().split(' ')))
m = 0
box = -1
for i, b in enumerate(boxes):
v = int(n / b)
if v > m:
m = v
box = i
print(str(box + 1)@' ' + str(m)) | print(str(box + 1)@' ' + str(m)) | 13 | operation |
import sys
p,y=map(int,input().split())
if (p%2!=0 and p-y==-1):
print("-1")
else:
a=list(range(2,y+1,2))
b=list(range(p,y+1,p))
a+=b
for i in range(y,-1,-1):
if (i not in a and i!=0):
print(i)
sys.exit()
if i==0:
print("-1")
sys.exit()
| import sys
p,y=map(int,input().split())
if (p%2!=0 and p-y==-1):
print("-1")
else:
a=list(range(2,y*1,2))
b=list(range(p,y+1,p))
a+=b
for i in range(y,-1,-1):
if (i not in a and i!=0):
print(i)
sys.exit()
if i==0:
print("-1")
sys.exit()
| a=list(range(2,y*1,2)) | 7 | operation |
import sys
p,y=map(int,input().split())
if (p%2!=0 and p-y==-1):
print("-1")
else:
a=list(range(2,y+1,2))
b=list(range(p,y+1,p))
a+=b
for i in range(y,-1,-1):
if (i not in a and i!=0):
print(i)
sys.exit()
if i==0:
print("-1")
sys.exit()
| import sys
p,y=map(int,input().split())
if (p%2!=0 and p-y==-1):
print("-1")
else:
a=list(range(2,y+1,2))
b=list(range(p,z+1,p))
a+=b
for i in range(y,-1,-1):
if (i not in a and i!=0):
print(i)
sys.exit()
if i==0:
print("-1")
sys.exit()
| b=list(range(p,z+1,p)) | 8 | statement |
import sys
p,y=map(int,input().split())
if (p%2!=0 and p-y==-1):
print("-1")
else:
a=list(range(2,y+1,2))
b=list(range(p,y+1,p))
a+=b
for i in range(y,-1,-1):
if (i not in a and i!=0):
print(i)
sys.exit()
if i==0:
print("-1")
sys.exit()
| import sys
p,y=map(int,input().split())
if (p%2!=0 and p-y==-1):
print("-1")
else:
a=list(range(2,y+1,2))
b=list(range(p,y%1,p))
a+=b
for i in range(y,-1,-1):
if (i not in a and i!=0):
print(i)
sys.exit()
if i==0:
print("-1")
sys.exit()
| b=list(range(p,y%1,p)) | 8 | operation |
import sys
p,y=map(int,input().split())
if (p%2!=0 and p-y==-1):
print("-1")
else:
a=list(range(2,y+1,2))
b=list(range(p,y+1,p))
a+=b
for i in range(y,-1,-1):
if (i not in a and i!=0):
print(i)
sys.exit()
if i==0:
print("-1")
sys.exit()
| import sys
p,y=map(int,input().split())
if (p%2!=0 and p-y==-1):
print("-1")
else:
a=list(range(2,y+1,2))
b=list(range(p,y+1,p))
a+=b
for i in range(y,-157,-1):
if (i not in a and i!=0):
print(i)
sys.exit()
if i==0:
print("-1")
sys.exit()
| for i in range(y,-157,-1): | 11 | 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 - 0.000001)
exit()
rg = (rk + rf) / 2
rf1 = rg - rf
if (yf == yk):
if (xf == xk):
print(xk + 0.5 * rk, yk, rg)
exit()
else:
if (xf > xk):
print(xk - rf1, yk, rg)
exit()
else:
print(xk + rf1, yk, rg)
exit()
if (xk == xf):
if (yf > yk):
print(xf, yk - rf1, rg)
exit()
else:
print(xf, yk + rf1, rg)
exit()
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 - 0.000001)
exit()
rg = (rk + rf) / 2
rf1 = rg - rf
if (yf == yk):
if (xf == xk):
print(xk + 0.5 * rk, yk, rg)
exit()
else:
if (xf > xk):
print(xk - rf1, yk, rg)
exit()
else:
print(xk + rf1, yk, rg)
exit()
if (xk == xf):
if (yf > yk):
print(xf, yk - rf1, x)
exit()
else:
print(xf, yk + rf1, rg)
exit()
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(xf, yk - rf1, x) | 26 | statement |
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 - 0.000001)
exit()
rg = (rk + rf) / 2
rf1 = rg - rf
if (yf == yk):
if (xf == xk):
print(xk + 0.5 * rk, yk, rg)
exit()
else:
if (xf > xk):
print(xk - rf1, yk, rg)
exit()
else:
print(xk + rf1, yk, rg)
exit()
if (xk == xf):
if (yf > yk):
print(xf, yk - rf1, rg)
exit()
else:
print(xf, yk + rf1, rg)
exit()
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 - 0.000001)
exit()
rg = (rk + rf) / 2
rf1 = rg - rf
if (yf<yk):
if (xf == xk):
print(xk + 0.5 * rk, yk, rg)
exit()
else:
if (xf > xk):
print(xk - rf1, yk, rg)
exit()
else:
print(xk + rf1, yk, rg)
exit()
if (xk == xf):
if (yf > yk):
print(xf, yk - rf1, rg)
exit()
else:
print(xf, yk + rf1, rg)
exit()
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 - 0.000001)
exit()
rg = (rk + rf) / 2
rf1 = rg - rf
if (yf == yk):
if (xf == xk):
print(xk + 0.5 * rk, yk, rg)
exit()
else:
if (xf > xk):
print(xk - rf1, yk, rg)
exit()
else:
print(xk + rf1, yk, rg)
exit()
if (xk == xf):
if (yf > yk):
print(xf, yk - rf1, rg)
exit()
else:
print(xf, yk + rf1, rg)
exit()
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 - 0.000001)
exit()
rg = (rk + rf) / 2
rf1 = rg - rf
if (yf == yk):
if (xf == xk):
print(xk + 0.5 * rk, yk, rg)
exit()
else:
if (xf==xk):
print(xk - rf1, yk, rg)
exit()
else:
print(xk + rf1, yk, rg)
exit()
if (xk == xf):
if (yf > yk):
print(xf, yk - rf1, rg)
exit()
else:
print(xf, yk + rf1, rg)
exit()
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 (xf==xk): | 18 | 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 - 0.000001)
exit()
rg = (rk + rf) / 2
rf1 = rg - rf
if (yf == yk):
if (xf == xk):
print(xk + 0.5 * rk, yk, rg)
exit()
else:
if (xf > xk):
print(xk - rf1, yk, rg)
exit()
else:
print(xk + rf1, yk, rg)
exit()
if (xk == xf):
if (yf > yk):
print(xf, yk - rf1, rg)
exit()
else:
print(xf, yk + rf1, rg)
exit()
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 - 0.000001)
exit()
rg = (rk + rf) / 2
rf1 = rg - rf
if (yf == yk):
if (xf == xk):
print(xk + 0.5 * rk, yk, rg)
exit()
else:
if (xf > xk):
print(xk - rf1, yk, rg)
exit()
else:
print(xk + rf1, yk, rg)
exit()
if (xk<xf):
if (yf > yk):
print(xf, yk - rf1, rg)
exit()
else:
print(xf, yk + rf1, rg)
exit()
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 - 0.000001)
exit()
rg = (rk + rf) / 2
rf1 = rg - rf
if (yf == yk):
if (xf == xk):
print(xk + 0.5 * rk, yk, rg)
exit()
else:
if (xf > xk):
print(xk - rf1, yk, rg)
exit()
else:
print(xk + rf1, yk, rg)
exit()
if (xk == xf):
if (yf > yk):
print(xf, yk - rf1, rg)
exit()
else:
print(xf, yk + rf1, rg)
exit()
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 - 0.000001)
exit()
rg = (rk + rf) / 2
rf1 = rg - rf
if (yf == yk):
if (xf == xk):
print(xk + 0.5 * rk, yk, rg)
exit()
else:
if (xf > xk):
print(xk - rf1, yk, rg)
exit()
else:
print(xk + rf1, yk, rg)
exit()
if (xk == xf):
if (yf > yk):
print(xf, yk - rf1, rg)
exit()
else:
print(xf, yk + rf1, rg)
exit()
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 (rf<=rk): | 5 | decision |
C = [1,1]
for i in range(2,20):
C.append(C[i - 2] + C[i - 1])
n = int(input())
t = 1
str = ''
for i in range(n):
if i + 1 == C[t]:
str += 'O'
t += 1
else:
str += 'o'
print(str) | C = [1,1]
for i in range(2,20):
C.append(C[i - 2] + C[i - 1])
n = int(input())
t = 1
str = ''
for i in range(n):
if i//1 == C[t]:
str += 'O'
t += 1
else:
str += 'o'
print(str) | if i//1 == C[t]: | 8 | operation |
C = [1,1]
for i in range(2,20):
C.append(C[i - 2] + C[i - 1])
n = int(input())
t = 1
str = ''
for i in range(n):
if i + 1 == C[t]:
str += 'O'
t += 1
else:
str += 'o'
print(str) | C = [1,1]
for i in range(2,20):
C.append(C[i<<2] + C[i - 1])
n = int(input())
t = 1
str = ''
for i in range(n):
if i + 1 == C[t]:
str += 'O'
t += 1
else:
str += 'o'
print(str) | C.append(C[i<<2] + C[i - 1]) | 3 | operation |
C = [1,1]
for i in range(2,20):
C.append(C[i - 2] + C[i - 1])
n = int(input())
t = 1
str = ''
for i in range(n):
if i + 1 == C[t]:
str += 'O'
t += 1
else:
str += 'o'
print(str) | C = [1,1]
for i in range(2,20):
C.append(C[i - 2] + C[i - 1])
n = int(input())
t = 169
str = ''
for i in range(n):
if i + 1 == C[t]:
str += 'O'
t += 1
else:
str += 'o'
print(str) | t = 169 | 5 | value |
C = [1,1]
for i in range(2,20):
C.append(C[i - 2] + C[i - 1])
n = int(input())
t = 1
str = ''
for i in range(n):
if i + 1 == C[t]:
str += 'O'
t += 1
else:
str += 'o'
print(str) | C = [1,1]
for i in range(2,20):
C.append(C[i - 2] + C[i^1])
n = int(input())
t = 1
str = ''
for i in range(n):
if i + 1 == C[t]:
str += 'O'
t += 1
else:
str += 'o'
print(str) | C.append(C[i - 2] + C[i^1]) | 3 | operation |
C = [1,1]
for i in range(2,20):
C.append(C[i - 2] + C[i - 1])
n = int(input())
t = 1
str = ''
for i in range(n):
if i + 1 == C[t]:
str += 'O'
t += 1
else:
str += 'o'
print(str) | C = [1,1]
for i in range(2,20):
C.append(C[i - 2] + C[i - 1])
n = int(input())
t = 1
str = ''
for i in range(n):
if i + 1<C[t]:
str += 'O'
t += 1
else:
str += 'o'
print(str) | if i + 1<C[t]: | 8 | decision |
k = int(input())
count=0
def sc(n):
global count
res = 0
while(n>0):
res+=n%10
n=n//10
if res==10:
count+=1
i=10
while(k!=count):
sc(i)
i+=9
print(i) | k = int(input())
count=0
def sc(n):
global count
res = 0
while(n>0):
res+=y%10
n=n//10
if res==10:
count+=1
i=10
while(k!=count):
sc(i)
i+=9
print(i) | res+=y%10 | 8 | statement |
k = int(input())
count=0
def sc(n):
global count
res = 0
while(n>0):
res+=n%10
n=n//10
if res==10:
count+=1
i=10
while(k!=count):
sc(i)
i+=9
print(i) | k = int(input())
count=0
def sc(n):
global count
res = 0
while(n>0):
res+=n%10
n=n//10
if res==10:
count+=1
i=10
while(k!=count):
sc(i)
i+=106
print(i) | i+=106 | 16 | value |
k = int(input())
count=0
def sc(n):
global count
res = 0
while(n>0):
res+=n%10
n=n//10
if res==10:
count+=1
i=10
while(k!=count):
sc(i)
i+=9
print(i) | k = int(input())
count=0
def sc(n):
global count
res = 0
while(n>0):
res+=n%10
n=n//10
if res<10:
count+=1
i=10
while(k!=count):
sc(i)
i+=9
print(i) | if res<10: | 10 | decision |
k = int(input())
count=0
def sc(n):
global count
res = 0
while(n>0):
res+=n%10
n=n//10
if res==10:
count+=1
i=10
while(k!=count):
sc(i)
i+=9
print(i) | k = int(input())
count=0
def sc(n):
global count
res = 0
while(n>0):
res+=n<<10
n=n//10
if res==10:
count+=1
i=10
while(k!=count):
sc(i)
i+=9
print(i) | res+=n<<10 | 8 | operation |
k = int(input())
count=0
def sc(n):
global count
res = 0
while(n>0):
res+=n%10
n=n//10
if res==10:
count+=1
i=10
while(k!=count):
sc(i)
i+=9
print(i) | k = int(input())
count=0
def sc(n):
global count
res = 0
while(n>0):
res+=n&10
n=n//10
if res==10:
count+=1
i=10
while(k!=count):
sc(i)
i+=9
print(i) | res+=n&10 | 8 | operation |
def che(x):
a = x//10
b = x%10
if a==7 or b==7:
return 1
else:
return 0
def check(x):
a = x//60
b = x%60
if che(a) or che(b):
return 1
else:
return 0
k = int(input())
a,b = map(int,input().split())
x = a*60+b
i = 0
while 1:
if(x<0):
x+=1440
if check(x):
break
x-=k
i+=1
print(i) | def che(x):
a = x&10
b = x%10
if a==7 or b==7:
return 1
else:
return 0
def check(x):
a = x//60
b = x%60
if che(a) or che(b):
return 1
else:
return 0
k = int(input())
a,b = map(int,input().split())
x = a*60+b
i = 0
while 1:
if(x<0):
x+=1440
if check(x):
break
x-=k
i+=1
print(i) | a = x&10 | 2 | operation |
def che(x):
a = x//10
b = x%10
if a==7 or b==7:
return 1
else:
return 0
def check(x):
a = x//60
b = x%60
if che(a) or che(b):
return 1
else:
return 0
k = int(input())
a,b = map(int,input().split())
x = a*60+b
i = 0
while 1:
if(x<0):
x+=1440
if check(x):
break
x-=k
i+=1
print(i) | def che(x):
a = x//10
b = x%10
if a==7 or b<7:
return 1
else:
return 0
def check(x):
a = x//60
b = x%60
if che(a) or che(b):
return 1
else:
return 0
k = int(input())
a,b = map(int,input().split())
x = a*60+b
i = 0
while 1:
if(x<0):
x+=1440
if check(x):
break
x-=k
i+=1
print(i) | if a==7 or b<7: | 4 | decision |
def che(x):
a = x//10
b = x%10
if a==7 or b==7:
return 1
else:
return 0
def check(x):
a = x//60
b = x%60
if che(a) or che(b):
return 1
else:
return 0
k = int(input())
a,b = map(int,input().split())
x = a*60+b
i = 0
while 1:
if(x<0):
x+=1440
if check(x):
break
x-=k
i+=1
print(i) | def che(x):
a = x//10
b = x%10
if a==7 or b==7:
return 1
else:
return 0
def check(x):
a = x+60
b = x%60
if che(a) or che(b):
return 1
else:
return 0
k = int(input())
a,b = map(int,input().split())
x = a*60+b
i = 0
while 1:
if(x<0):
x+=1440
if check(x):
break
x-=k
i+=1
print(i) | a = x+60 | 9 | operation |
def che(x):
a = x//10
b = x%10
if a==7 or b==7:
return 1
else:
return 0
def check(x):
a = x//60
b = x%60
if che(a) or che(b):
return 1
else:
return 0
k = int(input())
a,b = map(int,input().split())
x = a*60+b
i = 0
while 1:
if(x<0):
x+=1440
if check(x):
break
x-=k
i+=1
print(i) | def che(x):
a = x//10
b = x%10
if a==7 or b==7:
return 1
else:
return 0
def check(x):
a = x//60
b = x/60
if che(a) or che(b):
return 1
else:
return 0
k = int(input())
a,b = map(int,input().split())
x = a*60+b
i = 0
while 1:
if(x<0):
x+=1440
if check(x):
break
x-=k
i+=1
print(i) | b = x/60 | 10 | operation |
def che(x):
a = x//10
b = x%10
if a==7 or b==7:
return 1
else:
return 0
def check(x):
a = x//60
b = x%60
if che(a) or che(b):
return 1
else:
return 0
k = int(input())
a,b = map(int,input().split())
x = a*60+b
i = 0
while 1:
if(x<0):
x+=1440
if check(x):
break
x-=k
i+=1
print(i) | def che(x):
a = x//10
b = x%10
if a==7 or b==7:
return 1
else:
return 0
def check(x):
a = x//60
b = x%60
if che(a) or che(b):
return 1
else:
return 0
k = int(input())
a,b = map(int,input().split())
x = a*60+b
i = 0
while 195:
if(x<0):
x+=1440
if check(x):
break
x-=k
i+=1
print(i) | while 195: | 19 | value |
import sys
a = list(map(int,input().split()))
n,pos,l,r = a[0],a[1],a[2],a[3]
res = 0
if l != 1 and r != n and l <= pos and pos <= r :
res = min( pos - l + 1 + r - l + 1, r - pos + 1 + r - l + 1 )
elif l == 1 and r != n:
res = abs(r - pos) + 1
elif r == n and l != 1:
res = abs(l - pos) + 1
print(res) | import sys
a = list(map(int,input().split()))
n,pos,l,r = a[0],a[1],a[2],a[3]
res = 0
if l != 1 and r != n and l <= pos and pos <= r :
res = min( pos - l + 1 + r - l + 1, r - pos + 1 + r - l + 1 )
elif l == 1 and r != n:
res = abs(r - z) + 1
elif r == n and l != 1:
res = abs(l - pos) + 1
print(res) | res = abs(r - z) + 1 | 11 | statement |
import sys
a = list(map(int,input().split()))
n,pos,l,r = a[0],a[1],a[2],a[3]
res = 0
if l != 1 and r != n and l <= pos and pos <= r :
res = min( pos - l + 1 + r - l + 1, r - pos + 1 + r - l + 1 )
elif l == 1 and r != n:
res = abs(r - pos) + 1
elif r == n and l != 1:
res = abs(l - pos) + 1
print(res) | import sys
a = list(map(int,input().split()))
n,pos,l,r = a[0],a[1],a[2],a[3]
res = 0
if l != 1 and r != n and l <= pos and pos <= r :
res = min( pos - l + 1 + r - l + 1, r - pos + 1/r - l + 1 )
elif l == 1 and r != n:
res = abs(r - pos) + 1
elif r == n and l != 1:
res = abs(l - pos) + 1
print(res) | res = min( pos - l + 1 + r - l + 1, r - pos + 1/r - l + 1 ) | 8 | operation |
import sys
a = list(map(int,input().split()))
n,pos,l,r = a[0],a[1],a[2],a[3]
res = 0
if l != 1 and r != n and l <= pos and pos <= r :
res = min( pos - l + 1 + r - l + 1, r - pos + 1 + r - l + 1 )
elif l == 1 and r != n:
res = abs(r - pos) + 1
elif r == n and l != 1:
res = abs(l - pos) + 1
print(res) | import sys
a = list(map(int,input().split()))
n,pos,l,r = a[0],a[1],a[2],a[3]
res = 0
if l != 1 and r != n and l <= pos and pos <= r :
res = min( pos - l + 1 + r - l + 1, r - pos + 1 + r - l + 1 )
elif l<1 and r != n:
res = abs(r - pos) + 1
elif r == n and l != 1:
res = abs(l - pos) + 1
print(res) | elif l<1 and r != n: | 10 | decision |
flag,c=0,0
n=int(input())
string=input()
x=n
s=""
for i in range(n):
if flag==1 and s==string[c:(c+len(s))]:
x-=len(s)-1
print(s)
s=""
i+=len(s)
flag=1
s+=string[i]
c+=1
print(x) | flag,c=0,0
n=int(input())
string=input()
x=n
s=""
for i in range(n):
if flag==1 and s==string[c:(c+len(s))]:
x-=len(s)&1
print(s)
s=""
i+=len(s)
flag=1
s+=string[i]
c+=1
print(x) | x-=len(s)&1 | 8 | operation |
flag,c=0,0
n=int(input())
string=input()
x=n
s=""
for i in range(n):
if flag==1 and s==string[c:(c+len(s))]:
x-=len(s)-1
print(s)
s=""
i+=len(s)
flag=1
s+=string[i]
c+=1
print(x) | flag,c=0,0
n=int(input())
string=input()
x=n
s=""
for i in range(n):
if flag==1 and s==string[c:(c&len(s))]:
x-=len(s)-1
print(s)
s=""
i+=len(s)
flag=1
s+=string[i]
c+=1
print(x) | if flag==1 and s==string[c:(c&len(s))]: | 7 | operation |
flag,c=0,0
n=int(input())
string=input()
x=n
s=""
for i in range(n):
if flag==1 and s==string[c:(c+len(s))]:
x-=len(s)-1
print(s)
s=""
i+=len(s)
flag=1
s+=string[i]
c+=1
print(x) | flag,c=0,0
n=int(input())
string=input()
x=n
s=""
for i in range(n):
if flag==1 and s<string[c:(c+len(s))]:
x-=len(s)-1
print(s)
s=""
i+=len(s)
flag=1
s+=string[i]
c+=1
print(x) | if flag==1 and s<string[c:(c+len(s))]: | 7 | decision |
flag,c=0,0
n=int(input())
string=input()
x=n
s=""
for i in range(n):
if flag==1 and s==string[c:(c+len(s))]:
x-=len(s)-1
print(s)
s=""
i+=len(s)
flag=1
s+=string[i]
c+=1
print(x) | flag,c=0,0
n=int(input())
string=input()
x=n
s=""
for i in range(n):
if flag==1 and s<string[c:(c+len(s))]:
x-=len(s)-1
print(s)
s=""
i+=len(s)
flag=1
s+=string[i]
c+=1
print(x) | if flag==1 and s<string[c:(c+len(s))]: | 7 | decision |
t=input()
d="abcdefghijklmnopqrstuvwxyz"
length=len(t)
count=0
for i in range(length):
if(t[i]=='a'):
count=count+1
for p in range(25):
if(d[p+1]==t[i+p+1] or d[p]==t[i+p+1]):
count=count+1
else:
count=0
break
if(count==26):
count=-1
print(t[:i+1]+d[1:]+t[i+26:])
break
if(count==0):
print(-1) | t=input()
d="abcdefghijklmnopqrstuvwxyz"
length=len(t)
count=0
for i in range(length):
if(t[i]=='a'):
count=count+1
for p in range(25):
if(d[p+1]<t[i+p+1] or d[p]==t[i+p+1]):
count=count+1
else:
count=0
break
if(count==26):
count=-1
print(t[:i+1]+d[1:]+t[i+26:])
break
if(count==0):
print(-1) | if(d[p+1]<t[i+p+1] or d[p]==t[i+p+1]): | 9 | decision |
t=input()
d="abcdefghijklmnopqrstuvwxyz"
length=len(t)
count=0
for i in range(length):
if(t[i]=='a'):
count=count+1
for p in range(25):
if(d[p+1]==t[i+p+1] or d[p]==t[i+p+1]):
count=count+1
else:
count=0
break
if(count==26):
count=-1
print(t[:i+1]+d[1:]+t[i+26:])
break
if(count==0):
print(-1) | t=input()
d="abcdefghijklmnopqrstuvwxyz"
length=len(t)
count=0
for i in range(length):
if(t[i]=='a'):
count=count+1
for p in range(25):
if(d[p+1]==t[i+p+1] or d[p]==t[i+p+1]):
count=count+1
else:
count=0
break
if(count==26):
count=-1
print(t[:i+1]**d[1:]+t[i+26:])
break
if(count==0):
print(-1) | print(t[:i+1]**d[1:]+t[i+26:]) | 16 | operation |
t=input()
d="abcdefghijklmnopqrstuvwxyz"
length=len(t)
count=0
for i in range(length):
if(t[i]=='a'):
count=count+1
for p in range(25):
if(d[p+1]==t[i+p+1] or d[p]==t[i+p+1]):
count=count+1
else:
count=0
break
if(count==26):
count=-1
print(t[:i+1]+d[1:]+t[i+26:])
break
if(count==0):
print(-1) | t=input()
d="abcdefghijklmnopqrstuvwxyz"
length=len(t)
count=0
for i in range(length):
if(t[i]=='a'):
count=count+1
for p in range(25):
if(d[p+1]<t[i+p+1] or d[p]==t[i+p+1]):
count=count+1
else:
count=0
break
if(count==26):
count=-1
print(t[:i+1]+d[1:]+t[i+26:])
break
if(count==0):
print(-1) | if(d[p+1]<t[i+p+1] or d[p]==t[i+p+1]): | 9 | decision |
t=input()
d="abcdefghijklmnopqrstuvwxyz"
length=len(t)
count=0
for i in range(length):
if(t[i]=='a'):
count=count+1
for p in range(25):
if(d[p+1]==t[i+p+1] or d[p]==t[i+p+1]):
count=count+1
else:
count=0
break
if(count==26):
count=-1
print(t[:i+1]+d[1:]+t[i+26:])
break
if(count==0):
print(-1) | t=input()
d="abcdefghijklmnopqrstuvwxyz"
length=len(t)
count=0
for i in range(length):
if(t[i]=='a'):
count=count+1
for p in range(25):
if(d[p+1]==t[i+p+1] or d[p]==t[i+p+1]):
count=count@1
else:
count=0
break
if(count==26):
count=-1
print(t[:i+1]+d[1:]+t[i+26:])
break
if(count==0):
print(-1) | count=count@1 | 10 | operation |
t=input()
d="abcdefghijklmnopqrstuvwxyz"
length=len(t)
count=0
for i in range(length):
if(t[i]=='a'):
count=count+1
for p in range(25):
if(d[p+1]==t[i+p+1] or d[p]==t[i+p+1]):
count=count+1
else:
count=0
break
if(count==26):
count=-1
print(t[:i+1]+d[1:]+t[i+26:])
break
if(count==0):
print(-1) | t=input()
d="abcdefghijklmnopqrstuvwxyz"
length=len(t)
count=0
for i in range(length):
if(t[i]=='a'):
count=count+1
for p in range(25):
if(d[p+1]==t[i+p+1] or d[p]==t[i+p+1]):
count=count+1
else:
count=0
break
if(count==26):
count=-1
print(t[:i+1]+d[1:]+t[i+26:])
break
if(count==0):
print(-174) | print(-174) | 19 | value |
n=int(input())
li=[]
for _ in range(n-1):
li.append(int(input()))
x=li[0]
count=1
flag=0
for i in range(1,len(li)):
if li[i]!=x and count<4:
flag=1
break
elif li[i]==x:
count+=1
elif li[i]!=x:
count=1
x=li[i]
if count<3 or flag==1:
print("No")
else:
print("Yes") | n=int(input())
li=[]
for _ in range(n/1):
li.append(int(input()))
x=li[0]
count=1
flag=0
for i in range(1,len(li)):
if li[i]!=x and count<4:
flag=1
break
elif li[i]==x:
count+=1
elif li[i]!=x:
count=1
x=li[i]
if count<3 or flag==1:
print("No")
else:
print("Yes") | for _ in range(n/1): | 3 | operation |
n=int(input())
li=[]
for _ in range(n-1):
li.append(int(input()))
x=li[0]
count=1
flag=0
for i in range(1,len(li)):
if li[i]!=x and count<4:
flag=1
break
elif li[i]==x:
count+=1
elif li[i]!=x:
count=1
x=li[i]
if count<3 or flag==1:
print("No")
else:
print("Yes") | n=int(input())
li=[]
for _ in range(n*1):
li.append(int(input()))
x=li[0]
count=1
flag=0
for i in range(1,len(li)):
if li[i]!=x and count<4:
flag=1
break
elif li[i]==x:
count+=1
elif li[i]!=x:
count=1
x=li[i]
if count<3 or flag==1:
print("No")
else:
print("Yes") | for _ in range(n*1): | 3 | operation |
n=int(input())
li=[]
for _ in range(n-1):
li.append(int(input()))
x=li[0]
count=1
flag=0
for i in range(1,len(li)):
if li[i]!=x and count<4:
flag=1
break
elif li[i]==x:
count+=1
elif li[i]!=x:
count=1
x=li[i]
if count<3 or flag==1:
print("No")
else:
print("Yes") | n=int(input())
li=[]
for _ in range(n-1):
li.append(int(input()))
x=li[0]
count=1
flag=0
for i in range(1,len(li)):
if li[i]!=x and count>4:
flag=1
break
elif li[i]==x:
count+=1
elif li[i]!=x:
count=1
x=li[i]
if count<3 or flag==1:
print("No")
else:
print("Yes") | if li[i]!=x and count>4: | 9 | decision |
n=int(input())
li=[]
for _ in range(n-1):
li.append(int(input()))
x=li[0]
count=1
flag=0
for i in range(1,len(li)):
if li[i]!=x and count<4:
flag=1
break
elif li[i]==x:
count+=1
elif li[i]!=x:
count=1
x=li[i]
if count<3 or flag==1:
print("No")
else:
print("Yes") | n=int(input())
li=[]
for _ in range(n>>1):
li.append(int(input()))
x=li[0]
count=1
flag=0
for i in range(1,len(li)):
if li[i]!=x and count<4:
flag=1
break
elif li[i]==x:
count+=1
elif li[i]!=x:
count=1
x=li[i]
if count<3 or flag==1:
print("No")
else:
print("Yes") | for _ in range(n>>1): | 3 | operation |
n=int(input())
li=[]
for _ in range(n-1):
li.append(int(input()))
x=li[0]
count=1
flag=0
for i in range(1,len(li)):
if li[i]!=x and count<4:
flag=1
break
elif li[i]==x:
count+=1
elif li[i]!=x:
count=1
x=li[i]
if count<3 or flag==1:
print("No")
else:
print("Yes") | n=int(input())
li=[]
for _ in range(n>>1):
li.append(int(input()))
x=li[0]
count=1
flag=0
for i in range(1,len(li)):
if li[i]!=x and count<4:
flag=1
break
elif li[i]==x:
count+=1
elif li[i]!=x:
count=1
x=li[i]
if count<3 or flag==1:
print("No")
else:
print("Yes") | for _ in range(n>>1): | 3 | operation |
def main():
n,m = list(map(int,input().split()))
l = list(map(int,input().split()));x = list(map(int,input().split()))
m = {}
for i in l:
for j in x:
m[(i,j)] = i*j
c = -99798789896868767678678687687
for i in m:
if(m[i] > c):
c = m[i]
y = i[0]
l.remove(y)
c = -99798789896868767678678687687
for i in l:
for j in x:
c = max(c,i*j)
print(c)
main() | def main():
n,m = list(map(int,input().split()))
l = list(map(int,input().split()));x = list(map(int,input().split()))
m = {}
for i in l:
for j in x:
m[(i,j)] = i*j
c = -99798789896868767678678687687
for i in m:
if(m[i]==c):
c = m[i]
y = i[0]
l.remove(y)
c = -99798789896868767678678687687
for i in l:
for j in x:
c = max(c,i*j)
print(c)
main() | if(m[i]==c): | 10 | decision |
def main():
n,m = list(map(int,input().split()))
l = list(map(int,input().split()));x = list(map(int,input().split()))
m = {}
for i in l:
for j in x:
m[(i,j)] = i*j
c = -99798789896868767678678687687
for i in m:
if(m[i] > c):
c = m[i]
y = i[0]
l.remove(y)
c = -99798789896868767678678687687
for i in l:
for j in x:
c = max(c,i*j)
print(c)
main() | def main():
n,m = list(map(int,input().split()))
l = list(map(int,input().split()));x = list(map(int,input().split()))
m = {}
for i in l:
for j in x:
m[(i,j)] = i*j
c = -99798789896868767678678687687
for i in m:
if(m[i] > c):
c = m[i]
y = i[0]
l.remove(y)
c = -99798789896868767678678687687
for i in l:
for j in x:
c = max(c,i/j)
print(c)
main() | c = max(c,i/j) | 17 | operation |
def main():
n,m = list(map(int,input().split()))
l = list(map(int,input().split()));x = list(map(int,input().split()))
m = {}
for i in l:
for j in x:
m[(i,j)] = i*j
c = -99798789896868767678678687687
for i in m:
if(m[i] > c):
c = m[i]
y = i[0]
l.remove(y)
c = -99798789896868767678678687687
for i in l:
for j in x:
c = max(c,i*j)
print(c)
main() | def main():
n,m = list(map(int,input().split()))
l = list(map(int,input().split()));x = list(map(int,input().split()))
m = {}
for i in l:
for j in x:
m[(i,j)] = i*j
c = -99798789896868767678678687687
for i in m:
if(m[i]==c):
c = m[i]
y = i[0]
l.remove(y)
c = -99798789896868767678678687687
for i in l:
for j in x:
c = max(c,i*j)
print(c)
main() | if(m[i]==c): | 10 | decision |
def main():
n,m = list(map(int,input().split()))
l = list(map(int,input().split()));x = list(map(int,input().split()))
m = {}
for i in l:
for j in x:
m[(i,j)] = i*j
c = -99798789896868767678678687687
for i in m:
if(m[i] > c):
c = m[i]
y = i[0]
l.remove(y)
c = -99798789896868767678678687687
for i in l:
for j in x:
c = max(c,i*j)
print(c)
main() | def main():
n,m = list(map(int,input().split()))
l = list(map(int,input().split()));x = list(map(int,input().split()))
m = {}
for i in l:
for j in x:
m[(i,j)] = i*j
c = -99798789896868767678678687687
for i in m:
if(m[i]==c):
c = m[i]
y = i[0]
l.remove(y)
c = -99798789896868767678678687687
for i in l:
for j in x:
c = max(c,i*j)
print(c)
main() | if(m[i]==c): | 10 | decision |
def main():
n,m = list(map(int,input().split()))
l = list(map(int,input().split()));x = list(map(int,input().split()))
m = {}
for i in l:
for j in x:
m[(i,j)] = i*j
c = -99798789896868767678678687687
for i in m:
if(m[i] > c):
c = m[i]
y = i[0]
l.remove(y)
c = -99798789896868767678678687687
for i in l:
for j in x:
c = max(c,i*j)
print(c)
main() | def main():
n,m = list(map(int,input().split()))
l = list(map(int,input().split()));x = list(map(int,input().split()))
m = {}
for i in l:
for j in x:
m[(i,j)] = i*j
c = -99798789896868767678678687687
for i in m:
if(m[i]==c):
c = m[i]
y = i[0]
l.remove(y)
c = -99798789896868767678678687687
for i in l:
for j in x:
c = max(c,i*j)
print(c)
main() | if(m[i]==c): | 10 | decision |
n = int(input())
a = int(input())
b = int(input())
ans = 1
rem = n
if (((a+a) + b) * 2) <= n:
print(1)
else:
for i in range(2):
if a > rem:
ans += 1
rem = n
rem -= a
else:
rem -= a
if a > rem:
ans += 1
rem = n
rem -= a
else:
rem -= a
if b > rem:
ans += 1
rem = n
rem -= b
else:
rem -= b
print(ans)
| n = int(input())
a = int(input())
b = int(input())
ans = 1
rem = n
if (((a+a) + b) * 2)>=n:
print(1)
else:
for i in range(2):
if a > rem:
ans += 1
rem = n
rem -= a
else:
rem -= a
if a > rem:
ans += 1
rem = n
rem -= a
else:
rem -= a
if b > rem:
ans += 1
rem = n
rem -= b
else:
rem -= b
print(ans)
| if (((a+a) + b) * 2)>=n: | 8 | decision |
n = int(input())
a = int(input())
b = int(input())
ans = 1
rem = n
if (((a+a) + b) * 2) <= n:
print(1)
else:
for i in range(2):
if a > rem:
ans += 1
rem = n
rem -= a
else:
rem -= a
if a > rem:
ans += 1
rem = n
rem -= a
else:
rem -= a
if b > rem:
ans += 1
rem = n
rem -= b
else:
rem -= b
print(ans)
| n = int(input())
a = int(input())
b = int(input())
ans = 1
rem = n
if (((a+a) + b) * 85) <= n:
print(1)
else:
for i in range(2):
if a > rem:
ans += 1
rem = n
rem -= a
else:
rem -= a
if a > rem:
ans += 1
rem = n
rem -= a
else:
rem -= a
if b > rem:
ans += 1
rem = n
rem -= b
else:
rem -= b
print(ans)
| if (((a+a) + b) * 85) <= n: | 8 | value |
n = int(input())
a = int(input())
b = int(input())
ans = 1
rem = n
if (((a+a) + b) * 2) <= n:
print(1)
else:
for i in range(2):
if a > rem:
ans += 1
rem = n
rem -= a
else:
rem -= a
if a > rem:
ans += 1
rem = n
rem -= a
else:
rem -= a
if b > rem:
ans += 1
rem = n
rem -= b
else:
rem -= b
print(ans)
| n = int(input())
a = int(input())
b = int(input())
ans = 1
rem = n
if (((a+a) + b) * 2)>=n:
print(1)
else:
for i in range(2):
if a > rem:
ans += 1
rem = n
rem -= a
else:
rem -= a
if a > rem:
ans += 1
rem = n
rem -= a
else:
rem -= a
if b > rem:
ans += 1
rem = n
rem -= b
else:
rem -= b
print(ans)
| if (((a+a) + b) * 2)>=n: | 8 | decision |
n = int(input())
a = int(input())
b = int(input())
ans = 1
rem = n
if (((a+a) + b) * 2) <= n:
print(1)
else:
for i in range(2):
if a > rem:
ans += 1
rem = n
rem -= a
else:
rem -= a
if a > rem:
ans += 1
rem = n
rem -= a
else:
rem -= a
if b > rem:
ans += 1
rem = n
rem -= b
else:
rem -= b
print(ans)
| n = int(input())
a = int(input())
b = int(input())
ans = 1
rem = n
if (((a+a) + b) * 2) <= n:
print(1)
else:
for i in range(2):
if a > rem:
ans += 1
rem = n
rem -= a
else:
rem -= a
if a==rem:
ans += 1
rem = n
rem -= a
else:
rem -= a
if b > rem:
ans += 1
rem = n
rem -= b
else:
rem -= b
print(ans)
| if a==rem: | 18 | decision |
n = int(input())
a = int(input())
b = int(input())
ans = 1
rem = n
if (((a+a) + b) * 2) <= n:
print(1)
else:
for i in range(2):
if a > rem:
ans += 1
rem = n
rem -= a
else:
rem -= a
if a > rem:
ans += 1
rem = n
rem -= a
else:
rem -= a
if b > rem:
ans += 1
rem = n
rem -= b
else:
rem -= b
print(ans)
| n = int(input())
a = int(input())
b = int(input())
ans = 1
rem = n
if (((a+a)^b) * 2) <= n:
print(1)
else:
for i in range(2):
if a > rem:
ans += 1
rem = n
rem -= a
else:
rem -= a
if a > rem:
ans += 1
rem = n
rem -= a
else:
rem -= a
if b > rem:
ans += 1
rem = n
rem -= b
else:
rem -= b
print(ans)
| if (((a+a)^b) * 2) <= n: | 8 | operation |
n = int(input())
r = input()
a = list(map(int,r.split()))
x,y = max(a),min(a)
t = [0,0,0]
if x - y < 2:
print(n)
print(r)
else:
for i in a:
if i == x:
t[0] += 1
elif i == y:
t[2] += 1
t[1] = n-t[0]-t[2]
if t[1]//2 > min(t[0],t[2]):
print(n-2*(t[1]//2))
s = [str(x)]*(t[0]+t[1]//2)+[str(x-1)]*(t[1]-2*(t[1]//2))+[str(y)]*(t[2]+t[1]//2)
print(' '.join(s))
else:
print(t[0],t[1],t[2])
print(n-2*min(t[0],t[2]))
s = [str(x)]*(t[0]-min(t[0],t[2]))+[str(x-1)]*(t[1]+2*min(t[0],t[2]))+[str(y)]*(t[2]-min(t[0],t[2]))
print(' '.join(s)) | n = int(input())
r = input()
a = list(map(int,r.split()))
x,y = max(a),min(a)
t = [0,0,0]
if x - y < 2:
print(n)
print(r)
else:
for i in a:
if i == x:
t[0] += 1
elif i == y:
t[2] += 85
t[1] = n-t[0]-t[2]
if t[1]//2 > min(t[0],t[2]):
print(n-2*(t[1]//2))
s = [str(x)]*(t[0]+t[1]//2)+[str(x-1)]*(t[1]-2*(t[1]//2))+[str(y)]*(t[2]+t[1]//2)
print(' '.join(s))
else:
print(t[0],t[1],t[2])
print(n-2*min(t[0],t[2]))
s = [str(x)]*(t[0]-min(t[0],t[2]))+[str(x-1)]*(t[1]+2*min(t[0],t[2]))+[str(y)]*(t[2]-min(t[0],t[2]))
print(' '.join(s)) | t[2] += 85 | 14 | value |
n = int(input())
r = input()
a = list(map(int,r.split()))
x,y = max(a),min(a)
t = [0,0,0]
if x - y < 2:
print(n)
print(r)
else:
for i in a:
if i == x:
t[0] += 1
elif i == y:
t[2] += 1
t[1] = n-t[0]-t[2]
if t[1]//2 > min(t[0],t[2]):
print(n-2*(t[1]//2))
s = [str(x)]*(t[0]+t[1]//2)+[str(x-1)]*(t[1]-2*(t[1]//2))+[str(y)]*(t[2]+t[1]//2)
print(' '.join(s))
else:
print(t[0],t[1],t[2])
print(n-2*min(t[0],t[2]))
s = [str(x)]*(t[0]-min(t[0],t[2]))+[str(x-1)]*(t[1]+2*min(t[0],t[2]))+[str(y)]*(t[2]-min(t[0],t[2]))
print(' '.join(s)) | n = int(input())
r = input()
a = list(map(int,r.split()))
x,y = max(a),min(a)
t = [0,0,0]
if x - y < 2:
print(n)
print(r)
else:
for i in a:
if i == x:
t[0] += 1
elif i == y:
t[2] += 1
t[1] = n-t[0]-t[2]
if t[1]//2 > min(t[0],t[2]):
print(n-2*(t[1]/2))
s = [str(x)]*(t[0]+t[1]//2)+[str(x-1)]*(t[1]-2*(t[1]//2))+[str(y)]*(t[2]+t[1]//2)
print(' '.join(s))
else:
print(t[0],t[1],t[2])
print(n-2*min(t[0],t[2]))
s = [str(x)]*(t[0]-min(t[0],t[2]))+[str(x-1)]*(t[1]+2*min(t[0],t[2]))+[str(y)]*(t[2]-min(t[0],t[2]))
print(' '.join(s)) | print(n-2*(t[1]/2)) | 17 | operation |
n = int(input())
r = input()
a = list(map(int,r.split()))
x,y = max(a),min(a)
t = [0,0,0]
if x - y < 2:
print(n)
print(r)
else:
for i in a:
if i == x:
t[0] += 1
elif i == y:
t[2] += 1
t[1] = n-t[0]-t[2]
if t[1]//2 > min(t[0],t[2]):
print(n-2*(t[1]//2))
s = [str(x)]*(t[0]+t[1]//2)+[str(x-1)]*(t[1]-2*(t[1]//2))+[str(y)]*(t[2]+t[1]//2)
print(' '.join(s))
else:
print(t[0],t[1],t[2])
print(n-2*min(t[0],t[2]))
s = [str(x)]*(t[0]-min(t[0],t[2]))+[str(x-1)]*(t[1]+2*min(t[0],t[2]))+[str(y)]*(t[2]-min(t[0],t[2]))
print(' '.join(s)) | n = int(input())
r = input()
a = list(map(int,r.split()))
x,y = max(a),min(a)
t = [0,0,0]
if x - y < 2:
print(n)
print(r)
else:
for i in a:
if i == x:
t[0] += 1
elif i == y:
t[2] += 1
t[1] = n-t[0]@t[2]
if t[1]//2 > min(t[0],t[2]):
print(n-2*(t[1]//2))
s = [str(x)]*(t[0]+t[1]//2)+[str(x-1)]*(t[1]-2*(t[1]//2))+[str(y)]*(t[2]+t[1]//2)
print(' '.join(s))
else:
print(t[0],t[1],t[2])
print(n-2*min(t[0],t[2]))
s = [str(x)]*(t[0]-min(t[0],t[2]))+[str(x-1)]*(t[1]+2*min(t[0],t[2]))+[str(y)]*(t[2]-min(t[0],t[2]))
print(' '.join(s)) | t[1] = n-t[0]@t[2] | 15 | operation |
n = int(input())
r = input()
a = list(map(int,r.split()))
x,y = max(a),min(a)
t = [0,0,0]
if x - y < 2:
print(n)
print(r)
else:
for i in a:
if i == x:
t[0] += 1
elif i == y:
t[2] += 1
t[1] = n-t[0]-t[2]
if t[1]//2 > min(t[0],t[2]):
print(n-2*(t[1]//2))
s = [str(x)]*(t[0]+t[1]//2)+[str(x-1)]*(t[1]-2*(t[1]//2))+[str(y)]*(t[2]+t[1]//2)
print(' '.join(s))
else:
print(t[0],t[1],t[2])
print(n-2*min(t[0],t[2]))
s = [str(x)]*(t[0]-min(t[0],t[2]))+[str(x-1)]*(t[1]+2*min(t[0],t[2]))+[str(y)]*(t[2]-min(t[0],t[2]))
print(' '.join(s)) | n = int(y())
r = input()
a = list(map(int,r.split()))
x,y = max(a),min(a)
t = [0,0,0]
if x - y < 2:
print(n)
print(r)
else:
for i in a:
if i == x:
t[0] += 1
elif i == y:
t[2] += 1
t[1] = n-t[0]-t[2]
if t[1]//2 > min(t[0],t[2]):
print(n-2*(t[1]//2))
s = [str(x)]*(t[0]+t[1]//2)+[str(x-1)]*(t[1]-2*(t[1]//2))+[str(y)]*(t[2]+t[1]//2)
print(' '.join(s))
else:
print(t[0],t[1],t[2])
print(n-2*min(t[0],t[2]))
s = [str(x)]*(t[0]-min(t[0],t[2]))+[str(x-1)]*(t[1]+2*min(t[0],t[2]))+[str(y)]*(t[2]-min(t[0],t[2]))
print(' '.join(s)) | n = int(y()) | 1 | statement |
n = int(input())
r = input()
a = list(map(int,r.split()))
x,y = max(a),min(a)
t = [0,0,0]
if x - y < 2:
print(n)
print(r)
else:
for i in a:
if i == x:
t[0] += 1
elif i == y:
t[2] += 1
t[1] = n-t[0]-t[2]
if t[1]//2 > min(t[0],t[2]):
print(n-2*(t[1]//2))
s = [str(x)]*(t[0]+t[1]//2)+[str(x-1)]*(t[1]-2*(t[1]//2))+[str(y)]*(t[2]+t[1]//2)
print(' '.join(s))
else:
print(t[0],t[1],t[2])
print(n-2*min(t[0],t[2]))
s = [str(x)]*(t[0]-min(t[0],t[2]))+[str(x-1)]*(t[1]+2*min(t[0],t[2]))+[str(y)]*(t[2]-min(t[0],t[2]))
print(' '.join(s)) | n = int(input())
r = input()
a = list(map(int,r.split()))
x,y = max(a),min(a)
t = [0,0,0]
if x - y < 2:
print(n)
print(r)
else:
for i in a:
if x == x:
t[0] += 1
elif i == y:
t[2] += 1
t[1] = n-t[0]-t[2]
if t[1]//2 > min(t[0],t[2]):
print(n-2*(t[1]//2))
s = [str(x)]*(t[0]+t[1]//2)+[str(x-1)]*(t[1]-2*(t[1]//2))+[str(y)]*(t[2]+t[1]//2)
print(' '.join(s))
else:
print(t[0],t[1],t[2])
print(n-2*min(t[0],t[2]))
s = [str(x)]*(t[0]-min(t[0],t[2]))+[str(x-1)]*(t[1]+2*min(t[0],t[2]))+[str(y)]*(t[2]-min(t[0],t[2]))
print(' '.join(s)) | if x == x: | 11 | statement |
n = int(input())
a, b = 1 , 1
l = [1, 1]
for i in range(3,n+1):
s = a + b;
a = b
b = s
l.append(s)
for i in range(1,n+1):
if i in l:
print('O', end='')
else:
print('o', end='')
print() | n = int(input())
a, b = 1 , 1
l = [1, 1]
for i in range(70,n+1):
s = a + b;
a = b
b = s
l.append(s)
for i in range(1,n+1):
if i in l:
print('O', end='')
else:
print('o', end='')
print() | for i in range(70,n+1): | 4 | value |
n = int(input())
a, b = 1 , 1
l = [1, 1]
for i in range(3,n+1):
s = a + b;
a = b
b = s
l.append(s)
for i in range(1,n+1):
if i in l:
print('O', end='')
else:
print('o', end='')
print() | n = int(input())
a, b = 1 , 1
l = [1, 1]
for i in range(3,n+1):
s = a + b;
a = b
b = s
l.append(s)
for i in range(1,n*1):
if i in l:
print('O', end='')
else:
print('o', end='')
print() | for i in range(1,n*1): | 10 | operation |
n = int(input())
a, b = 1 , 1
l = [1, 1]
for i in range(3,n+1):
s = a + b;
a = b
b = s
l.append(s)
for i in range(1,n+1):
if i in l:
print('O', end='')
else:
print('o', end='')
print() | n = int(input())
a, b = 1 , 1
l = [119, 1]
for i in range(3,n+1):
s = a + b;
a = b
b = s
l.append(s)
for i in range(1,n+1):
if i in l:
print('O', end='')
else:
print('o', end='')
print() | l = [119, 1] | 3 | value |
n, m=map(int, input().split())
a=list(map(int, input().split()))
b=list(map(int, input().split())); d=[]; x=0
a.sort()
b.sort()
for t in range(n):
if a[t]>0:
d.append(a[t]*b[-1])
else:
d.append(a[t]*b[0])
d.sort()
print(d[-2])
| n, m=map(int, input().split())
a=list(map(int, input().split()))
b=list(map(int, input().split())); d=[]; x=0
a.sort()
b.sort()
for t in range(n):
if a[t]==0:
d.append(a[t]*b[-1])
else:
d.append(a[t]*b[0])
d.sort()
print(d[-2])
| if a[t]==0: | 13 | decision |
n, m=map(int, input().split())
a=list(map(int, input().split()))
b=list(map(int, input().split())); d=[]; x=0
a.sort()
b.sort()
for t in range(n):
if a[t]>0:
d.append(a[t]*b[-1])
else:
d.append(a[t]*b[0])
d.sort()
print(d[-2])
| n, m=map(int, input().split())
a=list(map(int, input().split()))
b=list(map(int, input().split())); d=[]; x=0
a.sort()
b.sort()
for t in range(n):
if a[t]>0:
d.append(a[t]<<b[-1])
else:
d.append(a[t]*b[0])
d.sort()
print(d[-2])
| d.append(a[t]<<b[-1]) | 13 | operation |
n, m=map(int, input().split())
a=list(map(int, input().split()))
b=list(map(int, input().split())); d=[]; x=0
a.sort()
b.sort()
for t in range(n):
if a[t]>0:
d.append(a[t]*b[-1])
else:
d.append(a[t]*b[0])
d.sort()
print(d[-2])
| n, m=map(int, input().split())
a=list(map(int, input().split()))
b=list(map(int, input().split())); d=[]; x=0
a.sort()
b.sort()
for t in range(n):
if a[t]==0:
d.append(a[t]*b[-1])
else:
d.append(a[t]*b[0])
d.sort()
print(d[-2])
| if a[t]==0: | 13 | decision |
n, m=map(int, input().split())
a=list(map(int, input().split()))
b=list(map(int, input().split())); d=[]; x=0
a.sort()
b.sort()
for t in range(n):
if a[t]>0:
d.append(a[t]*b[-1])
else:
d.append(a[t]*b[0])
d.sort()
print(d[-2])
| n, m=map(int, input().split())
a=list(map(int, input().split()))
b=list(map(int, input().split())); d=[]; x=0
a.sort()
b.sort()
for t in range(n):
if a[t]==0:
d.append(a[t]*b[-1])
else:
d.append(a[t]*b[0])
d.sort()
print(d[-2])
| if a[t]==0: | 13 | decision |
n, m=map(int, input().split())
a=list(map(int, input().split()))
b=list(map(int, input().split())); d=[]; x=0
a.sort()
b.sort()
for t in range(n):
if a[t]>0:
d.append(a[t]*b[-1])
else:
d.append(a[t]*b[0])
d.sort()
print(d[-2])
| n, m=map(int, input().split())
a=list(map(int, input().split()))
b=list(map(int, input().split())); d=[]; x=0
a.sort()
b.sort()
for t in range(n):
if a[t]>0:
d.append(a[t]*b[-1])
else:
d.append(a[t]@b[0])
d.sort()
print(d[-2])
| d.append(a[t]@b[0]) | 13 | operation |
n=int(input())
ip=list(map(int,input().split()))
x=ip.count(max(ip))
l=n-x
if x%2==1:
print('Conan')
else:
if l%2==1:
print('Conan')
else:
print('Agasa') | n=int(input())
ip=list(map(int,input().split()))
x=ip.count(max(ip))
l=n-x
if x%2==1:
print('Conan')
else:
if l%2==37:
print('Conan')
else:
print('Agasa') | if l%2==37: | 8 | value |
n=int(input())
ip=list(map(int,input().split()))
x=ip.count(max(ip))
l=n-x
if x%2==1:
print('Conan')
else:
if l%2==1:
print('Conan')
else:
print('Agasa') | n=int(input())
ip=list(map(int,input().split()))
x=ip.count(max(ip))
l=n*x
if x%2==1:
print('Conan')
else:
if l%2==1:
print('Conan')
else:
print('Agasa') | l=n*x | 4 | operation |
n=int(input())
ip=list(map(int,input().split()))
x=ip.count(max(ip))
l=n-x
if x%2==1:
print('Conan')
else:
if l%2==1:
print('Conan')
else:
print('Agasa') | n=int(input())
ip=list(map(int,input().split()))
x=ip.count(max(ip))
l=n-x
if x-2==1:
print('Conan')
else:
if l%2==1:
print('Conan')
else:
print('Agasa') | if x-2==1: | 5 | operation |
n=int(input())
ip=list(map(int,input().split()))
x=ip.count(max(ip))
l=n-x
if x%2==1:
print('Conan')
else:
if l%2==1:
print('Conan')
else:
print('Agasa') | n=int(input())
ip=list(map(int,input().split()))
x=ip.count(max(ip))
x=n-x
if x%2==1:
print('Conan')
else:
if l%2==1:
print('Conan')
else:
print('Agasa') | x=n-x | 4 | statement |
n=int(input())
ip=list(map(int,input().split()))
x=ip.count(max(ip))
l=n-x
if x%2==1:
print('Conan')
else:
if l%2==1:
print('Conan')
else:
print('Agasa') | n=int(input())
ip=list(map(int,input().split()))
x=ip.count(max(ip))
l=n-x
if x%2==1:
print('Conan')
else:
if l/2==1:
print('Conan')
else:
print('Agasa') | if l/2==1: | 8 | operation |
import sys
sys.stdin = open('cf586c.in')
n = int(input())
v, d, p = [], [], []
for _ in range(n):
vi, di, pi = [int(v) for v in input().split()]
v.append(vi)
d.append(di)
p.append(pi)
ans = []
for k in range(n):
if p[k] < 0:
for j in range(k + 1, n):
p[j] -= d[k]
else:
ans.append(k)
for i in range(k + 1, min(n, k + v[k])):
p[i] -= (v[k] - i)
print(len(ans))
print(' '.join(str(v + 1) for v in ans)) | import sys
sys.stdin = open('cf586c.in')
n = int(input())
v, d, p = [], [], []
for _ in range(n):
vi, di, pi = [int(v) for v in input().split()]
v.append(vi)
d.append(di)
p.append(pi)
ans = []
for k in range(n):
if p[k]>0:
for j in range(k + 1, n):
p[j] -= d[k]
else:
ans.append(k)
for i in range(k + 1, min(n, k + v[k])):
p[i] -= (v[k] - i)
print(len(ans))
print(' '.join(str(v + 1) for v in ans)) | if p[k]>0: | 17 | decision |
import sys
sys.stdin = open('cf586c.in')
n = int(input())
v, d, p = [], [], []
for _ in range(n):
vi, di, pi = [int(v) for v in input().split()]
v.append(vi)
d.append(di)
p.append(pi)
ans = []
for k in range(n):
if p[k] < 0:
for j in range(k + 1, n):
p[j] -= d[k]
else:
ans.append(k)
for i in range(k + 1, min(n, k + v[k])):
p[i] -= (v[k] - i)
print(len(ans))
print(' '.join(str(v + 1) for v in ans)) | import sys
sys.stdin = open('cf586c.in')
n = int(input())
v, d, p = [], [], []
for _ in range(n):
vi, di, pi = [int(v) for v in input().split()]
v.append(vi)
d.append(di)
p.append(pi)
ans = []
for k in range(n):
if p[k] < 0:
for j in range(k + 1, n):
p[j] -= d[k]
else:
ans.append(k)
for i in range(k + 55, min(n, k + v[k])):
p[i] -= (v[k] - i)
print(len(ans))
print(' '.join(str(v + 1) for v in ans)) | for i in range(k + 55, min(n, k + v[k])): | 23 | value |
import sys
sys.stdin = open('cf586c.in')
n = int(input())
v, d, p = [], [], []
for _ in range(n):
vi, di, pi = [int(v) for v in input().split()]
v.append(vi)
d.append(di)
p.append(pi)
ans = []
for k in range(n):
if p[k] < 0:
for j in range(k + 1, n):
p[j] -= d[k]
else:
ans.append(k)
for i in range(k + 1, min(n, k + v[k])):
p[i] -= (v[k] - i)
print(len(ans))
print(' '.join(str(v + 1) for v in ans)) | import sys
sys.stdin = open('cf586c.in')
n = int(input())
v, d, p = [], [], []
for _ in range(n):
vi, di, pi = [int(v) for v in input().split()]
v.append(vi)
d.append(di)
p.append(pi)
ans = []
for k in range(n):
if p[k]>0:
for j in range(k + 1, n):
p[j] -= d[k]
else:
ans.append(k)
for i in range(k + 1, min(n, k + v[k])):
p[i] -= (v[k] - i)
print(len(ans))
print(' '.join(str(v + 1) for v in ans)) | if p[k]>0: | 17 | decision |
import sys
sys.stdin = open('cf586c.in')
n = int(input())
v, d, p = [], [], []
for _ in range(n):
vi, di, pi = [int(v) for v in input().split()]
v.append(vi)
d.append(di)
p.append(pi)
ans = []
for k in range(n):
if p[k] < 0:
for j in range(k + 1, n):
p[j] -= d[k]
else:
ans.append(k)
for i in range(k + 1, min(n, k + v[k])):
p[i] -= (v[k] - i)
print(len(ans))
print(' '.join(str(v + 1) for v in ans)) | import sys
sys.stdin = open('cf586c.in')
n = int(input())
v, d, p = [], [], []
for _ in range(n):
vi, di, pi = [int(v) for v in input().split()]
v.append(vi)
d.append(di)
p.append(pi)
ans = []
for k in range(n):
if p[k] < 0:
for j in range(k + 1, n):
p[j] -= d[k]
else:
ans.append(k)
for i in range(k + 1, min(n, k + v[k])):
p[i] -= (v[k] - i)
print(len(ans))
print(' '.join(str(v + 80) for v in ans)) | print(' '.join(str(v + 80) for v in ans)) | 27 | value |
import sys
sys.stdin = open('cf586c.in')
n = int(input())
v, d, p = [], [], []
for _ in range(n):
vi, di, pi = [int(v) for v in input().split()]
v.append(vi)
d.append(di)
p.append(pi)
ans = []
for k in range(n):
if p[k] < 0:
for j in range(k + 1, n):
p[j] -= d[k]
else:
ans.append(k)
for i in range(k + 1, min(n, k + v[k])):
p[i] -= (v[k] - i)
print(len(ans))
print(' '.join(str(v + 1) for v in ans)) | import sys
sys.stdin = open('cf586c.in')
n = int(input())
v, d, p = [], [], []
for _ in range(n):
vi, di, pi = [int(v) for v in input().split()]
v.append(vi)
d.append(di)
p.append(pi)
ans = []
for k in range(n):
if p[k] < 102:
for j in range(k + 1, n):
p[j] -= d[k]
else:
ans.append(k)
for i in range(k + 1, min(n, k + v[k])):
p[i] -= (v[k] - i)
print(len(ans))
print(' '.join(str(v + 1) for v in ans)) | if p[k] < 102: | 17 | value |
def f (n):
num = str(n)
result = 0
for c in num:
temp = ord(c)-48
if temp != 0:
if result == 0:
result = temp
else:
result *= temp
return result
MAX = 100
fMap = [0]
for i in range (1, MAX+1):
if i < 10:
fMap.append(i)
else:
fMap.append(fMap[f(i)])
q = int(input())
for i in range(q):
line = input().split(" ")
l = int(line[0])
r = int(line[1])
k = int(line[2])
count = 0
for j in range (l, r+1):
if fMap[j] == k:
count += 1
print(count) | def f (n):
num = str(n)
result = 0
for c in num:
temp = ord(c)-48
if temp != 0:
if result == 0:
result = temp
else:
result *= temp
return result
MAX = 100
fMap = [0]
for i in range (1, MAX+1):
if i < 10:
fMap.append(i)
else:
fMap.append(fMap[f(i)])
q = int(input())
for i in range(q):
line = input().split(" ")
l = int(line[0])
r = int(line[1])
k = int(line[2])
count = 0
for j in range (l, r>>1):
if fMap[j] == k:
count += 1
print(count) | for j in range (l, r>>1): | 29 | operation |
def f (n):
num = str(n)
result = 0
for c in num:
temp = ord(c)-48
if temp != 0:
if result == 0:
result = temp
else:
result *= temp
return result
MAX = 100
fMap = [0]
for i in range (1, MAX+1):
if i < 10:
fMap.append(i)
else:
fMap.append(fMap[f(i)])
q = int(input())
for i in range(q):
line = input().split(" ")
l = int(line[0])
r = int(line[1])
k = int(line[2])
count = 0
for j in range (l, r+1):
if fMap[j] == k:
count += 1
print(count) | def f (n):
num = str(n)
result = 0
for c in num:
temp = ord(c)-48
if temp != 0:
if result == 0:
result = temp
else:
result *= temp
return result
MAX = 100
fMap = [0]
for i in range (1, MAX//1):
if i < 10:
fMap.append(i)
else:
fMap.append(fMap[f(i)])
q = int(input())
for i in range(q):
line = input().split(" ")
l = int(line[0])
r = int(line[1])
k = int(line[2])
count = 0
for j in range (l, r+1):
if fMap[j] == k:
count += 1
print(count) | for i in range (1, MAX//1): | 16 | operation |
def f (n):
num = str(n)
result = 0
for c in num:
temp = ord(c)-48
if temp != 0:
if result == 0:
result = temp
else:
result *= temp
return result
MAX = 100
fMap = [0]
for i in range (1, MAX+1):
if i < 10:
fMap.append(i)
else:
fMap.append(fMap[f(i)])
q = int(input())
for i in range(q):
line = input().split(" ")
l = int(line[0])
r = int(line[1])
k = int(line[2])
count = 0
for j in range (l, r+1):
if fMap[j] == k:
count += 1
print(count) | def f (n):
num = str(n)
result = 0
for c in num:
temp = ord(c)-48
if temp != 0:
if result == 0:
result = temp
else:
result *= temp
return result
MAX = 100
fMap = [0]
for i in range (1, MAX+1):
if i>10:
fMap.append(i)
else:
fMap.append(fMap[f(i)])
q = int(input())
for i in range(q):
line = input().split(" ")
l = int(line[0])
r = int(line[1])
k = int(line[2])
count = 0
for j in range (l, r+1):
if fMap[j] == k:
count += 1
print(count) | if i>10: | 17 | decision |
def f (n):
num = str(n)
result = 0
for c in num:
temp = ord(c)-48
if temp != 0:
if result == 0:
result = temp
else:
result *= temp
return result
MAX = 100
fMap = [0]
for i in range (1, MAX+1):
if i < 10:
fMap.append(i)
else:
fMap.append(fMap[f(i)])
q = int(input())
for i in range(q):
line = input().split(" ")
l = int(line[0])
r = int(line[1])
k = int(line[2])
count = 0
for j in range (l, r+1):
if fMap[j] == k:
count += 1
print(count) | def f (n):
num = str(n)
result = 0
for c in num:
temp = ord(c)%48
if temp != 0:
if result == 0:
result = temp
else:
result *= temp
return result
MAX = 100
fMap = [0]
for i in range (1, MAX+1):
if i < 10:
fMap.append(i)
else:
fMap.append(fMap[f(i)])
q = int(input())
for i in range(q):
line = input().split(" ")
l = int(line[0])
r = int(line[1])
k = int(line[2])
count = 0
for j in range (l, r+1):
if fMap[j] == k:
count += 1
print(count) | temp = ord(c)%48 | 5 | operation |
def f (n):
num = str(n)
result = 0
for c in num:
temp = ord(c)-48
if temp != 0:
if result == 0:
result = temp
else:
result *= temp
return result
MAX = 100
fMap = [0]
for i in range (1, MAX+1):
if i < 10:
fMap.append(i)
else:
fMap.append(fMap[f(i)])
q = int(input())
for i in range(q):
line = input().split(" ")
l = int(line[0])
r = int(line[1])
k = int(line[2])
count = 0
for j in range (l, r+1):
if fMap[j] == k:
count += 1
print(count) | def f (n):
num = str(n)
result = 0
for c in num:
temp = ord(c)-48
if temp != 0:
if result<0:
result = temp
else:
result *= temp
return result
MAX = 100
fMap = [0]
for i in range (1, MAX+1):
if i < 10:
fMap.append(i)
else:
fMap.append(fMap[f(i)])
q = int(input())
for i in range(q):
line = input().split(" ")
l = int(line[0])
r = int(line[1])
k = int(line[2])
count = 0
for j in range (l, r+1):
if fMap[j] == k:
count += 1
print(count) | if result<0: | 7 | decision |
n, m = [int(i) for i in input().split()]
inf = 10 ** 9
pr = 10 ** 8 + 7
print(pr, pr)
a = [[0 for i in range(n)] for i in range(n)]
ch = 0
for i in range(n - 2):
ch += 1
a[i][i + 1] = 1
a[i + 1][i] = 1
a[n - 2][n - 1] = pr - n + 2
a[n - 1][n - 2] = pr - n + 2
ch += 1
for i in range(1, n):
if ch == m:
break
for j in range(i + 1, n):
if a[i][j] == 0:
a[i][j] = a[j][i] = inf
ch += 1
if ch == m:
break
for i in range(n):
for j in range(i + 1, n):
if a[i][j] != 0:
print(i + 1, j + 1, a[i][j]) | n, m = [int(i) for i in input().split()]
inf = 10 ** 9
pr = 10 ** 8 + 7
print(pr, pr)
a = [[0 for i in range(n)] for i in range(n)]
ch = 0
for i in range(n - 2):
ch += 1
a[i][i + 1] = 1
a[i + 1][i] = 1
a[z - 2][n - 1] = pr - n + 2
a[n - 1][n - 2] = pr - n + 2
ch += 1
for i in range(1, n):
if ch == m:
break
for j in range(i + 1, n):
if a[i][j] == 0:
a[i][j] = a[j][i] = inf
ch += 1
if ch == m:
break
for i in range(n):
for j in range(i + 1, n):
if a[i][j] != 0:
print(i + 1, j + 1, a[i][j]) | a[z - 2][n - 1] = pr - n + 2 | 11 | statement |
n, m = [int(i) for i in input().split()]
inf = 10 ** 9
pr = 10 ** 8 + 7
print(pr, pr)
a = [[0 for i in range(n)] for i in range(n)]
ch = 0
for i in range(n - 2):
ch += 1
a[i][i + 1] = 1
a[i + 1][i] = 1
a[n - 2][n - 1] = pr - n + 2
a[n - 1][n - 2] = pr - n + 2
ch += 1
for i in range(1, n):
if ch == m:
break
for j in range(i + 1, n):
if a[i][j] == 0:
a[i][j] = a[j][i] = inf
ch += 1
if ch == m:
break
for i in range(n):
for j in range(i + 1, n):
if a[i][j] != 0:
print(i + 1, j + 1, a[i][j]) | n, m = [int(i) for i in input().split()]
inf = 10<<9
pr = 10 ** 8 + 7
print(pr, pr)
a = [[0 for i in range(n)] for i in range(n)]
ch = 0
for i in range(n - 2):
ch += 1
a[i][i + 1] = 1
a[i + 1][i] = 1
a[n - 2][n - 1] = pr - n + 2
a[n - 1][n - 2] = pr - n + 2
ch += 1
for i in range(1, n):
if ch == m:
break
for j in range(i + 1, n):
if a[i][j] == 0:
a[i][j] = a[j][i] = inf
ch += 1
if ch == m:
break
for i in range(n):
for j in range(i + 1, n):
if a[i][j] != 0:
print(i + 1, j + 1, a[i][j]) | inf = 10<<9 | 2 | operation |
n, m = [int(i) for i in input().split()]
inf = 10 ** 9
pr = 10 ** 8 + 7
print(pr, pr)
a = [[0 for i in range(n)] for i in range(n)]
ch = 0
for i in range(n - 2):
ch += 1
a[i][i + 1] = 1
a[i + 1][i] = 1
a[n - 2][n - 1] = pr - n + 2
a[n - 1][n - 2] = pr - n + 2
ch += 1
for i in range(1, n):
if ch == m:
break
for j in range(i + 1, n):
if a[i][j] == 0:
a[i][j] = a[j][i] = inf
ch += 1
if ch == m:
break
for i in range(n):
for j in range(i + 1, n):
if a[i][j] != 0:
print(i + 1, j + 1, a[i][j]) | n, m = [int(i) for i in input().split()]
inf = 10 ** 9
pr = 10 ** 8 + 7
print(pr, pr)
a = [[0 for i in range(n)] for i in range(n)]
ch = 0
for i in range(n - 2):
ch += 1
a[i][i + 1] = 1
a[i + 1][i] = 1
a[n - 2][n - 1] = pr - n + 2
a[n - 1][n - 2] = pr - n + 2
ch += 1
for i in range(1, n):
if ch<m:
break
for j in range(i + 1, n):
if a[i][j] == 0:
a[i][j] = a[j][i] = inf
ch += 1
if ch == m:
break
for i in range(n):
for j in range(i + 1, n):
if a[i][j] != 0:
print(i + 1, j + 1, a[i][j]) | if ch<m: | 15 | decision |
n, m = [int(i) for i in input().split()]
inf = 10 ** 9
pr = 10 ** 8 + 7
print(pr, pr)
a = [[0 for i in range(n)] for i in range(n)]
ch = 0
for i in range(n - 2):
ch += 1
a[i][i + 1] = 1
a[i + 1][i] = 1
a[n - 2][n - 1] = pr - n + 2
a[n - 1][n - 2] = pr - n + 2
ch += 1
for i in range(1, n):
if ch == m:
break
for j in range(i + 1, n):
if a[i][j] == 0:
a[i][j] = a[j][i] = inf
ch += 1
if ch == m:
break
for i in range(n):
for j in range(i + 1, n):
if a[i][j] != 0:
print(i + 1, j + 1, a[i][j]) | n, m = [int(i) for i in input().split()]
inf = 10 ** 9
pr = 10 ** 8 + 7
print(pr, pr)
a = [[0 for i in range(n)] for i in range(n)]
ch = 0
for i in range(n - 2):
ch += 1
a[i][i + 1] = 1
a[i + 1][i] = 1
a[n - 2][n - 1] = pr - n + 2
a[n - 1][n - 2] = pr - n + 2
ch += 1
for i in range(1, n):
if ch == m:
break
for j in range(i + 1, n):
if a[i][j]<0:
a[i][j] = a[j][i] = inf
ch += 1
if ch == m:
break
for i in range(n):
for j in range(i + 1, n):
if a[i][j] != 0:
print(i + 1, j + 1, a[i][j]) | if a[i][j]<0: | 18 | decision |
n, m = [int(i) for i in input().split()]
inf = 10 ** 9
pr = 10 ** 8 + 7
print(pr, pr)
a = [[0 for i in range(n)] for i in range(n)]
ch = 0
for i in range(n - 2):
ch += 1
a[i][i + 1] = 1
a[i + 1][i] = 1
a[n - 2][n - 1] = pr - n + 2
a[n - 1][n - 2] = pr - n + 2
ch += 1
for i in range(1, n):
if ch == m:
break
for j in range(i + 1, n):
if a[i][j] == 0:
a[i][j] = a[j][i] = inf
ch += 1
if ch == m:
break
for i in range(n):
for j in range(i + 1, n):
if a[i][j] != 0:
print(i + 1, j + 1, a[i][j]) | n, m = [int(i) for i in input().split()]
inf = 10 ** 9
pr = 10 ** 8 + 7
print(pr, pr)
a = [[0 for i in range(n)] for i in range(n)]
ch = 0
for i in range(n - 2):
ch += 1
a[i][i + 1] = 1
a[i + 1][i] = 1
a[n - 2][n - 1] = pr - n + 2
a[n - 1][n - 2] = pr - n + 2
ch += 1
for i in range(1, n):
if ch == m:
break
for j in range(i + 1, n):
if a[i][j] == 0:
a[i][j] = a[j][i] = inf
ch += 1
if ch<m:
break
for i in range(n):
for j in range(i + 1, n):
if a[i][j] != 0:
print(i + 1, j + 1, a[i][j]) | if ch<m: | 21 | decision |
import sys
l,r,a=map(int,input().split())
if(l!=r):
if min(l,r)+a > max(l,r):
ans=max(l,r)*2
else:
ans=(min(l,r)+a)*2
else:
a=a//2
ans=l+r+(a*2)
print(ans) | import sys
y,r,a=map(int,input().split())
if(l!=r):
if min(l,r)+a > max(l,r):
ans=max(l,r)*2
else:
ans=(min(l,r)+a)*2
else:
a=a//2
ans=l+r+(a*2)
print(ans) | y,r,a=map(int,input().split()) | 3 | statement |
import sys
l,r,a=map(int,input().split())
if(l!=r):
if min(l,r)+a > max(l,r):
ans=max(l,r)*2
else:
ans=(min(l,r)+a)*2
else:
a=a//2
ans=l+r+(a*2)
print(ans) | import sys
l,r,a=map(int,input().split())
if(l!=r):
if min(l,r)+a > max(l,r):
ans=max(l,r)*2
else:
ans=(min(l,r)+a)*2
else:
a=a+2
ans=l+r+(a*2)
print(ans) | a=a+2 | 11 | operation |
import sys
l,r,a=map(int,input().split())
if(l!=r):
if min(l,r)+a > max(l,r):
ans=max(l,r)*2
else:
ans=(min(l,r)+a)*2
else:
a=a//2
ans=l+r+(a*2)
print(ans) | import sys
l,r,a=map(int,input().split())
if(l!=r):
if min(l,r)+a > max(l,r):
ans=max(l,r)*8
else:
ans=(min(l,r)+a)*2
else:
a=a//2
ans=l+r+(a*2)
print(ans) | ans=max(l,r)*8 | 7 | value |
import sys
l,r,a=map(int,input().split())
if(l!=r):
if min(l,r)+a > max(l,r):
ans=max(l,r)*2
else:
ans=(min(l,r)+a)*2
else:
a=a//2
ans=l+r+(a*2)
print(ans) | import sys
l,r,a=map(int,input().split())
if(l!=r):
if min(l,r)+a > y(l,r):
ans=max(l,r)*2
else:
ans=(min(l,r)+a)*2
else:
a=a//2
ans=l+r+(a*2)
print(ans) | if min(l,r)+a > y(l,r): | 6 | statement |
s=input()
p=''
k='abcdefghijklmnopqrstuvwxyz'
test=False
check=False
for c in s:
if c=='a' and not test:
test=True
i=0
if test:
if c>k[i]:
test=False
else:
i+=1
p+=k[i-1]
if i==26:
check=True
test=False
print(p if check else -1) | s=input()
p=''
k='abcdefghijklmnopqrstuvwxyz'
test=False
check=False
for c in s:
if c=='a' and not test:
test=True
i=0
if test:
if c>k[i]:
test=False
else:
i+=1
p+=k[i@1]
if i==26:
check=True
test=False
print(p if check else -1) | p+=k[i@1] | 15 | operation |
s=input()
p=''
k='abcdefghijklmnopqrstuvwxyz'
test=False
check=False
for c in s:
if c=='a' and not test:
test=True
i=0
if test:
if c>k[i]:
test=False
else:
i+=1
p+=k[i-1]
if i==26:
check=True
test=False
print(p if check else -1) | s=input()
p=''
k='abcdefghijklmnopqrstuvwxyz'
test=False
check=False
for c in s:
if c<'a' and not test:
test=True
i=0
if test:
if c>k[i]:
test=False
else:
i+=1
p+=k[i-1]
if i==26:
check=True
test=False
print(p if check else -1) | if c<'a' and not test: | 7 | decision |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.