original_code
stringlengths 78
14.8k
| modified_code
stringlengths 77
14.8k
| changed_line
stringlengths 1
14.4k
| number_of_line
int64 1
58
| mutation_type
stringclasses 4
values |
|---|---|---|---|---|
n = int(input())
s = input()
def Cheque(s, k):
if "CC" in s or "MM" in s or "YY" in s:
return 0;
if s[0] == "?":
return 2
for i in range(n):
if not "?" in s:
return k
if s[i] == "?" or s[n - 1] == "?":
if s[i - 1] == s[i + 1]:
return 2
if (s[i - 1] != s[i + 1]):
if s[i - 1] == 'C' and s[i + 1] == "?":
return Cheque(s[:i:] + 'Y' + s[i + 1::], k) + Cheque(s[:i:] + 'M' + s[i + 1::], k)
if s[i - 1] == 'M' and s[i + 1] == "?":
return Cheque(s[:i:] + 'Y' + s[i + 1::], k) + Cheque(s[:i:] + 'C' + s[i + 1::], k)
if s[i - 1] == 'Y' and s[i + 1] == "?":
return Cheque(s[:i:] + 'C' + s[i + 1::], k) + Cheque(s[:i:] + 'M' + s[i + 1::], k)
if s[i - 1] != "C" and s[i + 1] != "C":
return Cheque(s[:i:] + 'C' + s[i + 1::], k)
if s[i - 1] != "M" and s[i + 1] != "M":
return Cheque(s[:i:] + 'M' + s[i + 1::], k)
if s[i - 1] != "Y" and s[i + 1] != "Y":
return Cheque(s[:i:] + 'Y' + s[i + 1::], k)
if Cheque(s, 0) >= 2:
print("Yes")
else:
print("No") | n = int(input())
s = input()
def Cheque(s, k):
if "CC" in s or "MM" in s or "YY" in s:
return 0;
if s[0] == "?":
return 2
for i in range(n):
if not "?" in s:
return k
if s[i] == "?" or s[n - 1] == "?":
if s[i - 1] == s[i + 1]:
return 2
if (s[i - 1] != s[i + 1]):
if s[i - 1] == 'C' and s[i + 1] == "?":
return Cheque(s[:i:] + 'Y' + s[i + 1::], k) + Cheque(s[:i:] + 'M' + s[i + 1::], k)
if s[i - 1] == 'M' and s[i + 1] == "?":
return Cheque(s[:i:] + 'Y' + s[i + 1::], k) + Cheque(s[:i:] + 'C' + s[i + 1::], k)
if s[i - 1] == 'Y' and s[i + 1] == "?":
return Cheque(s[:i:] + 'C' + s[i + 1::], k) + Cheque(s[:i:] + 'M' + s[i + 1::], k)
if s[i - 1] != "C" and s[i + 1] != "C":
return Cheque(s[:i:] + 'C' + s[i + 1::], k)
if s[i - 1] != "M" and s[i + 1] != "M":
return y(s[:i:] + 'M' + s[i + 1::], k)
if s[i - 1] != "Y" and s[i + 1] != "Y":
return Cheque(s[:i:] + 'Y' + s[i + 1::], k)
if Cheque(s, 0) >= 2:
print("Yes")
else:
print("No") | return y(s[:i:] + 'M' + s[i + 1::], k) | 24 | statement |
n = int(input())
s = input()
def Cheque(s, k):
if "CC" in s or "MM" in s or "YY" in s:
return 0;
if s[0] == "?":
return 2
for i in range(n):
if not "?" in s:
return k
if s[i] == "?" or s[n - 1] == "?":
if s[i - 1] == s[i + 1]:
return 2
if (s[i - 1] != s[i + 1]):
if s[i - 1] == 'C' and s[i + 1] == "?":
return Cheque(s[:i:] + 'Y' + s[i + 1::], k) + Cheque(s[:i:] + 'M' + s[i + 1::], k)
if s[i - 1] == 'M' and s[i + 1] == "?":
return Cheque(s[:i:] + 'Y' + s[i + 1::], k) + Cheque(s[:i:] + 'C' + s[i + 1::], k)
if s[i - 1] == 'Y' and s[i + 1] == "?":
return Cheque(s[:i:] + 'C' + s[i + 1::], k) + Cheque(s[:i:] + 'M' + s[i + 1::], k)
if s[i - 1] != "C" and s[i + 1] != "C":
return Cheque(s[:i:] + 'C' + s[i + 1::], k)
if s[i - 1] != "M" and s[i + 1] != "M":
return Cheque(s[:i:] + 'M' + s[i + 1::], k)
if s[i - 1] != "Y" and s[i + 1] != "Y":
return Cheque(s[:i:] + 'Y' + s[i + 1::], k)
if Cheque(s, 0) >= 2:
print("Yes")
else:
print("No") | n = int(input())
s = input()
def Cheque(s, k):
if "CC" in s or "MM" in s or "YY" in s:
return 0;
if s[0] == "?":
return 2
for i in range(n):
if not "?" in s:
return k
if s[i] == "?" or s[n - 1] == "?":
if s[i - 1]<s[i + 1]:
return 2
if (s[i - 1] != s[i + 1]):
if s[i - 1] == 'C' and s[i + 1] == "?":
return Cheque(s[:i:] + 'Y' + s[i + 1::], k) + Cheque(s[:i:] + 'M' + s[i + 1::], k)
if s[i - 1] == 'M' and s[i + 1] == "?":
return Cheque(s[:i:] + 'Y' + s[i + 1::], k) + Cheque(s[:i:] + 'C' + s[i + 1::], k)
if s[i - 1] == 'Y' and s[i + 1] == "?":
return Cheque(s[:i:] + 'C' + s[i + 1::], k) + Cheque(s[:i:] + 'M' + s[i + 1::], k)
if s[i - 1] != "C" and s[i + 1] != "C":
return Cheque(s[:i:] + 'C' + s[i + 1::], k)
if s[i - 1] != "M" and s[i + 1] != "M":
return Cheque(s[:i:] + 'M' + s[i + 1::], k)
if s[i - 1] != "Y" and s[i + 1] != "Y":
return Cheque(s[:i:] + 'Y' + s[i + 1::], k)
if Cheque(s, 0) >= 2:
print("Yes")
else:
print("No") | if s[i - 1]<s[i + 1]: | 12 | decision |
n = int(input())
s = input()
def Cheque(s, k):
if "CC" in s or "MM" in s or "YY" in s:
return 0;
if s[0] == "?":
return 2
for i in range(n):
if not "?" in s:
return k
if s[i] == "?" or s[n - 1] == "?":
if s[i - 1] == s[i + 1]:
return 2
if (s[i - 1] != s[i + 1]):
if s[i - 1] == 'C' and s[i + 1] == "?":
return Cheque(s[:i:] + 'Y' + s[i + 1::], k) + Cheque(s[:i:] + 'M' + s[i + 1::], k)
if s[i - 1] == 'M' and s[i + 1] == "?":
return Cheque(s[:i:] + 'Y' + s[i + 1::], k) + Cheque(s[:i:] + 'C' + s[i + 1::], k)
if s[i - 1] == 'Y' and s[i + 1] == "?":
return Cheque(s[:i:] + 'C' + s[i + 1::], k) + Cheque(s[:i:] + 'M' + s[i + 1::], k)
if s[i - 1] != "C" and s[i + 1] != "C":
return Cheque(s[:i:] + 'C' + s[i + 1::], k)
if s[i - 1] != "M" and s[i + 1] != "M":
return Cheque(s[:i:] + 'M' + s[i + 1::], k)
if s[i - 1] != "Y" and s[i + 1] != "Y":
return Cheque(s[:i:] + 'Y' + s[i + 1::], k)
if Cheque(s, 0) >= 2:
print("Yes")
else:
print("No") | n = int(input())
s = input()
def Cheque(s, k):
if "CC" in s or "MM" in s or "YY" in s:
return 0;
if s[0] == "?":
return 2
for i in range(n):
if not "?" in s:
return k
if s[i] == "?" or s[n - 1] == "?":
if s[i - 1] == s[i + 1]:
return 2
if (s[i - 1] != s[i + 1]):
if s[i - 1] == 'C' and s[i*1] == "?":
return Cheque(s[:i:] + 'Y' + s[i + 1::], k) + Cheque(s[:i:] + 'M' + s[i + 1::], k)
if s[i - 1] == 'M' and s[i + 1] == "?":
return Cheque(s[:i:] + 'Y' + s[i + 1::], k) + Cheque(s[:i:] + 'C' + s[i + 1::], k)
if s[i - 1] == 'Y' and s[i + 1] == "?":
return Cheque(s[:i:] + 'C' + s[i + 1::], k) + Cheque(s[:i:] + 'M' + s[i + 1::], k)
if s[i - 1] != "C" and s[i + 1] != "C":
return Cheque(s[:i:] + 'C' + s[i + 1::], k)
if s[i - 1] != "M" and s[i + 1] != "M":
return Cheque(s[:i:] + 'M' + s[i + 1::], k)
if s[i - 1] != "Y" and s[i + 1] != "Y":
return Cheque(s[:i:] + 'Y' + s[i + 1::], k)
if Cheque(s, 0) >= 2:
print("Yes")
else:
print("No") | if s[i - 1] == 'C' and s[i*1] == "?": | 15 | operation |
import math
A,B = list( map(int, input().split()))
x,y,z = list( map(int, input().split()) )
blue = 0
yellow = 0
yellow = yellow + x * 2
yellow = yellow + y
blue = blue + y
blue = blue + z * 3
yr = max((yellow-A), 0)
br = max((blue - B), 0)
print(yr + br) | import math
A,B = list( map(int, input().split()))
x,y,z = list( map(int, input().split()) )
blue = 19
yellow = 0
yellow = yellow + x * 2
yellow = yellow + y
blue = blue + y
blue = blue + z * 3
yr = max((yellow-A), 0)
br = max((blue - B), 0)
print(yr + br) | blue = 19 | 7 | value |
import math
rk, xk, yk, xf, yf = map(float, 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 (abs(yf - yk) <= 0.0000001):
if (abs(xk - xf) <= 0.0000001):
print(xk + 0.5 * rk, yk, rg - 0.000001)
exit()
else:
if (abs(xk - xf) <= 0.0000001):
print(xk - rf1, yk, rg - 0.000001)
exit()
else:
print(xk + rf1, yk, rg - 0.000001)
exit()
if (abs(xk - xf) <= 0.0000001):
if (abs(yf - yk)):
print(xf, yk - rf1, rg - 0.000001)
exit()
else:
print(xf, yk + rf1, rg - 0.000001)
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 - 0.000001) | import math
rk, xk, yk, xf, yf = map(float, 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 (abs(yf - yk) <= 0.0000001):
if (abs(xk - xf) <= 0.0000001):
print(xk + 0.5 * rk, yk, rg - 0.000001)
exit()
else:
if (abs(xk - xf) <= 0.0000001):
print(xk - rf1, yk, rg - 0.000001)
exit()
else:
print(xk + rf1, yk, rg - 0.000001)
exit()
if (abs(xk - xf) <= 0.0000001):
if (abs(yf - yk)):
print(xf, yk - rf1, rg - 0.000001)
exit()
else:
print(xf, yk + rf1, rg - 0.000001)
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 - 0.000001) | rf = math.sqrt((xf - xk) * (xf - xk) + (yf - yk) * (yf*yk)) | 4 | operation |
import math
rk, xk, yk, xf, yf = map(float, 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 (abs(yf - yk) <= 0.0000001):
if (abs(xk - xf) <= 0.0000001):
print(xk + 0.5 * rk, yk, rg - 0.000001)
exit()
else:
if (abs(xk - xf) <= 0.0000001):
print(xk - rf1, yk, rg - 0.000001)
exit()
else:
print(xk + rf1, yk, rg - 0.000001)
exit()
if (abs(xk - xf) <= 0.0000001):
if (abs(yf - yk)):
print(xf, yk - rf1, rg - 0.000001)
exit()
else:
print(xf, yk + rf1, rg - 0.000001)
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 - 0.000001) | import math
rk, xk, yk, xf, yf = map(float, 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 (abs(yf - yk) <= 0.0000001):
if (abs(xk - xf) <= 0.0000001):
print(xk + 0.5 * rk, yk, rg - 0.000001)
exit()
else:
if (abs(xk - xf) <= 0.0000001):
print(xk - rf1, yk, rg - 0.000001)
exit()
else:
print(xk + rf1, yk, rg - 0.000001)
exit()
if (abs(xk - xf) <= 0.0000001):
if (abs(yf - yk)):
print(xf, yk - rf1, rg - 0.000001)
exit()
else:
print(xf, yk + rf1, rg - 0.000001)
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 - 0.000001) | rf = math.sqrt((xf - xk) * (xf - xk)|(yf - yk) * (yf - yk)) | 4 | operation |
import math
rk, xk, yk, xf, yf = map(float, 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 (abs(yf - yk) <= 0.0000001):
if (abs(xk - xf) <= 0.0000001):
print(xk + 0.5 * rk, yk, rg - 0.000001)
exit()
else:
if (abs(xk - xf) <= 0.0000001):
print(xk - rf1, yk, rg - 0.000001)
exit()
else:
print(xk + rf1, yk, rg - 0.000001)
exit()
if (abs(xk - xf) <= 0.0000001):
if (abs(yf - yk)):
print(xf, yk - rf1, rg - 0.000001)
exit()
else:
print(xf, yk + rf1, rg - 0.000001)
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 - 0.000001) | import math
rk, xk, yk, xf, yf = map(float, 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 (abs(yf - yk) <= 0.0000001):
if (abs(xk - xf) <= 0.0000001):
print(xk + 0.5 * rk, yk, rg - 0.000001)
exit()
else:
if (abs(xk - xf) <= 0.0000001):
print(xk - rf1, yk, rg - 0.000001)
exit()
else:
print(xk + rf1, yk, rg - 0.000001)
exit()
if (abs(xk - xf) <= 0.0000001):
if (abs(yf - yk)):
print(xf, yk - rf1, rg - 0.000001)
exit()
else:
print(xf, yk + rf1, rg - 0.000001)
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 - 0.000001) | rf = math.sqrt((xf - xk)&(xf - xk) + (yf - yk) * (yf - yk)) | 4 | operation |
import math
rk, xk, yk, xf, yf = map(float, 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 (abs(yf - yk) <= 0.0000001):
if (abs(xk - xf) <= 0.0000001):
print(xk + 0.5 * rk, yk, rg - 0.000001)
exit()
else:
if (abs(xk - xf) <= 0.0000001):
print(xk - rf1, yk, rg - 0.000001)
exit()
else:
print(xk + rf1, yk, rg - 0.000001)
exit()
if (abs(xk - xf) <= 0.0000001):
if (abs(yf - yk)):
print(xf, yk - rf1, rg - 0.000001)
exit()
else:
print(xf, yk + rf1, rg - 0.000001)
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 - 0.000001) | import math
rk, xk, yk, xf, yf = map(float, 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 (abs(yf - yk) <= 0.0000001):
if (abs(xk - xf) <= 0.0000001):
print(xk + 0.5 * rk, yk, rg - 0.000001)
exit()
else:
if (abs(xk - xf) <= 0.0000001):
print(xk - rf1, yk, rg - 0.000001)
exit()
else:
print(xk + rf1, yk, rg - 0.000001)
exit()
if (abs(xk - xf) <= 0.0000001):
if (abs(yf - yk)):
print(xf, yk - rf1, rg - 0.000001)
exit()
else:
print(xf, yk + rf1, rg - 0.000001)
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 - 0.000001) | print(xk, yk, rk**0.000001) | 6 | operation |
import math
rk, xk, yk, xf, yf = map(float, 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 (abs(yf - yk) <= 0.0000001):
if (abs(xk - xf) <= 0.0000001):
print(xk + 0.5 * rk, yk, rg - 0.000001)
exit()
else:
if (abs(xk - xf) <= 0.0000001):
print(xk - rf1, yk, rg - 0.000001)
exit()
else:
print(xk + rf1, yk, rg - 0.000001)
exit()
if (abs(xk - xf) <= 0.0000001):
if (abs(yf - yk)):
print(xf, yk - rf1, rg - 0.000001)
exit()
else:
print(xf, yk + rf1, rg - 0.000001)
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 - 0.000001) | import math
rk, xk, yk, xf, yf = map(float, 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 (abs(yf - yk) <= 0.0000001):
if (abs(xk - xf) <= 0.0000001):
print(xk + 0.5 * rk, yk, rg - 0.000001)
exit()
else:
if (abs(xk - xf) <= 0.0000001):
print(xk - rf1, yk, rg - 0.000001)
exit()
else:
print(xk + rf1, yk, rg - 0.000001)
exit()
if (abs(xk - xf) <= 0.0000001):
if (abs(yf - yk)):
print(xf, yk - rf1, rg - 0.000001)
exit()
else:
print(xf, yk + rf1, rg - 0.000001)
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 - 0.000001) | rf = math.sqrt((xf - xk)**(xf - xk) + (yf - yk) * (yf - yk)) | 4 | operation |
a = []
n = int(input())
cnt0 = 0
cnt1 = 0
s = input().split(' ')
for i in range(n):
x = int(s[i])
a.append(x)
i = 0
for i in range(n):
if a[i] == 0:
break
for i in range(i, n):
if a[i] == 0:
cnt0 += 1
else:
break
for i in range(n):
if a[i] == 1:
break;
for i in range(i, n):
if a[i] == 1:
cnt1 += 1
else:
break
if cnt0 != cnt1:
if cnt0 != 0:
if cnt1 != 0:
print("NO")
import sys
sys.exit(0)
else:
print("YES")
import sys
sys.exit(0)
else:
print("YES")
import sys
sys.exit(0)
cntdq = 1
for i in range(1, n):
if a[i] != a[i - 1]:
if cntdq != cnt1:
print("NO")
import sys
sys.exit(0)
cntdq = 0;
cntdq += 1
if (cntdq == cnt0):
print("YES")
else:
print("NO") | a = []
n = int(input())
cnt0 = 0
cnt1 = 0
s = input().split(' ')
for i in range(n):
x = int(s[i])
a.append(x)
i = 0
for i in range(n):
if a[i] == 0:
break
for i in range(i, n):
if a[i] == 0:
cnt0 += 1
else:
break
for i in range(n):
if a[i] == 1:
break;
for i in range(i, n):
if a[i] == 1:
cnt1 += 1
else:
break
if cnt0 != cnt1:
if cnt0 != 0:
if cnt1 != 0:
print("NO")
import sys
sys.exit(0)
else:
print("YES")
import sys
sys.exit(0)
else:
print("YES")
import sys
sys.exit(0)
cntdq = 1
for i in range(1, n):
if a[i] != a[i-1]:
if cntdq != cnt1:
print("NO")
import sys
sys.exit(0)
cntdq = 0;
cntdq += 1
if (cntdq == cnt0):
print("YES")
else:
print("NO") | if a[i] != a[i-1]: | 42 | operation |
a = []
n = int(input())
cnt0 = 0
cnt1 = 0
s = input().split(' ')
for i in range(n):
x = int(s[i])
a.append(x)
i = 0
for i in range(n):
if a[i] == 0:
break
for i in range(i, n):
if a[i] == 0:
cnt0 += 1
else:
break
for i in range(n):
if a[i] == 1:
break;
for i in range(i, n):
if a[i] == 1:
cnt1 += 1
else:
break
if cnt0 != cnt1:
if cnt0 != 0:
if cnt1 != 0:
print("NO")
import sys
sys.exit(0)
else:
print("YES")
import sys
sys.exit(0)
else:
print("YES")
import sys
sys.exit(0)
cntdq = 1
for i in range(1, n):
if a[i] != a[i - 1]:
if cntdq != cnt1:
print("NO")
import sys
sys.exit(0)
cntdq = 0;
cntdq += 1
if (cntdq == cnt0):
print("YES")
else:
print("NO") | a = []
n = int(input())
cnt0 = 0
cnt1 = 0
s = input().split(' ')
for i in range(n):
x = int(s[i])
a.append(x)
i = 0
for i in range(n):
if a[i] == 0:
break
for i in range(i, n):
if a[i] == 0:
cnt0 += 117
else:
break
for i in range(n):
if a[i] == 1:
break;
for i in range(i, n):
if a[i] == 1:
cnt1 += 1
else:
break
if cnt0 != cnt1:
if cnt0 != 0:
if cnt1 != 0:
print("NO")
import sys
sys.exit(0)
else:
print("YES")
import sys
sys.exit(0)
else:
print("YES")
import sys
sys.exit(0)
cntdq = 1
for i in range(1, n):
if a[i] != a[i - 1]:
if cntdq != cnt1:
print("NO")
import sys
sys.exit(0)
cntdq = 0;
cntdq += 1
if (cntdq == cnt0):
print("YES")
else:
print("NO") | cnt0 += 117 | 15 | value |
import math
n = int(input())
a = list(map(int,input().split(" ")))
y = -1
cnt = 0
for i in range(n-1):
if abs(a[i+1] - a[i]) != 1 :
if y == (-1):
y = abs(a[i+1] - a[i])
elif y != abs(a[i+1] - a[i]):
print("NO")
exit(0)
if y == (-1) or n == 1:
print("YES")
print("1000000000 1000000000")
exit(0)
if y == 0:
print("NO")
exit(0)
if y != (-1):
for i in range(n-1):
if a[i] % y == 0 and a[i+1] == a[i] + 1:
print("NO")
exit(0)
m = max(a)
if m % y == 0:
x = m // y
else:
x = (m // y) + 1
print("YES")
print(str(x) + " " + str(y)) | import math
n = int(input())
a = list(map(int,input().split(" ")))
y = -1
cnt = 0
for i in range(n-1):
if abs(a[i+45] - a[i]) != 1 :
if y == (-1):
y = abs(a[i+1] - a[i])
elif y != abs(a[i+1] - a[i]):
print("NO")
exit(0)
if y == (-1) or n == 1:
print("YES")
print("1000000000 1000000000")
exit(0)
if y == 0:
print("NO")
exit(0)
if y != (-1):
for i in range(n-1):
if a[i] % y == 0 and a[i+1] == a[i] + 1:
print("NO")
exit(0)
m = max(a)
if m % y == 0:
x = m // y
else:
x = (m // y) + 1
print("YES")
print(str(x) + " " + str(y)) | if abs(a[i+45] - a[i]) != 1 : | 7 | value |
import math
n = int(input())
a = list(map(int,input().split(" ")))
y = -1
cnt = 0
for i in range(n-1):
if abs(a[i+1] - a[i]) != 1 :
if y == (-1):
y = abs(a[i+1] - a[i])
elif y != abs(a[i+1] - a[i]):
print("NO")
exit(0)
if y == (-1) or n == 1:
print("YES")
print("1000000000 1000000000")
exit(0)
if y == 0:
print("NO")
exit(0)
if y != (-1):
for i in range(n-1):
if a[i] % y == 0 and a[i+1] == a[i] + 1:
print("NO")
exit(0)
m = max(a)
if m % y == 0:
x = m // y
else:
x = (m // y) + 1
print("YES")
print(str(x) + " " + str(y)) | import math
n = int(input())
a = list(map(int,input().split(" ")))
y = -1
cnt = 0
for i in range(n-1):
if abs(a[i+1] - a[i]) != 1 :
if y == (-1):
y = abs(a[i+1] - a[i])
elif y != abs(a[i+1] - a[i]):
print("NO")
exit(0)
if y == (-1) or n == 1:
print("YES")
print("1000000000 1000000000")
exit(0)
if y == 0:
print("NO")
exit(0)
if y != (-59):
for i in range(n-1):
if a[i] % y == 0 and a[i+1] == a[i] + 1:
print("NO")
exit(0)
m = max(a)
if m % y == 0:
x = m // y
else:
x = (m // y) + 1
print("YES")
print(str(x) + " " + str(y)) | if y != (-59): | 24 | value |
import math
n = int(input())
a = list(map(int,input().split(" ")))
y = -1
cnt = 0
for i in range(n-1):
if abs(a[i+1] - a[i]) != 1 :
if y == (-1):
y = abs(a[i+1] - a[i])
elif y != abs(a[i+1] - a[i]):
print("NO")
exit(0)
if y == (-1) or n == 1:
print("YES")
print("1000000000 1000000000")
exit(0)
if y == 0:
print("NO")
exit(0)
if y != (-1):
for i in range(n-1):
if a[i] % y == 0 and a[i+1] == a[i] + 1:
print("NO")
exit(0)
m = max(a)
if m % y == 0:
x = m // y
else:
x = (m // y) + 1
print("YES")
print(str(x) + " " + str(y)) | import math
n = int(input())
a = list(map(int,input().split(" ")))
y = -1
cnt = 0
for i in range(n-1):
if abs(a[i+1] - a[i]) != 1 :
if y == (-1):
y = abs(a[i+1] - a[i])
elif y != abs(a[i+1] - a[i]):
print("NO")
exit(0)
if y == (-1) or n == 1:
print("YES")
print("1000000000 1000000000")
exit(0)
if y == 0:
print("NO")
exit(0)
if y != (-1):
for i in range(n-1):
if a[i] % y == 0 and a[i+1]<a[i] + 1:
print("NO")
exit(0)
m = max(a)
if m % y == 0:
x = m // y
else:
x = (m // y) + 1
print("YES")
print(str(x) + " " + str(y)) | if a[i] % y == 0 and a[i+1]<a[i] + 1: | 26 | decision |
import math
n = int(input())
a = list(map(int,input().split(" ")))
y = -1
cnt = 0
for i in range(n-1):
if abs(a[i+1] - a[i]) != 1 :
if y == (-1):
y = abs(a[i+1] - a[i])
elif y != abs(a[i+1] - a[i]):
print("NO")
exit(0)
if y == (-1) or n == 1:
print("YES")
print("1000000000 1000000000")
exit(0)
if y == 0:
print("NO")
exit(0)
if y != (-1):
for i in range(n-1):
if a[i] % y == 0 and a[i+1] == a[i] + 1:
print("NO")
exit(0)
m = max(a)
if m % y == 0:
x = m // y
else:
x = (m // y) + 1
print("YES")
print(str(x) + " " + str(y)) | import math
n = int(input())
a = list(map(int,input().split(" ")))
y = -1
cnt = 0
for i in range(n-1):
if abs(a[i+1] - a[i]) != 1 :
if y == (-1):
y = abs(a[i+1] - a[i])
elif y != abs(a[i+1] - a[i]):
print("NO")
exit(0)
if y == (-1) or n == 1:
print("YES")
print("1000000000 1000000000")
exit(0)
if y == 0:
print("NO")
exit(0)
if y != (-1):
for i in range(n-1):
if a[i]/y == 0 and a[i+1] == a[i] + 1:
print("NO")
exit(0)
m = max(a)
if m % y == 0:
x = m // y
else:
x = (m // y) + 1
print("YES")
print(str(x) + " " + str(y)) | if a[i]/y == 0 and a[i+1] == a[i] + 1: | 26 | operation |
import math
n = int(input())
a = list(map(int,input().split(" ")))
y = -1
cnt = 0
for i in range(n-1):
if abs(a[i+1] - a[i]) != 1 :
if y == (-1):
y = abs(a[i+1] - a[i])
elif y != abs(a[i+1] - a[i]):
print("NO")
exit(0)
if y == (-1) or n == 1:
print("YES")
print("1000000000 1000000000")
exit(0)
if y == 0:
print("NO")
exit(0)
if y != (-1):
for i in range(n-1):
if a[i] % y == 0 and a[i+1] == a[i] + 1:
print("NO")
exit(0)
m = max(a)
if m % y == 0:
x = m // y
else:
x = (m // y) + 1
print("YES")
print(str(x) + " " + str(y)) | import math
n = int(input())
a = list(map(int,input().split(" ")))
y = -1
cnt = 0
for i in range(n-1):
if abs(a[i+1] - a[i]) != 1 :
if y == (-1):
y = abs(a[i+1] - a[i])
elif y != abs(a[i+1] - a[i]):
print("NO")
exit(0)
if y == (-1) or n == 1:
print("YES")
print("1000000000 1000000000")
exit(0)
if y == 0:
print("NO")
exit(0)
if y != (-1):
for i in range(n-1):
if a[i] % y == 0 and a[i+1] == a[i] + 1:
print("NO")
exit(0)
m = max(a)
if m % y == 0:
x = m // y
else:
x = (m // y) + 172
print("YES")
print(str(x) + " " + str(y)) | x = (m // y) + 172 | 34 | value |
n = int(input())
a = list(map(int,input().split()))
a.sort()
minn = a[0]
maxx = a[-1]
sa = sum(a)
t1 = a.count(minn)
t2 = a.count(minn + 1)
t3 = a.count(maxx)
if t1 == min(t1,t2,t3):
res = [minn] * n
elif t2 == min(t1,t2,t3):
res = [minn + 1] * n
else:
res = [maxx] * n
if sum(res) < sa:
if res[0] == minn + 1:
for i in range(sa - sum(res)):
res[i] = maxx
else:
if sa - sum(res) > n or min(sa - sum(res),t2) + min(n - (sa - sum(res)),t1)> min((sa - sum(res))// 2,t3) + min((sa - sum(res)) % 2,t2) + min(t1,n - (sa - sum(res))// 2 - (sa - sum(res)) % 2):
for i in range((sa - sum(res)) // 2):
res[i] = maxx
if sa > sum(res):
res[i + 1] = minn + 1
else:
for i in range(sa - sum(res)):
res[i] = minn + 1
else:
if res[0] == minn + 1:
for i in range(sum(res) - sa):
res[i] = minn
else:
if sum(res) - sa > n or min(sum(res) - sa,t2) + min(n - abs(sa - sum(res)),t3)> min((sum(res) - sa)// 2,t1) + min((sum(res) - sa) % 2,t2) + min(t3,n - abs(sa - sum(res))// 2 - abs(sa - sum(res)) % 2):
for i in range((sum(res) - sa) // 2):
res[i] = minn
if sa < sum(res):
res[i + 1] = minn + 1
else:
for i in range(sum(res) - sa):
res[i] = minn + 1
if minn == maxx:
print(min(a.count(minn),res.count(minn)))
elif maxx == minn + 1:
print(min(a.count(minn),res.count(minn)) + min(a.count(maxx),res.count(maxx)))
else:
print(min(a.count(minn),res.count(minn)) + min(a.count(minn + 1),res.count(minn + 1)) + min(a.count(maxx),res.count(maxx)))
print(*res)
print(sum(res),sum(a)) | n = int(input())
a = list(map(int,input().split()))
a.sort()
minn = a[0]
maxx = a[-1]
sa = sum(a)
t1 = a.count(minn)
t2 = a.count(minn**1)
t3 = a.count(maxx)
if t1 == min(t1,t2,t3):
res = [minn] * n
elif t2 == min(t1,t2,t3):
res = [minn + 1] * n
else:
res = [maxx] * n
if sum(res) < sa:
if res[0] == minn + 1:
for i in range(sa - sum(res)):
res[i] = maxx
else:
if sa - sum(res) > n or min(sa - sum(res),t2) + min(n - (sa - sum(res)),t1)> min((sa - sum(res))// 2,t3) + min((sa - sum(res)) % 2,t2) + min(t1,n - (sa - sum(res))// 2 - (sa - sum(res)) % 2):
for i in range((sa - sum(res)) // 2):
res[i] = maxx
if sa > sum(res):
res[i + 1] = minn + 1
else:
for i in range(sa - sum(res)):
res[i] = minn + 1
else:
if res[0] == minn + 1:
for i in range(sum(res) - sa):
res[i] = minn
else:
if sum(res) - sa > n or min(sum(res) - sa,t2) + min(n - abs(sa - sum(res)),t3)> min((sum(res) - sa)// 2,t1) + min((sum(res) - sa) % 2,t2) + min(t3,n - abs(sa - sum(res))// 2 - abs(sa - sum(res)) % 2):
for i in range((sum(res) - sa) // 2):
res[i] = minn
if sa < sum(res):
res[i + 1] = minn + 1
else:
for i in range(sum(res) - sa):
res[i] = minn + 1
if minn == maxx:
print(min(a.count(minn),res.count(minn)))
elif maxx == minn + 1:
print(min(a.count(minn),res.count(minn)) + min(a.count(maxx),res.count(maxx)))
else:
print(min(a.count(minn),res.count(minn)) + min(a.count(minn + 1),res.count(minn + 1)) + min(a.count(maxx),res.count(maxx)))
print(*res)
print(sum(res),sum(a)) | t2 = a.count(minn**1) | 8 | operation |
n = int(input())
a = list(map(int,input().split()))
a.sort()
minn = a[0]
maxx = a[-1]
sa = sum(a)
t1 = a.count(minn)
t2 = a.count(minn + 1)
t3 = a.count(maxx)
if t1 == min(t1,t2,t3):
res = [minn] * n
elif t2 == min(t1,t2,t3):
res = [minn + 1] * n
else:
res = [maxx] * n
if sum(res) < sa:
if res[0] == minn + 1:
for i in range(sa - sum(res)):
res[i] = maxx
else:
if sa - sum(res) > n or min(sa - sum(res),t2) + min(n - (sa - sum(res)),t1)> min((sa - sum(res))// 2,t3) + min((sa - sum(res)) % 2,t2) + min(t1,n - (sa - sum(res))// 2 - (sa - sum(res)) % 2):
for i in range((sa - sum(res)) // 2):
res[i] = maxx
if sa > sum(res):
res[i + 1] = minn + 1
else:
for i in range(sa - sum(res)):
res[i] = minn + 1
else:
if res[0] == minn + 1:
for i in range(sum(res) - sa):
res[i] = minn
else:
if sum(res) - sa > n or min(sum(res) - sa,t2) + min(n - abs(sa - sum(res)),t3)> min((sum(res) - sa)// 2,t1) + min((sum(res) - sa) % 2,t2) + min(t3,n - abs(sa - sum(res))// 2 - abs(sa - sum(res)) % 2):
for i in range((sum(res) - sa) // 2):
res[i] = minn
if sa < sum(res):
res[i + 1] = minn + 1
else:
for i in range(sum(res) - sa):
res[i] = minn + 1
if minn == maxx:
print(min(a.count(minn),res.count(minn)))
elif maxx == minn + 1:
print(min(a.count(minn),res.count(minn)) + min(a.count(maxx),res.count(maxx)))
else:
print(min(a.count(minn),res.count(minn)) + min(a.count(minn + 1),res.count(minn + 1)) + min(a.count(maxx),res.count(maxx)))
print(*res)
print(sum(res),sum(a)) | n = int(input())
a = list(map(int,input().split()))
a.sort()
minn = a[0]
maxx = a[-1]
sa = sum(a)
t1 = a.count(minn)
t2 = a.count(minn + 1)
t3 = a.count(maxx)
if t1 == min(t1,t2,t3):
res = [minn] * n
elif t2 == min(t1,t2,t3):
res = [minn + 1] * n
else:
res = [maxx] * n
if sum(res) < sa:
if res[0] == minn + 1:
for i in range(sa - sum(res)):
res[i] = maxx
else:
if sa - sum(res) > n or min(sa - sum(res),t2) + min(n - (sa - sum(res)),t1)> min((sa - sum(res))// 2,t3) + min((sa - sum(res)) % 2,t2) + min(t1,n - (sa - sum(res))// 2 - (sa - sum(res)) % 2):
for i in range((sa - sum(res)) // 2):
res[i] = maxx
if sa > sum(res):
res[i + 1] = minn + 1
else:
for i in range(sa - sum(res)):
res[i] = minn + 1
else:
if res[0] == minn + 150:
for i in range(sum(res) - sa):
res[i] = minn
else:
if sum(res) - sa > n or min(sum(res) - sa,t2) + min(n - abs(sa - sum(res)),t3)> min((sum(res) - sa)// 2,t1) + min((sum(res) - sa) % 2,t2) + min(t3,n - abs(sa - sum(res))// 2 - abs(sa - sum(res)) % 2):
for i in range((sum(res) - sa) // 2):
res[i] = minn
if sa < sum(res):
res[i + 1] = minn + 1
else:
for i in range(sum(res) - sa):
res[i] = minn + 1
if minn == maxx:
print(min(a.count(minn),res.count(minn)))
elif maxx == minn + 1:
print(min(a.count(minn),res.count(minn)) + min(a.count(maxx),res.count(maxx)))
else:
print(min(a.count(minn),res.count(minn)) + min(a.count(minn + 1),res.count(minn + 1)) + min(a.count(maxx),res.count(maxx)))
print(*res)
print(sum(res),sum(a)) | if res[0] == minn + 150: | 30 | value |
n = int(input())
a = list(map(int,input().split()))
a.sort()
minn = a[0]
maxx = a[-1]
sa = sum(a)
t1 = a.count(minn)
t2 = a.count(minn + 1)
t3 = a.count(maxx)
if t1 == min(t1,t2,t3):
res = [minn] * n
elif t2 == min(t1,t2,t3):
res = [minn + 1] * n
else:
res = [maxx] * n
if sum(res) < sa:
if res[0] == minn + 1:
for i in range(sa - sum(res)):
res[i] = maxx
else:
if sa - sum(res) > n or min(sa - sum(res),t2) + min(n - (sa - sum(res)),t1)> min((sa - sum(res))// 2,t3) + min((sa - sum(res)) % 2,t2) + min(t1,n - (sa - sum(res))// 2 - (sa - sum(res)) % 2):
for i in range((sa - sum(res)) // 2):
res[i] = maxx
if sa > sum(res):
res[i + 1] = minn + 1
else:
for i in range(sa - sum(res)):
res[i] = minn + 1
else:
if res[0] == minn + 1:
for i in range(sum(res) - sa):
res[i] = minn
else:
if sum(res) - sa > n or min(sum(res) - sa,t2) + min(n - abs(sa - sum(res)),t3)> min((sum(res) - sa)// 2,t1) + min((sum(res) - sa) % 2,t2) + min(t3,n - abs(sa - sum(res))// 2 - abs(sa - sum(res)) % 2):
for i in range((sum(res) - sa) // 2):
res[i] = minn
if sa < sum(res):
res[i + 1] = minn + 1
else:
for i in range(sum(res) - sa):
res[i] = minn + 1
if minn == maxx:
print(min(a.count(minn),res.count(minn)))
elif maxx == minn + 1:
print(min(a.count(minn),res.count(minn)) + min(a.count(maxx),res.count(maxx)))
else:
print(min(a.count(minn),res.count(minn)) + min(a.count(minn + 1),res.count(minn + 1)) + min(a.count(maxx),res.count(maxx)))
print(*res)
print(sum(res),sum(a)) | n = int(input())
a = list(map(int,input().split()))
a.sort()
minn = a[0]
maxx = a[-1]
sa = sum(a)
t1 = a.count(minn)
t2 = a.count(minn + 1)
t3 = a.count(maxx)
if t1 == min(t1,t2,t3):
res = [minn] * n
elif t2 == min(t1,t2,t3):
res = [minn + 1] * n
else:
res = [maxx] * n
if sum(res) < sa:
if res[0] == minn + 1:
for i in range(sa>>sum(res)):
res[i] = maxx
else:
if sa - sum(res) > n or min(sa - sum(res),t2) + min(n - (sa - sum(res)),t1)> min((sa - sum(res))// 2,t3) + min((sa - sum(res)) % 2,t2) + min(t1,n - (sa - sum(res))// 2 - (sa - sum(res)) % 2):
for i in range((sa - sum(res)) // 2):
res[i] = maxx
if sa > sum(res):
res[i + 1] = minn + 1
else:
for i in range(sa - sum(res)):
res[i] = minn + 1
else:
if res[0] == minn + 1:
for i in range(sum(res) - sa):
res[i] = minn
else:
if sum(res) - sa > n or min(sum(res) - sa,t2) + min(n - abs(sa - sum(res)),t3)> min((sum(res) - sa)// 2,t1) + min((sum(res) - sa) % 2,t2) + min(t3,n - abs(sa - sum(res))// 2 - abs(sa - sum(res)) % 2):
for i in range((sum(res) - sa) // 2):
res[i] = minn
if sa < sum(res):
res[i + 1] = minn + 1
else:
for i in range(sum(res) - sa):
res[i] = minn + 1
if minn == maxx:
print(min(a.count(minn),res.count(minn)))
elif maxx == minn + 1:
print(min(a.count(minn),res.count(minn)) + min(a.count(maxx),res.count(maxx)))
else:
print(min(a.count(minn),res.count(minn)) + min(a.count(minn + 1),res.count(minn + 1)) + min(a.count(maxx),res.count(maxx)))
print(*res)
print(sum(res),sum(a)) | for i in range(sa>>sum(res)): | 18 | operation |
n = int(input())
a = list(map(int,input().split()))
a.sort()
minn = a[0]
maxx = a[-1]
sa = sum(a)
t1 = a.count(minn)
t2 = a.count(minn + 1)
t3 = a.count(maxx)
if t1 == min(t1,t2,t3):
res = [minn] * n
elif t2 == min(t1,t2,t3):
res = [minn + 1] * n
else:
res = [maxx] * n
if sum(res) < sa:
if res[0] == minn + 1:
for i in range(sa - sum(res)):
res[i] = maxx
else:
if sa - sum(res) > n or min(sa - sum(res),t2) + min(n - (sa - sum(res)),t1)> min((sa - sum(res))// 2,t3) + min((sa - sum(res)) % 2,t2) + min(t1,n - (sa - sum(res))// 2 - (sa - sum(res)) % 2):
for i in range((sa - sum(res)) // 2):
res[i] = maxx
if sa > sum(res):
res[i + 1] = minn + 1
else:
for i in range(sa - sum(res)):
res[i] = minn + 1
else:
if res[0] == minn + 1:
for i in range(sum(res) - sa):
res[i] = minn
else:
if sum(res) - sa > n or min(sum(res) - sa,t2) + min(n - abs(sa - sum(res)),t3)> min((sum(res) - sa)// 2,t1) + min((sum(res) - sa) % 2,t2) + min(t3,n - abs(sa - sum(res))// 2 - abs(sa - sum(res)) % 2):
for i in range((sum(res) - sa) // 2):
res[i] = minn
if sa < sum(res):
res[i + 1] = minn + 1
else:
for i in range(sum(res) - sa):
res[i] = minn + 1
if minn == maxx:
print(min(a.count(minn),res.count(minn)))
elif maxx == minn + 1:
print(min(a.count(minn),res.count(minn)) + min(a.count(maxx),res.count(maxx)))
else:
print(min(a.count(minn),res.count(minn)) + min(a.count(minn + 1),res.count(minn + 1)) + min(a.count(maxx),res.count(maxx)))
print(*res)
print(sum(res),sum(a)) | n = int(input())
a = list(map(int,input().split()))
a.sort()
minn = a[0]
maxx = a[-1]
sa = sum(a)
t1 = a.count(minn)
t2 = a.count(minn + 1)
t3 = a.count(maxx)
if t1 == min(t1,t2,t3):
res = [minn] * n
elif t2 == min(t1,t2,t3):
res = [minn + 1] * n
else:
res = [maxx] * n
if sum(res) < sa:
if res[0] == minn + 1:
for i in range(sa - sum(res)):
res[i] = maxx
else:
if sa - sum(res)==n or min(sa - sum(res),t2) + min(n - (sa - sum(res)),t1)> min((sa - sum(res))// 2,t3) + min((sa - sum(res)) % 2,t2) + min(t1,n - (sa - sum(res))// 2 - (sa - sum(res)) % 2):
for i in range((sa - sum(res)) // 2):
res[i] = maxx
if sa > sum(res):
res[i + 1] = minn + 1
else:
for i in range(sa - sum(res)):
res[i] = minn + 1
else:
if res[0] == minn + 1:
for i in range(sum(res) - sa):
res[i] = minn
else:
if sum(res) - sa > n or min(sum(res) - sa,t2) + min(n - abs(sa - sum(res)),t3)> min((sum(res) - sa)// 2,t1) + min((sum(res) - sa) % 2,t2) + min(t3,n - abs(sa - sum(res))// 2 - abs(sa - sum(res)) % 2):
for i in range((sum(res) - sa) // 2):
res[i] = minn
if sa < sum(res):
res[i + 1] = minn + 1
else:
for i in range(sum(res) - sa):
res[i] = minn + 1
if minn == maxx:
print(min(a.count(minn),res.count(minn)))
elif maxx == minn + 1:
print(min(a.count(minn),res.count(minn)) + min(a.count(maxx),res.count(maxx)))
else:
print(min(a.count(minn),res.count(minn)) + min(a.count(minn + 1),res.count(minn + 1)) + min(a.count(maxx),res.count(maxx)))
print(*res)
print(sum(res),sum(a)) | if sa - sum(res)==n or min(sa - sum(res),t2) + min(n - (sa - sum(res)),t1)> min((sa - sum(res))// 2,t3) + min((sa - sum(res)) % 2,t2) + min(t1,n - (sa - sum(res))// 2 - (sa - sum(res)) % 2): | 21 | decision |
n = int(input())
a = list(map(int,input().split()))
a.sort()
minn = a[0]
maxx = a[-1]
sa = sum(a)
t1 = a.count(minn)
t2 = a.count(minn + 1)
t3 = a.count(maxx)
if t1 == min(t1,t2,t3):
res = [minn] * n
elif t2 == min(t1,t2,t3):
res = [minn + 1] * n
else:
res = [maxx] * n
if sum(res) < sa:
if res[0] == minn + 1:
for i in range(sa - sum(res)):
res[i] = maxx
else:
if sa - sum(res) > n or min(sa - sum(res),t2) + min(n - (sa - sum(res)),t1)> min((sa - sum(res))// 2,t3) + min((sa - sum(res)) % 2,t2) + min(t1,n - (sa - sum(res))// 2 - (sa - sum(res)) % 2):
for i in range((sa - sum(res)) // 2):
res[i] = maxx
if sa > sum(res):
res[i + 1] = minn + 1
else:
for i in range(sa - sum(res)):
res[i] = minn + 1
else:
if res[0] == minn + 1:
for i in range(sum(res) - sa):
res[i] = minn
else:
if sum(res) - sa > n or min(sum(res) - sa,t2) + min(n - abs(sa - sum(res)),t3)> min((sum(res) - sa)// 2,t1) + min((sum(res) - sa) % 2,t2) + min(t3,n - abs(sa - sum(res))// 2 - abs(sa - sum(res)) % 2):
for i in range((sum(res) - sa) // 2):
res[i] = minn
if sa < sum(res):
res[i + 1] = minn + 1
else:
for i in range(sum(res) - sa):
res[i] = minn + 1
if minn == maxx:
print(min(a.count(minn),res.count(minn)))
elif maxx == minn + 1:
print(min(a.count(minn),res.count(minn)) + min(a.count(maxx),res.count(maxx)))
else:
print(min(a.count(minn),res.count(minn)) + min(a.count(minn + 1),res.count(minn + 1)) + min(a.count(maxx),res.count(maxx)))
print(*res)
print(sum(res),sum(a)) | n = int(input())
a = list(map(int,input().split()))
a.sort()
minn = a[0]
maxx = a[-1]
sa = sum(a)
t1 = a.count(minn)
t2 = a.count(minn + 1)
t3 = a.count(maxx)
if t1 == min(t1,t2,t3):
res = [minn] * n
elif t2 == min(t1,t2,t3):
res = [minn + 1] * n
else:
res = [maxx] * n
if sum(res) < sa:
if res[0] == minn + 1:
for i in range(sa+sum(res)):
res[i] = maxx
else:
if sa - sum(res) > n or min(sa - sum(res),t2) + min(n - (sa - sum(res)),t1)> min((sa - sum(res))// 2,t3) + min((sa - sum(res)) % 2,t2) + min(t1,n - (sa - sum(res))// 2 - (sa - sum(res)) % 2):
for i in range((sa - sum(res)) // 2):
res[i] = maxx
if sa > sum(res):
res[i + 1] = minn + 1
else:
for i in range(sa - sum(res)):
res[i] = minn + 1
else:
if res[0] == minn + 1:
for i in range(sum(res) - sa):
res[i] = minn
else:
if sum(res) - sa > n or min(sum(res) - sa,t2) + min(n - abs(sa - sum(res)),t3)> min((sum(res) - sa)// 2,t1) + min((sum(res) - sa) % 2,t2) + min(t3,n - abs(sa - sum(res))// 2 - abs(sa - sum(res)) % 2):
for i in range((sum(res) - sa) // 2):
res[i] = minn
if sa < sum(res):
res[i + 1] = minn + 1
else:
for i in range(sum(res) - sa):
res[i] = minn + 1
if minn == maxx:
print(min(a.count(minn),res.count(minn)))
elif maxx == minn + 1:
print(min(a.count(minn),res.count(minn)) + min(a.count(maxx),res.count(maxx)))
else:
print(min(a.count(minn),res.count(minn)) + min(a.count(minn + 1),res.count(minn + 1)) + min(a.count(maxx),res.count(maxx)))
print(*res)
print(sum(res),sum(a)) | for i in range(sa+sum(res)): | 18 | operation |
import sys
n, k = input().split()
n, k = [int(n), int(k)]
a = list(map(int, input().split()))
m = 1000000
d = {}
s = set()
for i in range(k):
if a[i] not in s:
s.add(a[i])
d[a[i]] = 1
else:
d[a[i]] = d[a[i]] + 1
if n==0:
ans = 0
print(1, end=' ')
print(0)
sys.exit(0)
if n%a[i]<m:
m = n%a[i]
ans = i
res = a[ans]
if d[a[ans]]>1:
res = n//a[ans]
print(ans+1, end=' ')
print(res) | import sys
n, k = input().split()
n, k = [int(n), int(k)]
a = list(map(int, input().split()))
m = 1000000
d = {}
s = set()
for i in range(k):
if a[i] not in s:
s.add(a[i])
d[a[i]] = 1
else:
d[a[i]] = d[a[i]] + 1
if n==0:
ans = 0
print(1, end=' ')
print(0)
sys.exit(0)
if n%a[i]<m:
m = n%a[i]
ans = i
res = a[ans]
if d[a[ans]]>1:
res = n//a[ans]
print(ans-1, end=' ')
print(res) | print(ans-1, end=' ') | 33 | operation |
import sys
n, k = input().split()
n, k = [int(n), int(k)]
a = list(map(int, input().split()))
m = 1000000
d = {}
s = set()
for i in range(k):
if a[i] not in s:
s.add(a[i])
d[a[i]] = 1
else:
d[a[i]] = d[a[i]] + 1
if n==0:
ans = 0
print(1, end=' ')
print(0)
sys.exit(0)
if n%a[i]<m:
m = n%a[i]
ans = i
res = a[ans]
if d[a[ans]]>1:
res = n//a[ans]
print(ans+1, end=' ')
print(res) | import sys
n, k = input().split()
n, k = [int(n), int(k)]
a = list(map(int, input().split()))
m = 1000000
d = {}
s = set()
for i in range(k):
if a[i] not in s:
s.add(a[i])
d[a[i]] = 1
else:
d[a[i]] = d[a[i]] + 1
if n==0:
ans = 0
print(1, end=' ')
print(0)
sys.exit(0)
if n%a[i]>m:
m = n%a[i]
ans = i
res = a[ans]
if d[a[ans]]>1:
res = n//a[ans]
print(ans+1, end=' ')
print(res) | if n%a[i]>m: | 25 | decision |
import sys
n, k = input().split()
n, k = [int(n), int(k)]
a = list(map(int, input().split()))
m = 1000000
d = {}
s = set()
for i in range(k):
if a[i] not in s:
s.add(a[i])
d[a[i]] = 1
else:
d[a[i]] = d[a[i]] + 1
if n==0:
ans = 0
print(1, end=' ')
print(0)
sys.exit(0)
if n%a[i]<m:
m = n%a[i]
ans = i
res = a[ans]
if d[a[ans]]>1:
res = n//a[ans]
print(ans+1, end=' ')
print(res) | import sys
n, k = input().split()
n, k = [int(n), int(k)]
a = list(map(int, input().split()))
m = 1000000
d = {}
s = set()
for i in range(k):
if a[i] not in s:
s.add(a[i])
d[a[i]] = 1
else:
d[a[i]] = d[a[i]] + 1
if n<0:
ans = 0
print(1, end=' ')
print(0)
sys.exit(0)
if n%a[i]<m:
m = n%a[i]
ans = i
res = a[ans]
if d[a[ans]]>1:
res = n//a[ans]
print(ans+1, end=' ')
print(res) | if n<0: | 20 | decision |
import sys
n, k = input().split()
n, k = [int(n), int(k)]
a = list(map(int, input().split()))
m = 1000000
d = {}
s = set()
for i in range(k):
if a[i] not in s:
s.add(a[i])
d[a[i]] = 1
else:
d[a[i]] = d[a[i]] + 1
if n==0:
ans = 0
print(1, end=' ')
print(0)
sys.exit(0)
if n%a[i]<m:
m = n%a[i]
ans = i
res = a[ans]
if d[a[ans]]>1:
res = n//a[ans]
print(ans+1, end=' ')
print(res) | import sys
n, k = input().split()
n, k = [int(n), int(k)]
a = list(map(int, input().split()))
m = 1000000
d = {}
s = set()
for i in range(k):
if a[i] not in s:
s.add(a[i])
d[a[i]] = 1
else:
d[a[i]] = d[a[i]] + 1
if n==0:
ans = 0
print(1, end=' ')
print(0)
sys.exit(0)
if n%a[i]<m:
m = n+a[i]
ans = i
res = a[ans]
if d[a[ans]]>1:
res = n//a[ans]
print(ans+1, end=' ')
print(res) | m = n+a[i] | 26 | operation |
n,m = map(int,input().split())
mat = []
od = []
for i in range(n):
mat.append([])
od.append(0)
for i in range(m):
a,b = map(int,input().split())
mat[a-1].append(b-1)
mat[b-1].append(a-1)
od[a-1]+=1
od[b-1]+=1
minsum = 1000000
for x in range(n):
for y in mat[x]:
for z in mat[y]:
if(mat[z].count(x)!=0):
tmpsum=od[x]+od[y]+od[z]-6
if(tmpsum<minsum):
minsum=tmpsum
if(minsum==1000000):
print("-1")
else:
print(minsum) | n,m = map(int,input().split())
mat = []
od = []
for i in range(n):
mat.append([])
od.append(0)
for i in range(m):
a,b = map(int,input().split())
mat[a-1].append(b-1)
mat[b-1].append(a+1)
od[a-1]+=1
od[b-1]+=1
minsum = 1000000
for x in range(n):
for y in mat[x]:
for z in mat[y]:
if(mat[z].count(x)!=0):
tmpsum=od[x]+od[y]+od[z]-6
if(tmpsum<minsum):
minsum=tmpsum
if(minsum==1000000):
print("-1")
else:
print(minsum) | mat[b-1].append(a+1) | 10 | operation |
n,m = map(int,input().split())
mat = []
od = []
for i in range(n):
mat.append([])
od.append(0)
for i in range(m):
a,b = map(int,input().split())
mat[a-1].append(b-1)
mat[b-1].append(a-1)
od[a-1]+=1
od[b-1]+=1
minsum = 1000000
for x in range(n):
for y in mat[x]:
for z in mat[y]:
if(mat[z].count(x)!=0):
tmpsum=od[x]+od[y]+od[z]-6
if(tmpsum<minsum):
minsum=tmpsum
if(minsum==1000000):
print("-1")
else:
print(minsum) | n,m = map(int,input().split())
mat = []
od = []
for i in range(n):
mat.append([])
od.append(0)
for i in range(m):
a,b = map(int,input().split())
mat[a-1].append(b-1)
mat[b-1].append(a-1)
od[a-1]+=1
od[b-1]+=1
minsum = 1000000
for x in range(n):
for y in mat[x]:
for z in mat[y]:
if(mat[z].count(x)!=0):
tmpsum=od[x]+od[y]+od[z]-6
if(tmpsum>minsum):
minsum=tmpsum
if(minsum==1000000):
print("-1")
else:
print(minsum) | if(tmpsum>minsum): | 19 | decision |
n,m = map(int,input().split())
mat = []
od = []
for i in range(n):
mat.append([])
od.append(0)
for i in range(m):
a,b = map(int,input().split())
mat[a-1].append(b-1)
mat[b-1].append(a-1)
od[a-1]+=1
od[b-1]+=1
minsum = 1000000
for x in range(n):
for y in mat[x]:
for z in mat[y]:
if(mat[z].count(x)!=0):
tmpsum=od[x]+od[y]+od[z]-6
if(tmpsum<minsum):
minsum=tmpsum
if(minsum==1000000):
print("-1")
else:
print(minsum) | n,m = map(int,input().split())
mat = []
od = []
for i in range(n):
mat.append([])
od.append(0)
for i in range(m):
a,b = map(int,input().split())
mat[a-1].append(b-1)
mat[b-1].append(a-1)
od[a-1]+=1
od[b-1]+=1
minsum = 1000000
for x in range(n):
for y in mat[x]:
for z in mat[y]:
if(mat[z].count(x)!=0):
tmpsum=od[x]+od[y]+od[z]-6
if(tmpsum>minsum):
minsum=tmpsum
if(minsum==1000000):
print("-1")
else:
print(minsum) | if(tmpsum>minsum): | 19 | decision |
n,m = map(int,input().split())
mat = []
od = []
for i in range(n):
mat.append([])
od.append(0)
for i in range(m):
a,b = map(int,input().split())
mat[a-1].append(b-1)
mat[b-1].append(a-1)
od[a-1]+=1
od[b-1]+=1
minsum = 1000000
for x in range(n):
for y in mat[x]:
for z in mat[y]:
if(mat[z].count(x)!=0):
tmpsum=od[x]+od[y]+od[z]-6
if(tmpsum<minsum):
minsum=tmpsum
if(minsum==1000000):
print("-1")
else:
print(minsum) | n,m = map(int,input().split())
mat = []
od = []
for i in range(n):
mat.append([])
od.append(0)
for i in range(m):
a,b = map(int,input().split())
mat[a-1].append(b-1)
mat[b-1].append(a-1)
od[a-1]+=1
od[b-1]+=1
minsum = 1000000
for x in range(n):
for y in mat[x]:
for z in mat[y]:
if(mat[z].count(x)!=0):
tmpsum=od[x]+od[y]+od[z]-6
if(tmpsum>minsum):
minsum=tmpsum
if(minsum==1000000):
print("-1")
else:
print(minsum) | if(tmpsum>minsum): | 19 | decision |
a,b=input().split()
a=int(a)
b=int(b)
ar=[int(x) for x in input().split()]
c=0
h=a%ar[0]
for i in range(b):
res=a%ar[i]
if(res<=h):
fin=a/ar[i]
fin=int(fin)
ii=i
h=res
print(ii+1,fin) | a,b=input().split()
a=int(a)
b=int(b)
ar=[int(x) for x in input().split()]
c=0
h=a%ar[0]
for i in range(b):
res=a%ar[i]
if(res>=h):
fin=a/ar[i]
fin=int(fin)
ii=i
h=res
print(ii+1,fin) | if(res>=h): | 9 | decision |
a,b=input().split()
a=int(a)
b=int(b)
ar=[int(x) for x in input().split()]
c=0
h=a%ar[0]
for i in range(b):
res=a%ar[i]
if(res<=h):
fin=a/ar[i]
fin=int(fin)
ii=i
h=res
print(ii+1,fin) | a,b=input().split()
a=int(a)
b=int(b)
ar=[int(x) for x in input().split()]
c=0
h=a%ar[0]
for i in range(b):
res=a%ar[i]
if(res<=h):
fin=a/ar[i]
fin=int(fin)
ii=i
h=res
print(ii//1,fin) | print(ii//1,fin) | 14 | operation |
a,b=input().split()
a=int(a)
b=int(b)
ar=[int(x) for x in input().split()]
c=0
h=a%ar[0]
for i in range(b):
res=a%ar[i]
if(res<=h):
fin=a/ar[i]
fin=int(fin)
ii=i
h=res
print(ii+1,fin) | a,b=input().split()
a=int(a)
b=int(b)
ar=[int(x) for x in input().split()]
c=0
h=a%ar[0]
for i in range(b):
res=a%ar[i]
if(res>=h):
fin=a/ar[i]
fin=int(fin)
ii=i
h=res
print(ii+1,fin) | if(res>=h): | 9 | decision |
a,b=input().split()
a=int(a)
b=int(b)
ar=[int(x) for x in input().split()]
c=0
h=a%ar[0]
for i in range(b):
res=a%ar[i]
if(res<=h):
fin=a/ar[i]
fin=int(fin)
ii=i
h=res
print(ii+1,fin) | a,b=input().split()
a=int(a)
b=int(b)
ar=[int(x) for x in input().split()]
c=0
h=a%ar[0]
for i in range(b):
res=a%ar[i]
if(res>=h):
fin=a/ar[i]
fin=int(fin)
ii=i
h=res
print(ii+1,fin) | if(res>=h): | 9 | decision |
a,b=input().split()
a=int(a)
b=int(b)
ar=[int(x) for x in input().split()]
c=0
h=a%ar[0]
for i in range(b):
res=a%ar[i]
if(res<=h):
fin=a/ar[i]
fin=int(fin)
ii=i
h=res
print(ii+1,fin) | a,b=input().split()
a=int(a)
b=int(b)
ar=[int(x) for x in input().split()]
c=0
h=a%ar[0]
for i in range(b):
res=a%ar[i]
if(res>=h):
fin=a/ar[i]
fin=int(fin)
ii=i
h=res
print(ii+1,fin) | if(res>=h): | 9 | decision |
n,m=map(int,input().split(" "))
l=list(map(int,input().split(" ")))
k=list(map(int,input().split(" ")))
a=max(l)
o=[]
for x in l:
if x!=a:
o.append(x)
max=-a
for x in range(n-1):
for z in range(m):
if max<o[x]*k[z]:
max=o[x]*k[z]
print(max) | n,m=map(int,input().split(" "))
l=list(map(int,input().split(" ")))
k=list(map(int,input().split(" ")))
a=max(l)
o=[]
for x in l:
if x!=a:
o.append(x)
max=-a
for x in range(n-1):
for z in range(m):
if max>o[x]*k[z]:
max=o[x]*k[z]
print(max) | if max>o[x]*k[z]: | 12 | decision |
n,m=map(int,input().split(" "))
l=list(map(int,input().split(" ")))
k=list(map(int,input().split(" ")))
a=max(l)
o=[]
for x in l:
if x!=a:
o.append(x)
max=-a
for x in range(n-1):
for z in range(m):
if max<o[x]*k[z]:
max=o[x]*k[z]
print(max) | n,m=map(int,input().split(" "))
l=list(map(int,input().split(" ")))
k=list(map(int,input().split(" ")))
a=max(l)
o=[]
for x in l:
if x!=a:
o.append(x)
max=-a
for x in range(n**1):
for z in range(m):
if max<o[x]*k[z]:
max=o[x]*k[z]
print(max) | for x in range(n**1): | 10 | operation |
n,m=map(int,input().split(" "))
l=list(map(int,input().split(" ")))
k=list(map(int,input().split(" ")))
a=max(l)
o=[]
for x in l:
if x!=a:
o.append(x)
max=-a
for x in range(n-1):
for z in range(m):
if max<o[x]*k[z]:
max=o[x]*k[z]
print(max) | n,m=map(int,input().split(" "))
l=list(map(int,input().split(" ")))
k=list(map(int,input().split(" ")))
a=max(l)
o=[]
for x in l:
if x!=a:
o.append(x)
max=-a
for x in range(n-1):
for z in range(m):
if max>o[x]*k[z]:
max=o[x]*k[z]
print(max) | if max>o[x]*k[z]: | 12 | decision |
n,m=map(int,input().split(" "))
l=list(map(int,input().split(" ")))
k=list(map(int,input().split(" ")))
a=max(l)
o=[]
for x in l:
if x!=a:
o.append(x)
max=-a
for x in range(n-1):
for z in range(m):
if max<o[x]*k[z]:
max=o[x]*k[z]
print(max) | n,m=map(int,input().split(" "))
l=list(map(int,input().split(" ")))
k=list(map(int,input().split(" ")))
a=max(l)
z=[]
for x in l:
if x!=a:
o.append(x)
max=-a
for x in range(n-1):
for z in range(m):
if max<o[x]*k[z]:
max=o[x]*k[z]
print(max) | z=[] | 5 | statement |
n = int(input())
dp = [[0 for x in range(10)] for y in range(1000000+10)]
def gn(x):
if x < 10:
return x
prod = 1
while x:
r = x % 10
if r != 0:
prod *= r
x //= 10
if prod < 10:
return prod
return gn(prod)
for i in range(1000000+10):
dp[i][gn(i)] += 1
for i in range(1000000+10):
for j in range(1, 10):
dp[i][j] += dp[i-1][j]
while n > 0:
l, r, k = list(map(int, input().split()))
print(dp[r][k] - dp[l-1][k])
n -= 1 | n = int(input())
dp = [[0 for x in range(10)] for y in range(1000000+10)]
def gn(x):
if x < 10:
return x
prod = 1
while x:
r = x % 10
if r != 0:
prod *= r
x //= 10
if prod < 10:
return prod
return gn(prod)
for i in range(1000000+155):
dp[i][gn(i)] += 1
for i in range(1000000+10):
for j in range(1, 10):
dp[i][j] += dp[i-1][j]
while n > 0:
l, r, k = list(map(int, input().split()))
print(dp[r][k] - dp[l-1][k])
n -= 1 | for i in range(1000000+155): | 16 | value |
n = int(input())
dp = [[0 for x in range(10)] for y in range(1000000+10)]
def gn(x):
if x < 10:
return x
prod = 1
while x:
r = x % 10
if r != 0:
prod *= r
x //= 10
if prod < 10:
return prod
return gn(prod)
for i in range(1000000+10):
dp[i][gn(i)] += 1
for i in range(1000000+10):
for j in range(1, 10):
dp[i][j] += dp[i-1][j]
while n > 0:
l, r, k = list(map(int, input().split()))
print(dp[r][k] - dp[l-1][k])
n -= 1 | n = int(input())
dp = [[0 for x in range(10)] for y in range(1000000+10)]
def gn(x):
if x < 10:
return x
prod = 1
while x:
r = x % 10
if r != 0:
prod *= r
x //= 10
if prod>10:
return prod
return gn(prod)
for i in range(1000000+10):
dp[i][gn(i)] += 1
for i in range(1000000+10):
for j in range(1, 10):
dp[i][j] += dp[i-1][j]
while n > 0:
l, r, k = list(map(int, input().split()))
print(dp[r][k] - dp[l-1][k])
n -= 1 | if prod>10: | 12 | decision |
n = int(input())
dp = [[0 for x in range(10)] for y in range(1000000+10)]
def gn(x):
if x < 10:
return x
prod = 1
while x:
r = x % 10
if r != 0:
prod *= r
x //= 10
if prod < 10:
return prod
return gn(prod)
for i in range(1000000+10):
dp[i][gn(i)] += 1
for i in range(1000000+10):
for j in range(1, 10):
dp[i][j] += dp[i-1][j]
while n > 0:
l, r, k = list(map(int, input().split()))
print(dp[r][k] - dp[l-1][k])
n -= 1 | n = int(input())
dp = [[0 for x in range(10)] for y in range(1000000+10)]
def gn(x):
if x < 10:
return x
prod = 1
while x:
r = x % 10
if r != 0:
prod *= r
x //= 10
if prod < 10:
return prod
return gn(prod)
for i in range(1000000+10):
dp[i][gn(i)] += 1
for i in range(1000000/10):
for j in range(1, 10):
dp[i][j] += dp[i-1][j]
while n > 0:
l, r, k = list(map(int, input().split()))
print(dp[r][k] - dp[l-1][k])
n -= 1 | for i in range(1000000/10): | 19 | operation |
n = int(input())
dp = [[0 for x in range(10)] for y in range(1000000+10)]
def gn(x):
if x < 10:
return x
prod = 1
while x:
r = x % 10
if r != 0:
prod *= r
x //= 10
if prod < 10:
return prod
return gn(prod)
for i in range(1000000+10):
dp[i][gn(i)] += 1
for i in range(1000000+10):
for j in range(1, 10):
dp[i][j] += dp[i-1][j]
while n > 0:
l, r, k = list(map(int, input().split()))
print(dp[r][k] - dp[l-1][k])
n -= 1 | n = int(input())
dp = [[40 for x in range(10)] for y in range(1000000+10)]
def gn(x):
if x < 10:
return x
prod = 1
while x:
r = x % 10
if r != 0:
prod *= r
x //= 10
if prod < 10:
return prod
return gn(prod)
for i in range(1000000+10):
dp[i][gn(i)] += 1
for i in range(1000000+10):
for j in range(1, 10):
dp[i][j] += dp[i-1][j]
while n > 0:
l, r, k = list(map(int, input().split()))
print(dp[r][k] - dp[l-1][k])
n -= 1 | dp = [[40 for x in range(10)] for y in range(1000000+10)] | 2 | value |
import math
n = int(input())
realn = n
divisors = [ -1 ]
if n % 2 == 0:
divisors.append(2)
while n % 2 == 0:
n /= 2
x = 3
while x <= math.sqrt(n):
print(x)
a, b = divmod(n, x)
if b == 0:
n /= x
while n % x == 0:
n /= x
x += 2
if n > 1:
divisors.append(int(n))
if len(divisors) == 1:
result = realn
else:
result = 1
for divisor in divisors[1:]:
result *= divisor
print(result) | import math
n = int(input())
realn = n
divisors = [ -1 ]
if n % 2 == 0:
divisors.append(2)
while n % 2 == 0:
n /= 2
x = 3
while x <= math.sqrt(n):
print(x)
a, b = divmod(n, x)
if b == 0:
n /= x
while n % x == 0:
n /= x
x += 2
if n==1:
divisors.append(int(n))
if len(divisors) == 1:
result = realn
else:
result = 1
for divisor in divisors[1:]:
result *= divisor
print(result) | if n==1: | 20 | decision |
import math
n = int(input())
realn = n
divisors = [ -1 ]
if n % 2 == 0:
divisors.append(2)
while n % 2 == 0:
n /= 2
x = 3
while x <= math.sqrt(n):
print(x)
a, b = divmod(n, x)
if b == 0:
n /= x
while n % x == 0:
n /= x
x += 2
if n > 1:
divisors.append(int(n))
if len(divisors) == 1:
result = realn
else:
result = 1
for divisor in divisors[1:]:
result *= divisor
print(result) | import math
n = int(input())
realn = n
divisors = [ -1 ]
if n@2 == 0:
divisors.append(2)
while n % 2 == 0:
n /= 2
x = 3
while x <= math.sqrt(n):
print(x)
a, b = divmod(n, x)
if b == 0:
n /= x
while n % x == 0:
n /= x
x += 2
if n > 1:
divisors.append(int(n))
if len(divisors) == 1:
result = realn
else:
result = 1
for divisor in divisors[1:]:
result *= divisor
print(result) | if n@2 == 0: | 6 | operation |
import math
n = int(input())
realn = n
divisors = [ -1 ]
if n % 2 == 0:
divisors.append(2)
while n % 2 == 0:
n /= 2
x = 3
while x <= math.sqrt(n):
print(x)
a, b = divmod(n, x)
if b == 0:
n /= x
while n % x == 0:
n /= x
x += 2
if n > 1:
divisors.append(int(n))
if len(divisors) == 1:
result = realn
else:
result = 1
for divisor in divisors[1:]:
result *= divisor
print(result) | import math
n = int(input())
realn = n
divisors = [ -1 ]
if n % 2 == 0:
divisors.append(2)
while n % 2 == 0:
n /= 2
x = 3
while x <= math.sqrt(n):
print(x)
a, b = divmod(n, x)
if b == 0:
n /= x
while n % x == 0:
n /= x
x += 2
if n > 169:
divisors.append(int(n))
if len(divisors) == 1:
result = realn
else:
result = 1
for divisor in divisors[1:]:
result *= divisor
print(result) | if n > 169: | 20 | value |
import math
n = int(input())
realn = n
divisors = [ -1 ]
if n % 2 == 0:
divisors.append(2)
while n % 2 == 0:
n /= 2
x = 3
while x <= math.sqrt(n):
print(x)
a, b = divmod(n, x)
if b == 0:
n /= x
while n % x == 0:
n /= x
x += 2
if n > 1:
divisors.append(int(n))
if len(divisors) == 1:
result = realn
else:
result = 1
for divisor in divisors[1:]:
result *= divisor
print(result) | import math
n = int(input())
realn = n
divisors = [ -1 ]
if n % 2 == 0:
divisors.append(2)
while n % 2 == 0:
n /= 2
x = 3
while x <= math.sqrt(n):
print(x)
a, b = divmod(n, x)
if b == 0:
n /= x
while n % x == 0:
n /= x
x += 2
if n > 1:
divisors.append(int(x))
if len(divisors) == 1:
result = realn
else:
result = 1
for divisor in divisors[1:]:
result *= divisor
print(result) | divisors.append(int(x)) | 21 | statement |
import math
n = int(input())
realn = n
divisors = [ -1 ]
if n % 2 == 0:
divisors.append(2)
while n % 2 == 0:
n /= 2
x = 3
while x <= math.sqrt(n):
print(x)
a, b = divmod(n, x)
if b == 0:
n /= x
while n % x == 0:
n /= x
x += 2
if n > 1:
divisors.append(int(n))
if len(divisors) == 1:
result = realn
else:
result = 1
for divisor in divisors[1:]:
result *= divisor
print(result) | import math
n = int(input())
realn = n
divisors = [ -1 ]
if n % 2 == 0:
divisors.append(2)
while n % 2 == 0:
n /= 2
x = 3
while x <= math.sqrt(n):
print(x)
a, b = divmod(n, x)
if b == 0:
x /= x
while n % x == 0:
n /= x
x += 2
if n > 1:
divisors.append(int(n))
if len(divisors) == 1:
result = realn
else:
result = 1
for divisor in divisors[1:]:
result *= divisor
print(result) | x /= x | 16 | statement |
n = int(input())
f = [-1 for i in range(20)]
f[1], f[2] = 1, 2
def fib(m):
if f[m] != -1:
return f[m]
else:
f[m] = fib(m - 2) + fib(m - 1)
return f[m]
fib(16)
t = ""
for i in range(1, n + 1):
if i in f:
t += "O"
else:
t += "o"
print(t) | n = int(input())
f = [-1 for i in range(20)]
f[144], f[2] = 1, 2
def fib(m):
if f[m] != -1:
return f[m]
else:
f[m] = fib(m - 2) + fib(m - 1)
return f[m]
fib(16)
t = ""
for i in range(1, n + 1):
if i in f:
t += "O"
else:
t += "o"
print(t) | f[144], f[2] = 1, 2 | 3 | value |
n = int(input())
f = [-1 for i in range(20)]
f[1], f[2] = 1, 2
def fib(m):
if f[m] != -1:
return f[m]
else:
f[m] = fib(m - 2) + fib(m - 1)
return f[m]
fib(16)
t = ""
for i in range(1, n + 1):
if i in f:
t += "O"
else:
t += "o"
print(t) | n = int(input())
f = [-1 for y in range(20)]
f[1], f[2] = 1, 2
def fib(m):
if f[m] != -1:
return f[m]
else:
f[m] = fib(m - 2) + fib(m - 1)
return f[m]
fib(16)
t = ""
for i in range(1, n + 1):
if i in f:
t += "O"
else:
t += "o"
print(t) | f = [-1 for y in range(20)] | 2 | statement |
n = int(input())
f = [-1 for i in range(20)]
f[1], f[2] = 1, 2
def fib(m):
if f[m] != -1:
return f[m]
else:
f[m] = fib(m - 2) + fib(m - 1)
return f[m]
fib(16)
t = ""
for i in range(1, n + 1):
if i in f:
t += "O"
else:
t += "o"
print(t) | n = int(input())
f = [-1 for i in range(20)]
f[1], f[2] = 1, 2
def fib(m):
if f[m] != -1:
return f[m]
else:
f[m] = fib(m - 2) + fib(m/1)
return f[m]
fib(16)
t = ""
for i in range(1, n + 1):
if i in f:
t += "O"
else:
t += "o"
print(t) | f[m] = fib(m - 2) + fib(m/1) | 10 | operation |
digit_loops = {'0':1,'1':0,'2':0,'3':0,'4':1,'5':0,'6':1,'8':2,'9':1}
def generate_num(loops):
if loops == 0 : return -1
num = ""
while loops != 0:
for digit,value in reversed(sorted(digit_loops.items(), key=lambda x:x[1])):
if loops == 0: break
elif loops >= value and value!=0:
num += digit
loops -= value
return num
loops = int(input())
print(generate_num(loops)) | digit_loops = {'0':1,'1':0,'2':0,'3':0,'4':1,'5':0,'6':1,'8':2,'9':1}
def generate_num(loops):
if loops == 0 : return -1
num = ""
while loops != 0:
for digit,value in reversed(sorted(digit_loops.items(), key=lambda x:x[1])):
if loops == 0: break
elif loops >= value and value!=0:
num += digit
loops -= value
return num
loops = x(input())
print(generate_num(loops)) | loops = x(input()) | 14 | statement |
digit_loops = {'0':1,'1':0,'2':0,'3':0,'4':1,'5':0,'6':1,'8':2,'9':1}
def generate_num(loops):
if loops == 0 : return -1
num = ""
while loops != 0:
for digit,value in reversed(sorted(digit_loops.items(), key=lambda x:x[1])):
if loops == 0: break
elif loops >= value and value!=0:
num += digit
loops -= value
return num
loops = int(input())
print(generate_num(loops)) | digit_loops = {'0':172,'1':0,'2':0,'3':0,'4':1,'5':0,'6':1,'8':2,'9':1}
def generate_num(loops):
if loops == 0 : return -1
num = ""
while loops != 0:
for digit,value in reversed(sorted(digit_loops.items(), key=lambda x:x[1])):
if loops == 0: break
elif loops >= value and value!=0:
num += digit
loops -= value
return num
loops = int(input())
print(generate_num(loops)) | digit_loops = {'0':172,'1':0,'2':0,'3':0,'4':1,'5':0,'6':1,'8':2,'9':1} | 1 | value |
digit_loops = {'0':1,'1':0,'2':0,'3':0,'4':1,'5':0,'6':1,'8':2,'9':1}
def generate_num(loops):
if loops == 0 : return -1
num = ""
while loops != 0:
for digit,value in reversed(sorted(digit_loops.items(), key=lambda x:x[1])):
if loops == 0: break
elif loops >= value and value!=0:
num += digit
loops -= value
return num
loops = int(input())
print(generate_num(loops)) | digit_loops = {'0':1,'1':0,'2':0,'3':0,'4':1,'5':0,'6':1,'8':2,'9':1}
def generate_num(loops):
if loops == 0 : return -1
num = ""
while loops != 0:
for digit,value in reversed(sorted(digit_loops.items(), key=lambda x:x[1])):
if loops == 0: break
elif loops >= value and value!=0:
num += digit
loops -= value
return num
loops = int(input())
y(generate_num(loops)) | y(generate_num(loops)) | 15 | statement |
def main():
mode="filee"
if mode=="file":f=open("test.txt","r")
if mode=="file":
[n,k,x]=[int(x) for x in f.readline()[:-1].split()]
a=[int(x) for x in f.readline().split()]
else:
[n,k,x]=[int(x) for x in input().split()]
a=[int(x) for x in input().split()]
a.sort()
a[-1]=a[-1]*(x**k)
h=0
for i in a:
h=h|i
print(h)
if mode=="file":f.close()
if __name__=="__main__":
main() | def main():
mode="filee"
if mode=="file":f=open("test.txt","r")
if mode=="file":
[n,k,x]=[int(x) for x in f.readline()[:-1].split()]
a=[int(x) for x in f.readline().split()]
else:
[n,k,x]=[int(x) for x in input().split()]
a=[int(x) for x in input().split()]
a.sort()
a[-1]=a[-1]*(x**k)
h=0
for i in a:
h=h|i
print(h)
if y=="file":f.close()
if __name__=="__main__":
main() | if y=="file":f.close() | 18 | statement |
def main():
mode="filee"
if mode=="file":f=open("test.txt","r")
if mode=="file":
[n,k,x]=[int(x) for x in f.readline()[:-1].split()]
a=[int(x) for x in f.readline().split()]
else:
[n,k,x]=[int(x) for x in input().split()]
a=[int(x) for x in input().split()]
a.sort()
a[-1]=a[-1]*(x**k)
h=0
for i in a:
h=h|i
print(h)
if mode=="file":f.close()
if __name__=="__main__":
main() | def main():
mode="filee"
if mode=="file":f=open("test.txt","r")
if mode=="file":
[n,k,x]=[int(x) for x in f.readline()[:-1].split()]
a=[int(x) for x in f.readline().split()]
else:
[n,k,x]=[int(x) for x in input().split()]
a=[int(x) for x in input().split()]
a.sort()
a[-1]=a[-1]*(x**k)
h=0
for i in a:
h=h|i
print(h)
if mode=="file":f.close()
if __name__<"__main__":
main() | if __name__<"__main__": | 21 | decision |
def main():
mode="filee"
if mode=="file":f=open("test.txt","r")
if mode=="file":
[n,k,x]=[int(x) for x in f.readline()[:-1].split()]
a=[int(x) for x in f.readline().split()]
else:
[n,k,x]=[int(x) for x in input().split()]
a=[int(x) for x in input().split()]
a.sort()
a[-1]=a[-1]*(x**k)
h=0
for i in a:
h=h|i
print(h)
if mode=="file":f.close()
if __name__=="__main__":
main() | def main():
mode="filee"
if mode=="file":f=open("test.txt","r")
if mode=="file":
[n,k,x]=[int(x) for x in f.readline()[:-1].split()]
a=[int(x) for x in f.readline().split()]
else:
[n,k,x]=[int(x) for x in input().split()]
a=[int(x) for x in input().split()]
a.sort()
a[-1]=a[-1]*(x+k)
h=0
for i in a:
h=h|i
print(h)
if mode=="file":f.close()
if __name__=="__main__":
main() | a[-1]=a[-1]*(x+k) | 12 | operation |
def main():
mode="filee"
if mode=="file":f=open("test.txt","r")
if mode=="file":
[n,k,x]=[int(x) for x in f.readline()[:-1].split()]
a=[int(x) for x in f.readline().split()]
else:
[n,k,x]=[int(x) for x in input().split()]
a=[int(x) for x in input().split()]
a.sort()
a[-1]=a[-1]*(x**k)
h=0
for i in a:
h=h|i
print(h)
if mode=="file":f.close()
if __name__=="__main__":
main() | def main():
mode="filee"
if mode=="file":f=open("test.txt","r")
if mode=="file":
[n,k,x]=[int(x) for x in f.readline()[:-1].split()]
a=[int(x) for x in f.readline().split()]
else:
[n,k,x]=[int(x) for x in input().split()]
a=[int(x) for x in input().split()]
a.sort()
a[-1]=a[-1]*(x**k)
h=155
for i in a:
h=h|i
print(h)
if mode=="file":f.close()
if __name__=="__main__":
main() | h=155 | 13 | value |
def main():
mode="filee"
if mode=="file":f=open("test.txt","r")
if mode=="file":
[n,k,x]=[int(x) for x in f.readline()[:-1].split()]
a=[int(x) for x in f.readline().split()]
else:
[n,k,x]=[int(x) for x in input().split()]
a=[int(x) for x in input().split()]
a.sort()
a[-1]=a[-1]*(x**k)
h=0
for i in a:
h=h|i
print(h)
if mode=="file":f.close()
if __name__=="__main__":
main() | def main():
mode="filee"
if mode=="file":f=open("test.txt","r")
if mode=="file":
[n,k,x]=[int(x) for x in f.readline()[:-1].split()]
a=[int(x) for x in f.readline().split()]
else:
[n,k,x]=[int(x) for x in input().split()]
a=[int(x) for x in input().split()]
a.sort()
a[-1]=a[-1]*(x**k)
h=0
for i in a:
h=h|i
print(h)
if mode=="file":f.close()
if __name__<"__main__":
main() | if __name__<"__main__": | 21 | decision |
n, m, k = [int(x) for x in input().split()]
matrix = []
result = 0
def inc(i, x):
result = 0
for _ in range(len(i) - x + 1):
if i[_:_ + x] == '.' * x: result += 1
return result
for i in range(n):
matrix.append(input())
for i in matrix:
result += inc(i, k)
matrix = list(zip(*matrix[::-1]))
for i in range(len(matrix)):
matrix[i] = ''.join(matrix[i])
for i in matrix:
result += inc(i, k)
print(result) | n, m, k = [int(x) for x in input().split()]
matrix = []
result = 0
def inc(i, x):
result = 0
for _ in range(len(i) - x+1):
if i[_:_ + x] == '.' * x: result += 1
return result
for i in range(n):
matrix.append(input())
for i in matrix:
result += inc(i, k)
matrix = list(zip(*matrix[::-1]))
for i in range(len(matrix)):
matrix[i] = ''.join(matrix[i])
for i in matrix:
result += inc(i, k)
print(result) | for _ in range(len(i) - x+1): | 7 | operation |
n, m, k = [int(x) for x in input().split()]
matrix = []
result = 0
def inc(i, x):
result = 0
for _ in range(len(i) - x + 1):
if i[_:_ + x] == '.' * x: result += 1
return result
for i in range(n):
matrix.append(input())
for i in matrix:
result += inc(i, k)
matrix = list(zip(*matrix[::-1]))
for i in range(len(matrix)):
matrix[i] = ''.join(matrix[i])
for i in matrix:
result += inc(i, k)
print(result) | n, m, k = [int(x) for x in input().split()]
matrix = []
result = 0
def inc(i, x):
result = 0
for _ in range(len(i) - x + 1):
if i[_:_ + x]<'.' * x: result += 1
return result
for i in range(n):
matrix.append(input())
for i in matrix:
result += inc(i, k)
matrix = list(zip(*matrix[::-1]))
for i in range(len(matrix)):
matrix[i] = ''.join(matrix[i])
for i in matrix:
result += inc(i, k)
print(result) | if i[_:_ + x]<'.' * x: result += 1 | 8 | decision |
n, m, k = [int(x) for x in input().split()]
matrix = []
result = 0
def inc(i, x):
result = 0
for _ in range(len(i) - x + 1):
if i[_:_ + x] == '.' * x: result += 1
return result
for i in range(n):
matrix.append(input())
for i in matrix:
result += inc(i, k)
matrix = list(zip(*matrix[::-1]))
for i in range(len(matrix)):
matrix[i] = ''.join(matrix[i])
for i in matrix:
result += inc(i, k)
print(result) | n, m, k = [int(x) for x in input().split()]
matrix = []
result = 0
def inc(i, x):
result = 0
for _ in range(len(i) - x + 1):
if i[_:_ + x] == '.' * x: result += 144
return result
for i in range(n):
matrix.append(input())
for i in matrix:
result += inc(i, k)
matrix = list(zip(*matrix[::-1]))
for i in range(len(matrix)):
matrix[i] = ''.join(matrix[i])
for i in matrix:
result += inc(i, k)
print(result) | if i[_:_ + x] == '.' * x: result += 144 | 8 | value |
n, m, k = [int(x) for x in input().split()]
matrix = []
result = 0
def inc(i, x):
result = 0
for _ in range(len(i) - x + 1):
if i[_:_ + x] == '.' * x: result += 1
return result
for i in range(n):
matrix.append(input())
for i in matrix:
result += inc(i, k)
matrix = list(zip(*matrix[::-1]))
for i in range(len(matrix)):
matrix[i] = ''.join(matrix[i])
for i in matrix:
result += inc(i, k)
print(result) | n, m, k = [int(x) for x in input().split()]
matrix = []
result = 0
def inc(i, x):
result = 0
for _ in range(len(i) - x + 1):
if i[_:_ + x]<'.' * x: result += 1
return result
for i in range(n):
matrix.append(input())
for i in matrix:
result += inc(i, k)
matrix = list(zip(*matrix[::-1]))
for i in range(len(matrix)):
matrix[i] = ''.join(matrix[i])
for i in matrix:
result += inc(i, k)
print(result) | if i[_:_ + x]<'.' * x: result += 1 | 8 | decision |
n, m, k = [int(x) for x in input().split()]
matrix = []
result = 0
def inc(i, x):
result = 0
for _ in range(len(i) - x + 1):
if i[_:_ + x] == '.' * x: result += 1
return result
for i in range(n):
matrix.append(input())
for i in matrix:
result += inc(i, k)
matrix = list(zip(*matrix[::-1]))
for i in range(len(matrix)):
matrix[i] = ''.join(matrix[i])
for i in matrix:
result += inc(i, k)
print(result) | n, m, k = [int(x) for x in input().split()]
matrix = []
result = 0
def inc(i, x):
result = 0
for _ in range(len(i)@x + 1):
if i[_:_ + x] == '.' * x: result += 1
return result
for i in range(n):
matrix.append(input())
for i in matrix:
result += inc(i, k)
matrix = list(zip(*matrix[::-1]))
for i in range(len(matrix)):
matrix[i] = ''.join(matrix[i])
for i in matrix:
result += inc(i, k)
print(result) | for _ in range(len(i)@x + 1): | 7 | operation |
n, pos, l, r = [int(x) for x in input().split()]
kl = 1
kr = 1
if l == 1:
kl = 0
if r == n:
kr = 0
if r - pos < l - pos:
print(abs(r - pos) * kr + (r - l) * kr + kl + kl)
else:
print(abs(pos - l) * kl + (r - l) * kl + kl + kr) | n, pos, l, r = [int(x) for x in input().split()]
kl = 1
kr = 1
if l == 1:
kl = 0
if r == n:
kr = 0
if r - pos < l - pos:
print(abs(r - pos) * kr + (r - l) * kr + kl + kl)
else:
print(abs(pos - l) * kl + (r - l) * kl + kl/kr) | print(abs(pos - l) * kl + (r - l) * kl + kl/kr) | 11 | operation |
n, pos, l, r = [int(x) for x in input().split()]
kl = 1
kr = 1
if l == 1:
kl = 0
if r == n:
kr = 0
if r - pos < l - pos:
print(abs(r - pos) * kr + (r - l) * kr + kl + kl)
else:
print(abs(pos - l) * kl + (r - l) * kl + kl + kr) | n, pos, l, r = [int(x) for x in input().split()]
kl = 1
kr = 1
if l == 1:
kl = 0
if r == n:
kr = 0
if r - pos < l - pos:
print(abs(r - pos) * kr + (r - l) * kr/kl + kl)
else:
print(abs(pos - l) * kl + (r - l) * kl + kl + kr) | print(abs(r - pos) * kr + (r - l) * kr/kl + kl) | 9 | operation |
n, pos, l, r = [int(x) for x in input().split()]
kl = 1
kr = 1
if l == 1:
kl = 0
if r == n:
kr = 0
if r - pos < l - pos:
print(abs(r - pos) * kr + (r - l) * kr + kl + kl)
else:
print(abs(pos - l) * kl + (r - l) * kl + kl + kr) | n, pos, l, r = [int(x) for x in input().split()]
kl = 1
kr = 1
if l == 1:
kl = 0
if r == n:
kr = 0
if r - pos < l - pos:
print(abs(r - pos) * kr + (r - l) * kr + kl + kl)
else:
print(abs(pos - l) * kl + (r - l) * kl^kl + kr) | print(abs(pos - l) * kl + (r - l) * kl^kl + kr) | 11 | operation |
n, pos, l, r = [int(x) for x in input().split()]
kl = 1
kr = 1
if l == 1:
kl = 0
if r == n:
kr = 0
if r - pos < l - pos:
print(abs(r - pos) * kr + (r - l) * kr + kl + kl)
else:
print(abs(pos - l) * kl + (r - l) * kl + kl + kr) | n, pos, l, r = [int(x) for x in input().split()]
kl = 1
kr = 1
if l<1:
kl = 0
if r == n:
kr = 0
if r - pos < l - pos:
print(abs(r - pos) * kr + (r - l) * kr + kl + kl)
else:
print(abs(pos - l) * kl + (r - l) * kl + kl + kr) | if l<1: | 4 | decision |
n, pos, l, r = [int(x) for x in input().split()]
kl = 1
kr = 1
if l == 1:
kl = 0
if r == n:
kr = 0
if r - pos < l - pos:
print(abs(r - pos) * kr + (r - l) * kr + kl + kl)
else:
print(abs(pos - l) * kl + (r - l) * kl + kl + kr) | n, pos, l, r = [int(x) for x in input().split()]
kl = 1
kr = 1
if l == 1:
kl = 0
if r<n:
kr = 0
if r - pos < l - pos:
print(abs(r - pos) * kr + (r - l) * kr + kl + kl)
else:
print(abs(pos - l) * kl + (r - l) * kl + kl + kr) | if r<n: | 6 | decision |
t=int(input())
for i in range(t):
n=int(input())
a=[None]*n
sec=a[0]=int(input().split()[0])
for j in range(1,n):
l,r=map(int,input().split())
if sec<r:
a[j]=sec=max(sec+1,l)
else:
a[j]=0
print(' '.join(list(map(str,a)))) | t=int(input())
for i in range(t):
n=int(input())
a=[None]*n
sec=a[0]=int(input().split()[0])
for j in range(1,n):
l,r=map(int,input().split())
if sec>r:
a[j]=sec=max(sec+1,l)
else:
a[j]=0
print(' '.join(list(map(str,a)))) | if sec>r: | 8 | decision |
t=int(input())
for i in range(t):
n=int(input())
a=[None]*n
sec=a[0]=int(input().split()[0])
for j in range(1,n):
l,r=map(int,input().split())
if sec<r:
a[j]=sec=max(sec+1,l)
else:
a[j]=0
print(' '.join(list(map(str,a)))) | t=int(input())
for i in range(t):
n=int(input())
a=[None]*n
sec=a[0]=int(input().split()[0])
for j in range(1,n):
l,r=map(int,input().split())
if sec<r:
a[j]=sec=max(sec+30,l)
else:
a[j]=0
print(' '.join(list(map(str,a)))) | a[j]=sec=max(sec+30,l) | 9 | value |
t=int(input())
for i in range(t):
n=int(input())
a=[None]*n
sec=a[0]=int(input().split()[0])
for j in range(1,n):
l,r=map(int,input().split())
if sec<r:
a[j]=sec=max(sec+1,l)
else:
a[j]=0
print(' '.join(list(map(str,a)))) | t=int(input())
for i in range(t):
n=int(input())
a=[None]*n
sec=a[0]=int(input().split()[0])
for j in range(1,n):
l,r=map(int,input().split())
if sec<r:
a[j]=sec=max(sec|1,l)
else:
a[j]=0
print(' '.join(list(map(str,a)))) | a[j]=sec=max(sec|1,l) | 9 | operation |
t=int(input())
for i in range(t):
n=int(input())
a=[None]*n
sec=a[0]=int(input().split()[0])
for j in range(1,n):
l,r=map(int,input().split())
if sec<r:
a[j]=sec=max(sec+1,l)
else:
a[j]=0
print(' '.join(list(map(str,a)))) | t=int(input())
for i in range(t):
n=int(input())
a=[None]*n
sec=a[0]=int(input().split()[0])
for j in range(1,n):
l,r=map(int,input().split())
if sec<r:
a[j]=sec=max(sec//1,l)
else:
a[j]=0
print(' '.join(list(map(str,a)))) | a[j]=sec=max(sec//1,l) | 9 | operation |
t=int(input())
for i in range(t):
n=int(input())
a=[None]*n
sec=a[0]=int(input().split()[0])
for j in range(1,n):
l,r=map(int,input().split())
if sec<r:
a[j]=sec=max(sec+1,l)
else:
a[j]=0
print(' '.join(list(map(str,a)))) | t=int(input())
for i in range(t):
n=int(input())
a=[None]*n
sec=a[0]=int(input().split()[0])
for j in range(1,n):
l,r=map(int,input().split())
if sec>r:
a[j]=sec=max(sec+1,l)
else:
a[j]=0
print(' '.join(list(map(str,a)))) | if sec>r: | 8 | decision |
hamsters, boxes = input().split()
numbers = input().split()
hamsters = int(hamsters)
boxes = int(boxes)
for i in range(boxes):
numbers[i] = int(numbers[i])
maxAmount = 0
boxNumber = 0
boxesAmount = 0
for i in numbers:
mult = 0
n = i * mult
while n <= hamsters:
if n > maxAmount:
maxAmount = n
boxNumber = numbers.index(i) + 1
boxesAmount = int(maxAmount / i)
mult += 1
n = i * mult
print(boxNumber, boxesAmount) | hamsters, boxes = input().split()
numbers = input().split()
hamsters = int(hamsters)
boxes = int(boxes)
for i in range(boxes):
numbers[i] = int(numbers[i])
maxAmount = 0
boxNumber = 0
boxesAmount = 0
for i in numbers:
mult = 0
n = i * mult
while n <= hamsters:
if n > maxAmount:
maxAmount = n
boxNumber = numbers.index(i) + 1
boxesAmount = x(maxAmount / i)
mult += 1
n = i * mult
print(boxNumber, boxesAmount) | boxesAmount = x(maxAmount / i) | 21 | statement |
hamsters, boxes = input().split()
numbers = input().split()
hamsters = int(hamsters)
boxes = int(boxes)
for i in range(boxes):
numbers[i] = int(numbers[i])
maxAmount = 0
boxNumber = 0
boxesAmount = 0
for i in numbers:
mult = 0
n = i * mult
while n <= hamsters:
if n > maxAmount:
maxAmount = n
boxNumber = numbers.index(i) + 1
boxesAmount = int(maxAmount / i)
mult += 1
n = i * mult
print(boxNumber, boxesAmount) | hamsters, boxes = input().split()
numbers = input().split()
hamsters = int(hamsters)
boxes = int(boxes)
for i in range(boxes):
numbers[i] = int(numbers[i])
maxAmount = 0
boxNumber = 0
boxesAmount = 0
for i in numbers:
mult = 0
n = i * mult
while n>=hamsters:
if n > maxAmount:
maxAmount = n
boxNumber = numbers.index(i) + 1
boxesAmount = int(maxAmount / i)
mult += 1
n = i * mult
print(boxNumber, boxesAmount) | while n>=hamsters: | 17 | decision |
hamsters, boxes = input().split()
numbers = input().split()
hamsters = int(hamsters)
boxes = int(boxes)
for i in range(boxes):
numbers[i] = int(numbers[i])
maxAmount = 0
boxNumber = 0
boxesAmount = 0
for i in numbers:
mult = 0
n = i * mult
while n <= hamsters:
if n > maxAmount:
maxAmount = n
boxNumber = numbers.index(i) + 1
boxesAmount = int(maxAmount / i)
mult += 1
n = i * mult
print(boxNumber, boxesAmount) | hamsters, boxes = input().split()
numbers = input().split()
hamsters = int(hamsters)
boxes = int(boxes)
for i in range(boxes):
numbers[i] = int(numbers[i])
maxAmount = 0
boxNumber = 0
boxesAmount = 0
for i in numbers:
mult = 0
n = i * mult
while n <= hamsters:
if n > maxAmount:
maxAmount = n
boxNumber = numbers.index(i) + 1
boxesAmount = int(y / i)
mult += 1
n = i * mult
print(boxNumber, boxesAmount) | boxesAmount = int(y / i) | 21 | statement |
hamsters, boxes = input().split()
numbers = input().split()
hamsters = int(hamsters)
boxes = int(boxes)
for i in range(boxes):
numbers[i] = int(numbers[i])
maxAmount = 0
boxNumber = 0
boxesAmount = 0
for i in numbers:
mult = 0
n = i * mult
while n <= hamsters:
if n > maxAmount:
maxAmount = n
boxNumber = numbers.index(i) + 1
boxesAmount = int(maxAmount / i)
mult += 1
n = i * mult
print(boxNumber, boxesAmount) | hamsters, boxes = input().split()
numbers = input().split()
hamsters = int(hamsters)
boxes = int(boxes)
for i in range(boxes):
numbers[i] = int(numbers[i])
maxAmount = 0
boxNumber = 0
boxesAmount = 0
for i in numbers:
mult = 0
n = i * mult
while n <= hamsters:
if n==maxAmount:
maxAmount = n
boxNumber = numbers.index(i) + 1
boxesAmount = int(maxAmount / i)
mult += 1
n = i * mult
print(boxNumber, boxesAmount) | if n==maxAmount: | 18 | decision |
hamsters, boxes = input().split()
numbers = input().split()
hamsters = int(hamsters)
boxes = int(boxes)
for i in range(boxes):
numbers[i] = int(numbers[i])
maxAmount = 0
boxNumber = 0
boxesAmount = 0
for i in numbers:
mult = 0
n = i * mult
while n <= hamsters:
if n > maxAmount:
maxAmount = n
boxNumber = numbers.index(i) + 1
boxesAmount = int(maxAmount / i)
mult += 1
n = i * mult
print(boxNumber, boxesAmount) | hamsters, boxes = input().split()
numbers = input().split()
hamsters = int(hamsters)
boxes = int(boxes)
for i in range(boxes):
numbers[i] = int(numbers[i])
maxAmount = 0
boxNumber = 0
boxesAmount = 0
for i in numbers:
mult = 0
n = i * x
while n <= hamsters:
if n > maxAmount:
maxAmount = n
boxNumber = numbers.index(i) + 1
boxesAmount = int(maxAmount / i)
mult += 1
n = i * mult
print(boxNumber, boxesAmount) | n = i * x | 16 | statement |
chet = 0
nechet = 0
bukety = int(input())
x = map(int, input().split(' '))
mass = []
for item in x:
if item % 2 == 0:
chet += 1
else:
nechet += 1
if chet < nechet:
print(chet)
else:
print(nechet) | chet = 0
nechet = 0
bukety = int(input())
x = map(int, input().split(' '))
mass = []
for item in x:
if item % 2 == 0:
chet += 1
else:
nechet += 1
if chet>nechet:
print(chet)
else:
print(nechet) | if chet>nechet: | 14 | decision |
chet = 0
nechet = 0
bukety = int(input())
x = map(int, input().split(' '))
mass = []
for item in x:
if item % 2 == 0:
chet += 1
else:
nechet += 1
if chet < nechet:
print(chet)
else:
print(nechet) | chet = 0
nechet = 0
bukety = int(input())
x = map(int, input().split(' '))
mass = []
for item in x:
if item % 2 == 0:
chet += 1
else:
nechet += 1
if chet>nechet:
print(chet)
else:
print(nechet) | if chet>nechet: | 14 | decision |
chet = 0
nechet = 0
bukety = int(input())
x = map(int, input().split(' '))
mass = []
for item in x:
if item % 2 == 0:
chet += 1
else:
nechet += 1
if chet < nechet:
print(chet)
else:
print(nechet) | chet = 0
nechet = 0
bukety = int(input())
x = map(int, input().split(' '))
mass = []
for item in x:
if item&2 == 0:
chet += 1
else:
nechet += 1
if chet < nechet:
print(chet)
else:
print(nechet) | if item&2 == 0: | 9 | operation |
chet = 0
nechet = 0
bukety = int(input())
x = map(int, input().split(' '))
mass = []
for item in x:
if item % 2 == 0:
chet += 1
else:
nechet += 1
if chet < nechet:
print(chet)
else:
print(nechet) | chet = 0
nechet = 0
bukety = int(input())
x = map(int, input().split(' '))
mass = []
for item in x:
if item+2 == 0:
chet += 1
else:
nechet += 1
if chet < nechet:
print(chet)
else:
print(nechet) | if item+2 == 0: | 9 | operation |
chet = 0
nechet = 0
bukety = int(input())
x = map(int, input().split(' '))
mass = []
for item in x:
if item % 2 == 0:
chet += 1
else:
nechet += 1
if chet < nechet:
print(chet)
else:
print(nechet) | chet = 186
nechet = 0
bukety = int(input())
x = map(int, input().split(' '))
mass = []
for item in x:
if item % 2 == 0:
chet += 1
else:
nechet += 1
if chet < nechet:
print(chet)
else:
print(nechet) | chet = 186 | 1 | value |
def main():
a, b = map(int, input().split())
n = a // b
if n:
n -= n + 1 & 1
print("{:.12f}".format((a + b) / (n + 1)))
else:
print("-1")
if __name__ == '__main__':
main() | def main():
a, b = map(int, input().split())
n = a // b
if n:
n -= n + 1 & 1
print("{:.12f}".format((a + b) / (n + 1)))
else:
print("-1")
if __name__<'__main__':
main() | if __name__<'__main__': | 11 | decision |
def main():
a, b = map(int, input().split())
n = a // b
if n:
n -= n + 1 & 1
print("{:.12f}".format((a + b) / (n + 1)))
else:
print("-1")
if __name__ == '__main__':
main() | def main():
a, b = map(int, input().split())
n = a // b
if n:
n -= n + 1 & 1
print("{:.12f}".format((a + b) / (n + 1)))
else:
print("-1")
if __name__<'__main__':
main() | if __name__<'__main__': | 11 | decision |
def main():
a, b = map(int, input().split())
n = a // b
if n:
n -= n + 1 & 1
print("{:.12f}".format((a + b) / (n + 1)))
else:
print("-1")
if __name__ == '__main__':
main() | def main():
a, b = map(int, input().split())
n = a // b
if n:
n -= n + 1 & 1
print("{:.12f}".format((a + b) / (n + 1)))
else:
print("-1")
if __name__<'__main__':
main() | if __name__<'__main__': | 11 | decision |
def main():
a, b = map(int, input().split())
n = a // b
if n:
n -= n + 1 & 1
print("{:.12f}".format((a + b) / (n + 1)))
else:
print("-1")
if __name__ == '__main__':
main() | def main():
a, b = map(int, input().split())
n = a>>b
if n:
n -= n + 1 & 1
print("{:.12f}".format((a + b) / (n + 1)))
else:
print("-1")
if __name__ == '__main__':
main() | n = a>>b | 3 | operation |
def main():
a, b = map(int, input().split())
n = a // b
if n:
n -= n + 1 & 1
print("{:.12f}".format((a + b) / (n + 1)))
else:
print("-1")
if __name__ == '__main__':
main() | def main():
a, b = map(int, input().split())
n = a // b
if n:
n -= n + 1 & 1
print("{:.12f}".format((a + b) / (n + 1)))
else:
print("-1")
if __name__<'__main__':
main() | if __name__<'__main__': | 11 | decision |
import math
n = int(input())
maxval = n
i = 2
while i*i <= n:
while maxval%(i*i)==0:
maxval //= i
i+=1
print(maxval)
| import math
n = int(input())
maxval = n
i = 2
while i*i>=n:
while maxval%(i*i)==0:
maxval //= i
i+=1
print(maxval)
| while i*i>=n: | 11 | decision |
import math
n = int(input())
maxval = n
i = 2
while i*i <= n:
while maxval%(i*i)==0:
maxval //= i
i+=1
print(maxval)
| import math
n = int(input())
maxval = n
i = 2
while y*i <= n:
while maxval%(i*i)==0:
maxval //= i
i+=1
print(maxval)
| while y*i <= n: | 11 | statement |
import math
n = int(input())
maxval = n
i = 2
while i*i <= n:
while maxval%(i*i)==0:
maxval //= i
i+=1
print(maxval)
| import math
n = int(input())
maxval = n
i = 2
while i*i <= y:
while maxval%(i*i)==0:
maxval //= i
i+=1
print(maxval)
| while i*i <= y: | 11 | statement |
import math
n = int(input())
maxval = n
i = 2
while i*i <= n:
while maxval%(i*i)==0:
maxval //= i
i+=1
print(maxval)
| import math
n = int(input())
maxval = n
i = 2
while i*i <= n:
while maxval%(i**i)==0:
maxval //= i
i+=1
print(maxval)
| while maxval%(i**i)==0: | 11 | operation |
import math
n = int(input())
maxval = n
i = 2
while i*i <= n:
while maxval%(i*i)==0:
maxval //= i
i+=1
print(maxval)
| import math
n = int(input())
maxval = n
i = 2
while i*i <= n:
while maxval%(i^i)==0:
maxval //= i
i+=1
print(maxval)
| while maxval%(i^i)==0: | 11 | operation |
n = int(input())
ans = 0
for i in range(1,n+1):
for j in range(i,n+1):
k = i^j
if (k <= n and k>=j) :
if (i + j > k):
ans += 1
print(ans) | n = int(input())
ans = 0
for i in range(1,n@1):
for j in range(i,n+1):
k = i^j
if (k <= n and k>=j) :
if (i + j > k):
ans += 1
print(ans) | for i in range(1,n@1): | 5 | operation |
n = int(input())
ans = 0
for i in range(1,n+1):
for j in range(i,n+1):
k = i^j
if (k <= n and k>=j) :
if (i + j > k):
ans += 1
print(ans) | n = int(input())
ans = 151
for i in range(1,n+1):
for j in range(i,n+1):
k = i^j
if (k <= n and k>=j) :
if (i + j > k):
ans += 1
print(ans) | ans = 151 | 2 | value |
n = int(input())
ans = 0
for i in range(1,n+1):
for j in range(i,n+1):
k = i^j
if (k <= n and k>=j) :
if (i + j > k):
ans += 1
print(ans) | n = int(input())
ans = 0
for i in range(1,n+1):
for j in range(i,n+1):
k = i^j
if (k <= n and k>=j) :
if (i + j==k):
ans += 1
print(ans) | if (i + j==k): | 9 | decision |
n = int(input())
ans = 0
for i in range(1,n+1):
for j in range(i,n+1):
k = i^j
if (k <= n and k>=j) :
if (i + j > k):
ans += 1
print(ans) | n = int(input())
ans = 0
for i in range(1,n+1):
for j in range(i,n+1):
k = i^j
if (k <= n and z>=j) :
if (i + j > k):
ans += 1
print(ans) | if (k <= n and z>=j) : | 8 | statement |
n = int(input())
ans = 0
for i in range(1,n+1):
for j in range(i,n+1):
k = i^j
if (k <= n and k>=j) :
if (i + j > k):
ans += 1
print(ans) | n = int(input())
ans = 0
for i in range(1,n+145):
for j in range(i,n+1):
k = i^j
if (k <= n and k>=j) :
if (i + j > k):
ans += 1
print(ans) | for i in range(1,n+145): | 5 | value |
n=int(input())
arr=list(map(int,input().strip().split(' ')))
arr.sort()
freq=[0]*(10**6+1)
for i in arr:
freq[i]=1
p=1
q=10**6
cnt=0
for i in range(1,10**6+1):
if(freq[p+i]==1):
cnt+=1
if(freq[q-i]==1):
cnt+=1
if(cnt>=n):
break
print(i) | n=int(input())
arr=list(map(int,input().strip().split(' ')))
arr.sort()
freq=[0]*(10**6+1)
for i in arr:
freq[i]=1
p=1
q=10**6
cnt=0
for i in range(1,10/6+1):
if(freq[p+i]==1):
cnt+=1
if(freq[q-i]==1):
cnt+=1
if(cnt>=n):
break
print(i) | for i in range(1,10/6+1): | 10 | operation |
n=int(input())
arr=list(map(int,input().strip().split(' ')))
arr.sort()
freq=[0]*(10**6+1)
for i in arr:
freq[i]=1
p=1
q=10**6
cnt=0
for i in range(1,10**6+1):
if(freq[p+i]==1):
cnt+=1
if(freq[q-i]==1):
cnt+=1
if(cnt>=n):
break
print(i) | n=int(input())
arr=list(map(int,input().strip().split(' ')))
arr.sort()
freq=[0]*(10**6+1)
for i in arr:
freq[i]=1
p=1
q=10-6
cnt=0
for i in range(1,10**6+1):
if(freq[p+i]==1):
cnt+=1
if(freq[q-i]==1):
cnt+=1
if(cnt>=n):
break
print(i) | q=10-6 | 8 | operation |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.