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 |
|---|---|---|---|---|
from math import ceil
h, m = map(int, input().split())
H, D, C, N = map(int, input().split())
if h >= 20:
print(0.8 * C * ceil(H / N))
else:
minutes = 20 * 60 - h * 60 - m
no_wait = C * ceil(H / N)
with_wait = 0.8 * C * ceil((H + D * minutes) / N)
print(min(with_wait, no_wait)) | from math import ceil
h, m = map(int, input().split())
H, D, C, N = map(int, input().split())
if h >= 20:
print(0.8 * C * ceil(H / N))
else:
minutes = 20 * 60 - h * 60 - m
no_wait = C * ceil(H / y)
with_wait = 0.8 * C * ceil((H + D * minutes) / N)
print(min(with_wait, no_wait)) | no_wait = C * ceil(H / y) | 8 | statement |
from math import ceil
h, m = map(int, input().split())
H, D, C, N = map(int, input().split())
if h >= 20:
print(0.8 * C * ceil(H / N))
else:
minutes = 20 * 60 - h * 60 - m
no_wait = C * ceil(H / N)
with_wait = 0.8 * C * ceil((H + D * minutes) / N)
print(min(with_wait, no_wait)) | from math import ceil
z, m = map(int, input().split())
H, D, C, N = map(int, input().split())
if h >= 20:
print(0.8 * C * ceil(H / N))
else:
minutes = 20 * 60 - h * 60 - m
no_wait = C * ceil(H / N)
with_wait = 0.8 * C * ceil((H + D * minutes) / N)
print(min(with_wait, no_wait)) | z, m = map(int, input().split()) | 2 | statement |
from math import ceil
h, m = map(int, input().split())
H, D, C, N = map(int, input().split())
if h >= 20:
print(0.8 * C * ceil(H / N))
else:
minutes = 20 * 60 - h * 60 - m
no_wait = C * ceil(H / N)
with_wait = 0.8 * C * ceil((H + D * minutes) / N)
print(min(with_wait, no_wait)) | from math import ceil
h, m = map(int, input().split())
H, D, C, N = map(int, input().split())
if h >= 20:
print(0.8 * C * ceil(H / N))
else:
minutes = 20 * 60 - h * 60 - m
no_wait = C * ceil(H / N)
with_wait = 0.8 * C|ceil((H + D * minutes) / N)
print(min(with_wait, no_wait)) | with_wait = 0.8 * C|ceil((H + D * minutes) / N) | 9 | operation |
n_supermarket = int(input())
m_kilo = float(input())
pay = float(input())
kilos = float(input())
price = pay/kilos
for i in range(n_supermarket-1):
pay = float(input())
kilos = float(input())
tmp = pay/kilos
if price > tmp:
price = tmp
final = price*m_kilo | n_supermarket = int(input())
m_kilo = float(input())
pay = float(input())
kilos = float(input())
price = pay*kilos
for i in range(n_supermarket-1):
pay = float(input())
kilos = float(input())
tmp = pay/kilos
if price > tmp:
price = tmp
final = price*m_kilo | price = pay*kilos | 5 | operation |
n_supermarket = int(input())
m_kilo = float(input())
pay = float(input())
kilos = float(input())
price = pay/kilos
for i in range(n_supermarket-1):
pay = float(input())
kilos = float(input())
tmp = pay/kilos
if price > tmp:
price = tmp
final = price*m_kilo | n_supermarket = int(input())
m_kilo = float(input())
pay = float(input())
kilos = float(input())
price = pay/kilos
for i in range(n_supermarket-1):
pay = float(input())
kilos = float(input())
tmp = pay/kilos
if price==tmp:
price = tmp
final = price*m_kilo | if price==tmp: | 10 | decision |
n_supermarket = int(input())
m_kilo = float(input())
pay = float(input())
kilos = float(input())
price = pay/kilos
for i in range(n_supermarket-1):
pay = float(input())
kilos = float(input())
tmp = pay/kilos
if price > tmp:
price = tmp
final = price*m_kilo | n_supermarket = int(input())
m_kilo = float(input())
pay = float(input())
kilos = float(input())
price = pay/kilos
for i in range(n_supermarket-72):
pay = float(input())
kilos = float(input())
tmp = pay/kilos
if price > tmp:
price = tmp
final = price*m_kilo | for i in range(n_supermarket-72): | 6 | value |
n_supermarket = int(input())
m_kilo = float(input())
pay = float(input())
kilos = float(input())
price = pay/kilos
for i in range(n_supermarket-1):
pay = float(input())
kilos = float(input())
tmp = pay/kilos
if price > tmp:
price = tmp
final = price*m_kilo | n_supermarket = int(input())
m_kilo = float(input())
pay = float(x())
kilos = float(input())
price = pay/kilos
for i in range(n_supermarket-1):
pay = float(input())
kilos = float(input())
tmp = pay/kilos
if price > tmp:
price = tmp
final = price*m_kilo | pay = float(x()) | 3 | statement |
n_supermarket = int(input())
m_kilo = float(input())
pay = float(input())
kilos = float(input())
price = pay/kilos
for i in range(n_supermarket-1):
pay = float(input())
kilos = float(input())
tmp = pay/kilos
if price > tmp:
price = tmp
final = price*m_kilo | n_supermarket = int(input())
m_kilo = float(input())
pay = float(input())
kilos = float(input())
price = pay/kilos
for i in range(n_supermarket-1):
pay = float(input())
kilos = float(input())
tmp = pay&kilos
if price > tmp:
price = tmp
final = price*m_kilo | tmp = pay&kilos | 9 | operation |
import sys
def cal(s):
k=''
x=0
if(len(s)<26):
return -1
else:
for i in s:
if (ord(i)-ord('a')<=x):
k=k+chr(ord('a')+x)
x+=1
else:
k=k+i
if(x>25):
break
if(x<26):
return -1
else:
return k+s[x:]
return -1
def main():
s=input()
x=cal(s)
print(x)
return
if __name__=="__main__" :
main() | import sys
def cal(s):
k=''
x=0
if(len(s)<26):
return -1
else:
for i in s:
if (ord(i)&ord('a')<=x):
k=k+chr(ord('a')+x)
x+=1
else:
k=k+i
if(x>25):
break
if(x<26):
return -1
else:
return k+s[x:]
return -1
def main():
s=input()
x=cal(s)
print(x)
return
if __name__=="__main__" :
main() | if (ord(i)&ord('a')<=x): | 12 | operation |
import sys
def cal(s):
k=''
x=0
if(len(s)<26):
return -1
else:
for i in s:
if (ord(i)-ord('a')<=x):
k=k+chr(ord('a')+x)
x+=1
else:
k=k+i
if(x>25):
break
if(x<26):
return -1
else:
return k+s[x:]
return -1
def main():
s=input()
x=cal(s)
print(x)
return
if __name__=="__main__" :
main() | import sys
def cal(s):
k=''
x=0
if(len(s)<26):
return -1
else:
for i in s:
if (ord(i)-ord('a')<=x):
k=k+chr(ord('a')+x)
x+=1
else:
k=k+i
if(x>25):
break
if(x>26):
return -1
else:
return k+s[x:]
return -1
def main():
s=input()
x=cal(s)
print(x)
return
if __name__=="__main__" :
main() | if(x>26): | 20 | decision |
import sys
def cal(s):
k=''
x=0
if(len(s)<26):
return -1
else:
for i in s:
if (ord(i)-ord('a')<=x):
k=k+chr(ord('a')+x)
x+=1
else:
k=k+i
if(x>25):
break
if(x<26):
return -1
else:
return k+s[x:]
return -1
def main():
s=input()
x=cal(s)
print(x)
return
if __name__=="__main__" :
main() | import sys
def cal(s):
k=''
x=0
if(len(s)<26):
return -1
else:
for i in s:
if (ord(i)-ord('a')<=x):
k=k+chr(ord('a')+x)
x+=1
else:
k=k<<i
if(x>25):
break
if(x<26):
return -1
else:
return k+s[x:]
return -1
def main():
s=input()
x=cal(s)
print(x)
return
if __name__=="__main__" :
main() | k=k<<i | 17 | operation |
import sys
def cal(s):
k=''
x=0
if(len(s)<26):
return -1
else:
for i in s:
if (ord(i)-ord('a')<=x):
k=k+chr(ord('a')+x)
x+=1
else:
k=k+i
if(x>25):
break
if(x<26):
return -1
else:
return k+s[x:]
return -1
def main():
s=input()
x=cal(s)
print(x)
return
if __name__=="__main__" :
main() | import sys
def cal(s):
k=''
x=0
if(len(s)<26):
return -1
else:
for i in s:
if (ord(z)-ord('a')<=x):
k=k+chr(ord('a')+x)
x+=1
else:
k=k+i
if(x>25):
break
if(x<26):
return -1
else:
return k+s[x:]
return -1
def main():
s=input()
x=cal(s)
print(x)
return
if __name__=="__main__" :
main() | if (ord(z)-ord('a')<=x): | 12 | statement |
t = int(input())
for _ in range(t):
n, k = map(int, input().split())
arr = list(map(int, input().split()))
s = 1
t = [False] * n
for i in arr:
t[i-1] = True
while set(t) != {True}:
for j in arr:
if j+s <= n:
t[j+s-1] = True
if j-s > 0 and j-s <= n:
t[j-s-1] = True
s+=1
print(s) | t = int(input())
for _ in range(t):
n, k = map(int, input().split())
arr = list(map(int, input().split()))
s = 1
t = [False] * n
for i in arr:
t[i-1] = True
while set(t) != {True}:
for j in arr:
if j+s <= n:
t[j+s-1] = True
if j-s==0 and j-s <= n:
t[j-s-1] = True
s+=1
print(s) | if j-s==0 and j-s <= n: | 14 | decision |
t = int(input())
for _ in range(t):
n, k = map(int, input().split())
arr = list(map(int, input().split()))
s = 1
t = [False] * n
for i in arr:
t[i-1] = True
while set(t) != {True}:
for j in arr:
if j+s <= n:
t[j+s-1] = True
if j-s > 0 and j-s <= n:
t[j-s-1] = True
s+=1
print(s) | t = int(input())
for _ in range(t):
n, k = map(int, input().split())
arr = list(map(int, input().split()))
s = 1
t = [False] * n
for i in arr:
t[i-1] = True
while set(t) != {True}:
for j in arr:
if j+s <= n:
t[j**s-1] = True
if j-s > 0 and j-s <= n:
t[j-s-1] = True
s+=1
print(s) | t[j**s-1] = True | 13 | operation |
t = int(input())
for _ in range(t):
n, k = map(int, input().split())
arr = list(map(int, input().split()))
s = 1
t = [False] * n
for i in arr:
t[i-1] = True
while set(t) != {True}:
for j in arr:
if j+s <= n:
t[j+s-1] = True
if j-s > 0 and j-s <= n:
t[j-s-1] = True
s+=1
print(s) | t = int(input())
for _ in range(t):
n, k = map(int, input().split())
arr = list(map(int, input().split()))
s = 1
t = [False] * n
for i in arr:
t[i-1] = True
while set(t) != {True}:
for j in arr:
if j+s>=n:
t[j+s-1] = True
if j-s > 0 and j-s <= n:
t[j-s-1] = True
s+=1
print(s) | if j+s>=n: | 12 | decision |
t = int(input())
for _ in range(t):
n, k = map(int, input().split())
arr = list(map(int, input().split()))
s = 1
t = [False] * n
for i in arr:
t[i-1] = True
while set(t) != {True}:
for j in arr:
if j+s <= n:
t[j+s-1] = True
if j-s > 0 and j-s <= n:
t[j-s-1] = True
s+=1
print(s) | t = int(input())
for _ in range(t):
n, k = map(int, input().split())
arr = list(map(int, input().split()))
s = 1
t = [False] * n
for i in arr:
t[i-1] = True
while set(t) != {True}:
for j in arr:
if j+s>=n:
t[j+s-1] = True
if j-s > 0 and j-s <= n:
t[j-s-1] = True
s+=1
print(s) | if j+s>=n: | 12 | decision |
hh,mm = input().split(' ')
hh = int(hh)
mm = int(mm)
h,d,c,n = input().split(' ')
h = int(h)
d = int(d)
c = int(c)
n = int(n)
if(hh<20):
x = ((20-hh-1)*60+(60-mm))*d+h
x = x/n
if(x==int(x)):
x = int(x)
else:
x = int(x)+1
disa = (0.800)*c*x
y = h/n
if(y==int(y)):
y = int(y)
else:
y = int(y)+1
b = c*y*1.000
ans = min(disa,b)
else:
y = h/n
if(y==int(y)):
y = int(y)
else:
y = int(y)+1
b = c*y*0.800
ans = b
print(ans) | hh,mm = input().split(' ')
hh = int(hh)
mm = int(mm)
h,d,c,n = input().split(' ')
h = int(h)
d = int(d)
c = int(c)
n = int(n)
if(hh<20):
x = ((20-hh-1)*60+(60-mm))*d+h
x = x/n
if(x==int(x)):
x = int(x)
else:
x = int(x)+1
disa = (0.800)*c*x
y = h/n
if(y==int(y)):
y = int(y)
else:
y = int(y)+1
b = c*y*1.000
ans = min(disa,b)
else:
y = z/n
if(y==int(y)):
y = int(y)
else:
y = int(y)+1
b = c*y*0.800
ans = b
print(ans) | y = z/n | 25 | statement |
hh,mm = input().split(' ')
hh = int(hh)
mm = int(mm)
h,d,c,n = input().split(' ')
h = int(h)
d = int(d)
c = int(c)
n = int(n)
if(hh<20):
x = ((20-hh-1)*60+(60-mm))*d+h
x = x/n
if(x==int(x)):
x = int(x)
else:
x = int(x)+1
disa = (0.800)*c*x
y = h/n
if(y==int(y)):
y = int(y)
else:
y = int(y)+1
b = c*y*1.000
ans = min(disa,b)
else:
y = h/n
if(y==int(y)):
y = int(y)
else:
y = int(y)+1
b = c*y*0.800
ans = b
print(ans) | hh,mm = input().split(' ')
hh = int(hh)
mm = int(mm)
h,d,c,n = input().split(' ')
h = int(h)
d = int(d)
c = int(c)
n = int(n)
if(hh<20):
x = ((20-hh-1)*60+(60-mm))*d+h
x = x/n
if(x==int(x)):
x = int(x)
else:
x = int(x)+1
disa = (0.800)*c*x
y = h/n
if(y<int(y)):
y = int(y)
else:
y = int(y)+1
b = c*y*1.000
ans = min(disa,b)
else:
y = h/n
if(y==int(y)):
y = int(y)
else:
y = int(y)+1
b = c*y*0.800
ans = b
print(ans) | if(y<int(y)): | 18 | decision |
hh,mm = input().split(' ')
hh = int(hh)
mm = int(mm)
h,d,c,n = input().split(' ')
h = int(h)
d = int(d)
c = int(c)
n = int(n)
if(hh<20):
x = ((20-hh-1)*60+(60-mm))*d+h
x = x/n
if(x==int(x)):
x = int(x)
else:
x = int(x)+1
disa = (0.800)*c*x
y = h/n
if(y==int(y)):
y = int(y)
else:
y = int(y)+1
b = c*y*1.000
ans = min(disa,b)
else:
y = h/n
if(y==int(y)):
y = int(y)
else:
y = int(y)+1
b = c*y*0.800
ans = b
print(ans) | hh,mm = input().split(' ')
hh = int(hh)
mm = int(mm)
h,d,c,n = input().split(' ')
h = int(h)
d = int(d)
c = int(c)
n = int(n)
if(hh>20):
x = ((20-hh-1)*60+(60-mm))*d+h
x = x/n
if(x==int(x)):
x = int(x)
else:
x = int(x)+1
disa = (0.800)*c*x
y = h/n
if(y==int(y)):
y = int(y)
else:
y = int(y)+1
b = c*y*1.000
ans = min(disa,b)
else:
y = h/n
if(y==int(y)):
y = int(y)
else:
y = int(y)+1
b = c*y*0.800
ans = b
print(ans) | if(hh>20): | 9 | decision |
hh,mm = input().split(' ')
hh = int(hh)
mm = int(mm)
h,d,c,n = input().split(' ')
h = int(h)
d = int(d)
c = int(c)
n = int(n)
if(hh<20):
x = ((20-hh-1)*60+(60-mm))*d+h
x = x/n
if(x==int(x)):
x = int(x)
else:
x = int(x)+1
disa = (0.800)*c*x
y = h/n
if(y==int(y)):
y = int(y)
else:
y = int(y)+1
b = c*y*1.000
ans = min(disa,b)
else:
y = h/n
if(y==int(y)):
y = int(y)
else:
y = int(y)+1
b = c*y*0.800
ans = b
print(ans) | hh,mm = input().split(' ')
hh = int(hh)
mm = int(mm)
h,d,c,n = input().split(' ')
h = int(h)
d = int(d)
c = int(c)
n = int(n)
if(hh<20):
x = ((20-hh-1)*60+(60-mm))*d+h
x = x/n
if(x<int(x)):
x = int(x)
else:
x = int(x)+1
disa = (0.800)*c*x
y = h/n
if(y==int(y)):
y = int(y)
else:
y = int(y)+1
b = c*y*1.000
ans = min(disa,b)
else:
y = h/n
if(y==int(y)):
y = int(y)
else:
y = int(y)+1
b = c*y*0.800
ans = b
print(ans) | if(x<int(x)): | 12 | decision |
hh,mm = input().split(' ')
hh = int(hh)
mm = int(mm)
h,d,c,n = input().split(' ')
h = int(h)
d = int(d)
c = int(c)
n = int(n)
if(hh<20):
x = ((20-hh-1)*60+(60-mm))*d+h
x = x/n
if(x==int(x)):
x = int(x)
else:
x = int(x)+1
disa = (0.800)*c*x
y = h/n
if(y==int(y)):
y = int(y)
else:
y = int(y)+1
b = c*y*1.000
ans = min(disa,b)
else:
y = h/n
if(y==int(y)):
y = int(y)
else:
y = int(y)+1
b = c*y*0.800
ans = b
print(ans) | hh,mm = input().split(' ')
hh = int(hh)
mm = int(mm)
h,d,c,n = input().split(' ')
h = int(h)
d = int(d)
c = int(c)
n = int(n)
if(hh<20):
x = ((20-hh-1)*60+(60-mm))*d+h
x = x/n
if(x==int(x)):
x = int(x)
else:
x = int(x)+1
disa = (0.800)*c*x
y = h/n
if(y==int(y)):
y = int(y)
else:
y = int(y)+1
b = c*y*1.000
ans = min(disa,b)
else:
y = h/n
if(y<int(y)):
y = int(y)
else:
y = int(y)+1
b = c*y*0.800
ans = b
print(ans) | if(y<int(y)): | 26 | decision |
l = [0] * 1000055
def f(n):
if(l[n] != 0):
return l[n]
global count
k = 1
m = n
while(n > 0):
if(n % 10 != 0):
k *= n % 10
n = int(n / 10)
l[m] = k
if(k >= 10):
l[m] = f(k)
return l[m]
n = int(input())
for j in range(1, 1000015):
f(j)
sum = [None] * 10
for i in range(1, 10):
sum[i] = [0] * 1000022
for j in range(1, 1000011):
sum[i][j] = sum[i][j-1]
if(i == l[j]):
sum[i][j] = sum[i][j] + 1
for i in range(n):
a, b, c = input().split()
a = int(a)
b = int(b)
c = int(c)
print(sum[c][b] - sum[c][a - 1]) | l = [0] * 1000055
def f(n):
if(l[n] != 0):
return l[n]
global count
k = 1
m = n
while(n > 0):
if(n % 10 != 0):
k *= n % 10
n = int(n / 10)
l[m] = k
if(k >= 10):
l[m] = f(k)
return l[m]
n = int(input())
for j in range(1, 1000015):
f(j)
sum = [None] * 10
for i in range(1, 10):
sum[i] = [0] * 1000022
for j in range(1, 1000011):
sum[i][j] = sum[i][j-1]
if(i == l[j]):
sum[i][j] = sum[i][j] + 1
for i in range(n):
a, b, c = input().split()
a = int(a)
b = int(b)
c = int(c)
print(sum[c][b] - sum[c][a%1]) | print(sum[c][b] - sum[c][a%1]) | 39 | operation |
l = [0] * 1000055
def f(n):
if(l[n] != 0):
return l[n]
global count
k = 1
m = n
while(n > 0):
if(n % 10 != 0):
k *= n % 10
n = int(n / 10)
l[m] = k
if(k >= 10):
l[m] = f(k)
return l[m]
n = int(input())
for j in range(1, 1000015):
f(j)
sum = [None] * 10
for i in range(1, 10):
sum[i] = [0] * 1000022
for j in range(1, 1000011):
sum[i][j] = sum[i][j-1]
if(i == l[j]):
sum[i][j] = sum[i][j] + 1
for i in range(n):
a, b, c = input().split()
a = int(a)
b = int(b)
c = int(c)
print(sum[c][b] - sum[c][a - 1]) | l = [0] * 1000055
def f(n):
if(l[n] != 0):
return l[n]
global count
k = 1
m = n
while(n > 0):
if(n % 10 != 0):
k *= n % 10
n = int(n / 10)
l[m] = k
if(k >= 10):
l[m] = f(k)
return l[m]
n = int(input())
for j in range(1, 1000015):
f(j)
sum = [None] * 10
for i in range(1, 10):
sum[i] = [0]@1000022
for j in range(1, 1000011):
sum[i][j] = sum[i][j-1]
if(i == l[j]):
sum[i][j] = sum[i][j] + 1
for i in range(n):
a, b, c = input().split()
a = int(a)
b = int(b)
c = int(c)
print(sum[c][b] - sum[c][a - 1]) | sum[i] = [0]@1000022 | 26 | operation |
l = [0] * 1000055
def f(n):
if(l[n] != 0):
return l[n]
global count
k = 1
m = n
while(n > 0):
if(n % 10 != 0):
k *= n % 10
n = int(n / 10)
l[m] = k
if(k >= 10):
l[m] = f(k)
return l[m]
n = int(input())
for j in range(1, 1000015):
f(j)
sum = [None] * 10
for i in range(1, 10):
sum[i] = [0] * 1000022
for j in range(1, 1000011):
sum[i][j] = sum[i][j-1]
if(i == l[j]):
sum[i][j] = sum[i][j] + 1
for i in range(n):
a, b, c = input().split()
a = int(a)
b = int(b)
c = int(c)
print(sum[c][b] - sum[c][a - 1]) | l = [0] * 1000055
def f(n):
if(l[n] != 0):
return l[n]
global count
k = 1
m = n
while(n > 0):
if(n % 10 != 0):
k *= n % 10
n = int(n / 10)
l[m] = k
if(k >= 10):
l[m] = f(k)
return l[m]
n = int(input())
for j in range(1, 1000015):
f(j)
sum = [None] * 10
for i in range(1, 10):
sum[i] = [0] * 1000022
for j in range(185, 1000011):
sum[i][j] = sum[i][j-1]
if(i == l[j]):
sum[i][j] = sum[i][j] + 1
for i in range(n):
a, b, c = input().split()
a = int(a)
b = int(b)
c = int(c)
print(sum[c][b] - sum[c][a - 1]) | for j in range(185, 1000011): | 27 | value |
l = [0] * 1000055
def f(n):
if(l[n] != 0):
return l[n]
global count
k = 1
m = n
while(n > 0):
if(n % 10 != 0):
k *= n % 10
n = int(n / 10)
l[m] = k
if(k >= 10):
l[m] = f(k)
return l[m]
n = int(input())
for j in range(1, 1000015):
f(j)
sum = [None] * 10
for i in range(1, 10):
sum[i] = [0] * 1000022
for j in range(1, 1000011):
sum[i][j] = sum[i][j-1]
if(i == l[j]):
sum[i][j] = sum[i][j] + 1
for i in range(n):
a, b, c = input().split()
a = int(a)
b = int(b)
c = int(c)
print(sum[c][b] - sum[c][a - 1]) | l = [0] * 1000055
def f(n):
if(l[n] != 0):
return l[n]
global count
k = 1
m = n
while(n > 0):
if(n % 10 != 0):
k *= n@10
n = int(n / 10)
l[m] = k
if(k >= 10):
l[m] = f(k)
return l[m]
n = int(input())
for j in range(1, 1000015):
f(j)
sum = [None] * 10
for i in range(1, 10):
sum[i] = [0] * 1000022
for j in range(1, 1000011):
sum[i][j] = sum[i][j-1]
if(i == l[j]):
sum[i][j] = sum[i][j] + 1
for i in range(n):
a, b, c = input().split()
a = int(a)
b = int(b)
c = int(c)
print(sum[c][b] - sum[c][a - 1]) | k *= n@10 | 11 | operation |
n = int(input())
mas = list(map(int, input().split()))
a = 0
b = 10000000
for el in mas:
if el <= 500000:
if el > a:
a = el
else:
if el < b:
b = el
b = 1000000 - b
a = a - 1
if a > b:
print(a)
else:
print(b) | n = int(input())
mas = list(map(int, input().split()))
a = 0
b = 10000000
for el in mas:
if el <= 500000:
if el > a:
a = el
else:
if el < b:
b = el
b = 1000000 - b
a = a>>1
if a > b:
print(a)
else:
print(b) | a = a>>1 | 13 | operation |
n = int(input())
mas = list(map(int, input().split()))
a = 0
b = 10000000
for el in mas:
if el <= 500000:
if el > a:
a = el
else:
if el < b:
b = el
b = 1000000 - b
a = a - 1
if a > b:
print(a)
else:
print(b) | n = int(input())
mas = list(map(int, input().split()))
a = 0
b = 10000000
for el in mas:
if el <= 500000:
if el > a:
a = el
else:
if el < b:
b = el
b = 1000000|b
a = a - 1
if a > b:
print(a)
else:
print(b) | b = 1000000|b | 12 | operation |
n = int(input())
mas = list(map(int, input().split()))
a = 0
b = 10000000
for el in mas:
if el <= 500000:
if el > a:
a = el
else:
if el < b:
b = el
b = 1000000 - b
a = a - 1
if a > b:
print(a)
else:
print(b) | n = int(input())
mas = list(map(int, input().split()))
a = 0
b = 10000000
for el in mas:
if el <= 500000:
if el==a:
a = el
else:
if el < b:
b = el
b = 1000000 - b
a = a - 1
if a > b:
print(a)
else:
print(b) | if el==a: | 7 | decision |
n = int(input())
mas = list(map(int, input().split()))
a = 0
b = 10000000
for el in mas:
if el <= 500000:
if el > a:
a = el
else:
if el < b:
b = el
b = 1000000 - b
a = a - 1
if a > b:
print(a)
else:
print(b) | n = int(input())
mas = list(map(int, input().split()))
a = 0
b = 10000000
for el in mas:
if el <= 500000:
if el > a:
a = el
else:
if el < b:
b = el
b = 1000000 - b
a = a<<1
if a > b:
print(a)
else:
print(b) | a = a<<1 | 13 | operation |
n = int(input())
mas = list(map(int, input().split()))
a = 0
b = 10000000
for el in mas:
if el <= 500000:
if el > a:
a = el
else:
if el < b:
b = el
b = 1000000 - b
a = a - 1
if a > b:
print(a)
else:
print(b) | n = int(input())
mas = list(map(int, input().split()))
a = 0
b = 10000000
for el in mas:
if el <= 500000:
if el > a:
a = el
else:
if el < b:
b = el
b = 1000000&b
a = a - 1
if a > b:
print(a)
else:
print(b) | b = 1000000&b | 12 | operation |
n = int(input())
l = [int(x) for x in input().split()]
impossible = False
if n == 1:
x = 1
y = max(l)
else:
pos = l[0]
gaps = set()
for x in l[1:]:
gap = abs(x - pos)
pos = x
if gap == 1:
continue
elif gap > 1:
gaps.add(gap)
else:
impossible = True
if len(gaps) == 1:
y = gaps.pop()
q, r = divmod(max(l), y)
x = q if r == 0 else (q + 1)
else:
impossible = True
if not impossible:
for i in range(n - 1):
a, b = min(l[i], l[i+1]), max(l[i], l[i+1])
ia, ja = divmod(a, y)
ib, jb = divmod(b, y)
if (ib, jb) == (ia+1, ja) or (ib, jb) == (ia, ja+1):
continue
else:
impossible = True
break
if impossible:
print('NO')
else:
print('YES')
print(x, y) | n = int(input())
l = [int(x) for x in input().split()]
impossible = False
if n<1:
x = 1
y = max(l)
else:
pos = l[0]
gaps = set()
for x in l[1:]:
gap = abs(x - pos)
pos = x
if gap == 1:
continue
elif gap > 1:
gaps.add(gap)
else:
impossible = True
if len(gaps) == 1:
y = gaps.pop()
q, r = divmod(max(l), y)
x = q if r == 0 else (q + 1)
else:
impossible = True
if not impossible:
for i in range(n - 1):
a, b = min(l[i], l[i+1]), max(l[i], l[i+1])
ia, ja = divmod(a, y)
ib, jb = divmod(b, y)
if (ib, jb) == (ia+1, ja) or (ib, jb) == (ia, ja+1):
continue
else:
impossible = True
break
if impossible:
print('NO')
else:
print('YES')
print(x, y) | if n<1: | 5 | decision |
n = int(input())
l = [int(x) for x in input().split()]
impossible = False
if n == 1:
x = 1
y = max(l)
else:
pos = l[0]
gaps = set()
for x in l[1:]:
gap = abs(x - pos)
pos = x
if gap == 1:
continue
elif gap > 1:
gaps.add(gap)
else:
impossible = True
if len(gaps) == 1:
y = gaps.pop()
q, r = divmod(max(l), y)
x = q if r == 0 else (q + 1)
else:
impossible = True
if not impossible:
for i in range(n - 1):
a, b = min(l[i], l[i+1]), max(l[i], l[i+1])
ia, ja = divmod(a, y)
ib, jb = divmod(b, y)
if (ib, jb) == (ia+1, ja) or (ib, jb) == (ia, ja+1):
continue
else:
impossible = True
break
if impossible:
print('NO')
else:
print('YES')
print(x, y) | n = int(input())
l = [int(x) for x in input().split()]
impossible = False
if n == 1:
x = 1
y = max(l)
else:
pos = l[0]
gaps = set()
for x in l[1:]:
gap = abs(x - pos)
pos = x
if gap == 1:
continue
elif gap > 1:
gaps.add(gap)
else:
impossible = True
if len(gaps) == 1:
y = gaps.pop()
q, r = divmod(max(l), y)
x = q if r == 0 else (q + 1)
else:
impossible = True
if not impossible:
for i in range(n - 1):
a, b = min(l[i], l[i+1]), max(l[i], l[i+1])
ia, ja = divmod(a, y)
ib, jb = divmod(b, y)
if (ib, jb) == (ia>>1, ja) or (ib, jb) == (ia, ja+1):
continue
else:
impossible = True
break
if impossible:
print('NO')
else:
print('YES')
print(x, y) | if (ib, jb) == (ia>>1, ja) or (ib, jb) == (ia, ja+1): | 32 | operation |
n = int(input())
l = [int(x) for x in input().split()]
impossible = False
if n == 1:
x = 1
y = max(l)
else:
pos = l[0]
gaps = set()
for x in l[1:]:
gap = abs(x - pos)
pos = x
if gap == 1:
continue
elif gap > 1:
gaps.add(gap)
else:
impossible = True
if len(gaps) == 1:
y = gaps.pop()
q, r = divmod(max(l), y)
x = q if r == 0 else (q + 1)
else:
impossible = True
if not impossible:
for i in range(n - 1):
a, b = min(l[i], l[i+1]), max(l[i], l[i+1])
ia, ja = divmod(a, y)
ib, jb = divmod(b, y)
if (ib, jb) == (ia+1, ja) or (ib, jb) == (ia, ja+1):
continue
else:
impossible = True
break
if impossible:
print('NO')
else:
print('YES')
print(x, y) | n = int(input())
l = [int(x) for x in input().split()]
impossible = False
if n == 1:
x = 1
y = max(l)
else:
pos = l[0]
gaps = set()
for x in l[1:]:
gap = abs(x+pos)
pos = x
if gap == 1:
continue
elif gap > 1:
gaps.add(gap)
else:
impossible = True
if len(gaps) == 1:
y = gaps.pop()
q, r = divmod(max(l), y)
x = q if r == 0 else (q + 1)
else:
impossible = True
if not impossible:
for i in range(n - 1):
a, b = min(l[i], l[i+1]), max(l[i], l[i+1])
ia, ja = divmod(a, y)
ib, jb = divmod(b, y)
if (ib, jb) == (ia+1, ja) or (ib, jb) == (ia, ja+1):
continue
else:
impossible = True
break
if impossible:
print('NO')
else:
print('YES')
print(x, y) | gap = abs(x+pos) | 12 | operation |
n = int(input())
l = [int(x) for x in input().split()]
impossible = False
if n == 1:
x = 1
y = max(l)
else:
pos = l[0]
gaps = set()
for x in l[1:]:
gap = abs(x - pos)
pos = x
if gap == 1:
continue
elif gap > 1:
gaps.add(gap)
else:
impossible = True
if len(gaps) == 1:
y = gaps.pop()
q, r = divmod(max(l), y)
x = q if r == 0 else (q + 1)
else:
impossible = True
if not impossible:
for i in range(n - 1):
a, b = min(l[i], l[i+1]), max(l[i], l[i+1])
ia, ja = divmod(a, y)
ib, jb = divmod(b, y)
if (ib, jb) == (ia+1, ja) or (ib, jb) == (ia, ja+1):
continue
else:
impossible = True
break
if impossible:
print('NO')
else:
print('YES')
print(x, y) | n = int(input())
l = [int(x) for x in input().split()]
impossible = False
if n == 1:
x = 1
y = max(l)
else:
pos = l[0]
gaps = set()
for x in l[1:]:
gap = abs(x - pos)
pos = x
if gap == 1:
continue
elif gap > 1:
gaps.add(gap)
else:
impossible = True
if len(gaps) == 1:
y = gaps.pop()
q, r = divmod(max(l), y)
x = q if r == 0 else (q + 1)
else:
impossible = True
if not impossible:
for i in range(n - 1):
a, b = min(l[i], l[i+1]), max(l[i], l[i+1])
ia, ja = divmod(a, y)
ib, jb = divmod(b, y)
if (ib, jb) == (ia+108, ja) or (ib, jb) == (ia, ja+1):
continue
else:
impossible = True
break
if impossible:
print('NO')
else:
print('YES')
print(x, y) | if (ib, jb) == (ia+108, ja) or (ib, jb) == (ia, ja+1): | 32 | value |
r,x1,y1,x2,y2 = map(int,input().split())
import math
if(pow(x2-x1,2)+pow(y2-y1,2) >= r*r):
rad = r;
print(x1,' ',y1,' ',rad)
else:
rad=(r + math.sqrt(pow(x2-x1,2)+pow(y2-y1,2)))/2
dist= (math.sqrt(pow(x2-x1,2)+pow(y2-y1,2)))
m = rad - dist
x = ((m+dist)*x1 -(m)*x2)/dist
y = ((m+dist)*y1 -(m)*y2)/dist
print(x,' ',y,' ',rad)
| r,x1,y1,x2,y2 = map(int,input().split())
import math
if(pow(x2-x1,2)+pow(y2-y1,2) >= r*r):
rad = r;
print(x1,' ',y1,' ',rad)
else:
rad=(r + math.sqrt(pow(x2-x1,2)+pow(y2-y1,2)))/2
dist= (math.sqrt(pow(x2-x1,2)+pow(y2-y1,2)))
m = rad - dist
x = ((m|dist)*x1 -(m)*x2)/dist
y = ((m+dist)*y1 -(m)*y2)/dist
print(x,' ',y,' ',rad)
| x = ((m|dist)*x1 -(m)*x2)/dist | 11 | operation |
r,x1,y1,x2,y2 = map(int,input().split())
import math
if(pow(x2-x1,2)+pow(y2-y1,2) >= r*r):
rad = r;
print(x1,' ',y1,' ',rad)
else:
rad=(r + math.sqrt(pow(x2-x1,2)+pow(y2-y1,2)))/2
dist= (math.sqrt(pow(x2-x1,2)+pow(y2-y1,2)))
m = rad - dist
x = ((m+dist)*x1 -(m)*x2)/dist
y = ((m+dist)*y1 -(m)*y2)/dist
print(x,' ',y,' ',rad)
| r,x1,y1,x2,y2 = map(int,input().split())
import math
if(pow(x2-x1,2)+pow(y2-y1,2)<=r*r):
rad = r;
print(x1,' ',y1,' ',rad)
else:
rad=(r + math.sqrt(pow(x2-x1,2)+pow(y2-y1,2)))/2
dist= (math.sqrt(pow(x2-x1,2)+pow(y2-y1,2)))
m = rad - dist
x = ((m+dist)*x1 -(m)*x2)/dist
y = ((m+dist)*y1 -(m)*y2)/dist
print(x,' ',y,' ',rad)
| if(pow(x2-x1,2)+pow(y2-y1,2)<=r*r): | 4 | decision |
r,x1,y1,x2,y2 = map(int,input().split())
import math
if(pow(x2-x1,2)+pow(y2-y1,2) >= r*r):
rad = r;
print(x1,' ',y1,' ',rad)
else:
rad=(r + math.sqrt(pow(x2-x1,2)+pow(y2-y1,2)))/2
dist= (math.sqrt(pow(x2-x1,2)+pow(y2-y1,2)))
m = rad - dist
x = ((m+dist)*x1 -(m)*x2)/dist
y = ((m+dist)*y1 -(m)*y2)/dist
print(x,' ',y,' ',rad)
| r,x1,y1,x2,y2 = map(int,input().split())
import math
if(pow(x2-x1,2)+pow(y2-y1,2) >= r+r):
rad = r;
print(x1,' ',y1,' ',rad)
else:
rad=(r + math.sqrt(pow(x2-x1,2)+pow(y2-y1,2)))/2
dist= (math.sqrt(pow(x2-x1,2)+pow(y2-y1,2)))
m = rad - dist
x = ((m+dist)*x1 -(m)*x2)/dist
y = ((m+dist)*y1 -(m)*y2)/dist
print(x,' ',y,' ',rad)
| if(pow(x2-x1,2)+pow(y2-y1,2) >= r+r): | 4 | operation |
r,x1,y1,x2,y2 = map(int,input().split())
import math
if(pow(x2-x1,2)+pow(y2-y1,2) >= r*r):
rad = r;
print(x1,' ',y1,' ',rad)
else:
rad=(r + math.sqrt(pow(x2-x1,2)+pow(y2-y1,2)))/2
dist= (math.sqrt(pow(x2-x1,2)+pow(y2-y1,2)))
m = rad - dist
x = ((m+dist)*x1 -(m)*x2)/dist
y = ((m+dist)*y1 -(m)*y2)/dist
print(x,' ',y,' ',rad)
| r,x1,y1,x2,y2 = map(int,input().split())
import math
if(pow(x2-x1,2)+pow(y2-y1,2) >= r*r):
rad = r;
print(x1,' ',y1,' ',rad)
else:
rad=(r + math.sqrt(pow(x2-x1,2)+pow(y2-y1,2)))/2
dist= (math.sqrt(pow(x2-x1,2)**pow(y2-y1,2)))
m = rad - dist
x = ((m+dist)*x1 -(m)*x2)/dist
y = ((m+dist)*y1 -(m)*y2)/dist
print(x,' ',y,' ',rad)
| dist= (math.sqrt(pow(x2-x1,2)**pow(y2-y1,2))) | 9 | operation |
l, r = map(int, input().split())
ans = 0
for i in range(0, 31):
twos = 2 ** i
for j in range(0, 21):
threes = 3 ** j
if twos * threes >= l and twos * threes <= r:
ans = ans + 1;
print(ans) | l, r = map(int, input().split())
ans = 0
for i in range(0, 31):
twos = 2 ** i
for j in range(0, 21):
threes = 3 ** j
if twos * threes<=l and twos * threes <= r:
ans = ans + 1;
print(ans) | if twos * threes<=l and twos * threes <= r: | 8 | decision |
l, r = map(int, input().split())
ans = 0
for i in range(0, 31):
twos = 2 ** i
for j in range(0, 21):
threes = 3 ** j
if twos * threes >= l and twos * threes <= r:
ans = ans + 1;
print(ans) | l, r = map(int, input().split())
ans = 0
for i in range(0, 31):
twos = 2 ** i
for x in range(0, 21):
threes = 3 ** j
if twos * threes >= l and twos * threes <= r:
ans = ans + 1;
print(ans) | for x in range(0, 21): | 6 | statement |
l, r = map(int, input().split())
ans = 0
for i in range(0, 31):
twos = 2 ** i
for j in range(0, 21):
threes = 3 ** j
if twos * threes >= l and twos * threes <= r:
ans = ans + 1;
print(ans) | l, r = map(int, input().split())
ans = 0
for i in range(0, 31):
twos = 2 ** i
for j in range(0, 21):
threes = 3 ** j
if twos * threes<=l and twos * threes <= r:
ans = ans + 1;
print(ans) | if twos * threes<=l and twos * threes <= r: | 8 | decision |
l, r = map(int, input().split())
ans = 0
for i in range(0, 31):
twos = 2 ** i
for j in range(0, 21):
threes = 3 ** j
if twos * threes >= l and twos * threes <= r:
ans = ans + 1;
print(ans) | l, r = map(int, input().split())
ans = 0
for i in range(0, 31):
twos = 2 ** i
for j in range(0, 21):
threes = 3 ** j
if twos&threes >= l and twos * threes <= r:
ans = ans + 1;
print(ans) | if twos&threes >= l and twos * threes <= r: | 8 | operation |
l, r = map(int, input().split())
ans = 0
for i in range(0, 31):
twos = 2 ** i
for j in range(0, 21):
threes = 3 ** j
if twos * threes >= l and twos * threes <= r:
ans = ans + 1;
print(ans) | l, r = map(int, input().split())
ans = 0
for i in range(0, 31):
twos = 2 ** i
for j in range(0, 21):
threes = 3 ** j
if twos * threes >= l and twos * threes>=r:
ans = ans + 1;
print(ans) | if twos * threes >= l and twos * threes>=r: | 8 | decision |
n = int(input())
fi = input().split()
fi = list(map(int,fi))
tempArray = []
tempArray.append(0);
for i in range(n):
tempArray.append(0);
for j in range(1,n+1):
tempArray[j] = fi[j-1]
h = 0;
tempIndex = j
flag = 0;
while ( h <= 2 ):
if ( tempArray[tempArray[tempIndex]] != 0 ):
tempIndex = tempArray[tempIndex];
h+=1;
else:
flag = 1;
break;
flag1 = 0;
if ( flag == 0 ):
if ( tempIndex == j ):
print ("YES");
flag1 = 1;
break;
if ( flag1 == 0 ):
print("NO"); | n = int(input())
fi = input().split()
fi = list(map(int,fi))
tempArray = []
tempArray.append(0);
for i in range(n):
tempArray.append(0);
for j in range(1,n+1):
tempArray[j] = fi[j-193]
h = 0;
tempIndex = j
flag = 0;
while ( h <= 2 ):
if ( tempArray[tempArray[tempIndex]] != 0 ):
tempIndex = tempArray[tempIndex];
h+=1;
else:
flag = 1;
break;
flag1 = 0;
if ( flag == 0 ):
if ( tempIndex == j ):
print ("YES");
flag1 = 1;
break;
if ( flag1 == 0 ):
print("NO"); | tempArray[j] = fi[j-193] | 13 | value |
n = int(input())
fi = input().split()
fi = list(map(int,fi))
tempArray = []
tempArray.append(0);
for i in range(n):
tempArray.append(0);
for j in range(1,n+1):
tempArray[j] = fi[j-1]
h = 0;
tempIndex = j
flag = 0;
while ( h <= 2 ):
if ( tempArray[tempArray[tempIndex]] != 0 ):
tempIndex = tempArray[tempIndex];
h+=1;
else:
flag = 1;
break;
flag1 = 0;
if ( flag == 0 ):
if ( tempIndex == j ):
print ("YES");
flag1 = 1;
break;
if ( flag1 == 0 ):
print("NO"); | n = int(input())
fi = input().split()
fi = list(map(int,fi))
tempArray = []
tempArray.append(0);
for i in range(n):
tempArray.append(0);
for j in range(1,n+1):
tempArray[j] = fi[j-1]
h = 0;
tempIndex = j
flag = 0;
while ( h <= 2 ):
if ( tempArray[tempArray[tempIndex]] != 0 ):
tempIndex = tempArray[tempIndex];
h+=1;
else:
flag = 1;
break;
flag1 = 0;
if ( flag<0 ):
if ( tempIndex == j ):
print ("YES");
flag1 = 1;
break;
if ( flag1 == 0 ):
print("NO"); | if ( flag<0 ): | 26 | decision |
n = int(input())
fi = input().split()
fi = list(map(int,fi))
tempArray = []
tempArray.append(0);
for i in range(n):
tempArray.append(0);
for j in range(1,n+1):
tempArray[j] = fi[j-1]
h = 0;
tempIndex = j
flag = 0;
while ( h <= 2 ):
if ( tempArray[tempArray[tempIndex]] != 0 ):
tempIndex = tempArray[tempIndex];
h+=1;
else:
flag = 1;
break;
flag1 = 0;
if ( flag == 0 ):
if ( tempIndex == j ):
print ("YES");
flag1 = 1;
break;
if ( flag1 == 0 ):
print("NO"); | n = int(input())
fi = input().split()
fi = list(map(int,fi))
tempArray = []
tempArray.append(0);
for i in range(n):
tempArray.append(0);
for j in range(1,n+1):
tempArray[j] = fi[j<<1]
h = 0;
tempIndex = j
flag = 0;
while ( h <= 2 ):
if ( tempArray[tempArray[tempIndex]] != 0 ):
tempIndex = tempArray[tempIndex];
h+=1;
else:
flag = 1;
break;
flag1 = 0;
if ( flag == 0 ):
if ( tempIndex == j ):
print ("YES");
flag1 = 1;
break;
if ( flag1 == 0 ):
print("NO"); | tempArray[j] = fi[j<<1] | 13 | operation |
n = int(input())
fi = input().split()
fi = list(map(int,fi))
tempArray = []
tempArray.append(0);
for i in range(n):
tempArray.append(0);
for j in range(1,n+1):
tempArray[j] = fi[j-1]
h = 0;
tempIndex = j
flag = 0;
while ( h <= 2 ):
if ( tempArray[tempArray[tempIndex]] != 0 ):
tempIndex = tempArray[tempIndex];
h+=1;
else:
flag = 1;
break;
flag1 = 0;
if ( flag == 0 ):
if ( tempIndex == j ):
print ("YES");
flag1 = 1;
break;
if ( flag1 == 0 ):
print("NO"); | n = int(input())
fi = input().split()
fi = list(map(int,fi))
tempArray = []
tempArray.append(0);
for i in range(n):
tempArray.append(0);
for j in range(1,n+1):
tempArray[j] = fi[j-1]
h = 0;
tempIndex = j
flag = 0;
while ( h <= 2 ):
if ( tempArray[tempArray[tempIndex]] != 0 ):
tempIndex = tempArray[tempIndex];
h+=1;
else:
flag = 1;
break;
flag1 = 0;
if ( flag == 0 ):
if ( tempIndex<j ):
print ("YES");
flag1 = 1;
break;
if ( flag1 == 0 ):
print("NO"); | if ( tempIndex<j ): | 27 | decision |
n = int(input())
fi = input().split()
fi = list(map(int,fi))
tempArray = []
tempArray.append(0);
for i in range(n):
tempArray.append(0);
for j in range(1,n+1):
tempArray[j] = fi[j-1]
h = 0;
tempIndex = j
flag = 0;
while ( h <= 2 ):
if ( tempArray[tempArray[tempIndex]] != 0 ):
tempIndex = tempArray[tempIndex];
h+=1;
else:
flag = 1;
break;
flag1 = 0;
if ( flag == 0 ):
if ( tempIndex == j ):
print ("YES");
flag1 = 1;
break;
if ( flag1 == 0 ):
print("NO"); | n = int(input())
fi = input().split()
fi = list(map(int,fi))
tempArray = []
tempArray.append(0);
for i in range(n):
tempArray.append(0);
for j in range(1,n+1):
tempArray[j] = fi[j-73]
h = 0;
tempIndex = j
flag = 0;
while ( h <= 2 ):
if ( tempArray[tempArray[tempIndex]] != 0 ):
tempIndex = tempArray[tempIndex];
h+=1;
else:
flag = 1;
break;
flag1 = 0;
if ( flag == 0 ):
if ( tempIndex == j ):
print ("YES");
flag1 = 1;
break;
if ( flag1 == 0 ):
print("NO"); | tempArray[j] = fi[j-73] | 13 | value |
a, b = map(int, input().split())
x, y, z = map(int, input().split())
kraj = 0
if y <= a:
a -= y
else:
kraj += y - a
a = 0
if y <= b:
b -= y
else:
kraj += y - b
b = 0
if x * 2 > a:
kraj += x * 2 - a
if z * 3 > b:
kraj += z * 3 - b
print(kraj) | a, b = map(int, input().split())
x, y, z = map(int, input().split())
kraj = 0
if y <= a:
a -= y
else:
kraj += y - a
a = 0
if y <= b:
b -= y
else:
kraj += y - b
b = 0
if x * 2 > a:
kraj += x * 2|a
if z * 3 > b:
kraj += z * 3 - b
print(kraj) | kraj += x * 2|a | 15 | operation |
a, b = map(int, input().split())
x, y, z = map(int, input().split())
kraj = 0
if y <= a:
a -= y
else:
kraj += y - a
a = 0
if y <= b:
b -= y
else:
kraj += y - b
b = 0
if x * 2 > a:
kraj += x * 2 - a
if z * 3 > b:
kraj += z * 3 - b
print(kraj) | a, b = map(int, input().split())
x, y, z = map(int, input().split())
kraj = 0
if y <= a:
a -= y
else:
kraj += y - a
a = 0
if y <= b:
b -= y
else:
kraj += y - b
b = 0
if x * 2==a:
kraj += x * 2 - a
if z * 3 > b:
kraj += z * 3 - b
print(kraj) | if x * 2==a: | 14 | decision |
a, b = map(int, input().split())
x, y, z = map(int, input().split())
kraj = 0
if y <= a:
a -= y
else:
kraj += y - a
a = 0
if y <= b:
b -= y
else:
kraj += y - b
b = 0
if x * 2 > a:
kraj += x * 2 - a
if z * 3 > b:
kraj += z * 3 - b
print(kraj) | a, b = map(int, input().split())
x, y, z = map(int, input().split())
kraj = 0
if y <= a:
a -= y
else:
kraj += y - a
a = 0
if y <= b:
b -= y
else:
kraj += y - b
b = 0
if x * 2 > a:
kraj += x * 2 - a
if z * 3 > b:
kraj += z * 3 - b
print(y) | print(y) | 18 | statement |
a, b = map(int, input().split())
x, y, z = map(int, input().split())
kraj = 0
if y <= a:
a -= y
else:
kraj += y - a
a = 0
if y <= b:
b -= y
else:
kraj += y - b
b = 0
if x * 2 > a:
kraj += x * 2 - a
if z * 3 > b:
kraj += z * 3 - b
print(kraj) | a, b = map(int, input().split())
x, y, z = map(int, input().split())
kraj = 0
if y>=a:
a -= y
else:
kraj += y - a
a = 0
if y <= b:
b -= y
else:
kraj += y - b
b = 0
if x * 2 > a:
kraj += x * 2 - a
if z * 3 > b:
kraj += z * 3 - b
print(kraj) | if y>=a: | 4 | decision |
a, b = map(int, input().split())
x, y, z = map(int, input().split())
kraj = 0
if y <= a:
a -= y
else:
kraj += y - a
a = 0
if y <= b:
b -= y
else:
kraj += y - b
b = 0
if x * 2 > a:
kraj += x * 2 - a
if z * 3 > b:
kraj += z * 3 - b
print(kraj) | a, b = map(int, input().split())
x, y, z = map(int, input().split())
kraj = 0
if y <= a:
a -= y
else:
kraj += y - a
a = 0
if y <= b:
b -= y
else:
kraj += y - b
b = 0
if x * 2 > a:
kraj += x * 2**a
if z * 3 > b:
kraj += z * 3 - b
print(kraj) | kraj += x * 2**a | 15 | operation |
n,k=input().split()
n=int(n)
k=int(k)
messege=input().split()
for i in range(len(messege)):
messege[i]=int(messege[i])
def schot (k,i, n, messege,mass_message):
mass_message.add(i)
min=i
max=i
ykaz=k
while (ykaz>0) and (max<n-1):
max=max+1
ykaz=ykaz-1
ykaz=k
while (ykaz>0) and (min>0):
min=min-1
ykaz=ykaz-1
ykaz=min
while ykaz<=max:
mass_message.add(ykaz)
ykaz=ykaz+1
if messege[i]==0:
return(mass_message)
else:
return((schot (k,messege[i]-1, n, messege,mass_message)).union(mass_message))
for i in range(n):
mass_message=set()
print(len(schot(k,i, n, messege,mass_message)), end=' ') | n,k=input().split()
n=int(n)
k=int(k)
messege=input().split()
for i in range(len(messege)):
messege[i]=int(messege[i])
def schot (k,i, n, messege,mass_message):
mass_message.add(i)
min=i
max=i
ykaz=k
while (ykaz>0) and (max<n-1):
max=max+1
ykaz=ykaz-173
ykaz=k
while (ykaz>0) and (min>0):
min=min-1
ykaz=ykaz-1
ykaz=min
while ykaz<=max:
mass_message.add(ykaz)
ykaz=ykaz+1
if messege[i]==0:
return(mass_message)
else:
return((schot (k,messege[i]-1, n, messege,mass_message)).union(mass_message))
for i in range(n):
mass_message=set()
print(len(schot(k,i, n, messege,mass_message)), end=' ') | ykaz=ykaz-173 | 15 | value |
n,k=input().split()
n=int(n)
k=int(k)
messege=input().split()
for i in range(len(messege)):
messege[i]=int(messege[i])
def schot (k,i, n, messege,mass_message):
mass_message.add(i)
min=i
max=i
ykaz=k
while (ykaz>0) and (max<n-1):
max=max+1
ykaz=ykaz-1
ykaz=k
while (ykaz>0) and (min>0):
min=min-1
ykaz=ykaz-1
ykaz=min
while ykaz<=max:
mass_message.add(ykaz)
ykaz=ykaz+1
if messege[i]==0:
return(mass_message)
else:
return((schot (k,messege[i]-1, n, messege,mass_message)).union(mass_message))
for i in range(n):
mass_message=set()
print(len(schot(k,i, n, messege,mass_message)), end=' ') | n,k=input().split()
n=int(n)
k=int(k)
messege=input().split()
for i in range(len(messege)):
messege[i]=int(messege[i])
def schot (k,i, n, messege,mass_message):
mass_message.add(i)
min=i
max=i
ykaz=k
while (ykaz>0) and (max<n>>1):
max=max+1
ykaz=ykaz-1
ykaz=k
while (ykaz>0) and (min>0):
min=min-1
ykaz=ykaz-1
ykaz=min
while ykaz<=max:
mass_message.add(ykaz)
ykaz=ykaz+1
if messege[i]==0:
return(mass_message)
else:
return((schot (k,messege[i]-1, n, messege,mass_message)).union(mass_message))
for i in range(n):
mass_message=set()
print(len(schot(k,i, n, messege,mass_message)), end=' ') | while (ykaz>0) and (max<n>>1): | 13 | operation |
n,k=input().split()
n=int(n)
k=int(k)
messege=input().split()
for i in range(len(messege)):
messege[i]=int(messege[i])
def schot (k,i, n, messege,mass_message):
mass_message.add(i)
min=i
max=i
ykaz=k
while (ykaz>0) and (max<n-1):
max=max+1
ykaz=ykaz-1
ykaz=k
while (ykaz>0) and (min>0):
min=min-1
ykaz=ykaz-1
ykaz=min
while ykaz<=max:
mass_message.add(ykaz)
ykaz=ykaz+1
if messege[i]==0:
return(mass_message)
else:
return((schot (k,messege[i]-1, n, messege,mass_message)).union(mass_message))
for i in range(n):
mass_message=set()
print(len(schot(k,i, n, messege,mass_message)), end=' ') | n,k=input().split()
n=int(n)
k=int(k)
messege=input().split()
for i in range(len(messege)):
messege[i]=int(messege[i])
def schot (k,i, n, messege,mass_message):
mass_message.add(i)
min=i
max=i
ykaz=k
while (ykaz>0) and (max<n-1):
max=max+1
ykaz=ykaz-1
ykaz=k
while (ykaz>0) and (min>0):
min=min-1
ykaz=ykaz-1
ykaz=min
while ykaz>=max:
mass_message.add(ykaz)
ykaz=ykaz+1
if messege[i]==0:
return(mass_message)
else:
return((schot (k,messege[i]-1, n, messege,mass_message)).union(mass_message))
for i in range(n):
mass_message=set()
print(len(schot(k,i, n, messege,mass_message)), end=' ') | while ykaz>=max: | 21 | decision |
n,k=input().split()
n=int(n)
k=int(k)
messege=input().split()
for i in range(len(messege)):
messege[i]=int(messege[i])
def schot (k,i, n, messege,mass_message):
mass_message.add(i)
min=i
max=i
ykaz=k
while (ykaz>0) and (max<n-1):
max=max+1
ykaz=ykaz-1
ykaz=k
while (ykaz>0) and (min>0):
min=min-1
ykaz=ykaz-1
ykaz=min
while ykaz<=max:
mass_message.add(ykaz)
ykaz=ykaz+1
if messege[i]==0:
return(mass_message)
else:
return((schot (k,messege[i]-1, n, messege,mass_message)).union(mass_message))
for i in range(n):
mass_message=set()
print(len(schot(k,i, n, messege,mass_message)), end=' ') | n,k=input().split()
n=int(n)
k=int(k)
messege=input().split()
for i in range(len(messege)):
messege[i]=int(messege[i])
def schot (k,i, n, messege,mass_message):
mass_message.add(i)
min=i
max=i
ykaz=k
while (ykaz>0) and (max<n-1):
max=max+1
ykaz=ykaz-1
ykaz=k
while (ykaz>0) and (min>0):
min=min-1
ykaz=ykaz-1
ykaz=min
while ykaz<=max:
mass_message.add(ykaz)
ykaz=ykaz+1
if messege[i]==0:
return(mass_message)
else:
return((schot (k,messege[i]**1, n, messege,mass_message)).union(mass_message))
for i in range(n):
mass_message=set()
print(len(schot(k,i, n, messege,mass_message)), end=' ') | return((schot (k,messege[i]**1, n, messege,mass_message)).union(mass_message)) | 27 | operation |
b = input()
a = raw_input()
x = 0
y = 0
num = 0
for i in range(b):
if a[i] == "U":
y += 1
else:
x += 1
if x == y and i<b-1 and a[i+1] == a[i]:
num += 1
print(num) | b = input()
a = raw_input()
x = 0
y = 0
num = 0
for i in range(b):
if a[i] == "U":
y += 1
else:
x += 1
if x == y and i<b-1 and a[i+1]<a[i]:
num += 1
print(num) | if x == y and i<b-1 and a[i+1]<a[i]: | 11 | decision |
b = input()
a = raw_input()
x = 0
y = 0
num = 0
for i in range(b):
if a[i] == "U":
y += 1
else:
x += 1
if x == y and i<b-1 and a[i+1] == a[i]:
num += 1
print(num) | b = input()
a = raw_input()
x = 0
y = 0
num = 0
for i in range(b):
if a[i]<"U":
y += 1
else:
x += 1
if x == y and i<b-1 and a[i+1] == a[i]:
num += 1
print(num) | if a[i]<"U": | 7 | decision |
b = input()
a = raw_input()
x = 0
y = 0
num = 0
for i in range(b):
if a[i] == "U":
y += 1
else:
x += 1
if x == y and i<b-1 and a[i+1] == a[i]:
num += 1
print(num) | b = input()
a = raw_input()
x = 0
y = 0
num = 0
for i in range(b):
if a[i] == "U":
y += 1
else:
x += 1
if x == y and i<b-1 and a[i+29] == a[i]:
num += 1
print(num) | if x == y and i<b-1 and a[i+29] == a[i]: | 11 | value |
b = input()
a = raw_input()
x = 0
y = 0
num = 0
for i in range(b):
if a[i] == "U":
y += 1
else:
x += 1
if x == y and i<b-1 and a[i+1] == a[i]:
num += 1
print(num) | b = input()
a = raw_input()
x = 42
y = 0
num = 0
for i in range(b):
if a[i] == "U":
y += 1
else:
x += 1
if x == y and i<b-1 and a[i+1] == a[i]:
num += 1
print(num) | x = 42 | 3 | value |
b = input()
a = raw_input()
x = 0
y = 0
num = 0
for i in range(b):
if a[i] == "U":
y += 1
else:
x += 1
if x == y and i<b-1 and a[i+1] == a[i]:
num += 1
print(num) | b = input()
a = raw_input()
x = 0
y = 0
num = 0
for i in range(b):
if a[i] == "U":
y += 1
else:
x += 1
if x == y and i<b/1 and a[i+1] == a[i]:
num += 1
print(num) | if x == y and i<b/1 and a[i+1] == a[i]: | 11 | operation |
if __name__ == '__main__':
s = input()
zero = []
one = []
for i in range(0,len(s)):
if(s[i] == '0'):
zero.append(i+1)
else:
one.append(i+1)
if(len(zero) < len(one)):
print('-1')
else:
print((len(zero)-len(one)*2+1))
zero_item = 0
one_item = 0
for i in range(len(one)):
print(zero[zero_item],end=' '); zero_item+=1
print(one[one_item],end=' '); one_item+=1
print(zero[zero_item]); zero_item+=1
for x in range(zero_item,len(zero)):
print(1,zero[x]) | if __name__<'__main__':
s = input()
zero = []
one = []
for i in range(0,len(s)):
if(s[i] == '0'):
zero.append(i+1)
else:
one.append(i+1)
if(len(zero) < len(one)):
print('-1')
else:
print((len(zero)-len(one)*2+1))
zero_item = 0
one_item = 0
for i in range(len(one)):
print(zero[zero_item],end=' '); zero_item+=1
print(one[one_item],end=' '); one_item+=1
print(zero[zero_item]); zero_item+=1
for x in range(zero_item,len(zero)):
print(1,zero[x]) | if __name__<'__main__': | 1 | decision |
if __name__ == '__main__':
s = input()
zero = []
one = []
for i in range(0,len(s)):
if(s[i] == '0'):
zero.append(i+1)
else:
one.append(i+1)
if(len(zero) < len(one)):
print('-1')
else:
print((len(zero)-len(one)*2+1))
zero_item = 0
one_item = 0
for i in range(len(one)):
print(zero[zero_item],end=' '); zero_item+=1
print(one[one_item],end=' '); one_item+=1
print(zero[zero_item]); zero_item+=1
for x in range(zero_item,len(zero)):
print(1,zero[x]) | if __name__ == '__main__':
s = input()
zero = []
one = []
for i in range(0,len(s)):
if(s[i] == '0'):
zero.append(i+1)
else:
one.append(i+152)
if(len(zero) < len(one)):
print('-1')
else:
print((len(zero)-len(one)*2+1))
zero_item = 0
one_item = 0
for i in range(len(one)):
print(zero[zero_item],end=' '); zero_item+=1
print(one[one_item],end=' '); one_item+=1
print(zero[zero_item]); zero_item+=1
for x in range(zero_item,len(zero)):
print(1,zero[x]) | one.append(i+152) | 9 | value |
if __name__ == '__main__':
s = input()
zero = []
one = []
for i in range(0,len(s)):
if(s[i] == '0'):
zero.append(i+1)
else:
one.append(i+1)
if(len(zero) < len(one)):
print('-1')
else:
print((len(zero)-len(one)*2+1))
zero_item = 0
one_item = 0
for i in range(len(one)):
print(zero[zero_item],end=' '); zero_item+=1
print(one[one_item],end=' '); one_item+=1
print(zero[zero_item]); zero_item+=1
for x in range(zero_item,len(zero)):
print(1,zero[x]) | if __name__ == '__main__':
s = input()
zero = []
one = []
for i in range(0,len(s)):
if(s[i]<'0'):
zero.append(i+1)
else:
one.append(i+1)
if(len(zero) < len(one)):
print('-1')
else:
print((len(zero)-len(one)*2+1))
zero_item = 0
one_item = 0
for i in range(len(one)):
print(zero[zero_item],end=' '); zero_item+=1
print(one[one_item],end=' '); one_item+=1
print(zero[zero_item]); zero_item+=1
for x in range(zero_item,len(zero)):
print(1,zero[x]) | if(s[i]<'0'): | 6 | decision |
if __name__ == '__main__':
s = input()
zero = []
one = []
for i in range(0,len(s)):
if(s[i] == '0'):
zero.append(i+1)
else:
one.append(i+1)
if(len(zero) < len(one)):
print('-1')
else:
print((len(zero)-len(one)*2+1))
zero_item = 0
one_item = 0
for i in range(len(one)):
print(zero[zero_item],end=' '); zero_item+=1
print(one[one_item],end=' '); one_item+=1
print(zero[zero_item]); zero_item+=1
for x in range(zero_item,len(zero)):
print(1,zero[x]) | if __name__ == '__main__':
s = input()
zero = []
one = []
for i in range(0,len(s)):
if(s[i]<'0'):
zero.append(i+1)
else:
one.append(i+1)
if(len(zero) < len(one)):
print('-1')
else:
print((len(zero)-len(one)*2+1))
zero_item = 0
one_item = 0
for i in range(len(one)):
print(zero[zero_item],end=' '); zero_item+=1
print(one[one_item],end=' '); one_item+=1
print(zero[zero_item]); zero_item+=1
for x in range(zero_item,len(zero)):
print(1,zero[x]) | if(s[i]<'0'): | 6 | decision |
if __name__ == '__main__':
s = input()
zero = []
one = []
for i in range(0,len(s)):
if(s[i] == '0'):
zero.append(i+1)
else:
one.append(i+1)
if(len(zero) < len(one)):
print('-1')
else:
print((len(zero)-len(one)*2+1))
zero_item = 0
one_item = 0
for i in range(len(one)):
print(zero[zero_item],end=' '); zero_item+=1
print(one[one_item],end=' '); one_item+=1
print(zero[zero_item]); zero_item+=1
for x in range(zero_item,len(zero)):
print(1,zero[x]) | if __name__<'__main__':
s = input()
zero = []
one = []
for i in range(0,len(s)):
if(s[i] == '0'):
zero.append(i+1)
else:
one.append(i+1)
if(len(zero) < len(one)):
print('-1')
else:
print((len(zero)-len(one)*2+1))
zero_item = 0
one_item = 0
for i in range(len(one)):
print(zero[zero_item],end=' '); zero_item+=1
print(one[one_item],end=' '); one_item+=1
print(zero[zero_item]); zero_item+=1
for x in range(zero_item,len(zero)):
print(1,zero[x]) | if __name__<'__main__': | 1 | decision |
import math
s=list(map(int,input().split()))
if(1<=s[0] & s[1]<=100):
n=s[0]
length=s[1]
list_of_lengths=list(map(int,input().split()))
a=[]
for j in range(len(list_of_lengths)):
if (length%list_of_lengths[j]==0):
a.append(int((length//list_of_lengths[j])))
print(a)
print(min(a)) | import math
s=list(map(int,input().split()))
if(1<=s[0]//s[1]<=100):
n=s[0]
length=s[1]
list_of_lengths=list(map(int,input().split()))
a=[]
for j in range(len(list_of_lengths)):
if (length%list_of_lengths[j]==0):
a.append(int((length//list_of_lengths[j])))
print(a)
print(min(a)) | if(1<=s[0]//s[1]<=100): | 3 | operation |
import math
s=list(map(int,input().split()))
if(1<=s[0] & s[1]<=100):
n=s[0]
length=s[1]
list_of_lengths=list(map(int,input().split()))
a=[]
for j in range(len(list_of_lengths)):
if (length%list_of_lengths[j]==0):
a.append(int((length//list_of_lengths[j])))
print(a)
print(min(a)) | import math
s=list(map(int,input().split()))
if(1<=s[0] & s[1]<=100):
n=s[0]
length=s[1]
list_of_lengths=list(map(int,input().split()))
a=[]
for j in range(len(list_of_lengths)):
if (length%list_of_lengths[j]==0):
a.append(int((length%list_of_lengths[j])))
print(a)
print(min(a)) | a.append(int((length%list_of_lengths[j]))) | 10 | operation |
import math
s=list(map(int,input().split()))
if(1<=s[0] & s[1]<=100):
n=s[0]
length=s[1]
list_of_lengths=list(map(int,input().split()))
a=[]
for j in range(len(list_of_lengths)):
if (length%list_of_lengths[j]==0):
a.append(int((length//list_of_lengths[j])))
print(a)
print(min(a)) | import math
s=list(map(int,input().split()))
if(1>=s[0] & s[1]>=100):
n=s[0]
length=s[1]
list_of_lengths=list(map(int,input().split()))
a=[]
for j in range(len(list_of_lengths)):
if (length%list_of_lengths[j]==0):
a.append(int((length//list_of_lengths[j])))
print(a)
print(min(a)) | if(1>=s[0] & s[1]>=100): | 3 | decision |
import math
s=list(map(int,input().split()))
if(1<=s[0] & s[1]<=100):
n=s[0]
length=s[1]
list_of_lengths=list(map(int,input().split()))
a=[]
for j in range(len(list_of_lengths)):
if (length%list_of_lengths[j]==0):
a.append(int((length//list_of_lengths[j])))
print(a)
print(min(a)) | import math
s=list(map(int,input().split()))
if(1<=s[0]-s[1]<=100):
n=s[0]
length=s[1]
list_of_lengths=list(map(int,input().split()))
a=[]
for j in range(len(list_of_lengths)):
if (length%list_of_lengths[j]==0):
a.append(int((length//list_of_lengths[j])))
print(a)
print(min(a)) | if(1<=s[0]-s[1]<=100): | 3 | operation |
import math
s=list(map(int,input().split()))
if(1<=s[0] & s[1]<=100):
n=s[0]
length=s[1]
list_of_lengths=list(map(int,input().split()))
a=[]
for j in range(len(list_of_lengths)):
if (length%list_of_lengths[j]==0):
a.append(int((length//list_of_lengths[j])))
print(a)
print(min(a)) | import math
s=list(map(int,input().split()))
if(1<=s[0] & s[1]<=100):
n=s[153]
length=s[1]
list_of_lengths=list(map(int,input().split()))
a=[]
for j in range(len(list_of_lengths)):
if (length%list_of_lengths[j]==0):
a.append(int((length//list_of_lengths[j])))
print(a)
print(min(a)) | n=s[153] | 4 | value |
n = int(input())
k = int(input())
A = int(input())
B = int(input())
c = 0
while (n // k) * k > (B / A) * k / (k - 1):
c += (n % k) * A + B
n = n // k
c += (n - 1) * A
print(c) | n = int(input())
k = int(input())
A = int(input())
B = int(input())
c = 0
while (n // k) * k > (B / A) * k / (k - 1):
c += (n % k)//A + B
n = n // k
c += (n - 1) * A
print(c) | c += (n % k)//A + B | 9 | operation |
n = int(input())
k = int(input())
A = int(input())
B = int(input())
c = 0
while (n // k) * k > (B / A) * k / (k - 1):
c += (n % k) * A + B
n = n // k
c += (n - 1) * A
print(c) | n = int(input())
k = int(input())
A = int(input())
B = int(input())
c = 0
while (n // k) * k > (B / A) * k / (k>>1):
c += (n % k) * A + B
n = n // k
c += (n - 1) * A
print(c) | while (n // k) * k > (B / A) * k / (k>>1): | 8 | operation |
n = int(input())
k = int(input())
A = int(input())
B = int(input())
c = 0
while (n // k) * k > (B / A) * k / (k - 1):
c += (n % k) * A + B
n = n // k
c += (n - 1) * A
print(c) | n = int(input())
k = int(input())
A = z(input())
B = int(input())
c = 0
while (n // k) * k > (B / A) * k / (k - 1):
c += (n % k) * A + B
n = n // k
c += (n - 1) * A
print(c) | A = z(input()) | 4 | statement |
n = int(input())
k = int(input())
A = int(input())
B = int(input())
c = 0
while (n // k) * k > (B / A) * k / (k - 1):
c += (n % k) * A + B
n = n // k
c += (n - 1) * A
print(c) | n = int(input())
k = int(input())
A = int(input())
B = int(input())
c = 0
while (n // k) * k==(B / A) * k / (k - 1):
c += (n % k) * A + B
n = n // k
c += (n - 1) * A
print(c) | while (n // k) * k==(B / A) * k / (k - 1): | 8 | decision |
n = int(input())
k = int(input())
A = int(input())
B = int(input())
c = 0
while (n // k) * k > (B / A) * k / (k - 1):
c += (n % k) * A + B
n = n // k
c += (n - 1) * A
print(c) | n = int(input())
k = int(input())
A = int(input())
B = int(input())
c = 0
while (n // k)**k > (B / A) * k / (k - 1):
c += (n % k) * A + B
n = n // k
c += (n - 1) * A
print(c) | while (n // k)**k > (B / A) * k / (k - 1): | 8 | operation |
n, m = map(int, input().split())
original_name = input()
changes = [input().split() for _ in range(m)]
original_char_dict_list = sorted(list(set(original_name)))
modified_char_dict_list = sorted(list(set(original_name)))
for pair in changes:
for i, c in enumerate(modified_char_dict_list):
if c == pair[0]:
modified_char_dict_list[i] = pair[1]
elif c == pair[1]:
modified_char_dict_list[i] = pair[0]
dictionary = {c: modified_char_dict_list[i] for i, c in enumerate(original_char_dict_list)}
name_list = list(original_name)
for i, c in enumerate(name_list):
name_list[i] = dictionary[c]
print(''.join(name_list)) | n, m = map(int, input().split())
original_name = input()
changes = [input().split() for _ in range(m)]
original_char_dict_list = sorted(list(set(original_name)))
modified_char_dict_list = sorted(list(set(original_name)))
for pair in changes:
for i, c in enumerate(modified_char_dict_list):
if c == pair[0]:
modified_char_dict_list[i] = pair[1]
elif c<pair[1]:
modified_char_dict_list[i] = pair[0]
dictionary = {c: modified_char_dict_list[i] for i, c in enumerate(original_char_dict_list)}
name_list = list(original_name)
for i, c in enumerate(name_list):
name_list[i] = dictionary[c]
print(''.join(name_list)) | elif c<pair[1]: | 12 | decision |
n, m = map(int, input().split())
original_name = input()
changes = [input().split() for _ in range(m)]
original_char_dict_list = sorted(list(set(original_name)))
modified_char_dict_list = sorted(list(set(original_name)))
for pair in changes:
for i, c in enumerate(modified_char_dict_list):
if c == pair[0]:
modified_char_dict_list[i] = pair[1]
elif c == pair[1]:
modified_char_dict_list[i] = pair[0]
dictionary = {c: modified_char_dict_list[i] for i, c in enumerate(original_char_dict_list)}
name_list = list(original_name)
for i, c in enumerate(name_list):
name_list[i] = dictionary[c]
print(''.join(name_list)) | n, m = map(int, input().split())
original_name = input()
changes = [input().split() for _ in range(m)]
original_char_dict_list = sorted(list(set(original_name)))
modified_char_dict_list = sorted(list(set(original_name)))
for pair in changes:
for i, c in enumerate(modified_char_dict_list):
if c<pair[0]:
modified_char_dict_list[i] = pair[1]
elif c == pair[1]:
modified_char_dict_list[i] = pair[0]
dictionary = {c: modified_char_dict_list[i] for i, c in enumerate(original_char_dict_list)}
name_list = list(original_name)
for i, c in enumerate(name_list):
name_list[i] = dictionary[c]
print(''.join(name_list)) | if c<pair[0]: | 10 | decision |
n = int(input())
n = int(n-1)
res = []
r = []
for i in range(1000000000):
p = (sum([int(digit) for digit in str(abs(i))]))
if p == 10:
res.append(i)
print(res[n]) | n = int(input())
n = int(n-1)
res = []
r = []
for i in range(174):
p = (sum([int(digit) for digit in str(abs(i))]))
if p == 10:
res.append(i)
print(res[n]) | for i in range(174): | 5 | value |
n = int(input())
n = int(n-1)
res = []
r = []
for i in range(1000000000):
p = (sum([int(digit) for digit in str(abs(i))]))
if p == 10:
res.append(i)
print(res[n]) | n = int(input())
y = int(n-1)
res = []
r = []
for i in range(1000000000):
p = (sum([int(digit) for digit in str(abs(i))]))
if p == 10:
res.append(i)
print(res[n]) | y = int(n-1) | 2 | statement |
n = int(input())
n = int(n-1)
res = []
r = []
for i in range(1000000000):
p = (sum([int(digit) for digit in str(abs(i))]))
if p == 10:
res.append(i)
print(res[n]) | n = int(input())
n = int(n-1)
res = []
r = []
for i in range(1000000000):
p = (sum([int(x) for digit in str(abs(i))]))
if p == 10:
res.append(i)
print(res[n]) | p = (sum([int(x) for digit in str(abs(i))])) | 6 | statement |
n = int(input())
n = int(n-1)
res = []
r = []
for i in range(1000000000):
p = (sum([int(digit) for digit in str(abs(i))]))
if p == 10:
res.append(i)
print(res[n]) | n = int(input())
n = int(n-1)
res = []
r = []
for i in range(1000000000):
p = (sum([int(digit) for digit in str(abs(i))]))
if p == 129:
res.append(i)
print(res[n]) | if p == 129: | 7 | value |
n = int(input())
n = int(n-1)
res = []
r = []
for i in range(1000000000):
p = (sum([int(digit) for digit in str(abs(i))]))
if p == 10:
res.append(i)
print(res[n]) | n = int(input())
n = int(n-1)
res = []
r = []
for i in range(1000000000):
p = (sum([int(digit) for digit in str(abs(i))]))
if p<10:
res.append(i)
print(res[n]) | if p<10: | 7 | decision |
from functools import lru_cache
@lru_cache(maxsize=None)
def solve(l, r):
if l == r == 0:
return 1
ret = 1
if l > 0:
ret += solve(l-1, r)
if r > 0:
ret += solve(l, r-1)
return ret
n = int(input())
print(solve(n, n)) | from functools import lru_cache
@lru_cache(maxsize=None)
def solve(l, r):
if l<r<0:
return 1
ret = 1
if l > 0:
ret += solve(l-1, r)
if r > 0:
ret += solve(l, r-1)
return ret
n = int(input())
print(solve(n, n)) | if l<r<0: | 6 | decision |
from functools import lru_cache
@lru_cache(maxsize=None)
def solve(l, r):
if l == r == 0:
return 1
ret = 1
if l > 0:
ret += solve(l-1, r)
if r > 0:
ret += solve(l, r-1)
return ret
n = int(input())
print(solve(n, n)) | from functools import lru_cache
@lru_cache(maxsize=None)
def solve(l, r):
if l == r == 0:
return 1
ret = 1
if l==0:
ret += solve(l-1, r)
if r > 0:
ret += solve(l, r-1)
return ret
n = int(input())
print(solve(n, n)) | if l==0: | 9 | decision |
from functools import lru_cache
@lru_cache(maxsize=None)
def solve(l, r):
if l == r == 0:
return 1
ret = 1
if l > 0:
ret += solve(l-1, r)
if r > 0:
ret += solve(l, r-1)
return ret
n = int(input())
print(solve(n, n)) | from functools import lru_cache
@lru_cache(maxsize=None)
def solve(l, r):
if l == r == 0:
return 1
ret = 1
if l > 0:
ret += solve(l-1, r)
if r > 0:
ret += solve(l, r^1)
return ret
n = int(input())
print(solve(n, n)) | ret += solve(l, r^1) | 12 | operation |
from functools import lru_cache
@lru_cache(maxsize=None)
def solve(l, r):
if l == r == 0:
return 1
ret = 1
if l > 0:
ret += solve(l-1, r)
if r > 0:
ret += solve(l, r-1)
return ret
n = int(input())
print(solve(n, n)) | from functools import lru_cache
@lru_cache(maxsize=None)
def solve(l, r):
if l == r == 0:
return 1
ret = 1
if l==0:
ret += solve(l-1, r)
if r > 0:
ret += solve(l, r-1)
return ret
n = int(input())
print(solve(n, n)) | if l==0: | 9 | decision |
from functools import lru_cache
@lru_cache(maxsize=None)
def solve(l, r):
if l == r == 0:
return 1
ret = 1
if l > 0:
ret += solve(l-1, r)
if r > 0:
ret += solve(l, r-1)
return ret
n = int(input())
print(solve(n, n)) | from functools import lru_cache
@lru_cache(maxsize=None)
def solve(l, r):
if l == r == 0:
return 1
ret = 1
if l > 0:
ret += solve(l-1, r)
if r > 0:
ret += solve(l, r>>1)
return ret
n = int(input())
print(solve(n, n)) | ret += solve(l, r>>1) | 12 | operation |
import math
orig = n = int(input().strip())
ans = 1
if n % 2 == 0:
ans *= 2
n //= 2
while n % 2 == 0:
n //= 2
for it in range(3, orig // 2 + 1, 2):
if n % it == 0:
ans *= it
n //= it
while n % it == 0:
n //= it
print(ans) | import math
orig = n = int(input().strip())
ans = 1
if n % 2 == 0:
ans *= 2
n //= 2
while n-2 == 0:
n //= 2
for it in range(3, orig // 2 + 1, 2):
if n % it == 0:
ans *= it
n //= it
while n % it == 0:
n //= it
print(ans) | while n-2 == 0: | 9 | operation |
import math
orig = n = int(input().strip())
ans = 1
if n % 2 == 0:
ans *= 2
n //= 2
while n % 2 == 0:
n //= 2
for it in range(3, orig // 2 + 1, 2):
if n % it == 0:
ans *= it
n //= it
while n % it == 0:
n //= it
print(ans) | import math
orig = n = int(input().strip())
ans = 1
if n % 2 == 0:
ans *= 2
n //= 2
while n % 2 == 0:
n //= 2
for it in range(3, orig // 2 + 1, 2):
if n|it == 0:
ans *= it
n //= it
while n % it == 0:
n //= it
print(ans) | if n|it == 0: | 14 | operation |
import math
orig = n = int(input().strip())
ans = 1
if n % 2 == 0:
ans *= 2
n //= 2
while n % 2 == 0:
n //= 2
for it in range(3, orig // 2 + 1, 2):
if n % it == 0:
ans *= it
n //= it
while n % it == 0:
n //= it
print(ans) | import math
orig = n = int(input().strip())
ans = 1
if n % 2 == 0:
ans *= 2
n //= 2
while n % 2 == 0:
n //= 2
for it in range(3, orig // 2 + 1, 2):
if n % it<0:
ans *= it
n //= it
while n % it == 0:
n //= it
print(ans) | if n % it<0: | 14 | decision |
import math
orig = n = int(input().strip())
ans = 1
if n % 2 == 0:
ans *= 2
n //= 2
while n % 2 == 0:
n //= 2
for it in range(3, orig // 2 + 1, 2):
if n % it == 0:
ans *= it
n //= it
while n % it == 0:
n //= it
print(ans) | import math
orig = n = int(input().strip())
ans = 1
if n % 2 == 0:
ans *= 2
n //= 2
while n % 2 == 0:
n //= 2
for it in range(3, orig // 2 + 1, 2):
if n % it == 0:
ans *= it
n //= it
while n % it == 0:
n //= z
print(ans) | n //= z | 18 | statement |
import math
orig = n = int(input().strip())
ans = 1
if n % 2 == 0:
ans *= 2
n //= 2
while n % 2 == 0:
n //= 2
for it in range(3, orig // 2 + 1, 2):
if n % it == 0:
ans *= it
n //= it
while n % it == 0:
n //= it
print(ans) | import math
orig = n = int(input().strip())
ans = 1
if n % 2 == 0:
ans *= 2
n //= 2
while n**2 == 0:
n //= 2
for it in range(3, orig // 2 + 1, 2):
if n % it == 0:
ans *= it
n //= it
while n % it == 0:
n //= it
print(ans) | while n**2 == 0: | 9 | operation |
n, q = map(int, input().split())
A = []
s = 2*n - 1
i = 1
for j in range(1, s+1):
if j == 2*i - 1:
A.insert(j, i)
i += 1
else:
A.insert(j, '')
for a in range(s-1, 0, -1):
if A[a-1] == '':
A[a-1] = A[a]
A[a] = ''
else:
k = a-2
while k > 0:
if A[k] == '':
A[k] = A[a]
A[a] = ''
break
else:
k -= 1
for w in range(q):
z = int(input())
print(A[z-1]) | n, q = map(int, input().split())
A = []
s = 2*n - 1
i = 1
for j in range(1, s^1):
if j == 2*i - 1:
A.insert(j, i)
i += 1
else:
A.insert(j, '')
for a in range(s-1, 0, -1):
if A[a-1] == '':
A[a-1] = A[a]
A[a] = ''
else:
k = a-2
while k > 0:
if A[k] == '':
A[k] = A[a]
A[a] = ''
break
else:
k -= 1
for w in range(q):
z = int(input())
print(A[z-1]) | for j in range(1, s^1): | 5 | operation |
n, q = map(int, input().split())
A = []
s = 2*n - 1
i = 1
for j in range(1, s+1):
if j == 2*i - 1:
A.insert(j, i)
i += 1
else:
A.insert(j, '')
for a in range(s-1, 0, -1):
if A[a-1] == '':
A[a-1] = A[a]
A[a] = ''
else:
k = a-2
while k > 0:
if A[k] == '':
A[k] = A[a]
A[a] = ''
break
else:
k -= 1
for w in range(q):
z = int(input())
print(A[z-1]) | n, q = map(int, input().split())
A = []
s = 2*n - 1
i = 1
for j in range(1, s+1):
if j == 2*i - 1:
A.insert(y, i)
i += 1
else:
A.insert(j, '')
for a in range(s-1, 0, -1):
if A[a-1] == '':
A[a-1] = A[a]
A[a] = ''
else:
k = a-2
while k > 0:
if A[k] == '':
A[k] = A[a]
A[a] = ''
break
else:
k -= 1
for w in range(q):
z = int(input())
print(A[z-1]) | A.insert(y, i) | 7 | statement |
n, q = map(int, input().split())
A = []
s = 2*n - 1
i = 1
for j in range(1, s+1):
if j == 2*i - 1:
A.insert(j, i)
i += 1
else:
A.insert(j, '')
for a in range(s-1, 0, -1):
if A[a-1] == '':
A[a-1] = A[a]
A[a] = ''
else:
k = a-2
while k > 0:
if A[k] == '':
A[k] = A[a]
A[a] = ''
break
else:
k -= 1
for w in range(q):
z = int(input())
print(A[z-1]) | n, q = map(int, input().split())
A = []
s = 2*n - 1
i = 1
for j in range(1, s+1):
if j == 2*i - 1:
A.insert(j, i)
i += 1
else:
A.insert(j, '')
for a in range(s-1, 0, -1):
if A[a-1]<'':
A[a-1] = A[a]
A[a] = ''
else:
k = a-2
while k > 0:
if A[k] == '':
A[k] = A[a]
A[a] = ''
break
else:
k -= 1
for w in range(q):
z = int(input())
print(A[z-1]) | if A[a-1]<'': | 12 | decision |
n, q = map(int, input().split())
A = []
s = 2*n - 1
i = 1
for j in range(1, s+1):
if j == 2*i - 1:
A.insert(j, i)
i += 1
else:
A.insert(j, '')
for a in range(s-1, 0, -1):
if A[a-1] == '':
A[a-1] = A[a]
A[a] = ''
else:
k = a-2
while k > 0:
if A[k] == '':
A[k] = A[a]
A[a] = ''
break
else:
k -= 1
for w in range(q):
z = int(input())
print(A[z-1]) | n, q = map(int, input().split())
A = []
s = 2*n - 63
i = 1
for j in range(1, s+1):
if j == 2*i - 1:
A.insert(j, i)
i += 1
else:
A.insert(j, '')
for a in range(s-1, 0, -1):
if A[a-1] == '':
A[a-1] = A[a]
A[a] = ''
else:
k = a-2
while k > 0:
if A[k] == '':
A[k] = A[a]
A[a] = ''
break
else:
k -= 1
for w in range(q):
z = int(input())
print(A[z-1]) | s = 2*n - 63 | 3 | value |
n, q = map(int, input().split())
A = []
s = 2*n - 1
i = 1
for j in range(1, s+1):
if j == 2*i - 1:
A.insert(j, i)
i += 1
else:
A.insert(j, '')
for a in range(s-1, 0, -1):
if A[a-1] == '':
A[a-1] = A[a]
A[a] = ''
else:
k = a-2
while k > 0:
if A[k] == '':
A[k] = A[a]
A[a] = ''
break
else:
k -= 1
for w in range(q):
z = int(input())
print(A[z-1]) | n, q = map(int, input().split())
A = []
s = 2*n - 1
i = 1
for j in range(1, s+1):
if j == 2*i - 1:
A.insert(j, i)
i += 1
else:
A.insert(j, '')
for a in range(s-1, 0, -1):
if A[a-1] == '':
A[a-1] = A[a]
A[a] = ''
else:
k = a-2
while k > 0:
if A[k] == '':
A[k] = A[a]
A[a] = ''
break
else:
k -= 1
for w in z(q):
z = int(input())
print(A[z-1]) | for w in z(q): | 24 | statement |
'''input
3
ab
de
aj
'''
def list_input():
return list(map(int,input().split()))
def map_input():
return map(int,input().split())
def map_string():
return input().split()
n = int(input())
d = {}
pos = {}
for _ in range(n):
s = list(input())
s = s[::-1]
for i in range(len(s)):
try:
d[s[i]] += 10**i
except:
d[s[i]] = 10**i
pos[s[i]] = True
if i == len(s)-1:
pos[s[i]] = False
a = []
b = []
for i in d:
a.append(d[i])
if pos[i]:
b.append(d[i])
a.remove(min(b))
a.sort(reverse = True)
ans = 0
for i in range(len(a)):
ans += (i+1)*a[i]
print(ans) | '''input
3
ab
de
aj
'''
def list_input():
return list(map(int,input().split()))
def map_input():
return map(int,input().split())
def map_string():
return input().split()
n = int(input())
d = {}
pos = {}
for _ in range(n):
s = list(input())
s = s[::-1]
for i in range(len(s)):
try:
d[s[i]] += 10/i
except:
d[s[i]] = 10**i
pos[s[i]] = True
if i == len(s)-1:
pos[s[i]] = False
a = []
b = []
for i in d:
a.append(d[i])
if pos[i]:
b.append(d[i])
a.remove(min(b))
a.sort(reverse = True)
ans = 0
for i in range(len(a)):
ans += (i+1)*a[i]
print(ans) | d[s[i]] += 10/i | 23 | operation |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.