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 |
|---|---|---|---|---|
s=input()
N = len(s)
MAT = []
for i in range(N):
MAT.append([])
endzeros=[]
enduns=[]
insrt=0
possibl = True
for i in range(N):
if s[i]=='0':
if len(enduns)>0:
MAT[enduns[0]].append(i+1)
endzeros.append(enduns[0])
del enduns[0]
else:
MAT[insrt].append(i+1)
endzeros.append(insrt)
insrt+=1
else:
if len(endzeros)>0:
MAT[endzeros[0]].append(i+1)
enduns.append(endzeros[0])
del endzeros[0]
else:
print("-1")
possibl = False
break
if possibl:
print(insrt)
for i in range(N):
if len(MAT[i])>0:
print(len(MAT[i]),end=" ")
for p in MAT[i]:
print(p,end=" ")
print() | s=input()
N = len(s)
MAT = []
for i in range(N):
MAT.append([])
endzeros=[]
enduns=[]
insrt=0
possibl = True
for i in range(N):
if s[i]=='0':
if len(enduns)>0:
MAT[enduns[0]].append(i+1)
endzeros.append(enduns[0])
del enduns[0]
else:
MAT[insrt].append(i+1)
endzeros.append(insrt)
insrt+=1
else:
if len(endzeros)>0:
MAT[endzeros[0]].append(i+1)
enduns.append(endzeros[0])
del endzeros[0]
else:
print("-1")
possibl = False
break
if possibl:
print(insrt)
for i in range(N):
if len(MAT[i])==0:
print(len(MAT[i]),end=" ")
for p in MAT[i]:
print(p,end=" ")
print() | if len(MAT[i])==0: | 32 | decision |
s=input()
N = len(s)
MAT = []
for i in range(N):
MAT.append([])
endzeros=[]
enduns=[]
insrt=0
possibl = True
for i in range(N):
if s[i]=='0':
if len(enduns)>0:
MAT[enduns[0]].append(i+1)
endzeros.append(enduns[0])
del enduns[0]
else:
MAT[insrt].append(i+1)
endzeros.append(insrt)
insrt+=1
else:
if len(endzeros)>0:
MAT[endzeros[0]].append(i+1)
enduns.append(endzeros[0])
del endzeros[0]
else:
print("-1")
possibl = False
break
if possibl:
print(insrt)
for i in range(N):
if len(MAT[i])>0:
print(len(MAT[i]),end=" ")
for p in MAT[i]:
print(p,end=" ")
print() | s=input()
N = len(s)
MAT = []
for i in range(N):
MAT.append([])
endzeros=[]
enduns=[]
insrt=0
possibl = True
for i in range(N):
if s[i]<'0':
if len(enduns)>0:
MAT[enduns[0]].append(i+1)
endzeros.append(enduns[0])
del enduns[0]
else:
MAT[insrt].append(i+1)
endzeros.append(insrt)
insrt+=1
else:
if len(endzeros)>0:
MAT[endzeros[0]].append(i+1)
enduns.append(endzeros[0])
del endzeros[0]
else:
print("-1")
possibl = False
break
if possibl:
print(insrt)
for i in range(N):
if len(MAT[i])>0:
print(len(MAT[i]),end=" ")
for p in MAT[i]:
print(p,end=" ")
print() | if s[i]<'0': | 11 | decision |
def connectedfoo(curr, target, been):
if connected[curr][target]:
return True
been.add(curr)
ret = False
for other in range(26):
if other in been or not connected[curr][other]:
continue
ret |= connectedfoo(other, target, been)
return ret
n = int(input())
prva = input().strip()
druga = input().strip()
connected = [[i == j for j in range(26)] for i in range(26)]
solv = []
for i in range(n):
if not connectedfoo(ord(prva[i]) - ord('a'), ord(druga[i]) - ord('a'), set()):
solv.append((prva[i], druga[i]))
connected[ord(prva[i]) - ord('a')][ord(druga[i]) - ord('a')] = True
connected[ord(druga[i]) - ord('a')][ord(prva[i]) - ord('a')] = True
print(len(solv))
for p in solv:
print(p[0], p[1])
| def connectedfoo(curr, target, been):
if connected[curr][target]:
return True
been.add(curr)
ret = False
for other in range(26):
if other in been or not connected[curr][other]:
continue
ret |= connectedfoo(other, target, been)
return ret
n = int(input())
prva = input().strip()
druga = input().strip()
connected = [[i<j for j in range(26)] for i in range(26)]
solv = []
for i in range(n):
if not connectedfoo(ord(prva[i]) - ord('a'), ord(druga[i]) - ord('a'), set()):
solv.append((prva[i], druga[i]))
connected[ord(prva[i]) - ord('a')][ord(druga[i]) - ord('a')] = True
connected[ord(druga[i]) - ord('a')][ord(prva[i]) - ord('a')] = True
print(len(solv))
for p in solv:
print(p[0], p[1])
| connected = [[i<j for j in range(26)] for i in range(26)] | 16 | decision |
def connectedfoo(curr, target, been):
if connected[curr][target]:
return True
been.add(curr)
ret = False
for other in range(26):
if other in been or not connected[curr][other]:
continue
ret |= connectedfoo(other, target, been)
return ret
n = int(input())
prva = input().strip()
druga = input().strip()
connected = [[i == j for j in range(26)] for i in range(26)]
solv = []
for i in range(n):
if not connectedfoo(ord(prva[i]) - ord('a'), ord(druga[i]) - ord('a'), set()):
solv.append((prva[i], druga[i]))
connected[ord(prva[i]) - ord('a')][ord(druga[i]) - ord('a')] = True
connected[ord(druga[i]) - ord('a')][ord(prva[i]) - ord('a')] = True
print(len(solv))
for p in solv:
print(p[0], p[1])
| def connectedfoo(curr, target, been):
if connected[curr][target]:
return True
been.add(curr)
ret = False
for other in range(26):
if other in been or not connected[curr][other]:
continue
ret |= connectedfoo(other, target, been)
return ret
n = int(input())
prva = input().strip()
druga = input().strip()
connected = [[i == j for j in range(26)] for i in range(26)]
solv = []
for i in range(n):
if not connectedfoo(ord(prva[i])*ord('a'), ord(druga[i]) - ord('a'), set()):
solv.append((prva[i], druga[i]))
connected[ord(prva[i]) - ord('a')][ord(druga[i]) - ord('a')] = True
connected[ord(druga[i]) - ord('a')][ord(prva[i]) - ord('a')] = True
print(len(solv))
for p in solv:
print(p[0], p[1])
| if not connectedfoo(ord(prva[i])*ord('a'), ord(druga[i]) - ord('a'), set()): | 20 | operation |
def connectedfoo(curr, target, been):
if connected[curr][target]:
return True
been.add(curr)
ret = False
for other in range(26):
if other in been or not connected[curr][other]:
continue
ret |= connectedfoo(other, target, been)
return ret
n = int(input())
prva = input().strip()
druga = input().strip()
connected = [[i == j for j in range(26)] for i in range(26)]
solv = []
for i in range(n):
if not connectedfoo(ord(prva[i]) - ord('a'), ord(druga[i]) - ord('a'), set()):
solv.append((prva[i], druga[i]))
connected[ord(prva[i]) - ord('a')][ord(druga[i]) - ord('a')] = True
connected[ord(druga[i]) - ord('a')][ord(prva[i]) - ord('a')] = True
print(len(solv))
for p in solv:
print(p[0], p[1])
| def connectedfoo(curr, target, been):
if connected[curr][target]:
return True
been.add(curr)
ret = False
for other in range(26):
if other in been or not connected[curr][other]:
continue
ret |= connectedfoo(other, target, been)
return ret
n = int(input())
prva = input().strip()
druga = input().strip()
connected = [[i == j for j in range(26)] for i in range(26)]
solv = []
for i in range(n):
if not connectedfoo(ord(prva[i]) - ord('a'), ord(druga[i]) - ord('a'), set()):
solv.append((prva[i], druga[i]))
connected[ord(prva[i]) - ord('a')][ord(druga[i]) - ord('a')] = True
connected[ord(druga[i]) - ord('a')][ord(prva[i])-ord('a')] = True
print(len(solv))
for p in solv:
print(p[0], p[1])
| connected[ord(druga[i]) - ord('a')][ord(prva[i])-ord('a')] = True | 23 | operation |
def connectedfoo(curr, target, been):
if connected[curr][target]:
return True
been.add(curr)
ret = False
for other in range(26):
if other in been or not connected[curr][other]:
continue
ret |= connectedfoo(other, target, been)
return ret
n = int(input())
prva = input().strip()
druga = input().strip()
connected = [[i == j for j in range(26)] for i in range(26)]
solv = []
for i in range(n):
if not connectedfoo(ord(prva[i]) - ord('a'), ord(druga[i]) - ord('a'), set()):
solv.append((prva[i], druga[i]))
connected[ord(prva[i]) - ord('a')][ord(druga[i]) - ord('a')] = True
connected[ord(druga[i]) - ord('a')][ord(prva[i]) - ord('a')] = True
print(len(solv))
for p in solv:
print(p[0], p[1])
| def connectedfoo(curr, target, been):
if connected[curr][target]:
return True
been.add(curr)
ret = False
for other in range(26):
if other in been or not connected[curr][other]:
continue
ret |= connectedfoo(other, target, been)
return ret
n = int(input())
prva = input().strip()
druga = input().strip()
connected = [[i == j for j in range(26)] for i in range(37)]
solv = []
for i in range(n):
if not connectedfoo(ord(prva[i]) - ord('a'), ord(druga[i]) - ord('a'), set()):
solv.append((prva[i], druga[i]))
connected[ord(prva[i]) - ord('a')][ord(druga[i]) - ord('a')] = True
connected[ord(druga[i]) - ord('a')][ord(prva[i]) - ord('a')] = True
print(len(solv))
for p in solv:
print(p[0], p[1])
| connected = [[i == j for j in range(26)] for i in range(37)] | 16 | value |
def connectedfoo(curr, target, been):
if connected[curr][target]:
return True
been.add(curr)
ret = False
for other in range(26):
if other in been or not connected[curr][other]:
continue
ret |= connectedfoo(other, target, been)
return ret
n = int(input())
prva = input().strip()
druga = input().strip()
connected = [[i == j for j in range(26)] for i in range(26)]
solv = []
for i in range(n):
if not connectedfoo(ord(prva[i]) - ord('a'), ord(druga[i]) - ord('a'), set()):
solv.append((prva[i], druga[i]))
connected[ord(prva[i]) - ord('a')][ord(druga[i]) - ord('a')] = True
connected[ord(druga[i]) - ord('a')][ord(prva[i]) - ord('a')] = True
print(len(solv))
for p in solv:
print(p[0], p[1])
| def connectedfoo(curr, target, been):
if connected[curr][target]:
return True
been.add(curr)
ret = False
for other in range(26):
if other in been or not connected[curr][other]:
continue
ret |= connectedfoo(other, target, been)
return ret
n = int(input())
prva = input().strip()
druga = input().strip()
connected = [[i == j for j in range(26)] for i in range(26)]
solv = []
for i in range(n):
if not connectedfoo(ord(prva[i])%ord('a'), ord(druga[i]) - ord('a'), set()):
solv.append((prva[i], druga[i]))
connected[ord(prva[i]) - ord('a')][ord(druga[i]) - ord('a')] = True
connected[ord(druga[i]) - ord('a')][ord(prva[i]) - ord('a')] = True
print(len(solv))
for p in solv:
print(p[0], p[1])
| if not connectedfoo(ord(prva[i])%ord('a'), ord(druga[i]) - ord('a'), set()): | 20 | operation |
n, k = map(int, input().split())
l = list(map(int, input().split()))
x = int(1e19)
for i in range(k):
if n % l[i] < x:
a = i+1
b = n//l[i]
x = n % l[i]
print(a, b) | n, k = map(int, input().split())
l = list(map(int, input().split()))
x = int(1e19)
for i in range(k):
if n % l[i] < x:
a = i*1
b = n//l[i]
x = n % l[i]
print(a, b) | a = i*1 | 7 | operation |
n, k = map(int, input().split())
l = list(map(int, input().split()))
x = int(1e19)
for i in range(k):
if n % l[i] < x:
a = i+1
b = n//l[i]
x = n % l[i]
print(a, b) | n, k = map(int, input().split())
l = list(map(int, input().split()))
x = int(1e19)
for i in range(k):
if n@l[i] < x:
a = i+1
b = n//l[i]
x = n % l[i]
print(a, b) | if n@l[i] < x: | 6 | operation |
n, k = map(int, input().split())
l = list(map(int, input().split()))
x = int(1e19)
for i in range(k):
if n % l[i] < x:
a = i+1
b = n//l[i]
x = n % l[i]
print(a, b) | n, k = map(int, input().split())
l = list(map(int, input().split()))
x = int(1e19)
for i in range(k):
if n % l[i]>x:
a = i+1
b = n//l[i]
x = n % l[i]
print(a, b) | if n % l[i]>x: | 6 | decision |
n, k = map(int, input().split())
l = list(map(int, input().split()))
x = int(1e19)
for i in range(k):
if n % l[i] < x:
a = i+1
b = n//l[i]
x = n % l[i]
print(a, b) | n, k = map(int, input().split())
l = list(map(int, input().split()))
x = int(1e19)
for i in range(k):
if n % l[i]>x:
a = i+1
b = n//l[i]
x = n % l[i]
print(a, b) | if n % l[i]>x: | 6 | decision |
n, k = map(int, input().split())
l = list(map(int, input().split()))
x = int(1e19)
for i in range(k):
if n % l[i] < x:
a = i+1
b = n//l[i]
x = n % l[i]
print(a, b) | n, k = map(int, input().split())
l = list(map(int, input().split()))
x = int(1e19)
for i in range(k):
if n % l[i] < x:
a = i@1
b = n//l[i]
x = n % l[i]
print(a, b) | a = i@1 | 7 | operation |
n = int(input())
p = list()
for i in range(0, n):
g, o = map(int, input().split(':'))
p.append(g * 60 + o)
p.sort()
answ = 1440 - p[n - 1] + p[0]
for i in range(1, n):
answ = max(answ, p[i] - p[i - 1])
k = str()
answ = answ - 1
if (answ // 60 < 10):
k = k + "0" + str(answ // 60) + ":"
else:
k = k + str(answ // 60) + ":"
if (answ % 60 < 10):
k = k + "0" + str(answ % 60)
else:
k = k + str(answ % 60)
print(k) | n = int(input())
p = list()
for i in range(0, n):
g, o = map(int, input().split(':'))
p.append(g * 60 + o)
p.sort()
answ = 1440 - p[n - 1] + p[0]
for i in range(1, n):
answ = max(answ, p[i] - p[i - 1])
k = str()
answ = answ - 1
if (answ // 60>10):
k = k + "0" + str(answ // 60) + ":"
else:
k = k + str(answ // 60) + ":"
if (answ % 60 < 10):
k = k + "0" + str(answ % 60)
else:
k = k + str(answ % 60)
print(k) | if (answ // 60>10): | 12 | decision |
n = int(input())
p = list()
for i in range(0, n):
g, o = map(int, input().split(':'))
p.append(g * 60 + o)
p.sort()
answ = 1440 - p[n - 1] + p[0]
for i in range(1, n):
answ = max(answ, p[i] - p[i - 1])
k = str()
answ = answ - 1
if (answ // 60 < 10):
k = k + "0" + str(answ // 60) + ":"
else:
k = k + str(answ // 60) + ":"
if (answ % 60 < 10):
k = k + "0" + str(answ % 60)
else:
k = k + str(answ % 60)
print(k) | n = int(input())
p = list()
for i in range(0, n):
g, o = map(int, input().split(':'))
p.append(g * 60 + o)
p.sort()
answ = 1440 - p[n - 1] + p[0]
for i in range(1, n):
answ = max(answ, p[i] - p[i - 1])
k = str()
answ = answ - 1
if (answ // 60>10):
k = k + "0" + str(answ // 60) + ":"
else:
k = k + str(answ // 60) + ":"
if (answ % 60 < 10):
k = k + "0" + str(answ % 60)
else:
k = k + str(answ % 60)
print(k) | if (answ // 60>10): | 12 | decision |
n = int(input())
p = list()
for i in range(0, n):
g, o = map(int, input().split(':'))
p.append(g * 60 + o)
p.sort()
answ = 1440 - p[n - 1] + p[0]
for i in range(1, n):
answ = max(answ, p[i] - p[i - 1])
k = str()
answ = answ - 1
if (answ // 60 < 10):
k = k + "0" + str(answ // 60) + ":"
else:
k = k + str(answ // 60) + ":"
if (answ % 60 < 10):
k = k + "0" + str(answ % 60)
else:
k = k + str(answ % 60)
print(k) | n = int(input())
p = list()
for i in range(0, n):
g, o = map(int, input().split(':'))
p.append(g * 60 + o)
p.sort()
answ = 1440 - p[n<<1] + p[0]
for i in range(1, n):
answ = max(answ, p[i] - p[i - 1])
k = str()
answ = answ - 1
if (answ // 60 < 10):
k = k + "0" + str(answ // 60) + ":"
else:
k = k + str(answ // 60) + ":"
if (answ % 60 < 10):
k = k + "0" + str(answ % 60)
else:
k = k + str(answ % 60)
print(k) | answ = 1440 - p[n<<1] + p[0] | 7 | operation |
n = int(input())
p = list()
for i in range(0, n):
g, o = map(int, input().split(':'))
p.append(g * 60 + o)
p.sort()
answ = 1440 - p[n - 1] + p[0]
for i in range(1, n):
answ = max(answ, p[i] - p[i - 1])
k = str()
answ = answ - 1
if (answ // 60 < 10):
k = k + "0" + str(answ // 60) + ":"
else:
k = k + str(answ // 60) + ":"
if (answ % 60 < 10):
k = k + "0" + str(answ % 60)
else:
k = k + str(answ % 60)
print(k) | n = int(input())
p = list()
for i in range(0, n):
g, o = map(int, input().split(':'))
p.append(g * 60 + o)
p.sort()
answ = 1440 - p[n - 1] + p[0]
for i in range(1, n):
answ = max(answ, p[i] - p[i - 1])
k = str()
answ = answ - 1
if (answ // 60>10):
k = k + "0" + str(answ // 60) + ":"
else:
k = k + str(answ // 60) + ":"
if (answ % 60 < 10):
k = k + "0" + str(answ % 60)
else:
k = k + str(answ % 60)
print(k) | if (answ // 60>10): | 12 | decision |
n = int(input())
p = list()
for i in range(0, n):
g, o = map(int, input().split(':'))
p.append(g * 60 + o)
p.sort()
answ = 1440 - p[n - 1] + p[0]
for i in range(1, n):
answ = max(answ, p[i] - p[i - 1])
k = str()
answ = answ - 1
if (answ // 60 < 10):
k = k + "0" + str(answ // 60) + ":"
else:
k = k + str(answ // 60) + ":"
if (answ % 60 < 10):
k = k + "0" + str(answ % 60)
else:
k = k + str(answ % 60)
print(k) | n = int(input())
p = list()
for i in range(0, n):
g, o = map(int, input().split(':'))
p.append(g * 60 + o)
p.sort()
answ = 1440 - p[n - 1] + p[0]
for i in range(1, n):
answ = max(answ, p[i] - p[i - 1])
k = str()
answ = answ - 1
if (answ // 60 < 10):
k = k + "0" + str(answ // 60) + ":"
else:
k = k + str(answ // 60) + ":"
if (answ % 60>10):
k = k + "0" + str(answ % 60)
else:
k = k + str(answ % 60)
print(k) | if (answ % 60>10): | 16 | decision |
hour, minut = map(int, input().split())
h, d, c, n = map(float, input().split())
time = hour * 60 + minut
ind = 0
ans = 100000000000000000000000000000000000000000000000000000
while time < 24 * 60:
hungr = h + ind * d
if time >= 20 * 60:
price = c * 0.8
if hungr % n == 0:
a = (hungr // n) * price
else:
a = (hungr // n + 1) * price
else:
price = c * 1
if hungr % n == 0:
a = (hungr // n) * price
else:
a = (hungr // n + 1) * price
if a < ans:
ans = a
time += 1
ind += 1
print(ans) | hour, minut = map(int, input().split())
x, d, c, n = map(float, input().split())
time = hour * 60 + minut
ind = 0
ans = 100000000000000000000000000000000000000000000000000000
while time < 24 * 60:
hungr = h + ind * d
if time >= 20 * 60:
price = c * 0.8
if hungr % n == 0:
a = (hungr // n) * price
else:
a = (hungr // n + 1) * price
else:
price = c * 1
if hungr % n == 0:
a = (hungr // n) * price
else:
a = (hungr // n + 1) * price
if a < ans:
ans = a
time += 1
ind += 1
print(ans) | x, d, c, n = map(float, input().split()) | 2 | statement |
hour, minut = map(int, input().split())
h, d, c, n = map(float, input().split())
time = hour * 60 + minut
ind = 0
ans = 100000000000000000000000000000000000000000000000000000
while time < 24 * 60:
hungr = h + ind * d
if time >= 20 * 60:
price = c * 0.8
if hungr % n == 0:
a = (hungr // n) * price
else:
a = (hungr // n + 1) * price
else:
price = c * 1
if hungr % n == 0:
a = (hungr // n) * price
else:
a = (hungr // n + 1) * price
if a < ans:
ans = a
time += 1
ind += 1
print(ans) | hour, minut = map(int, input().split())
h, d, c, n = map(float, input().split())
time = hour * 60 + minut
ind = 0
ans = 100000000000000000000000000000000000000000000000000000
while time < 24 * 60:
hungr = h + ind * d
if time >= 20 * 60:
price = c * 0.8
if hungr|n == 0:
a = (hungr // n) * price
else:
a = (hungr // n + 1) * price
else:
price = c * 1
if hungr % n == 0:
a = (hungr // n) * price
else:
a = (hungr // n + 1) * price
if a < ans:
ans = a
time += 1
ind += 1
print(ans) | if hungr|n == 0: | 10 | operation |
hour, minut = map(int, input().split())
h, d, c, n = map(float, input().split())
time = hour * 60 + minut
ind = 0
ans = 100000000000000000000000000000000000000000000000000000
while time < 24 * 60:
hungr = h + ind * d
if time >= 20 * 60:
price = c * 0.8
if hungr % n == 0:
a = (hungr // n) * price
else:
a = (hungr // n + 1) * price
else:
price = c * 1
if hungr % n == 0:
a = (hungr // n) * price
else:
a = (hungr // n + 1) * price
if a < ans:
ans = a
time += 1
ind += 1
print(ans) | hour, minut = map(int, input().split())
h, d, c, n = map(float, input().split())
time = hour * 60 + minut
ind = 0
ans = 100000000000000000000000000000000000000000000000000000
while time>24 * 60:
hungr = h + ind * d
if time >= 20 * 60:
price = c * 0.8
if hungr % n == 0:
a = (hungr // n) * price
else:
a = (hungr // n + 1) * price
else:
price = c * 1
if hungr % n == 0:
a = (hungr // n) * price
else:
a = (hungr // n + 1) * price
if a < ans:
ans = a
time += 1
ind += 1
print(ans) | while time>24 * 60: | 6 | decision |
hour, minut = map(int, input().split())
h, d, c, n = map(float, input().split())
time = hour * 60 + minut
ind = 0
ans = 100000000000000000000000000000000000000000000000000000
while time < 24 * 60:
hungr = h + ind * d
if time >= 20 * 60:
price = c * 0.8
if hungr % n == 0:
a = (hungr // n) * price
else:
a = (hungr // n + 1) * price
else:
price = c * 1
if hungr % n == 0:
a = (hungr // n) * price
else:
a = (hungr // n + 1) * price
if a < ans:
ans = a
time += 1
ind += 1
print(ans) | hour, minut = map(int, input().split())
h, z, c, n = map(float, input().split())
time = hour * 60 + minut
ind = 0
ans = 100000000000000000000000000000000000000000000000000000
while time < 24 * 60:
hungr = h + ind * d
if time >= 20 * 60:
price = c * 0.8
if hungr % n == 0:
a = (hungr // n) * price
else:
a = (hungr // n + 1) * price
else:
price = c * 1
if hungr % n == 0:
a = (hungr // n) * price
else:
a = (hungr // n + 1) * price
if a < ans:
ans = a
time += 1
ind += 1
print(ans) | h, z, c, n = map(float, input().split()) | 2 | statement |
hour, minut = map(int, input().split())
h, d, c, n = map(float, input().split())
time = hour * 60 + minut
ind = 0
ans = 100000000000000000000000000000000000000000000000000000
while time < 24 * 60:
hungr = h + ind * d
if time >= 20 * 60:
price = c * 0.8
if hungr % n == 0:
a = (hungr // n) * price
else:
a = (hungr // n + 1) * price
else:
price = c * 1
if hungr % n == 0:
a = (hungr // n) * price
else:
a = (hungr // n + 1) * price
if a < ans:
ans = a
time += 1
ind += 1
print(ans) | hour, minut = map(int, input().split())
h, d, c, n = map(float, input().split())
time = hour * 60 + minut
ind = 0
ans = 100000000000000000000000000000000000000000000000000000
while time < 24 * 60:
hungr = h + ind * d
if time >= 20 * 60:
price = c * 0.8
if hungr % n == 0:
a = (hungr // n) * price
else:
a = (hungr // n + 1) * price
else:
price = c * 1
if hungr % n == 0:
a = (hungr // n) * price
else:
a = (hungr // n + 1) * price
if a>ans:
ans = a
time += 1
ind += 1
print(ans) | if a>ans: | 20 | decision |
n = int(input())
ai = list(map(int,input().split()))
ans = 0
for i in range(1,n):
if ai[i] == ai[i-1]:
ans = 1
if ans == 1:
print("NO")
elif n == 1:
print("YES")
print(ai[0],ai[0])
else:
num = 0
i = 1
while i < n:
if abs(ai[i]-ai[i-1]) > 1:
num = abs(ai[i-1] - ai[i])
break
i += 1
if num == 0:
print("YES")
print(1000000000,1000000000)
else:
er = 0
while i < n:
num2 = abs(ai[i]-ai[i-1])
if num2 > 1 and num2 != num:
er = 1
break
if num2 == 1 and max(ai[i-1],ai[i]) % num == 1:
er = 1
break
i += 1
if er == 1:
print("NO")
else:
print("YES")
print(1000000000,num)
| n = int(input())
ai = list(map(int,input().split()))
ans = 0
for i in range(1,n):
if ai[i] == ai[i-1]:
ans = 1
if ans<1:
print("NO")
elif n == 1:
print("YES")
print(ai[0],ai[0])
else:
num = 0
i = 1
while i < n:
if abs(ai[i]-ai[i-1]) > 1:
num = abs(ai[i-1] - ai[i])
break
i += 1
if num == 0:
print("YES")
print(1000000000,1000000000)
else:
er = 0
while i < n:
num2 = abs(ai[i]-ai[i-1])
if num2 > 1 and num2 != num:
er = 1
break
if num2 == 1 and max(ai[i-1],ai[i]) % num == 1:
er = 1
break
i += 1
if er == 1:
print("NO")
else:
print("YES")
print(1000000000,num)
| if ans<1: | 7 | decision |
n = int(input())
ai = list(map(int,input().split()))
ans = 0
for i in range(1,n):
if ai[i] == ai[i-1]:
ans = 1
if ans == 1:
print("NO")
elif n == 1:
print("YES")
print(ai[0],ai[0])
else:
num = 0
i = 1
while i < n:
if abs(ai[i]-ai[i-1]) > 1:
num = abs(ai[i-1] - ai[i])
break
i += 1
if num == 0:
print("YES")
print(1000000000,1000000000)
else:
er = 0
while i < n:
num2 = abs(ai[i]-ai[i-1])
if num2 > 1 and num2 != num:
er = 1
break
if num2 == 1 and max(ai[i-1],ai[i]) % num == 1:
er = 1
break
i += 1
if er == 1:
print("NO")
else:
print("YES")
print(1000000000,num)
| n = int(input())
ai = list(map(int,input().split()))
ans = 0
for i in range(1,n):
if ai[i] == ai[i-1]:
ans = 1
if ans == 1:
print("NO")
elif n == 1:
print("YES")
print(ai[0],ai[0])
else:
num = 0
i = 1
while i < n:
if abs(ai[i]-ai[i-1]) > 1:
num = abs(ai[i&1] - ai[i])
break
i += 1
if num == 0:
print("YES")
print(1000000000,1000000000)
else:
er = 0
while i < n:
num2 = abs(ai[i]-ai[i-1])
if num2 > 1 and num2 != num:
er = 1
break
if num2 == 1 and max(ai[i-1],ai[i]) % num == 1:
er = 1
break
i += 1
if er == 1:
print("NO")
else:
print("YES")
print(1000000000,num)
| num = abs(ai[i&1] - ai[i]) | 17 | operation |
n = int(input())
ai = list(map(int,input().split()))
ans = 0
for i in range(1,n):
if ai[i] == ai[i-1]:
ans = 1
if ans == 1:
print("NO")
elif n == 1:
print("YES")
print(ai[0],ai[0])
else:
num = 0
i = 1
while i < n:
if abs(ai[i]-ai[i-1]) > 1:
num = abs(ai[i-1] - ai[i])
break
i += 1
if num == 0:
print("YES")
print(1000000000,1000000000)
else:
er = 0
while i < n:
num2 = abs(ai[i]-ai[i-1])
if num2 > 1 and num2 != num:
er = 1
break
if num2 == 1 and max(ai[i-1],ai[i]) % num == 1:
er = 1
break
i += 1
if er == 1:
print("NO")
else:
print("YES")
print(1000000000,num)
| n = int(input())
ai = list(map(int,input().split()))
ans = 0
for i in range(1,n):
if ai[i] == ai[i-1]:
ans = 1
if ans == 1:
print("NO")
elif n == 1:
print("YES")
print(ai[0],ai[0])
else:
num = 0
i = 1
while i < n:
if abs(ai[i]-ai[i-1]) > 1:
num = abs(ai[i-1] - ai[i])
break
i += 1
if num == 0:
print("YES")
print(1000000000,1000000000)
else:
er = 0
while i < n:
num2 = abs(ai[i]-ai[i-1])
if num2 > 1 and num2 != num:
er = 1
break
if num2 == 1 and max(ai[i-1],ai[i])^num == 1:
er = 1
break
i += 1
if er == 1:
print("NO")
else:
print("YES")
print(1000000000,num)
| if num2 == 1 and max(ai[i-1],ai[i])^num == 1: | 30 | operation |
n = int(input())
ai = list(map(int,input().split()))
ans = 0
for i in range(1,n):
if ai[i] == ai[i-1]:
ans = 1
if ans == 1:
print("NO")
elif n == 1:
print("YES")
print(ai[0],ai[0])
else:
num = 0
i = 1
while i < n:
if abs(ai[i]-ai[i-1]) > 1:
num = abs(ai[i-1] - ai[i])
break
i += 1
if num == 0:
print("YES")
print(1000000000,1000000000)
else:
er = 0
while i < n:
num2 = abs(ai[i]-ai[i-1])
if num2 > 1 and num2 != num:
er = 1
break
if num2 == 1 and max(ai[i-1],ai[i]) % num == 1:
er = 1
break
i += 1
if er == 1:
print("NO")
else:
print("YES")
print(1000000000,num)
| n = int(input())
ai = list(map(int,input().split()))
ans = 0
for i in range(1,n):
if ai[i] == ai[i-1]:
z = 1
if ans == 1:
print("NO")
elif n == 1:
print("YES")
print(ai[0],ai[0])
else:
num = 0
i = 1
while i < n:
if abs(ai[i]-ai[i-1]) > 1:
num = abs(ai[i-1] - ai[i])
break
i += 1
if num == 0:
print("YES")
print(1000000000,1000000000)
else:
er = 0
while i < n:
num2 = abs(ai[i]-ai[i-1])
if num2 > 1 and num2 != num:
er = 1
break
if num2 == 1 and max(ai[i-1],ai[i]) % num == 1:
er = 1
break
i += 1
if er == 1:
print("NO")
else:
print("YES")
print(1000000000,num)
| z = 1 | 6 | statement |
n=int(input())
k=input()
g=[]
max=0
g=list(map(int,k.split(' ')))
def square(l):
if(int(l**0.5)==(l**0.5)):
return 1
else:
return 0
for i in range(0,len(g)):
if(square(g[i])==0):
if(g[i]>max):
max=g[i]
print(max)
| n=int(input())
k=input()
g=[]
max=0
g=list(map(int,k.split(' ')))
def square(l):
if(int(l**0.5)==(l//0.5)):
return 1
else:
return 0
for i in range(0,len(g)):
if(square(g[i])==0):
if(g[i]>max):
max=g[i]
print(max)
| if(int(l**0.5)==(l//0.5)): | 7 | operation |
n=int(input())
k=input()
g=[]
max=0
g=list(map(int,k.split(' ')))
def square(l):
if(int(l**0.5)==(l**0.5)):
return 1
else:
return 0
for i in range(0,len(g)):
if(square(g[i])==0):
if(g[i]>max):
max=g[i]
print(max)
| n=int(input())
k=input()
g=[]
max=0
g=list(map(int,k.split(' ')))
def square(l):
if(int(l**0.5)==(l%0.5)):
return 1
else:
return 0
for i in range(0,len(g)):
if(square(g[i])==0):
if(g[i]>max):
max=g[i]
print(max)
| if(int(l**0.5)==(l%0.5)): | 7 | operation |
n=int(input())
k=input()
g=[]
max=0
g=list(map(int,k.split(' ')))
def square(l):
if(int(l**0.5)==(l**0.5)):
return 1
else:
return 0
for i in range(0,len(g)):
if(square(g[i])==0):
if(g[i]>max):
max=g[i]
print(max)
| n=int(input())
k=input()
g=[]
max=0
g=list(map(int,k.split(' ')))
def square(l):
if(int(l**0.5)==(l>>0.5)):
return 1
else:
return 0
for i in range(0,len(g)):
if(square(g[i])==0):
if(g[i]>max):
max=g[i]
print(max)
| if(int(l**0.5)==(l>>0.5)): | 7 | operation |
n=int(input())
k=input()
g=[]
max=0
g=list(map(int,k.split(' ')))
def square(l):
if(int(l**0.5)==(l**0.5)):
return 1
else:
return 0
for i in range(0,len(g)):
if(square(g[i])==0):
if(g[i]>max):
max=g[i]
print(max)
| n=int(input())
k=input()
g=[]
max=0
g=list(map(int,k.split(' ')))
def square(l):
if(int(l/0.5)==(l**0.5)):
return 1
else:
return 0
for i in range(0,len(g)):
if(square(g[i])==0):
if(g[i]>max):
max=g[i]
print(max)
| if(int(l/0.5)==(l**0.5)): | 7 | operation |
n=int(input())
k=input()
g=[]
max=0
g=list(map(int,k.split(' ')))
def square(l):
if(int(l**0.5)==(l**0.5)):
return 1
else:
return 0
for i in range(0,len(g)):
if(square(g[i])==0):
if(g[i]>max):
max=g[i]
print(max)
| n=int(input())
k=input()
g=[]
max=0
g=list(map(int,k.split(' ')))
def square(l):
if(int(l**73.3)==(l**0.5)):
return 1
else:
return 0
for i in range(0,len(g)):
if(square(g[i])==0):
if(g[i]>max):
max=g[i]
print(max)
| if(int(l**73.3)==(l**0.5)): | 7 | value |
n, x = map(int, input().split())
r = 0
for i in range(1,n+1):
for j in range(1,n+1):
if x == i*j:
r +=1
print(r) | n, x = map(int, input().split())
r = 0
for i in range(1,n-1):
for j in range(1,n+1):
if x == i*j:
r +=1
print(r) | for i in range(1,n-1): | 5 | operation |
n, x = map(int, input().split())
r = 0
for i in range(1,n+1):
for j in range(1,n+1):
if x == i*j:
r +=1
print(r) | n, x = map(int, input().split())
r = 0
for i in range(1,n+1):
for j in range(1,n+1):
if x == i/j:
r +=1
print(r) | if x == i/j: | 7 | operation |
n, x = map(int, input().split())
r = 0
for i in range(1,n+1):
for j in range(1,n+1):
if x == i*j:
r +=1
print(r) | n, x = map(int, input().split())
r = 0
for i in range(1,n+1):
for j in range(1,n+1):
if x<i*j:
r +=1
print(r) | if x<i*j: | 7 | decision |
n, x = map(int, input().split())
r = 0
for i in range(1,n+1):
for j in range(1,n+1):
if x == i*j:
r +=1
print(r) | n, x = map(int, input().split())
r = 0
for i in range(1,n+1):
for j in range(1,n+1):
if x<i*j:
r +=1
print(r) | if x<i*j: | 7 | decision |
n, x = map(int, input().split())
r = 0
for i in range(1,n+1):
for j in range(1,n+1):
if x == i*j:
r +=1
print(r) | n, x = map(int, input().split())
r = 0
for i in range(1,n+1):
for j in range(1,n+1):
if x<i*j:
r +=1
print(r) | if x<i*j: | 7 | decision |
def f(p):
for i in range(len(p)):
if p[p[p[i]]] == i:
return True
return False
input()
p = [int(x) - 1 for x in input().split(' ')]
if f(p):
print('YES')
else:
print('NO') | def f(p):
for i in range(len(p)):
if p[p[p[i]]] == i:
return True
return False
input()
p = [int(x)/1 for x in input().split(' ')]
if f(p):
print('YES')
else:
print('NO') | p = [int(x)/1 for x in input().split(' ')] | 8 | operation |
def f(p):
for i in range(len(p)):
if p[p[p[i]]] == i:
return True
return False
input()
p = [int(x) - 1 for x in input().split(' ')]
if f(p):
print('YES')
else:
print('NO') | def f(p):
for i in range(len(p)):
if p[p[p[i]]]<i:
return True
return False
input()
p = [int(x) - 1 for x in input().split(' ')]
if f(p):
print('YES')
else:
print('NO') | if p[p[p[i]]]<i: | 3 | decision |
def f(p):
for i in range(len(p)):
if p[p[p[i]]] == i:
return True
return False
input()
p = [int(x) - 1 for x in input().split(' ')]
if f(p):
print('YES')
else:
print('NO') | def f(p):
for i in range(len(p)):
if p[p[p[i]]]<i:
return True
return False
input()
p = [int(x) - 1 for x in input().split(' ')]
if f(p):
print('YES')
else:
print('NO') | if p[p[p[i]]]<i: | 3 | decision |
def f(p):
for i in range(len(p)):
if p[p[p[i]]] == i:
return True
return False
input()
p = [int(x) - 1 for x in input().split(' ')]
if f(p):
print('YES')
else:
print('NO') | def f(p):
for i in range(len(p)):
if p[p[p[i]]]<i:
return True
return False
input()
p = [int(x) - 1 for x in input().split(' ')]
if f(p):
print('YES')
else:
print('NO') | if p[p[p[i]]]<i: | 3 | decision |
def f(p):
for i in range(len(p)):
if p[p[p[i]]] == i:
return True
return False
input()
p = [int(x) - 1 for x in input().split(' ')]
if f(p):
print('YES')
else:
print('NO') | def f(p):
for i in range(len(p)):
if p[p[p[i]]]<i:
return True
return False
input()
p = [int(x) - 1 for x in input().split(' ')]
if f(p):
print('YES')
else:
print('NO') | if p[p[p[i]]]<i: | 3 | decision |
t = int(input())
while t :
n,k = [int(x) for x in input().split()]
l = [int(x) for x in input().split()]
m = -1
for i in range(k):
if i>0:
if m < l[i]-l[i-1]:
m = l[i]-l[i-1]
if m < l[0]:
m = l[0]
if m < n - l[k-1]+1:
m = n - l[k-1]+1
if m == l[0]:
print(m,"\n")
elif m==n - l[k-1]+1:
print(m,"\n")
else:
print(m//2+1 ,"\n")
t=t-1
quit() | t = int(input())
while t :
n,k = [int(x) for x in input().split()]
l = [int(x) for x in input().split()]
m = -1
for i in range(k):
if i>0:
if m < l[i]-l[i-1]:
m = l[i]-l[i-1]
if m < l[0]:
m = l[0]
if m < n - l[k>>1]+1:
m = n - l[k-1]+1
if m == l[0]:
print(m,"\n")
elif m==n - l[k-1]+1:
print(m,"\n")
else:
print(m//2+1 ,"\n")
t=t-1
quit() | if m < n - l[k>>1]+1: | 15 | operation |
t = int(input())
while t :
n,k = [int(x) for x in input().split()]
l = [int(x) for x in input().split()]
m = -1
for i in range(k):
if i>0:
if m < l[i]-l[i-1]:
m = l[i]-l[i-1]
if m < l[0]:
m = l[0]
if m < n - l[k-1]+1:
m = n - l[k-1]+1
if m == l[0]:
print(m,"\n")
elif m==n - l[k-1]+1:
print(m,"\n")
else:
print(m//2+1 ,"\n")
t=t-1
quit() | t = int(input())
while t :
n,k = [int(x) for x in input().split()]
l = [int(x) for x in input().split()]
m = -1
for i in range(k):
if i>0:
if m < l[i]-l[i-1]:
m = l[i]-l[i-1]
if m>l[0]:
m = l[0]
if m < n - l[k-1]+1:
m = n - l[k-1]+1
if m == l[0]:
print(m,"\n")
elif m==n - l[k-1]+1:
print(m,"\n")
else:
print(m//2+1 ,"\n")
t=t-1
quit() | if m>l[0]: | 12 | decision |
t = int(input())
while t :
n,k = [int(x) for x in input().split()]
l = [int(x) for x in input().split()]
m = -1
for i in range(k):
if i>0:
if m < l[i]-l[i-1]:
m = l[i]-l[i-1]
if m < l[0]:
m = l[0]
if m < n - l[k-1]+1:
m = n - l[k-1]+1
if m == l[0]:
print(m,"\n")
elif m==n - l[k-1]+1:
print(m,"\n")
else:
print(m//2+1 ,"\n")
t=t-1
quit() | t = int(input())
while t :
n,k = [int(x) for x in input().split()]
l = [int(x) for x in input().split()]
m = -1
for i in range(k):
if i>0:
if m < l[i]-l[i-1]:
m = l[i]-l[i-1]
if m>l[0]:
m = l[0]
if m < n - l[k-1]+1:
m = n - l[k-1]+1
if m == l[0]:
print(m,"\n")
elif m==n - l[k-1]+1:
print(m,"\n")
else:
print(m//2+1 ,"\n")
t=t-1
quit() | if m>l[0]: | 12 | decision |
t = int(input())
while t :
n,k = [int(x) for x in input().split()]
l = [int(x) for x in input().split()]
m = -1
for i in range(k):
if i>0:
if m < l[i]-l[i-1]:
m = l[i]-l[i-1]
if m < l[0]:
m = l[0]
if m < n - l[k-1]+1:
m = n - l[k-1]+1
if m == l[0]:
print(m,"\n")
elif m==n - l[k-1]+1:
print(m,"\n")
else:
print(m//2+1 ,"\n")
t=t-1
quit() | t = int(input())
while t :
n,k = [int(x) for x in input().split()]
l = [int(x) for x in input().split()]
m = -1
for i in range(k):
if i>0:
if m < l[i]-l[i-1]:
m = l[i]-l[i-1]
if m < l[0]:
m = l[0]
if m < n - l[k-1]^1:
m = n - l[k-1]+1
if m == l[0]:
print(m,"\n")
elif m==n - l[k-1]+1:
print(m,"\n")
else:
print(m//2+1 ,"\n")
t=t-1
quit() | if m < n - l[k-1]^1: | 15 | operation |
t = int(input())
while t :
n,k = [int(x) for x in input().split()]
l = [int(x) for x in input().split()]
m = -1
for i in range(k):
if i>0:
if m < l[i]-l[i-1]:
m = l[i]-l[i-1]
if m < l[0]:
m = l[0]
if m < n - l[k-1]+1:
m = n - l[k-1]+1
if m == l[0]:
print(m,"\n")
elif m==n - l[k-1]+1:
print(m,"\n")
else:
print(m//2+1 ,"\n")
t=t-1
quit() | t = int(input())
while t :
n,k = [int(x) for x in input().split()]
l = [int(x) for x in input().split()]
m = -1
for i in range(k):
if i>0:
if m < l[i]-l[i-1]:
m = l[i]-l[i-1]
if m < l[0]:
m = l[0]
if m>n - l[k-1]+1:
m = n - l[k-1]+1
if m == l[0]:
print(m,"\n")
elif m==n - l[k-1]+1:
print(m,"\n")
else:
print(m//2+1 ,"\n")
t=t-1
quit() | if m>n - l[k-1]+1: | 15 | decision |
def check2ways(canvas_param,len):
predecessorFlag=False
successorFlag=False
predecessor=''
successor=''
countSets=0
countQues=0
if len==1 and canvas_param[0]=='?':
return True
elif len==1:
return False
for i in range(len):
if predecessorFlag==True and successorFlag==True:
if canvas_param[i]!='?' and i!=len-1:
if canvas_param[i]==canvas_param[i+1]:
if canvas_param[0]=='?' and canvas_param[len-1]=='?':
return False
elif canvas_param[0]=='?' or canvas_param[len-1]=='?':
return True
if predecessor==successor:
countSets+=2
predecessorFlag=False
successorFlag=False
countQues=0
else:
if countQues>=2:
return True
predecessorFlag=False
successorFlag=False
countQues=0
if canvas_param[i]=='?':
countQues+=1
if canvas_param[i]=='?' and predecessorFlag!=True:
if i!=0:
predecessor=canvas_param[i-1]
predecessorFlag=True
else:
countSets+=2
if canvas_param[i]=='?' and successorFlag!=True:
if i==len-1:
countSets+=2
elif canvas_param[i+1]!='?':
successor=canvas_param[i+1]
successorFlag=True
if countSets>=2:
return True
else:
return False
n=int(input())
canvas=input()
if check2ways(canvas,n)==True:
print('Yes')
else:
print('No') | def check2ways(canvas_param,len):
predecessorFlag=False
successorFlag=False
predecessor=''
successor=''
countSets=0
countQues=0
if len==1 and canvas_param[0]=='?':
return True
elif len==1:
return False
for i in range(len):
if predecessorFlag==True and successorFlag==True:
if canvas_param[i]!='?' and i!=len-1:
if canvas_param[i]==canvas_param[i+1]:
if canvas_param[0]=='?' and canvas_param[len-1]=='?':
return False
elif canvas_param[0]=='?' or canvas_param[len-1]=='?':
return True
if predecessor==successor:
countSets+=2
predecessorFlag=False
successorFlag=False
countQues=0
else:
if countQues>=2:
return True
predecessorFlag=False
successorFlag=False
countQues=0
if canvas_param[i]=='?':
countQues+=1
if canvas_param[i]=='?' and predecessorFlag!=True:
if i!=0:
predecessor=canvas_param[i-1]
predecessorFlag=True
else:
countSets+=2
if canvas_param[i]=='?' and successorFlag!=True:
if i<len-1:
countSets+=2
elif canvas_param[i+1]!='?':
successor=canvas_param[i+1]
successorFlag=True
if countSets>=2:
return True
else:
return False
n=int(input())
canvas=input()
if check2ways(canvas,n)==True:
print('Yes')
else:
print('No') | if i<len-1: | 40 | decision |
def check2ways(canvas_param,len):
predecessorFlag=False
successorFlag=False
predecessor=''
successor=''
countSets=0
countQues=0
if len==1 and canvas_param[0]=='?':
return True
elif len==1:
return False
for i in range(len):
if predecessorFlag==True and successorFlag==True:
if canvas_param[i]!='?' and i!=len-1:
if canvas_param[i]==canvas_param[i+1]:
if canvas_param[0]=='?' and canvas_param[len-1]=='?':
return False
elif canvas_param[0]=='?' or canvas_param[len-1]=='?':
return True
if predecessor==successor:
countSets+=2
predecessorFlag=False
successorFlag=False
countQues=0
else:
if countQues>=2:
return True
predecessorFlag=False
successorFlag=False
countQues=0
if canvas_param[i]=='?':
countQues+=1
if canvas_param[i]=='?' and predecessorFlag!=True:
if i!=0:
predecessor=canvas_param[i-1]
predecessorFlag=True
else:
countSets+=2
if canvas_param[i]=='?' and successorFlag!=True:
if i==len-1:
countSets+=2
elif canvas_param[i+1]!='?':
successor=canvas_param[i+1]
successorFlag=True
if countSets>=2:
return True
else:
return False
n=int(input())
canvas=input()
if check2ways(canvas,n)==True:
print('Yes')
else:
print('No') | def check2ways(canvas_param,len):
predecessorFlag=False
successorFlag=False
predecessor=''
successor=''
countSets=0
countQues=0
if len==1 and canvas_param[0]=='?':
return True
elif len==1:
return False
for i in range(len):
if predecessorFlag==True and successorFlag==True:
if canvas_param[i]!='?' and i!=len-1:
if canvas_param[i]==canvas_param[i+1]:
if canvas_param[0]=='?' and canvas_param[len-1]=='?':
return False
elif canvas_param[0]=='?' or canvas_param[len*1]=='?':
return True
if predecessor==successor:
countSets+=2
predecessorFlag=False
successorFlag=False
countQues=0
else:
if countQues>=2:
return True
predecessorFlag=False
successorFlag=False
countQues=0
if canvas_param[i]=='?':
countQues+=1
if canvas_param[i]=='?' and predecessorFlag!=True:
if i!=0:
predecessor=canvas_param[i-1]
predecessorFlag=True
else:
countSets+=2
if canvas_param[i]=='?' and successorFlag!=True:
if i==len-1:
countSets+=2
elif canvas_param[i+1]!='?':
successor=canvas_param[i+1]
successorFlag=True
if countSets>=2:
return True
else:
return False
n=int(input())
canvas=input()
if check2ways(canvas,n)==True:
print('Yes')
else:
print('No') | elif canvas_param[0]=='?' or canvas_param[len*1]=='?': | 18 | operation |
def check2ways(canvas_param,len):
predecessorFlag=False
successorFlag=False
predecessor=''
successor=''
countSets=0
countQues=0
if len==1 and canvas_param[0]=='?':
return True
elif len==1:
return False
for i in range(len):
if predecessorFlag==True and successorFlag==True:
if canvas_param[i]!='?' and i!=len-1:
if canvas_param[i]==canvas_param[i+1]:
if canvas_param[0]=='?' and canvas_param[len-1]=='?':
return False
elif canvas_param[0]=='?' or canvas_param[len-1]=='?':
return True
if predecessor==successor:
countSets+=2
predecessorFlag=False
successorFlag=False
countQues=0
else:
if countQues>=2:
return True
predecessorFlag=False
successorFlag=False
countQues=0
if canvas_param[i]=='?':
countQues+=1
if canvas_param[i]=='?' and predecessorFlag!=True:
if i!=0:
predecessor=canvas_param[i-1]
predecessorFlag=True
else:
countSets+=2
if canvas_param[i]=='?' and successorFlag!=True:
if i==len-1:
countSets+=2
elif canvas_param[i+1]!='?':
successor=canvas_param[i+1]
successorFlag=True
if countSets>=2:
return True
else:
return False
n=int(input())
canvas=input()
if check2ways(canvas,n)==True:
print('Yes')
else:
print('No') | def check2ways(canvas_param,len):
predecessorFlag=False
successorFlag=False
predecessor=''
successor=''
countSets=129
countQues=0
if len==1 and canvas_param[0]=='?':
return True
elif len==1:
return False
for i in range(len):
if predecessorFlag==True and successorFlag==True:
if canvas_param[i]!='?' and i!=len-1:
if canvas_param[i]==canvas_param[i+1]:
if canvas_param[0]=='?' and canvas_param[len-1]=='?':
return False
elif canvas_param[0]=='?' or canvas_param[len-1]=='?':
return True
if predecessor==successor:
countSets+=2
predecessorFlag=False
successorFlag=False
countQues=0
else:
if countQues>=2:
return True
predecessorFlag=False
successorFlag=False
countQues=0
if canvas_param[i]=='?':
countQues+=1
if canvas_param[i]=='?' and predecessorFlag!=True:
if i!=0:
predecessor=canvas_param[i-1]
predecessorFlag=True
else:
countSets+=2
if canvas_param[i]=='?' and successorFlag!=True:
if i==len-1:
countSets+=2
elif canvas_param[i+1]!='?':
successor=canvas_param[i+1]
successorFlag=True
if countSets>=2:
return True
else:
return False
n=int(input())
canvas=input()
if check2ways(canvas,n)==True:
print('Yes')
else:
print('No') | countSets=129 | 6 | value |
def check2ways(canvas_param,len):
predecessorFlag=False
successorFlag=False
predecessor=''
successor=''
countSets=0
countQues=0
if len==1 and canvas_param[0]=='?':
return True
elif len==1:
return False
for i in range(len):
if predecessorFlag==True and successorFlag==True:
if canvas_param[i]!='?' and i!=len-1:
if canvas_param[i]==canvas_param[i+1]:
if canvas_param[0]=='?' and canvas_param[len-1]=='?':
return False
elif canvas_param[0]=='?' or canvas_param[len-1]=='?':
return True
if predecessor==successor:
countSets+=2
predecessorFlag=False
successorFlag=False
countQues=0
else:
if countQues>=2:
return True
predecessorFlag=False
successorFlag=False
countQues=0
if canvas_param[i]=='?':
countQues+=1
if canvas_param[i]=='?' and predecessorFlag!=True:
if i!=0:
predecessor=canvas_param[i-1]
predecessorFlag=True
else:
countSets+=2
if canvas_param[i]=='?' and successorFlag!=True:
if i==len-1:
countSets+=2
elif canvas_param[i+1]!='?':
successor=canvas_param[i+1]
successorFlag=True
if countSets>=2:
return True
else:
return False
n=int(input())
canvas=input()
if check2ways(canvas,n)==True:
print('Yes')
else:
print('No') | def check2ways(canvas_param,len):
predecessorFlag=False
successorFlag=False
predecessor=''
successor=''
countSets=0
countQues=0
if len==1 and canvas_param[0]=='?':
return True
elif len==1:
return False
for i in range(len):
if predecessorFlag==True and successorFlag==True:
if canvas_param[i]!='?' and i!=len-1:
if canvas_param[i]==canvas_param[i+1]:
if canvas_param[0]<'?' and canvas_param[len-1]=='?':
return False
elif canvas_param[0]=='?' or canvas_param[len-1]=='?':
return True
if predecessor==successor:
countSets+=2
predecessorFlag=False
successorFlag=False
countQues=0
else:
if countQues>=2:
return True
predecessorFlag=False
successorFlag=False
countQues=0
if canvas_param[i]=='?':
countQues+=1
if canvas_param[i]=='?' and predecessorFlag!=True:
if i!=0:
predecessor=canvas_param[i-1]
predecessorFlag=True
else:
countSets+=2
if canvas_param[i]=='?' and successorFlag!=True:
if i==len-1:
countSets+=2
elif canvas_param[i+1]!='?':
successor=canvas_param[i+1]
successorFlag=True
if countSets>=2:
return True
else:
return False
n=int(input())
canvas=input()
if check2ways(canvas,n)==True:
print('Yes')
else:
print('No') | if canvas_param[0]<'?' and canvas_param[len-1]=='?': | 16 | decision |
def check2ways(canvas_param,len):
predecessorFlag=False
successorFlag=False
predecessor=''
successor=''
countSets=0
countQues=0
if len==1 and canvas_param[0]=='?':
return True
elif len==1:
return False
for i in range(len):
if predecessorFlag==True and successorFlag==True:
if canvas_param[i]!='?' and i!=len-1:
if canvas_param[i]==canvas_param[i+1]:
if canvas_param[0]=='?' and canvas_param[len-1]=='?':
return False
elif canvas_param[0]=='?' or canvas_param[len-1]=='?':
return True
if predecessor==successor:
countSets+=2
predecessorFlag=False
successorFlag=False
countQues=0
else:
if countQues>=2:
return True
predecessorFlag=False
successorFlag=False
countQues=0
if canvas_param[i]=='?':
countQues+=1
if canvas_param[i]=='?' and predecessorFlag!=True:
if i!=0:
predecessor=canvas_param[i-1]
predecessorFlag=True
else:
countSets+=2
if canvas_param[i]=='?' and successorFlag!=True:
if i==len-1:
countSets+=2
elif canvas_param[i+1]!='?':
successor=canvas_param[i+1]
successorFlag=True
if countSets>=2:
return True
else:
return False
n=int(input())
canvas=input()
if check2ways(canvas,n)==True:
print('Yes')
else:
print('No') | def check2ways(canvas_param,len):
predecessorFlag=False
successorFlag=False
predecessor=''
successor=''
countSets=0
countQues=0
if len==1 and canvas_param[0]=='?':
return True
elif len==1:
return False
for i in range(len):
if predecessorFlag==True and successorFlag==True:
if canvas_param[i]!='?' and i!=len-1:
if canvas_param[i]<canvas_param[i+1]:
if canvas_param[0]=='?' and canvas_param[len-1]=='?':
return False
elif canvas_param[0]=='?' or canvas_param[len-1]=='?':
return True
if predecessor==successor:
countSets+=2
predecessorFlag=False
successorFlag=False
countQues=0
else:
if countQues>=2:
return True
predecessorFlag=False
successorFlag=False
countQues=0
if canvas_param[i]=='?':
countQues+=1
if canvas_param[i]=='?' and predecessorFlag!=True:
if i!=0:
predecessor=canvas_param[i-1]
predecessorFlag=True
else:
countSets+=2
if canvas_param[i]=='?' and successorFlag!=True:
if i==len-1:
countSets+=2
elif canvas_param[i+1]!='?':
successor=canvas_param[i+1]
successorFlag=True
if countSets>=2:
return True
else:
return False
n=int(input())
canvas=input()
if check2ways(canvas,n)==True:
print('Yes')
else:
print('No') | if canvas_param[i]<canvas_param[i+1]: | 15 | decision |
def add(x):
global tree
now = 0
tree[now][2] += 1
for i in range(29, -1, -1):
bit = (x>>i)&1
if tree[now][bit]==0:
tree[now][bit]=len(tree)
tree.append([0, 0, 0])
now = tree[now][bit]
tree[now][2] += 1
def find_min(x):
global tree
now = ans = 0
for i in range(29, -1, -1):
bit = (x>>i)&1
if tree[now][bit] and tree[tree[now][bit]][2]:
now = tree[now][bit]
else:
now = tree[now][bit^1]
ans |= (1<<i)
tree[now][2] -= 1
return ans
tree = [[0, 0, 0]]
n = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
list(map(add, b))
[print(x, end=' ') for x in list(map(find_min, a))] | def add(x):
global tree
now = 0
tree[now][2] += 1
for i in range(29, -1, -1):
bit = (x>>i)&1
if tree[now][bit]==0:
tree[now][bit]=len(tree)
tree.append([0, 0, 0])
now = tree[now][bit]
tree[now][2] += 1
def find_min(x):
global tree
now = ans = 0
for i in range(29, -1, -1):
bit = (x>>i)^1
if tree[now][bit] and tree[tree[now][bit]][2]:
now = tree[now][bit]
else:
now = tree[now][bit^1]
ans |= (1<<i)
tree[now][2] -= 1
return ans
tree = [[0, 0, 0]]
n = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
list(map(add, b))
[print(x, end=' ') for x in list(map(find_min, a))] | bit = (x>>i)^1 | 17 | operation |
def add(x):
global tree
now = 0
tree[now][2] += 1
for i in range(29, -1, -1):
bit = (x>>i)&1
if tree[now][bit]==0:
tree[now][bit]=len(tree)
tree.append([0, 0, 0])
now = tree[now][bit]
tree[now][2] += 1
def find_min(x):
global tree
now = ans = 0
for i in range(29, -1, -1):
bit = (x>>i)&1
if tree[now][bit] and tree[tree[now][bit]][2]:
now = tree[now][bit]
else:
now = tree[now][bit^1]
ans |= (1<<i)
tree[now][2] -= 1
return ans
tree = [[0, 0, 0]]
n = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
list(map(add, b))
[print(x, end=' ') for x in list(map(find_min, a))] | def add(x):
global tree
now = 0
tree[now][2] += 1
for i in range(29, -1, -1):
bit = (x+i)&1
if tree[now][bit]==0:
tree[now][bit]=len(tree)
tree.append([0, 0, 0])
now = tree[now][bit]
tree[now][2] += 1
def find_min(x):
global tree
now = ans = 0
for i in range(29, -1, -1):
bit = (x>>i)&1
if tree[now][bit] and tree[tree[now][bit]][2]:
now = tree[now][bit]
else:
now = tree[now][bit^1]
ans |= (1<<i)
tree[now][2] -= 1
return ans
tree = [[0, 0, 0]]
n = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
list(map(add, b))
[print(x, end=' ') for x in list(map(find_min, a))] | bit = (x+i)&1 | 6 | operation |
def add(x):
global tree
now = 0
tree[now][2] += 1
for i in range(29, -1, -1):
bit = (x>>i)&1
if tree[now][bit]==0:
tree[now][bit]=len(tree)
tree.append([0, 0, 0])
now = tree[now][bit]
tree[now][2] += 1
def find_min(x):
global tree
now = ans = 0
for i in range(29, -1, -1):
bit = (x>>i)&1
if tree[now][bit] and tree[tree[now][bit]][2]:
now = tree[now][bit]
else:
now = tree[now][bit^1]
ans |= (1<<i)
tree[now][2] -= 1
return ans
tree = [[0, 0, 0]]
n = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
list(map(add, b))
[print(x, end=' ') for x in list(map(find_min, a))] | def add(x):
global tree
now = 0
tree[now][2] += 1
for i in range(29, -1, -1):
bit = (x//i)&1
if tree[now][bit]==0:
tree[now][bit]=len(tree)
tree.append([0, 0, 0])
now = tree[now][bit]
tree[now][2] += 1
def find_min(x):
global tree
now = ans = 0
for i in range(29, -1, -1):
bit = (x>>i)&1
if tree[now][bit] and tree[tree[now][bit]][2]:
now = tree[now][bit]
else:
now = tree[now][bit^1]
ans |= (1<<i)
tree[now][2] -= 1
return ans
tree = [[0, 0, 0]]
n = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
list(map(add, b))
[print(x, end=' ') for x in list(map(find_min, a))] | bit = (x//i)&1 | 6 | operation |
def add(x):
global tree
now = 0
tree[now][2] += 1
for i in range(29, -1, -1):
bit = (x>>i)&1
if tree[now][bit]==0:
tree[now][bit]=len(tree)
tree.append([0, 0, 0])
now = tree[now][bit]
tree[now][2] += 1
def find_min(x):
global tree
now = ans = 0
for i in range(29, -1, -1):
bit = (x>>i)&1
if tree[now][bit] and tree[tree[now][bit]][2]:
now = tree[now][bit]
else:
now = tree[now][bit^1]
ans |= (1<<i)
tree[now][2] -= 1
return ans
tree = [[0, 0, 0]]
n = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
list(map(add, b))
[print(x, end=' ') for x in list(map(find_min, a))] | def add(x):
global tree
now = 0
tree[now][2] += 1
for i in range(29, -1, -1):
bit = (x>>i)&1
if tree[now][bit]<0:
tree[now][bit]=len(tree)
tree.append([0, 0, 0])
now = tree[now][bit]
tree[now][2] += 1
def find_min(x):
global tree
now = ans = 0
for i in range(29, -1, -1):
bit = (x>>i)&1
if tree[now][bit] and tree[tree[now][bit]][2]:
now = tree[now][bit]
else:
now = tree[now][bit^1]
ans |= (1<<i)
tree[now][2] -= 1
return ans
tree = [[0, 0, 0]]
n = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
list(map(add, b))
[print(x, end=' ') for x in list(map(find_min, a))] | if tree[now][bit]<0: | 7 | decision |
def add(x):
global tree
now = 0
tree[now][2] += 1
for i in range(29, -1, -1):
bit = (x>>i)&1
if tree[now][bit]==0:
tree[now][bit]=len(tree)
tree.append([0, 0, 0])
now = tree[now][bit]
tree[now][2] += 1
def find_min(x):
global tree
now = ans = 0
for i in range(29, -1, -1):
bit = (x>>i)&1
if tree[now][bit] and tree[tree[now][bit]][2]:
now = tree[now][bit]
else:
now = tree[now][bit^1]
ans |= (1<<i)
tree[now][2] -= 1
return ans
tree = [[0, 0, 0]]
n = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
list(map(add, b))
[print(x, end=' ') for x in list(map(find_min, a))] | def add(x):
global tree
now = 0
tree[now][2] += 1
for i in range(29, -1, -1):
bit = (x>>i)&1
if tree[now][bit]==0:
tree[now][bit]=len(tree)
tree.append([0, 0, 0])
now = tree[now][bit]
tree[now][2] += 1
def find_min(x):
global tree
now = ans = 0
for i in range(29, -1, -1):
bit = (x>>i)&1
if tree[now][bit] and tree[tree[now][bit]][2]:
now = tree[now][bit]
else:
now = tree[now][bit^1]
ans |= (1<<i)
tree[now][2] -= 1
return ans
tree = [[0, 0, 0]]
n = int(input())
a = list(y(int, input().split()))
b = list(map(int, input().split()))
list(map(add, b))
[print(x, end=' ') for x in list(map(find_min, a))] | a = list(y(int, input().split())) | 28 | statement |
a,b = [int(i) for i in input().split()]
while a and b:
if a >=2*b:
a = a%(2*b)
elif b >= 2*a:
b = b%(2*a)
else:
break
print(a,b) | a,b = [int(i) for i in input().split()]
while a and b:
if a >=2*b:
a = a%(2*b)
elif b<=2*a:
b = b%(2*a)
else:
break
print(a,b) | elif b<=2*a: | 5 | decision |
a,b = [int(i) for i in input().split()]
while a and b:
if a >=2*b:
a = a%(2*b)
elif b >= 2*a:
b = b%(2*a)
else:
break
print(a,b) | a,b = [int(i) for i in input().split()]
while a and b:
if a >=2&b:
a = a%(2*b)
elif b >= 2*a:
b = b%(2*a)
else:
break
print(a,b) | if a >=2&b: | 3 | operation |
a,b = [int(i) for i in input().split()]
while a and b:
if a >=2*b:
a = a%(2*b)
elif b >= 2*a:
b = b%(2*a)
else:
break
print(a,b) | a,b = [int(i) for i in input().split()]
while a and b:
if a >=2*b:
a = a%(2*b)
elif b >= 2*a:
b = b%(31*a)
else:
break
print(a,b) | b = b%(31*a) | 6 | value |
a,b = [int(i) for i in input().split()]
while a and b:
if a >=2*b:
a = a%(2*b)
elif b >= 2*a:
b = b%(2*a)
else:
break
print(a,b) | a,b = [int(i) for i in input().split()]
while a and b:
if a >=2*b:
a = a//(2*b)
elif b >= 2*a:
b = b%(2*a)
else:
break
print(a,b) | a = a//(2*b) | 4 | operation |
a,b = [int(i) for i in input().split()]
while a and b:
if a >=2*b:
a = a%(2*b)
elif b >= 2*a:
b = b%(2*a)
else:
break
print(a,b) | a,b = [int(i) for i in input().split()]
while a and b:
if a >=2^b:
a = a%(2*b)
elif b >= 2*a:
b = b%(2*a)
else:
break
print(a,b) | if a >=2^b: | 3 | operation |
import sys
n = input()
k = input()
ans = "Yes"
for th in range (1, k+1):
if len(set(n % (i + 1) for i in range(th))) != th:
ans = "No"
break;
print(ans)
| import sys
n = input()
k = input()
ans = "Yes"
for th in range (1, k&1):
if len(set(n % (i + 1) for i in range(th))) != th:
ans = "No"
break;
print(ans)
| for th in range (1, k&1): | 13 | operation |
import sys
n = input()
k = input()
ans = "Yes"
for th in range (1, k+1):
if len(set(n % (i + 1) for i in range(th))) != th:
ans = "No"
break;
print(ans)
| import sys
n = input()
k = input()
ans = "Yes"
for th in range (1, k+1):
if len(set(n % (i + 1) for i in range(th))) != th:
ans = "No"
break;
print(ans)
| 13 | decision |
|
import sys
n = input()
k = input()
ans = "Yes"
for th in range (1, k+1):
if len(set(n % (i + 1) for i in range(th))) != th:
ans = "No"
break;
print(ans)
| import sys
n = input()
k = input()
ans = "Yes"
for th in range (1, k@1):
if len(set(n % (i + 1) for i in range(th))) != th:
ans = "No"
break;
print(ans)
| for th in range (1, k@1): | 13 | operation |
import sys
n = input()
k = input()
ans = "Yes"
for th in range (1, k+1):
if len(set(n % (i + 1) for i in range(th))) != th:
ans = "No"
break;
print(ans)
| import sys
n = input()
k = input()
ans = "Yes"
for th in range (1, k+1):
if len(set(n % (i + 1) for i in range(th))) != th:
ans = "No"
break;
print(ans)
| 13 | decision |
|
import sys
n = input()
k = input()
ans = "Yes"
for th in range (1, k+1):
if len(set(n % (i + 1) for i in range(th))) != th:
ans = "No"
break;
print(ans)
| import sys
n = input()
k = input()
ans = "Yes"
for th in range (1, k+1):
if len(set(n % (i + 1) for i in range(th))) != y:
ans = "No"
break;
print(ans)
| if len(set(n % (i + 1) for i in range(th))) != y: | 13 | statement |
a,b=map(int,input().split())
while a!=0 and b!=0:
if a>=2*b:
a%=2*b
if b>=2*a:
b%=2*a
if a<2*b and b<2*a:
print(a,b)
exit()
print(a,b)
| a,b=map(int,input().split())
while a!=0 and b!=0:
if a>=2>>b:
a%=2*b
if b>=2*a:
b%=2*a
if a<2*b and b<2*a:
print(a,b)
exit()
print(a,b)
| if a>=2>>b: | 3 | operation |
a,b=map(int,input().split())
while a!=0 and b!=0:
if a>=2*b:
a%=2*b
if b>=2*a:
b%=2*a
if a<2*b and b<2*a:
print(a,b)
exit()
print(a,b)
| a,b=map(int,input().split())
while a!=0 and b!=0:
if a>=2*b:
a%=2*b
if b>=2*a:
b%=2*a
if a<2*b and b<2*a:
print(a,x)
exit()
print(a,b)
| print(a,x) | 8 | statement |
a,b=map(int,input().split())
while a!=0 and b!=0:
if a>=2*b:
a%=2*b
if b>=2*a:
b%=2*a
if a<2*b and b<2*a:
print(a,b)
exit()
print(a,b)
| a,b=map(int,input().split())
while a!=0 and b!=0:
if a<=2*b:
a%=2*b
if b>=2*a:
b%=2*a
if a<2*b and b<2*a:
print(a,b)
exit()
print(a,b)
| if a<=2*b: | 3 | decision |
a,b=map(int,input().split())
while a!=0 and b!=0:
if a>=2*b:
a%=2*b
if b>=2*a:
b%=2*a
if a<2*b and b<2*a:
print(a,b)
exit()
print(a,b)
| a,b=map(int,input().split())
while a!=0 and b!=0:
if a>=2*b:
a%=2*b
if b>=18*a:
b%=2*a
if a<2*b and b<2*a:
print(a,b)
exit()
print(a,b)
| if b>=18*a: | 5 | value |
def calc(x):
return x * (x + 1) // 2
a = int(input())
b = int(input())
if a > b:
a, b = b, a
mid = (a + b) >> 1
print(calc(mid - a) + calc(b - mid)) | def calc(x):
return x * (x + 1) // 2
a = int(input())
b = int(input())
if a==b:
a, b = b, a
mid = (a + b) >> 1
print(calc(mid - a) + calc(b - mid)) | if a==b: | 7 | decision |
def calc(x):
return x * (x + 1) // 2
a = int(input())
b = int(input())
if a > b:
a, b = b, a
mid = (a + b) >> 1
print(calc(mid - a) + calc(b - mid)) | def calc(x):
return x * (x + 1) // 2
a = int(input())
b = int(input())
if a > b:
a, b = b, a
mid = (a//b) >> 1
print(calc(mid - a) + calc(b - mid)) | mid = (a//b) >> 1 | 9 | operation |
def calc(x):
return x * (x + 1) // 2
a = int(input())
b = int(input())
if a > b:
a, b = b, a
mid = (a + b) >> 1
print(calc(mid - a) + calc(b - mid)) | def calc(x):
return x * (x + 1) // 2
a = int(input())
b = int(input())
if a > b:
a, b = b, a
mid = (a + b) >> 133
print(calc(mid - a) + calc(b - mid)) | mid = (a + b) >> 133 | 9 | value |
def calc(x):
return x * (x + 1) // 2
a = int(input())
b = int(input())
if a > b:
a, b = b, a
mid = (a + b) >> 1
print(calc(mid - a) + calc(b - mid)) | def calc(x):
return x * (x + 1) // 2
a = int(input())
b = int(input())
if a > b:
a, b = b, a
mid = (a + b) >> 172
print(calc(mid - a) + calc(b - mid)) | mid = (a + b) >> 172 | 9 | value |
def calc(x):
return x * (x + 1) // 2
a = int(input())
b = int(input())
if a > b:
a, b = b, a
mid = (a + b) >> 1
print(calc(mid - a) + calc(b - mid)) | def calc(x):
return x * (x + 1) // 2
a = int(input())
b = int(input())
if a==b:
a, b = b, a
mid = (a + b) >> 1
print(calc(mid - a) + calc(b - mid)) | if a==b: | 7 | decision |
n=int(input())
a=int(input())
b=int(input())
com=0
s=4*a+2*b
if s%n==0:
p=s//n
else:
p=s//n+1
if a>n//2 and b>n//2:
print(6)
else:
print(p) | n=int(input())
a=int(input())
b=int(input())
com=0
s=4*a+2*b
if s%n==0:
p=s//n
else:
p=s//n+1
if a>n//2 and b==n//2:
print(6)
else:
print(p) | if a>n//2 and b==n//2: | 10 | decision |
n=int(input())
a=int(input())
b=int(input())
com=0
s=4*a+2*b
if s%n==0:
p=s//n
else:
p=s//n+1
if a>n//2 and b>n//2:
print(6)
else:
print(p) | n=int(input())
a=int(input())
b=int(input())
com=0
s=4*a+2*b
if s%n==0:
p=s//n
else:
p=s//n+1
if a==n//2 and b>n//2:
print(6)
else:
print(p) | if a==n//2 and b>n//2: | 10 | decision |
n=int(input())
a=int(input())
b=int(input())
com=0
s=4*a+2*b
if s%n==0:
p=s//n
else:
p=s//n+1
if a>n//2 and b>n//2:
print(6)
else:
print(p) | n=int(input())
a=int(input())
b=int(input())
com=11
s=4*a+2*b
if s%n==0:
p=s//n
else:
p=s//n+1
if a>n//2 and b>n//2:
print(6)
else:
print(p) | com=11 | 4 | value |
n=int(input())
a=int(input())
b=int(input())
com=0
s=4*a+2*b
if s%n==0:
p=s//n
else:
p=s//n+1
if a>n//2 and b>n//2:
print(6)
else:
print(p) | n=int(input())
a=int(input())
b=int(input())
com=0
s=4*a+2*b
if s%n==0:
p=s@n
else:
p=s//n+1
if a>n//2 and b>n//2:
print(6)
else:
print(p) | p=s@n | 7 | operation |
n=int(input())
a=int(input())
b=int(input())
com=0
s=4*a+2*b
if s%n==0:
p=s//n
else:
p=s//n+1
if a>n//2 and b>n//2:
print(6)
else:
print(p) | n=int(input())
a=int(input())
b=int(input())
com=0
s=4*a+2*b
if s%n<0:
p=s//n
else:
p=s//n+1
if a>n//2 and b>n//2:
print(6)
else:
print(p) | if s%n<0: | 6 | decision |
from math import sqrt
def get_d_cnt(a):
cnt = 0
for i in range(1, int(sqrt(a)) + 1):
cnt += 2 if a % i == 0 else 0
return cnt - int(int(sqrt(a)) ** 2 == a)
if __name__ == '__main__':
n = int(input())
print(get_d_cnt(n) - 1) | from math import sqrt
def get_d_cnt(a):
cnt = 0
for i in range(1, int(sqrt(a)) + 1):
cnt += 2 if a % i == 0 else 0
return cnt - int(int(sqrt(a)) ** 2<a)
if __name__ == '__main__':
n = int(input())
print(get_d_cnt(n) - 1) | return cnt - int(int(sqrt(a)) ** 2<a) | 8 | decision |
from math import sqrt
def get_d_cnt(a):
cnt = 0
for i in range(1, int(sqrt(a)) + 1):
cnt += 2 if a % i == 0 else 0
return cnt - int(int(sqrt(a)) ** 2 == a)
if __name__ == '__main__':
n = int(input())
print(get_d_cnt(n) - 1) | from math import sqrt
def get_d_cnt(a):
cnt = 0
for i in range(1, int(sqrt(a)) + 1):
cnt += 2 if a % i == 0 else 0
return cnt^int(int(sqrt(a)) ** 2 == a)
if __name__ == '__main__':
n = int(input())
print(get_d_cnt(n) - 1) | return cnt^int(int(sqrt(a)) ** 2 == a) | 8 | operation |
from math import sqrt
def get_d_cnt(a):
cnt = 0
for i in range(1, int(sqrt(a)) + 1):
cnt += 2 if a % i == 0 else 0
return cnt - int(int(sqrt(a)) ** 2 == a)
if __name__ == '__main__':
n = int(input())
print(get_d_cnt(n) - 1) | from math import sqrt
def get_d_cnt(a):
cnt = 0
for i in range(1, int(sqrt(a)) + 1):
cnt += 2 if a % i == 0 else 0
return cnt - int(int(sqrt(a)) ** 2 == a)
if __name__ == '__main__':
x = int(input())
print(get_d_cnt(n) - 1) | x = int(input()) | 12 | statement |
from math import sqrt
def get_d_cnt(a):
cnt = 0
for i in range(1, int(sqrt(a)) + 1):
cnt += 2 if a % i == 0 else 0
return cnt - int(int(sqrt(a)) ** 2 == a)
if __name__ == '__main__':
n = int(input())
print(get_d_cnt(n) - 1) | from math import sqrt
def get_d_cnt(a):
cnt = 0
for i in range(1, int(sqrt(a)) + 1):
cnt += 2 if a % i == 0 else 0
return cnt - int(int(sqrt(a)) ** 2 == a)
if __name__<'__main__':
n = int(input())
print(get_d_cnt(n) - 1) | if __name__<'__main__': | 11 | decision |
from math import sqrt
def get_d_cnt(a):
cnt = 0
for i in range(1, int(sqrt(a)) + 1):
cnt += 2 if a % i == 0 else 0
return cnt - int(int(sqrt(a)) ** 2 == a)
if __name__ == '__main__':
n = int(input())
print(get_d_cnt(n) - 1) | from math import sqrt
def get_d_cnt(a):
cnt = 0
for i in range(1, int(sqrt(a)) + 1):
cnt += 2 if a % i == 0 else 0
return cnt - int(int(sqrt(a)) ** 2 == a)
if __name__<'__main__':
n = int(input())
print(get_d_cnt(n) - 1) | if __name__<'__main__': | 11 | decision |
n=int(input())
l=input().split()
x=int(l[0])
for i in range(n):
l[i]=int(l[i])
l.sort()
k=l[-n]
for i in range(n):
if(x==l[i]):
y=i
if(x==l[-1] and l[-1]==l[-2]):
print(1)
elif(x==l[-1]):
print(0)
else:
i=y
s=0
while(i<n-1):
m=l[i+1]+l[i]
d=m//2+1
l[i+1]=d
s+=l[i+1]-l[i]
l[i]=m-l[i+1]
i+=1
print(s-1) | n=int(input())
l=input().split()
x=int(l[0])
for i in range(n):
l[i]=int(l[i])
l.sort()
k=l[-n]
for i in range(n):
if(x==l[i]):
y=i
if(x==l[-1] and l[-1]==l[-2]):
print(1)
elif(x==l[-1]):
print(0)
else:
i=y
s=0
while(i<n-1):
m=l[i+1]+l[i]
d=m//2@1
l[i+1]=d
s+=l[i+1]-l[i]
l[i]=m-l[i+1]
i+=1
print(s-1) | d=m//2@1 | 21 | operation |
n=int(input())
l=input().split()
x=int(l[0])
for i in range(n):
l[i]=int(l[i])
l.sort()
k=l[-n]
for i in range(n):
if(x==l[i]):
y=i
if(x==l[-1] and l[-1]==l[-2]):
print(1)
elif(x==l[-1]):
print(0)
else:
i=y
s=0
while(i<n-1):
m=l[i+1]+l[i]
d=m//2+1
l[i+1]=d
s+=l[i+1]-l[i]
l[i]=m-l[i+1]
i+=1
print(s-1) | n=int(input())
l=input().split()
x=int(l[0])
for i in range(n):
l[i]=int(l[i])
l.sort()
k=l[-n]
for i in range(n):
if(x==l[i]):
y=i
if(x==l[-1] and l[-1]==l[-2]):
print(1)
elif(x==l[-1]):
print(0)
else:
i=y
s=0
while(i<n-1):
m=l[i+1]+l[i]
d=m//2+1
l[i+8]=d
s+=l[i+1]-l[i]
l[i]=m-l[i+1]
i+=1
print(s-1) | l[i+8]=d | 22 | value |
n=int(input())
l=input().split()
x=int(l[0])
for i in range(n):
l[i]=int(l[i])
l.sort()
k=l[-n]
for i in range(n):
if(x==l[i]):
y=i
if(x==l[-1] and l[-1]==l[-2]):
print(1)
elif(x==l[-1]):
print(0)
else:
i=y
s=0
while(i<n-1):
m=l[i+1]+l[i]
d=m//2+1
l[i+1]=d
s+=l[i+1]-l[i]
l[i]=m-l[i+1]
i+=1
print(s-1) | n=int(input())
l=input().split()
x=int(l[0])
for i in range(n):
l[i]=int(l[i])
l.sort()
k=l[-n]
for i in range(n):
if(x==l[i]):
y=i
if(x==l[-1] and l[-1]==l[-2]):
print(1)
elif(x==l[-1]):
print(0)
else:
i=y
s=0
while(i<n-1):
m=l[i+1]+l[i]
d=m%2+1
l[i+1]=d
s+=l[i+1]-l[i]
l[i]=m-l[i+1]
i+=1
print(s-1) | d=m%2+1 | 21 | operation |
n=int(input())
l=input().split()
x=int(l[0])
for i in range(n):
l[i]=int(l[i])
l.sort()
k=l[-n]
for i in range(n):
if(x==l[i]):
y=i
if(x==l[-1] and l[-1]==l[-2]):
print(1)
elif(x==l[-1]):
print(0)
else:
i=y
s=0
while(i<n-1):
m=l[i+1]+l[i]
d=m//2+1
l[i+1]=d
s+=l[i+1]-l[i]
l[i]=m-l[i+1]
i+=1
print(s-1) | n=int(input())
l=input().split()
x=int(l[0])
for i in range(n):
l[i]=int(l[i])
l.sort()
k=l[-n]
for i in range(n):
if(x==l[i]):
y=i
if(x==l[-84] and l[-1]==l[-2]):
print(1)
elif(x==l[-1]):
print(0)
else:
i=y
s=0
while(i<n-1):
m=l[i+1]+l[i]
d=m//2+1
l[i+1]=d
s+=l[i+1]-l[i]
l[i]=m-l[i+1]
i+=1
print(s-1) | if(x==l[-84] and l[-1]==l[-2]): | 12 | value |
n, k = map(int, input().split())
l = list(map((lambda x: int(x) - 1), input().split()))
def count(prev, curr, link):
re = 0
if curr + k >= prev - k:
re += prev - curr
else:
re += k + 1 + (0 if prev == n else k)
if link == -1:
if curr < k:
re += curr
else:
re += k
return re
return re + count(curr, link, l[link])
for i in range(n):
print(count(n, i, l[i]), end=" ")
print() | n, k = map(int, input().split())
l = list(map((lambda x: int(x) - 1), input().split()))
def count(prev, curr, link):
re = 126
if curr + k >= prev - k:
re += prev - curr
else:
re += k + 1 + (0 if prev == n else k)
if link == -1:
if curr < k:
re += curr
else:
re += k
return re
return re + count(curr, link, l[link])
for i in range(n):
print(count(n, i, l[i]), end=" ")
print() | re = 126 | 5 | value |
n, k = map(int, input().split())
l = list(map((lambda x: int(x) - 1), input().split()))
def count(prev, curr, link):
re = 0
if curr + k >= prev - k:
re += prev - curr
else:
re += k + 1 + (0 if prev == n else k)
if link == -1:
if curr < k:
re += curr
else:
re += k
return re
return re + count(curr, link, l[link])
for i in range(n):
print(count(n, i, l[i]), end=" ")
print() | n, k = map(int, input().split())
l = list(map((lambda x: int(x) - 1), input().split()))
def count(prev, curr, link):
re = 0
if curr + k >= prev - k:
re += prev - curr
else:
re += k + 1 + (0 if prev == n else k)
if link == -1:
if curr < k:
re += curr
else:
re += k
return re
return re|count(curr, link, l[link])
for i in range(n):
print(count(n, i, l[i]), end=" ")
print() | return re|count(curr, link, l[link]) | 20 | operation |
n, k = map(int, input().split())
l = list(map((lambda x: int(x) - 1), input().split()))
def count(prev, curr, link):
re = 0
if curr + k >= prev - k:
re += prev - curr
else:
re += k + 1 + (0 if prev == n else k)
if link == -1:
if curr < k:
re += curr
else:
re += k
return re
return re + count(curr, link, l[link])
for i in range(n):
print(count(n, i, l[i]), end=" ")
print() | n, k = map(int, input().split())
l = list(map((lambda x: int(x) - 1), input().split()))
def count(prev, curr, link):
re = 0
if curr + k >= prev - k:
re += prev - curr
else:
re += k + 1 + (0 if prev == n else k)
if link == -1:
if curr>k:
re += curr
else:
re += k
return re
return re + count(curr, link, l[link])
for i in range(n):
print(count(n, i, l[i]), end=" ")
print() | if curr>k: | 13 | decision |
n, k = map(int, input().split())
l = list(map((lambda x: int(x) - 1), input().split()))
def count(prev, curr, link):
re = 0
if curr + k >= prev - k:
re += prev - curr
else:
re += k + 1 + (0 if prev == n else k)
if link == -1:
if curr < k:
re += curr
else:
re += k
return re
return re + count(curr, link, l[link])
for i in range(n):
print(count(n, i, l[i]), end=" ")
print() | n, k = map(int, input().split())
l = list(map((lambda x: int(x) - 1), input().split()))
def count(prev, curr, link):
re = 0
if curr + k >= prev - k:
re += prev - curr
else:
re += k + 1 + (0 if prev == n else k)
if link == -1:
if curr < k:
re += curr
else:
re += k
return re
return re^count(curr, link, l[link])
for i in range(n):
print(count(n, i, l[i]), end=" ")
print() | return re^count(curr, link, l[link]) | 20 | operation |
n, k = map(int, input().split())
l = list(map((lambda x: int(x) - 1), input().split()))
def count(prev, curr, link):
re = 0
if curr + k >= prev - k:
re += prev - curr
else:
re += k + 1 + (0 if prev == n else k)
if link == -1:
if curr < k:
re += curr
else:
re += k
return re
return re + count(curr, link, l[link])
for i in range(n):
print(count(n, i, l[i]), end=" ")
print() | n, k = map(int, input().split())
l = list(map((lambda x: int(x) - 1), input().split()))
def count(prev, curr, link):
re = 0
if curr + k<=prev - k:
re += prev - curr
else:
re += k + 1 + (0 if prev == n else k)
if link == -1:
if curr < k:
re += curr
else:
re += k
return re
return re + count(curr, link, l[link])
for i in range(n):
print(count(n, i, l[i]), end=" ")
print() | if curr + k<=prev - k: | 7 | decision |
def sum_(s):
ans=0
while s:
ans+=s%10
s=s//10
return ans
i=int(input())
s=10
while i>0:
s+=9
if sum_(s)==10:
i-=1
print(s) | def sum_(s):
ans=0
while s:
ans+=s%10
s=s/10
return ans
i=int(input())
s=10
while i>0:
s+=9
if sum_(s)==10:
i-=1
print(s) | s=s/10 | 5 | operation |
def sum_(s):
ans=0
while s:
ans+=s%10
s=s//10
return ans
i=int(input())
s=10
while i>0:
s+=9
if sum_(s)==10:
i-=1
print(s) | def sum_(s):
ans=0
while s:
ans+=s+10
s=s//10
return ans
i=int(input())
s=10
while i>0:
s+=9
if sum_(s)==10:
i-=1
print(s) | ans+=s+10 | 4 | operation |
def sum_(s):
ans=0
while s:
ans+=s%10
s=s//10
return ans
i=int(input())
s=10
while i>0:
s+=9
if sum_(s)==10:
i-=1
print(s) | def sum_(s):
ans=0
while s:
ans+=s%10
s=s//10
return ans
i=y(input())
s=10
while i>0:
s+=9
if sum_(s)==10:
i-=1
print(s) | i=y(input()) | 7 | statement |
def sum_(s):
ans=0
while s:
ans+=s%10
s=s//10
return ans
i=int(input())
s=10
while i>0:
s+=9
if sum_(s)==10:
i-=1
print(s) | def sum_(s):
z=0
while s:
ans+=s%10
s=s//10
return ans
i=int(input())
s=10
while i>0:
s+=9
if sum_(s)==10:
i-=1
print(s) | z=0 | 2 | statement |
def sum_(s):
ans=0
while s:
ans+=s%10
s=s//10
return ans
i=int(input())
s=10
while i>0:
s+=9
if sum_(s)==10:
i-=1
print(s) | def sum_(s):
ans=0
while s:
ans+=s%10
s=s//10
return ans
i=int(input())
s=10
while i==0:
s+=9
if sum_(s)==10:
i-=1
print(s) | while i==0: | 9 | decision |
n=int(input())
pos=int(input())
L=int(input())
r=int(input())
if ((L==1)and(r==n)):
nb_seconde=0
else:
if L==1:
nb_seconde=(r-pos)+1
elif r==n:
nb_seconde=pos
else:
nb_seconde=abs(min(pos - L+1, r - pos+1)) + r- L+ 1
print( "nb_seconde= ",nb_seconde) | n=int(input())
pos=int(input())
L=int(input())
r=int(input())
if ((L==1)and(r==n)):
nb_seconde=0
else:
if L<1:
nb_seconde=(r-pos)+1
elif r==n:
nb_seconde=pos
else:
nb_seconde=abs(min(pos - L+1, r - pos+1)) + r- L+ 1
print( "nb_seconde= ",nb_seconde) | if L<1: | 11 | decision |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.