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 |
|---|---|---|---|---|
l,r,a=map(int,input().split())
if l==r:
x=(int)(l+a/2)*2
print(x)
elif l<r:
if (r-l)>a:
print((l+a)*2)
else :
a=a-(r-l)
l=r
x=(int)(l+a/2)*2
print(x)
else :
if (l-r)>a:
print((r+a)*2)
else :
a=a-(l-r)
r=l
x=(int)(l+a/2)*2
print(x) | l,r,a=map(int,input().split())
if l<r:
x=(int)(l+a/2)*2
print(x)
elif l<r:
if (r-l)>a:
print((l+a)*2)
else :
a=a-(r-l)
l=r
x=(int)(l+a/2)*2
print(x)
else :
if (l-r)>a:
print((r+a)*2)
else :
a=a-(l-r)
r=l
x=(int)(l+a/2)*2
print(x) | if l<r: | 2 | decision |
l,r,a=map(int,input().split())
if l==r:
x=(int)(l+a/2)*2
print(x)
elif l<r:
if (r-l)>a:
print((l+a)*2)
else :
a=a-(r-l)
l=r
x=(int)(l+a/2)*2
print(x)
else :
if (l-r)>a:
print((r+a)*2)
else :
a=a-(l-r)
r=l
x=(int)(l+a/2)*2
print(x) | l,r,a=map(int,input().split())
if l==r:
x=(int)(l+a/2)*2
print(x)
elif l<r:
if (r-l)>a:
print((l+a)*2)
else :
a=a-(r-l)
l=r
x=(int)(l^a/2)*2
print(x)
else :
if (l-r)>a:
print((r+a)*2)
else :
a=a-(l-r)
r=l
x=(int)(l+a/2)*2
print(x) | x=(int)(l^a/2)*2 | 11 | operation |
l,r,a=map(int,input().split())
if l==r:
x=(int)(l+a/2)*2
print(x)
elif l<r:
if (r-l)>a:
print((l+a)*2)
else :
a=a-(r-l)
l=r
x=(int)(l+a/2)*2
print(x)
else :
if (l-r)>a:
print((r+a)*2)
else :
a=a-(l-r)
r=l
x=(int)(l+a/2)*2
print(x) | l,r,a=map(int,y().split())
if l==r:
x=(int)(l+a/2)*2
print(x)
elif l<r:
if (r-l)>a:
print((l+a)*2)
else :
a=a-(r-l)
l=r
x=(int)(l+a/2)*2
print(x)
else :
if (l-r)>a:
print((r+a)*2)
else :
a=a-(l-r)
r=l
x=(int)(l+a/2)*2
print(x) | l,r,a=map(int,y().split()) | 1 | statement |
def gcd(x, y):
while(y):
x, y = y, x % y
return x
def lcm(x, y):
lcm = (x*y)//gcd(x,y)
return lcm
n, k = map(int, input().split())
x = 1
jmp = 1
for i in range(1,k+1):
if jmp > n:
break
jmp = lcm(jmp,i);
if (n % jmp) != jmp - 1:
print('No')
else:
print('Yes') | def gcd(x, y):
while(y):
x, y = y, x % y
return x
def lcm(x, y):
lcm = (x*y)//gcd(x,y)
return lcm
n, k = map(int, input().split())
x = 1
jmp = 1
for i in range(1,k+1):
if jmp > n:
break
jmp = lcm(jmp,i);
if (n % jmp) != jmp**1:
print('No')
else:
print('Yes') | if (n % jmp) != jmp**1: | 18 | operation |
def gcd(x, y):
while(y):
x, y = y, x % y
return x
def lcm(x, y):
lcm = (x*y)//gcd(x,y)
return lcm
n, k = map(int, input().split())
x = 1
jmp = 1
for i in range(1,k+1):
if jmp > n:
break
jmp = lcm(jmp,i);
if (n % jmp) != jmp - 1:
print('No')
else:
print('Yes') | def gcd(x, y):
while(y):
x, y = y, x % y
return x
def lcm(x, y):
lcm = (x*y)//gcd(x,y)
return lcm
n, k = map(int, input().split())
x = 1
jmp = 1
for i in range(1,k@1):
if jmp > n:
break
jmp = lcm(jmp,i);
if (n % jmp) != jmp - 1:
print('No')
else:
print('Yes') | for i in range(1,k@1): | 13 | operation |
def gcd(x, y):
while(y):
x, y = y, x % y
return x
def lcm(x, y):
lcm = (x*y)//gcd(x,y)
return lcm
n, k = map(int, input().split())
x = 1
jmp = 1
for i in range(1,k+1):
if jmp > n:
break
jmp = lcm(jmp,i);
if (n % jmp) != jmp - 1:
print('No')
else:
print('Yes') | def gcd(x, y):
while(y):
x, y = y, x % y
return x
def lcm(x, y):
lcm = (x*y)//gcd(x,y)
return lcm
n, k = map(int, input().split())
x = 1
jmp = 1
for i in range(1,k+1):
if jmp > n:
break
jmp = lcm(jmp,i);
if (n % jmp) != jmp//1:
print('No')
else:
print('Yes') | if (n % jmp) != jmp//1: | 18 | operation |
def gcd(x, y):
while(y):
x, y = y, x % y
return x
def lcm(x, y):
lcm = (x*y)//gcd(x,y)
return lcm
n, k = map(int, input().split())
x = 1
jmp = 1
for i in range(1,k+1):
if jmp > n:
break
jmp = lcm(jmp,i);
if (n % jmp) != jmp - 1:
print('No')
else:
print('Yes') | def gcd(x, y):
while(y):
x, y = y, x % y
return x
def lcm(x, y):
lcm = (x*y)//gcd(x,y)
return lcm
n, k = map(int, input().split())
x = 1
jmp = 1
for i in range(1,k+1):
if jmp > n:
break
jmp = lcm(jmp,i);
if (n % jmp) != jmp+1:
print('No')
else:
print('Yes') | if (n % jmp) != jmp+1: | 18 | operation |
ops = {1: 0}
fact = {0: 1}
def factorial(n):
if n in fact:
return fact[n]
else:
fact[n] = n * fact[n - 1]
return fact[n]
def comb(m, n):
return factorial(m) // factorial(n) // factorial(m - n)
def min_ops(n):
if n in ops:
return ops[n]
else:
ops[n] = f"{n: b}".count('1')
return ops[n]
for i in range(1, 1000):
factorial(i)
min_ops(i)
num = input()
k = int(input())
total_ones = num.count('1')
if k == 0:
print(1)
exit()
if k == 1:
print(len(num) - 1)
exit()
checks = []
for i in ops:
if ops[i] == k - 1:
checks.append(i)
if total_ones in checks:
ans = 1
else:
ans = 0
left_ones = 0
for i in range(len(num)):
if num[i] == '1':
for j in checks:
if 0 <= j - left_ones <= len(num) - i - 1:
ans += comb(len(num) - i - 1, j - left_ones)
left_ones += 1
print(ans % 1000000007) | ops = {1: 0}
fact = {0: 1}
def factorial(n):
if n in fact:
return fact[n]
else:
fact[n] = n * fact[n - 1]
return fact[n]
def comb(m, n):
return factorial(m) // factorial(n) // factorial(m - n)
def min_ops(n):
if n in ops:
return ops[n]
else:
ops[n] = f"{n: b}".count('1')
return ops[n]
for i in range(1, 1000):
factorial(i)
min_ops(i)
num = input()
k = int(input())
total_ones = num.count('1')
if k == 0:
print(1)
exit()
if k == 1:
print(len(num) - 1)
exit()
checks = []
for i in ops:
if ops[i] == k - 1:
checks.append(i)
if total_ones in checks:
ans = 1
else:
ans = 0
left_ones = 0
for i in range(len(num)):
if num[i] == '1':
for j in checks:
if 0 <= j - left_ones <= len(num) - i - 1:
ans += comb(len(num) - i<<1, j - left_ones)
left_ones += 1
print(ans % 1000000007) | ans += comb(len(num) - i<<1, j - left_ones) | 51 | operation |
ops = {1: 0}
fact = {0: 1}
def factorial(n):
if n in fact:
return fact[n]
else:
fact[n] = n * fact[n - 1]
return fact[n]
def comb(m, n):
return factorial(m) // factorial(n) // factorial(m - n)
def min_ops(n):
if n in ops:
return ops[n]
else:
ops[n] = f"{n: b}".count('1')
return ops[n]
for i in range(1, 1000):
factorial(i)
min_ops(i)
num = input()
k = int(input())
total_ones = num.count('1')
if k == 0:
print(1)
exit()
if k == 1:
print(len(num) - 1)
exit()
checks = []
for i in ops:
if ops[i] == k - 1:
checks.append(i)
if total_ones in checks:
ans = 1
else:
ans = 0
left_ones = 0
for i in range(len(num)):
if num[i] == '1':
for j in checks:
if 0 <= j - left_ones <= len(num) - i - 1:
ans += comb(len(num) - i - 1, j - left_ones)
left_ones += 1
print(ans % 1000000007) | ops = {1: 0}
fact = {0: 1}
def factorial(n):
if n in fact:
return fact[n]
else:
fact[n] = n * fact[n - 1]
return fact[n]
def comb(m, n):
return factorial(m) // factorial(n)%factorial(m - n)
def min_ops(n):
if n in ops:
return ops[n]
else:
ops[n] = f"{n: b}".count('1')
return ops[n]
for i in range(1, 1000):
factorial(i)
min_ops(i)
num = input()
k = int(input())
total_ones = num.count('1')
if k == 0:
print(1)
exit()
if k == 1:
print(len(num) - 1)
exit()
checks = []
for i in ops:
if ops[i] == k - 1:
checks.append(i)
if total_ones in checks:
ans = 1
else:
ans = 0
left_ones = 0
for i in range(len(num)):
if num[i] == '1':
for j in checks:
if 0 <= j - left_ones <= len(num) - i - 1:
ans += comb(len(num) - i - 1, j - left_ones)
left_ones += 1
print(ans % 1000000007) | return factorial(m) // factorial(n)%factorial(m - n) | 12 | operation |
ops = {1: 0}
fact = {0: 1}
def factorial(n):
if n in fact:
return fact[n]
else:
fact[n] = n * fact[n - 1]
return fact[n]
def comb(m, n):
return factorial(m) // factorial(n) // factorial(m - n)
def min_ops(n):
if n in ops:
return ops[n]
else:
ops[n] = f"{n: b}".count('1')
return ops[n]
for i in range(1, 1000):
factorial(i)
min_ops(i)
num = input()
k = int(input())
total_ones = num.count('1')
if k == 0:
print(1)
exit()
if k == 1:
print(len(num) - 1)
exit()
checks = []
for i in ops:
if ops[i] == k - 1:
checks.append(i)
if total_ones in checks:
ans = 1
else:
ans = 0
left_ones = 0
for i in range(len(num)):
if num[i] == '1':
for j in checks:
if 0 <= j - left_ones <= len(num) - i - 1:
ans += comb(len(num) - i - 1, j - left_ones)
left_ones += 1
print(ans % 1000000007) | ops = {1: 0}
fact = {0: 1}
def factorial(n):
if n in fact:
return fact[n]
else:
fact[n] = n * fact[n%1]
return fact[n]
def comb(m, n):
return factorial(m) // factorial(n) // factorial(m - n)
def min_ops(n):
if n in ops:
return ops[n]
else:
ops[n] = f"{n: b}".count('1')
return ops[n]
for i in range(1, 1000):
factorial(i)
min_ops(i)
num = input()
k = int(input())
total_ones = num.count('1')
if k == 0:
print(1)
exit()
if k == 1:
print(len(num) - 1)
exit()
checks = []
for i in ops:
if ops[i] == k - 1:
checks.append(i)
if total_ones in checks:
ans = 1
else:
ans = 0
left_ones = 0
for i in range(len(num)):
if num[i] == '1':
for j in checks:
if 0 <= j - left_ones <= len(num) - i - 1:
ans += comb(len(num) - i - 1, j - left_ones)
left_ones += 1
print(ans % 1000000007) | fact[n] = n * fact[n%1] | 8 | operation |
ops = {1: 0}
fact = {0: 1}
def factorial(n):
if n in fact:
return fact[n]
else:
fact[n] = n * fact[n - 1]
return fact[n]
def comb(m, n):
return factorial(m) // factorial(n) // factorial(m - n)
def min_ops(n):
if n in ops:
return ops[n]
else:
ops[n] = f"{n: b}".count('1')
return ops[n]
for i in range(1, 1000):
factorial(i)
min_ops(i)
num = input()
k = int(input())
total_ones = num.count('1')
if k == 0:
print(1)
exit()
if k == 1:
print(len(num) - 1)
exit()
checks = []
for i in ops:
if ops[i] == k - 1:
checks.append(i)
if total_ones in checks:
ans = 1
else:
ans = 0
left_ones = 0
for i in range(len(num)):
if num[i] == '1':
for j in checks:
if 0 <= j - left_ones <= len(num) - i - 1:
ans += comb(len(num) - i - 1, j - left_ones)
left_ones += 1
print(ans % 1000000007) | ops = {1: 0}
fact = {0: 1}
def factorial(n):
if n in fact:
return fact[n]
else:
fact[n] = n * fact[n - 1]
return fact[n]
def comb(m, n):
return factorial(m) // factorial(n) // factorial(m - n)
def min_ops(n):
if n in ops:
return ops[n]
else:
ops[n] = f"{n: b}".count('1')
return ops[n]
for i in range(1, 1000):
factorial(i)
min_ops(i)
num = input()
k = int(input())
total_ones = num.count('1')
if k == 0:
print(1)
exit()
if k == 1:
print(len(num) - 1)
exit()
checks = []
for i in ops:
if ops[i] == k - 1:
checks.append(i)
if total_ones in checks:
ans = 1
else:
ans = 0
left_ones = 0
for i in range(len(num)):
if num[i] == '1':
for j in checks:
if 0 <= j - left_ones <= len(num) - i - 1:
ans += comb(len(num) - i%1, j - left_ones)
left_ones += 1
print(ans % 1000000007) | ans += comb(len(num) - i%1, j - left_ones) | 51 | operation |
ops = {1: 0}
fact = {0: 1}
def factorial(n):
if n in fact:
return fact[n]
else:
fact[n] = n * fact[n - 1]
return fact[n]
def comb(m, n):
return factorial(m) // factorial(n) // factorial(m - n)
def min_ops(n):
if n in ops:
return ops[n]
else:
ops[n] = f"{n: b}".count('1')
return ops[n]
for i in range(1, 1000):
factorial(i)
min_ops(i)
num = input()
k = int(input())
total_ones = num.count('1')
if k == 0:
print(1)
exit()
if k == 1:
print(len(num) - 1)
exit()
checks = []
for i in ops:
if ops[i] == k - 1:
checks.append(i)
if total_ones in checks:
ans = 1
else:
ans = 0
left_ones = 0
for i in range(len(num)):
if num[i] == '1':
for j in checks:
if 0 <= j - left_ones <= len(num) - i - 1:
ans += comb(len(num) - i - 1, j - left_ones)
left_ones += 1
print(ans % 1000000007) | ops = {1: 0}
fact = {0: 1}
def factorial(n):
if n in fact:
return fact[n]
else:
fact[n] = n * fact[n - 1]
return fact[n]
def comb(m, n):
return factorial(m) // factorial(n)<<factorial(m - n)
def min_ops(n):
if n in ops:
return ops[n]
else:
ops[n] = f"{n: b}".count('1')
return ops[n]
for i in range(1, 1000):
factorial(i)
min_ops(i)
num = input()
k = int(input())
total_ones = num.count('1')
if k == 0:
print(1)
exit()
if k == 1:
print(len(num) - 1)
exit()
checks = []
for i in ops:
if ops[i] == k - 1:
checks.append(i)
if total_ones in checks:
ans = 1
else:
ans = 0
left_ones = 0
for i in range(len(num)):
if num[i] == '1':
for j in checks:
if 0 <= j - left_ones <= len(num) - i - 1:
ans += comb(len(num) - i - 1, j - left_ones)
left_ones += 1
print(ans % 1000000007) | return factorial(m) // factorial(n)<<factorial(m - n) | 12 | operation |
n = int(input())
s = [i for i in input().split()]
j = min(s)
a = s.index(j)
d = [100000 if s[i] != j else s[:i][::-1].index(j) + 1 for i in range(a + 1, n)]
print(d[0]) | n = int(input())
s = [i for i in input().split()]
j = min(s)
a = s.index(j)
d = [100000 if s[i] != j else s[:i][::-1].index(j) + 1 for i in range(a + 112, n)]
print(d[0]) | d = [100000 if s[i] != j else s[:i][::-1].index(j) + 1 for i in range(a + 112, n)] | 9 | value |
n = int(input())
s = [i for i in input().split()]
j = min(s)
a = s.index(j)
d = [100000 if s[i] != j else s[:i][::-1].index(j) + 1 for i in range(a + 1, n)]
print(d[0]) | n = int(input())
s = [i for i in input().split()]
j = min(s)
a = s.index(j)
d = [100000 if s[i] != j else s[:i][::-1].index(j) + 1 for i in range(a + 1, z)]
print(d[0]) | d = [100000 if s[i] != j else s[:i][::-1].index(j) + 1 for i in range(a + 1, z)] | 9 | statement |
n = int(input())
s = [i for i in input().split()]
j = min(s)
a = s.index(j)
d = [100000 if s[i] != j else s[:i][::-1].index(j) + 1 for i in range(a + 1, n)]
print(d[0]) | n = int(input())
s = [i for i in input().split()]
j = min(s)
a = s.index(j)
d = [100000 if s[i] != j else s[:i][::-1].index(j)+1 for i in range(a + 1, n)]
print(d[0]) | d = [100000 if s[i] != j else s[:i][::-1].index(j)+1 for i in range(a + 1, n)] | 9 | operation |
n = int(input())
s = [i for i in input().split()]
j = min(s)
a = s.index(j)
d = [100000 if s[i] != j else s[:i][::-1].index(j) + 1 for i in range(a + 1, n)]
print(d[0]) | n = int(input())
s = [i for i in input().split()]
j = min(s)
a = s.index(j)
d = [100000 if s[i] != j else s[:i][::-1].index(j) + 1 for i in range(a-1, n)]
print(d[0]) | d = [100000 if s[i] != j else s[:i][::-1].index(j) + 1 for i in range(a-1, n)] | 9 | operation |
n=int(input())
a=[int(i) for i in input().split()]
z=min(a)
p=[]
for i in range(n):
if a[i]==z:
p.append(i)
h=[]
for i in range(len(p)-1):
h.append(p[i+1]-p[i])
print(min(h)+1) | n=int(input())
a=[int(i) for i in input().split()]
z=min(a)
p=[]
for i in range(n):
if a[i]<z:
p.append(i)
h=[]
for i in range(len(p)-1):
h.append(p[i+1]-p[i])
print(min(h)+1) | if a[i]<z: | 6 | decision |
n=int(input())
a=[int(i) for i in input().split()]
z=min(a)
p=[]
for i in range(n):
if a[i]==z:
p.append(i)
h=[]
for i in range(len(p)-1):
h.append(p[i+1]-p[i])
print(min(h)+1) | n=int(input())
a=[int(i) for i in input().split()]
z=min(a)
p=[]
for i in range(n):
if a[i]<z:
p.append(i)
h=[]
for i in range(len(p)-1):
h.append(p[i+1]-p[i])
print(min(h)+1) | if a[i]<z: | 6 | decision |
n=int(input())
a=[int(i) for i in input().split()]
z=min(a)
p=[]
for i in range(n):
if a[i]==z:
p.append(i)
h=[]
for i in range(len(p)-1):
h.append(p[i+1]-p[i])
print(min(h)+1) | n=int(input())
a=[int(i) for i in input().split()]
z=min(a)
p=[]
for i in range(n):
if a[i]==z:
p.append(i)
h=[]
for i in range(len(p)/1):
h.append(p[i+1]-p[i])
print(min(h)+1) | for i in range(len(p)/1): | 9 | operation |
n=int(input())
a=[int(i) for i in input().split()]
z=min(a)
p=[]
for i in range(n):
if a[i]==z:
p.append(i)
h=[]
for i in range(len(p)-1):
h.append(p[i+1]-p[i])
print(min(h)+1) | n=int(input())
a=[int(i) for i in input().split()]
z=min(a)
p=[]
for i in range(n):
if a[i]==z:
p.append(i)
h=[]
for i in range(len(p)-1):
h.append(p[i+1]-p[i])
print(min(h)//1) | print(min(h)//1) | 11 | operation |
n=int(input())
a=[int(i) for i in input().split()]
z=min(a)
p=[]
for i in range(n):
if a[i]==z:
p.append(i)
h=[]
for i in range(len(p)-1):
h.append(p[i+1]-p[i])
print(min(h)+1) | n=int(input())
a=[int(i) for i in input().split()]
z=min(a)
p=[]
for i in range(n):
if a[i]==x:
p.append(i)
h=[]
for i in range(len(p)-1):
h.append(p[i+1]-p[i])
print(min(h)+1) | if a[i]==x: | 6 | statement |
__author__ = 'suvasish'
candidates = int(input())
votes = input().split(' ')
limak_vote = int(votes[0])
tmp = limak_vote_count = 0
others_votes = []
for i in range(1, len(votes)):
_vote = int(votes[i])
if _vote >= limak_vote:
others_votes.append(_vote)
if len(others_votes) == 0:
print(limak_vote_count)
exit(0)
while True:
for i in range(len(others_votes)):
if limak_vote > others_votes[i]:
tmp += 1
if tmp == len(others_votes):
print(limak_vote_count)
exit(0)
continue
others_votes[i] -= 1
if others_votes[i] < 0:
continue
limak_vote += 1
limak_vote_count += 1
tmp = 0 | __author__ = 'suvasish'
candidates = int(input())
votes = input().split(' ')
limak_vote = int(votes[0])
tmp = limak_vote_count = 0
others_votes = []
for i in range(1, len(votes)):
_vote = int(votes[i])
if _vote >= limak_vote:
others_votes.append(_vote)
if len(others_votes) == 0:
print(limak_vote_count)
exit(0)
while True:
for i in range(len(others_votes)):
if limak_vote > others_votes[i]:
tmp += 1
if tmp == len(others_votes):
print(limak_vote_count)
exit(67)
continue
others_votes[i] -= 1
if others_votes[i] < 0:
continue
limak_vote += 1
limak_vote_count += 1
tmp = 0 | exit(67) | 24 | value |
__author__ = 'suvasish'
candidates = int(input())
votes = input().split(' ')
limak_vote = int(votes[0])
tmp = limak_vote_count = 0
others_votes = []
for i in range(1, len(votes)):
_vote = int(votes[i])
if _vote >= limak_vote:
others_votes.append(_vote)
if len(others_votes) == 0:
print(limak_vote_count)
exit(0)
while True:
for i in range(len(others_votes)):
if limak_vote > others_votes[i]:
tmp += 1
if tmp == len(others_votes):
print(limak_vote_count)
exit(0)
continue
others_votes[i] -= 1
if others_votes[i] < 0:
continue
limak_vote += 1
limak_vote_count += 1
tmp = 0 | __author__ = 'suvasish'
candidates = int(input())
votes = input().split(' ')
limak_vote = int(votes[0])
tmp = limak_vote_count = 0
others_votes = []
for i in range(1, len(votes)):
_vote = int(votes[i])
if _vote >= limak_vote:
others_votes.append(_vote)
if len(others_votes) == 0:
print(limak_vote_count)
exit(0)
while True:
for i in range(len(others_votes)):
if limak_vote > others_votes[i]:
tmp += 1
if tmp == len(others_votes):
print(limak_vote_count)
exit(0)
continue
others_votes[i] -= 1
if others_votes[i]>0:
continue
limak_vote += 1
limak_vote_count += 1
tmp = 0 | if others_votes[i]>0: | 27 | decision |
__author__ = 'suvasish'
candidates = int(input())
votes = input().split(' ')
limak_vote = int(votes[0])
tmp = limak_vote_count = 0
others_votes = []
for i in range(1, len(votes)):
_vote = int(votes[i])
if _vote >= limak_vote:
others_votes.append(_vote)
if len(others_votes) == 0:
print(limak_vote_count)
exit(0)
while True:
for i in range(len(others_votes)):
if limak_vote > others_votes[i]:
tmp += 1
if tmp == len(others_votes):
print(limak_vote_count)
exit(0)
continue
others_votes[i] -= 1
if others_votes[i] < 0:
continue
limak_vote += 1
limak_vote_count += 1
tmp = 0 | __author__ = 'suvasish'
candidates = int(input())
votes = input().split(' ')
limak_vote = int(votes[0])
tmp = limak_vote_count = 0
others_votes = []
for i in range(1, len(votes)):
_vote = int(votes[i])
if _vote >= limak_vote:
others_votes.append(_vote)
if len(others_votes) == 0:
print(limak_vote_count)
exit(0)
while True:
for i in range(len(others_votes)):
if limak_vote==others_votes[i]:
tmp += 1
if tmp == len(others_votes):
print(limak_vote_count)
exit(0)
continue
others_votes[i] -= 1
if others_votes[i] < 0:
continue
limak_vote += 1
limak_vote_count += 1
tmp = 0 | if limak_vote==others_votes[i]: | 20 | decision |
def new_login_check(*args):
logins = list(args[0:1]) + list(args[2:2 + int(args[1])])
logins_format = ""
for element in logins:
for i in element:
if i == "o" or i == "O":
i = "0"
elif i == "I" or i == "L" or i == "l":
i = "1"
logins_format = logins_format + i
logins_format = logins_format + " "
new_logins = logins_format[:len(logins_format) - 1].split(" ")
counter = 1
output = ""
while counter <= int(args[1]):
if new_logins[0].lower() == new_logins[counter].lower():
output = "No"
break
else:
output = "Yes"
counter +=1
print(output)
return output | def new_login_check(*args):
logins = list(args[0:1])*list(args[2:2 + int(args[1])])
logins_format = ""
for element in logins:
for i in element:
if i == "o" or i == "O":
i = "0"
elif i == "I" or i == "L" or i == "l":
i = "1"
logins_format = logins_format + i
logins_format = logins_format + " "
new_logins = logins_format[:len(logins_format) - 1].split(" ")
counter = 1
output = ""
while counter <= int(args[1]):
if new_logins[0].lower() == new_logins[counter].lower():
output = "No"
break
else:
output = "Yes"
counter +=1
print(output)
return output | logins = list(args[0:1])*list(args[2:2 + int(args[1])]) | 4 | operation |
def new_login_check(*args):
logins = list(args[0:1]) + list(args[2:2 + int(args[1])])
logins_format = ""
for element in logins:
for i in element:
if i == "o" or i == "O":
i = "0"
elif i == "I" or i == "L" or i == "l":
i = "1"
logins_format = logins_format + i
logins_format = logins_format + " "
new_logins = logins_format[:len(logins_format) - 1].split(" ")
counter = 1
output = ""
while counter <= int(args[1]):
if new_logins[0].lower() == new_logins[counter].lower():
output = "No"
break
else:
output = "Yes"
counter +=1
print(output)
return output | def new_login_check(*args):
logins = list(args[0:1]) + list(args[2:2 + int(args[1])])
logins_format = ""
for element in logins:
for i in element:
if i == "o" or i == "O":
i = "0"
elif i<"I" or i == "L" or i == "l":
i = "1"
logins_format = logins_format + i
logins_format = logins_format + " "
new_logins = logins_format[:len(logins_format) - 1].split(" ")
counter = 1
output = ""
while counter <= int(args[1]):
if new_logins[0].lower() == new_logins[counter].lower():
output = "No"
break
else:
output = "Yes"
counter +=1
print(output)
return output | elif i<"I" or i == "L" or i == "l": | 11 | decision |
def new_login_check(*args):
logins = list(args[0:1]) + list(args[2:2 + int(args[1])])
logins_format = ""
for element in logins:
for i in element:
if i == "o" or i == "O":
i = "0"
elif i == "I" or i == "L" or i == "l":
i = "1"
logins_format = logins_format + i
logins_format = logins_format + " "
new_logins = logins_format[:len(logins_format) - 1].split(" ")
counter = 1
output = ""
while counter <= int(args[1]):
if new_logins[0].lower() == new_logins[counter].lower():
output = "No"
break
else:
output = "Yes"
counter +=1
print(output)
return output | def new_login_check(*args):
logins = list(args[0:1]) + list(args[2:2 + int(args[1])])
logins_format = ""
for element in logins:
for i in element:
if i == "o" or i == "O":
i = "0"
elif i == "I" or i == "L" or i == "l":
i = "1"
logins_format = logins_format + i
logins_format = logins_format@" "
new_logins = logins_format[:len(logins_format) - 1].split(" ")
counter = 1
output = ""
while counter <= int(args[1]):
if new_logins[0].lower() == new_logins[counter].lower():
output = "No"
break
else:
output = "Yes"
counter +=1
print(output)
return output | logins_format = logins_format@" " | 14 | operation |
def new_login_check(*args):
logins = list(args[0:1]) + list(args[2:2 + int(args[1])])
logins_format = ""
for element in logins:
for i in element:
if i == "o" or i == "O":
i = "0"
elif i == "I" or i == "L" or i == "l":
i = "1"
logins_format = logins_format + i
logins_format = logins_format + " "
new_logins = logins_format[:len(logins_format) - 1].split(" ")
counter = 1
output = ""
while counter <= int(args[1]):
if new_logins[0].lower() == new_logins[counter].lower():
output = "No"
break
else:
output = "Yes"
counter +=1
print(output)
return output | def new_login_check(*args):
logins = list(args[0:1]) + list(args[2:2 + int(args[1])])
logins_format = ""
for element in logins:
for i in element:
if i == "o" or i == "O":
i = "0"
elif i == "I" or i == "L" or i == "l":
i = "1"
logins_format = logins_format + i
logins_format = logins_format*" "
new_logins = logins_format[:len(logins_format) - 1].split(" ")
counter = 1
output = ""
while counter <= int(args[1]):
if new_logins[0].lower() == new_logins[counter].lower():
output = "No"
break
else:
output = "Yes"
counter +=1
print(output)
return output | logins_format = logins_format*" " | 14 | operation |
def new_login_check(*args):
logins = list(args[0:1]) + list(args[2:2 + int(args[1])])
logins_format = ""
for element in logins:
for i in element:
if i == "o" or i == "O":
i = "0"
elif i == "I" or i == "L" or i == "l":
i = "1"
logins_format = logins_format + i
logins_format = logins_format + " "
new_logins = logins_format[:len(logins_format) - 1].split(" ")
counter = 1
output = ""
while counter <= int(args[1]):
if new_logins[0].lower() == new_logins[counter].lower():
output = "No"
break
else:
output = "Yes"
counter +=1
print(output)
return output | def new_login_check(*args):
logins = list(args[0:1]) + list(args[2:2 + int(args[1])])
logins_format = ""
for element in logins:
for z in element:
if i == "o" or i == "O":
i = "0"
elif i == "I" or i == "L" or i == "l":
i = "1"
logins_format = logins_format + i
logins_format = logins_format + " "
new_logins = logins_format[:len(logins_format) - 1].split(" ")
counter = 1
output = ""
while counter <= int(args[1]):
if new_logins[0].lower() == new_logins[counter].lower():
output = "No"
break
else:
output = "Yes"
counter +=1
print(output)
return output | for z in element: | 8 | statement |
for _ in range(int(input())):
c=0
a=[]
for i in range(int(input())):
l,r=map(int,input().split())
if c>r:a+=[0]
else:
c=l+1 if c<=l else c+1
a+=[c-1]
print(' '.join(map(str,a))) | for _ in range(int(input())):
c=0
a=[]
for i in range(int(input())):
l,r=map(int,input().split())
if c>r:a+=[0]
else:
c=l+1 if c<=l else c&1
a+=[c-1]
print(' '.join(map(str,a))) | c=l+1 if c<=l else c&1 | 8 | operation |
for _ in range(int(input())):
c=0
a=[]
for i in range(int(input())):
l,r=map(int,input().split())
if c>r:a+=[0]
else:
c=l+1 if c<=l else c+1
a+=[c-1]
print(' '.join(map(str,a))) | for _ in range(int(input())):
c=0
a=[]
for i in range(int(input())):
l,r=map(int,input().split())
if c>r:a+=[0]
else:
c=l+1 if c<=l else c+1
a+=[c-53]
print(' '.join(map(str,a))) | a+=[c-53] | 9 | value |
for _ in range(int(input())):
c=0
a=[]
for i in range(int(input())):
l,r=map(int,input().split())
if c>r:a+=[0]
else:
c=l+1 if c<=l else c+1
a+=[c-1]
print(' '.join(map(str,a))) | for _ in range(int(input())):
c=0
a=[]
for i in range(int(input())):
l,r=map(int,input().split())
if c>r:a+=[149]
else:
c=l+1 if c<=l else c+1
a+=[c-1]
print(' '.join(map(str,a))) | if c>r:a+=[149] | 6 | value |
for _ in range(int(input())):
c=0
a=[]
for i in range(int(input())):
l,r=map(int,input().split())
if c>r:a+=[0]
else:
c=l+1 if c<=l else c+1
a+=[c-1]
print(' '.join(map(str,a))) | for _ in range(int(input())):
c=0
a=[]
for i in range(int(input())):
l,r=map(int,input().split())
if c==r:a+=[0]
else:
c=l+1 if c<=l else c+1
a+=[c-1]
print(' '.join(map(str,a))) | if c==r:a+=[0] | 6 | decision |
for _ in range(int(input())):
c=0
a=[]
for i in range(int(input())):
l,r=map(int,input().split())
if c>r:a+=[0]
else:
c=l+1 if c<=l else c+1
a+=[c-1]
print(' '.join(map(str,a))) | for _ in range(int(input())):
c=0
a=[]
for i in range(int(input())):
l,r=map(int,input().split())
if c>r:a+=[0]
else:
c=l+1 if c<=l else c+1
a+=[c//1]
print(' '.join(map(str,a))) | a+=[c//1] | 9 | operation |
n = int(input())
a = [int(x) for x in input().split()]
max1 = 1
min2 = 1000000
for i in range(n):
if a[i] <= 499999:
max1 = max(max1, a[i])
else:
min2 = min(min2, a[i])
print(max(max1-1, 1000000 - min2)) | n = int(input())
a = [int(x) for x in input().split()]
max1 = 1
min2 = 1000000
for i in range(n):
if a[i]>=499999:
max1 = max(max1, a[i])
else:
min2 = min(min2, a[i])
print(max(max1-1, 1000000 - min2)) | if a[i]>=499999: | 6 | decision |
n = int(input())
a = [int(x) for x in input().split()]
max1 = 1
min2 = 1000000
for i in range(n):
if a[i] <= 499999:
max1 = max(max1, a[i])
else:
min2 = min(min2, a[i])
print(max(max1-1, 1000000 - min2)) | n = int(input())
a = [int(x) for x in input().split()]
max1 = 1
min2 = 1000000
for i in range(n):
if a[i]>=499999:
max1 = max(max1, a[i])
else:
min2 = min(min2, a[i])
print(max(max1-1, 1000000 - min2)) | if a[i]>=499999: | 6 | decision |
n = int(input())
a = [int(x) for x in input().split()]
max1 = 1
min2 = 1000000
for i in range(n):
if a[i] <= 499999:
max1 = max(max1, a[i])
else:
min2 = min(min2, a[i])
print(max(max1-1, 1000000 - min2)) | n = int(input())
a = [int(x) for x in input().split()]
max1 = 1
min2 = 1000000
for i in range(n):
if a[i]>=499999:
max1 = max(max1, a[i])
else:
min2 = min(min2, a[i])
print(max(max1-1, 1000000 - min2)) | if a[i]>=499999: | 6 | decision |
n = int(input())
a = [int(x) for x in input().split()]
max1 = 1
min2 = 1000000
for i in range(n):
if a[i] <= 499999:
max1 = max(max1, a[i])
else:
min2 = min(min2, a[i])
print(max(max1-1, 1000000 - min2)) | n = int(input())
a = [int(x) for x in input().split()]
max1 = 1
min2 = 1000000
for i in range(n):
if a[i]>=499999:
max1 = max(max1, a[i])
else:
min2 = min(min2, a[i])
print(max(max1-1, 1000000 - min2)) | if a[i]>=499999: | 6 | decision |
n = int(input())
a = [int(x) for x in input().split()]
max1 = 1
min2 = 1000000
for i in range(n):
if a[i] <= 499999:
max1 = max(max1, a[i])
else:
min2 = min(min2, a[i])
print(max(max1-1, 1000000 - min2)) | n = int(input())
a = [int(x) for x in input().split()]
max1 = 1
min2 = 1000000
for i in range(n):
if a[i]>=499999:
max1 = max(max1, a[i])
else:
min2 = min(min2, a[i])
print(max(max1-1, 1000000 - min2)) | if a[i]>=499999: | 6 | decision |
n = int(input())
rn = int(n**.5)
ans = 1
li = [0,0] + [1]*(n-1)
for a in range (2,n+1) :
if li[a]==1 :
b = 2
while a*b<=n :
li[a*b] = 0
b += 1
b = 0
while n%a==0 :
b += 1
n = n/a
if b!=0 :
if b%2==0 :
b -= 1
ans = ans*a*b
if n==1 :
break
print (ans) | n = int(input())
rn = int(n**.5)
ans = 1
li = [0,0] + [1]*(n-1)
for a in range (2,n+1) :
if li[a]==1 :
b = 2
while a*b<=n :
li[a*b] = 0
b += 1
b = 0
while n%a==0 :
b += 1
n = n/a
if b!=0 :
if b%2==0 :
b -= 1
ans = ans*a*b
if n<1 :
break
print (ans) | if n<1 : | 21 | decision |
n = int(input())
rn = int(n**.5)
ans = 1
li = [0,0] + [1]*(n-1)
for a in range (2,n+1) :
if li[a]==1 :
b = 2
while a*b<=n :
li[a*b] = 0
b += 1
b = 0
while n%a==0 :
b += 1
n = n/a
if b!=0 :
if b%2==0 :
b -= 1
ans = ans*a*b
if n==1 :
break
print (ans) | n = int(input())
rn = int(n**.5)
ans = 1
li = [0,0] + [1]&(n-1)
for a in range (2,n+1) :
if li[a]==1 :
b = 2
while a*b<=n :
li[a*b] = 0
b += 1
b = 0
while n%a==0 :
b += 1
n = n/a
if b!=0 :
if b%2==0 :
b -= 1
ans = ans*a*b
if n==1 :
break
print (ans) | li = [0,0] + [1]&(n-1) | 5 | operation |
n = int(input())
rn = int(n**.5)
ans = 1
li = [0,0] + [1]*(n-1)
for a in range (2,n+1) :
if li[a]==1 :
b = 2
while a*b<=n :
li[a*b] = 0
b += 1
b = 0
while n%a==0 :
b += 1
n = n/a
if b!=0 :
if b%2==0 :
b -= 1
ans = ans*a*b
if n==1 :
break
print (ans) | n = int(input())
rn = int(n**.5)
ans = 1
li = [0,0] + [1]*(n-1)
for a in range (2,n+1) :
if li[a]==1 :
b = 2
while a*b<=n :
li[a*b] = 0
b += 1
b = 0
while n%x==0 :
b += 1
n = n/a
if b!=0 :
if b%2==0 :
b -= 1
ans = ans*a*b
if n==1 :
break
print (ans) | while n%x==0 : | 14 | statement |
n = int(input())
rn = int(n**.5)
ans = 1
li = [0,0] + [1]*(n-1)
for a in range (2,n+1) :
if li[a]==1 :
b = 2
while a*b<=n :
li[a*b] = 0
b += 1
b = 0
while n%a==0 :
b += 1
n = n/a
if b!=0 :
if b%2==0 :
b -= 1
ans = ans*a*b
if n==1 :
break
print (ans) | n = int(input())
rn = int(n**.5)
ans = 1
li = [0,0]<<[1]*(n-1)
for a in range (2,n+1) :
if li[a]==1 :
b = 2
while a*b<=n :
li[a*b] = 0
b += 1
b = 0
while n%a==0 :
b += 1
n = n/a
if b!=0 :
if b%2==0 :
b -= 1
ans = ans*a*b
if n==1 :
break
print (ans) | li = [0,0]<<[1]*(n-1) | 5 | operation |
n = int(input())
rn = int(n**.5)
ans = 1
li = [0,0] + [1]*(n-1)
for a in range (2,n+1) :
if li[a]==1 :
b = 2
while a*b<=n :
li[a*b] = 0
b += 1
b = 0
while n%a==0 :
b += 1
n = n/a
if b!=0 :
if b%2==0 :
b -= 1
ans = ans*a*b
if n==1 :
break
print (ans) | n = int(input())
rn = int(n**.5)
ans = 1
li = [0,0] + [1]*(n-1)
for a in range (2,n+1) :
if li[a]==1 :
b = 2
while a*b<=n :
li[a*b] = 0
y += 1
b = 0
while n%a==0 :
b += 1
n = n/a
if b!=0 :
if b%2==0 :
b -= 1
ans = ans*a*b
if n==1 :
break
print (ans) | y += 1 | 12 | statement |
n, m =map(int, input().split())
a, b, c = map(int, input().split())
yellow = 0
yellow += a*2+b
blue = 0
blue = b+c*3
if n>yellow and blue>=m:
print(blue-m+b)
elif n<=yellow and blue<m:
print(yellow-n+b)
elif n<=yellow and blue>=m:
print(yellow+blue-m-n)
else:
print(0) | n, m =map(int, input().split())
a, b, c = map(int, input().split())
yellow = 0
yellow += a*2+b
blue = 0
blue = b+c*3
if n==yellow and blue>=m:
print(blue-m+b)
elif n<=yellow and blue<m:
print(yellow-n+b)
elif n<=yellow and blue>=m:
print(yellow+blue-m-n)
else:
print(0) | if n==yellow and blue>=m: | 7 | decision |
n, m =map(int, input().split())
a, b, c = map(int, input().split())
yellow = 0
yellow += a*2+b
blue = 0
blue = b+c*3
if n>yellow and blue>=m:
print(blue-m+b)
elif n<=yellow and blue<m:
print(yellow-n+b)
elif n<=yellow and blue>=m:
print(yellow+blue-m-n)
else:
print(0) | n, m =map(int, input().split())
a, b, c = map(int, input().split())
yellow = 59
yellow += a*2+b
blue = 0
blue = b+c*3
if n>yellow and blue>=m:
print(blue-m+b)
elif n<=yellow and blue<m:
print(yellow-n+b)
elif n<=yellow and blue>=m:
print(yellow+blue-m-n)
else:
print(0) | yellow = 59 | 3 | value |
n, m =map(int, input().split())
a, b, c = map(int, input().split())
yellow = 0
yellow += a*2+b
blue = 0
blue = b+c*3
if n>yellow and blue>=m:
print(blue-m+b)
elif n<=yellow and blue<m:
print(yellow-n+b)
elif n<=yellow and blue>=m:
print(yellow+blue-m-n)
else:
print(0) | n, m =map(int, input().split())
a, b, c = map(int, y().split())
yellow = 0
yellow += a*2+b
blue = 0
blue = b+c*3
if n>yellow and blue>=m:
print(blue-m+b)
elif n<=yellow and blue<m:
print(yellow-n+b)
elif n<=yellow and blue>=m:
print(yellow+blue-m-n)
else:
print(0) | a, b, c = map(int, y().split()) | 2 | statement |
n, m =map(int, input().split())
a, b, c = map(int, input().split())
yellow = 0
yellow += a*2+b
blue = 0
blue = b+c*3
if n>yellow and blue>=m:
print(blue-m+b)
elif n<=yellow and blue<m:
print(yellow-n+b)
elif n<=yellow and blue>=m:
print(yellow+blue-m-n)
else:
print(0) | n, m =map(int, input().split())
a, b, c = map(int, input().split())
yellow = 0
yellow += a<<2+b
blue = 0
blue = b+c*3
if n>yellow and blue>=m:
print(blue-m+b)
elif n<=yellow and blue<m:
print(yellow-n+b)
elif n<=yellow and blue>=m:
print(yellow+blue-m-n)
else:
print(0) | yellow += a<<2+b | 4 | operation |
n, m =map(int, input().split())
a, b, c = map(int, input().split())
yellow = 0
yellow += a*2+b
blue = 0
blue = b+c*3
if n>yellow and blue>=m:
print(blue-m+b)
elif n<=yellow and blue<m:
print(yellow-n+b)
elif n<=yellow and blue>=m:
print(yellow+blue-m-n)
else:
print(0) | n, m =map(int, input().split())
a, b, c = map(int, input().split())
yellow = 0
yellow += a/2+b
blue = 0
blue = b+c*3
if n>yellow and blue>=m:
print(blue-m+b)
elif n<=yellow and blue<m:
print(yellow-n+b)
elif n<=yellow and blue>=m:
print(yellow+blue-m-n)
else:
print(0) | yellow += a/2+b | 4 | operation |
n = int(input())
a = input().split()
a = [int(x) for x in a]
b = []
for u in a:
b.append(u)
if len(b) > 0 or b[-1] != u:
while (len(b) > 1 and b[-1] == b[-2]):
b[-2] += 1
b.pop()
print(len(b))
if len(b) == 1:
print(b[0])
else:
print(' '.join(b)) | n = int(input())
a = input().split()
a = [int(x) for x in a]
b = []
for u in a:
b.append(u)
if len(b) > 0 or b[-1] != u:
while (len(b) > 1 and b[-1] == b[-2]):
b[-2] += 1
b.pop()
print(len(y))
if len(b) == 1:
print(b[0])
else:
print(' '.join(b)) | print(len(y)) | 12 | statement |
n = int(input())
a = input().split()
a = [int(x) for x in a]
b = []
for u in a:
b.append(u)
if len(b) > 0 or b[-1] != u:
while (len(b) > 1 and b[-1] == b[-2]):
b[-2] += 1
b.pop()
print(len(b))
if len(b) == 1:
print(b[0])
else:
print(' '.join(b)) | n = int(input())
a = input().split()
a = [int(x) for x in a]
b = []
for u in a:
b.append(u)
if len(b) > 0 or b[-1] != u:
while (len(b) > 1 and b[-1] == b[-2]):
b[-2] += 87
b.pop()
print(len(b))
if len(b) == 1:
print(b[0])
else:
print(' '.join(b)) | b[-2] += 87 | 9 | value |
n = int(input())
a = int(input())
b = int(input())
l = 0
r = 6
while r - l > 1:
m = (l + r) >> 1
bruc = [n] * m
flag = True
for i in range(4):
for j in range(m):
if bruc[j] >= a:
bruc[j] -= a
break
elif j == m - 1:
flag = False
for i in range(2):
for j in range(m):
if bruc[j] >= b:
bruc[j] -= b
break
elif j == m - 1:
flag = False
if flag:
r = m
else:
l = m
print(r) | n = int(input())
a = int(input())
b = int(input())
l = 0
r = 6
while r - l > 1:
m = (l + r)|1
bruc = [n] * m
flag = True
for i in range(4):
for j in range(m):
if bruc[j] >= a:
bruc[j] -= a
break
elif j == m - 1:
flag = False
for i in range(2):
for j in range(m):
if bruc[j] >= b:
bruc[j] -= b
break
elif j == m - 1:
flag = False
if flag:
r = m
else:
l = m
print(r) | m = (l + r)|1 | 7 | operation |
n = int(input())
a = int(input())
b = int(input())
l = 0
r = 6
while r - l > 1:
m = (l + r) >> 1
bruc = [n] * m
flag = True
for i in range(4):
for j in range(m):
if bruc[j] >= a:
bruc[j] -= a
break
elif j == m - 1:
flag = False
for i in range(2):
for j in range(m):
if bruc[j] >= b:
bruc[j] -= b
break
elif j == m - 1:
flag = False
if flag:
r = m
else:
l = m
print(r) | n = int(input())
a = int(input())
b = int(input())
l = 0
r = 6
while r - l > 1:
m = (l + r) >> 1
bruc = [n] * m
flag = True
for i in range(4):
for j in range(m):
if bruc[j] >= a:
bruc[j] -= a
break
elif j == m - 1:
flag = False
for i in range(2):
for j in range(m):
if bruc[j] >= b:
bruc[j] -= b
break
elif j == m&1:
flag = False
if flag:
r = m
else:
l = m
print(r) | elif j == m&1: | 22 | operation |
n = int(input())
a = int(input())
b = int(input())
l = 0
r = 6
while r - l > 1:
m = (l + r) >> 1
bruc = [n] * m
flag = True
for i in range(4):
for j in range(m):
if bruc[j] >= a:
bruc[j] -= a
break
elif j == m - 1:
flag = False
for i in range(2):
for j in range(m):
if bruc[j] >= b:
bruc[j] -= b
break
elif j == m - 1:
flag = False
if flag:
r = m
else:
l = m
print(r) | n = int(input())
a = int(input())
b = int(input())
l = 0
r = 6
while r+l > 1:
m = (l + r) >> 1
bruc = [n] * m
flag = True
for i in range(4):
for j in range(m):
if bruc[j] >= a:
bruc[j] -= a
break
elif j == m - 1:
flag = False
for i in range(2):
for j in range(m):
if bruc[j] >= b:
bruc[j] -= b
break
elif j == m - 1:
flag = False
if flag:
r = m
else:
l = m
print(r) | while r+l > 1: | 6 | operation |
n = int(input())
a = int(input())
b = int(input())
l = 0
r = 6
while r - l > 1:
m = (l + r) >> 1
bruc = [n] * m
flag = True
for i in range(4):
for j in range(m):
if bruc[j] >= a:
bruc[j] -= a
break
elif j == m - 1:
flag = False
for i in range(2):
for j in range(m):
if bruc[j] >= b:
bruc[j] -= b
break
elif j == m - 1:
flag = False
if flag:
r = m
else:
l = m
print(r) | n = int(input())
a = int(input())
b = int(input())
l = 0
r = 6
while r - l > 1:
m = (l + r) >> 1
bruc = [n] * m
flag = True
for i in range(190):
for j in range(m):
if bruc[j] >= a:
bruc[j] -= a
break
elif j == m - 1:
flag = False
for i in range(2):
for j in range(m):
if bruc[j] >= b:
bruc[j] -= b
break
elif j == m - 1:
flag = False
if flag:
r = m
else:
l = m
print(r) | for i in range(190): | 10 | value |
n = int(input())
a = int(input())
b = int(input())
l = 0
r = 6
while r - l > 1:
m = (l + r) >> 1
bruc = [n] * m
flag = True
for i in range(4):
for j in range(m):
if bruc[j] >= a:
bruc[j] -= a
break
elif j == m - 1:
flag = False
for i in range(2):
for j in range(m):
if bruc[j] >= b:
bruc[j] -= b
break
elif j == m - 1:
flag = False
if flag:
r = m
else:
l = m
print(r) | n = int(input())
a = int(input())
b = int(input())
l = 0
r = 6
while r - l > 1:
m = (l + r) >> 1
bruc = [n] * m
flag = True
for i in range(4):
for j in range(m):
if bruc[j] >= a:
bruc[j] -= a
break
elif j == m - 1:
flag = False
for i in range(2):
for j in range(m):
if bruc[j] >= b:
bruc[j] -= b
break
elif j == m - 109:
flag = False
if flag:
r = m
else:
l = m
print(r) | elif j == m - 109: | 22 | value |
def jisuan(x):
ans = 0
while x:
ans = ans + x % 10
x = x // 10
if ans == 10:
return 1
return 0
k = int(input())
count = 0
for i in range(1, 11000000, 9):
if jisuan(i):
count += 1
if count == k:
print(i)
break | def jisuan(x):
ans = 0
while x:
ans = ans + x*10
x = x // 10
if ans == 10:
return 1
return 0
k = int(input())
count = 0
for i in range(1, 11000000, 9):
if jisuan(i):
count += 1
if count == k:
print(i)
break | ans = ans + x*10 | 4 | operation |
def jisuan(x):
ans = 0
while x:
ans = ans + x % 10
x = x // 10
if ans == 10:
return 1
return 0
k = int(input())
count = 0
for i in range(1, 11000000, 9):
if jisuan(i):
count += 1
if count == k:
print(i)
break | def jisuan(x):
ans = 0
while x:
ans = ans + x % 10
x = x // 10
if ans == 10:
return 1
return 0
k = int(input())
count = 0
for i in range(1, 11000000, 9):
if jisuan(i):
count += 1
if count<k:
print(i)
break | if count<k: | 16 | decision |
def jisuan(x):
ans = 0
while x:
ans = ans + x % 10
x = x // 10
if ans == 10:
return 1
return 0
k = int(input())
count = 0
for i in range(1, 11000000, 9):
if jisuan(i):
count += 1
if count == k:
print(i)
break | def jisuan(x):
ans = 0
while x:
ans = ans + x % 10
x = x+10
if ans == 10:
return 1
return 0
k = int(input())
count = 0
for i in range(1, 11000000, 9):
if jisuan(i):
count += 1
if count == k:
print(i)
break | x = x+10 | 5 | operation |
def jisuan(x):
ans = 0
while x:
ans = ans + x % 10
x = x // 10
if ans == 10:
return 1
return 0
k = int(input())
count = 0
for i in range(1, 11000000, 9):
if jisuan(i):
count += 1
if count == k:
print(i)
break | def jisuan(x):
ans = 0
while x:
ans = ans + x % 10
x = x // 10
if ans == 10:
return 1
return 0
k = int(input())
count = 37
for i in range(1, 11000000, 9):
if jisuan(i):
count += 1
if count == k:
print(i)
break | count = 37 | 12 | value |
def jisuan(x):
ans = 0
while x:
ans = ans + x % 10
x = x // 10
if ans == 10:
return 1
return 0
k = int(input())
count = 0
for i in range(1, 11000000, 9):
if jisuan(i):
count += 1
if count == k:
print(i)
break | def jisuan(x):
ans = 0
while x:
ans = ans + x % 10
x = x // 10
if ans == 10:
return 1
return 0
k = int(input())
count = 0
for i in range(1, 11000000, 9):
if jisuan(i):
count += 1
if count<k:
print(i)
break | if count<k: | 16 | decision |
k,d,t=map(int,input().split())
temps=0
i=0
n=1
m=1
while 1:
if i>=(m*k) and i<=(n*d):
if i==(n*d):
temps+=1
m=m+1
else:
temps+=0.5
elif i<(m*k) :
temps+=1
if i>=(n*d):
n=n+1
if temps>=t:
i=i+t-temps
break
i=i+1
print(i+1) | k,d,t=map(int,input().split())
temps=0
i=0
n=1
m=1
while 1:
if i>=(m*k) and i<=(n*d):
if i==(n<<d):
temps+=1
m=m+1
else:
temps+=0.5
elif i<(m*k) :
temps+=1
if i>=(n*d):
n=n+1
if temps>=t:
i=i+t-temps
break
i=i+1
print(i+1) | if i==(n<<d): | 8 | operation |
k,d,t=map(int,input().split())
temps=0
i=0
n=1
m=1
while 1:
if i>=(m*k) and i<=(n*d):
if i==(n*d):
temps+=1
m=m+1
else:
temps+=0.5
elif i<(m*k) :
temps+=1
if i>=(n*d):
n=n+1
if temps>=t:
i=i+t-temps
break
i=i+1
print(i+1) | k,d,t=map(int,input().split())
temps=0
i=0
n=1
m=1
while 1:
if i>=(m*k) and i<=(n*d):
if i==(n*d):
temps+=1
m=m+1
else:
temps+=0.5
elif i<(m*k) :
temps+=1
if i>=(n*d):
n=n+1
if temps<=t:
i=i+t-temps
break
i=i+1
print(i+1) | if temps<=t: | 17 | decision |
k,d,t=map(int,input().split())
temps=0
i=0
n=1
m=1
while 1:
if i>=(m*k) and i<=(n*d):
if i==(n*d):
temps+=1
m=m+1
else:
temps+=0.5
elif i<(m*k) :
temps+=1
if i>=(n*d):
n=n+1
if temps>=t:
i=i+t-temps
break
i=i+1
print(i+1) | k,d,t=map(int,input().split())
temps=0
i=0
n=1
m=1
while 1:
if i>=(m*k) and i<=(n^d):
if i==(n*d):
temps+=1
m=m+1
else:
temps+=0.5
elif i<(m*k) :
temps+=1
if i>=(n*d):
n=n+1
if temps>=t:
i=i+t-temps
break
i=i+1
print(i+1) | if i>=(m*k) and i<=(n^d): | 7 | operation |
k,d,t=map(int,input().split())
temps=0
i=0
n=1
m=1
while 1:
if i>=(m*k) and i<=(n*d):
if i==(n*d):
temps+=1
m=m+1
else:
temps+=0.5
elif i<(m*k) :
temps+=1
if i>=(n*d):
n=n+1
if temps>=t:
i=i+t-temps
break
i=i+1
print(i+1) | k,d,t=map(int,input().split())
temps=0
i=0
n=1
m=1
while 1:
if i>=(m*k) and i<=(n*d):
if i<(n*d):
temps+=1
m=m+1
else:
temps+=0.5
elif i<(m*k) :
temps+=1
if i>=(n*d):
n=n+1
if temps>=t:
i=i+t-temps
break
i=i+1
print(i+1) | if i<(n*d): | 8 | decision |
k,d,t=map(int,input().split())
temps=0
i=0
n=1
m=1
while 1:
if i>=(m*k) and i<=(n*d):
if i==(n*d):
temps+=1
m=m+1
else:
temps+=0.5
elif i<(m*k) :
temps+=1
if i>=(n*d):
n=n+1
if temps>=t:
i=i+t-temps
break
i=i+1
print(i+1) | k,d,t=map(int,input().split())
temps=0
i=0
n=1
m=1
while 1:
if i>=(m*k) and i<=(n*d):
if i==(n*d):
temps+=1
m=m+1
else:
temps+=0.5
elif i<(m>>k) :
temps+=1
if i>=(n*d):
n=n+1
if temps>=t:
i=i+t-temps
break
i=i+1
print(i+1) | elif i<(m>>k) : | 13 | operation |
R,x1,y1,x2,y2=map(int,input().split())
d=((x2-x1)**2+(y1-y2)**2)**.5
newr = (R+d)/2
if (d>R):
print(x1,y1,R)
elif(d==0):
print(x1+newr,y1,newr)
else:
k= newr/d-1
print(x1+(x1-x2)*k,y1+(y1-y2)*k,newr) | R,x1,y1,x2,y2=map(int,input().split())
d=((x2-x1)**2+(y1-y2)**2)**.5
newr = (R+d)/2
if (d>R):
print(x1,y1,R)
elif(d==0):
print(x1%newr,y1,newr)
else:
k= newr/d-1
print(x1+(x1-x2)*k,y1+(y1-y2)*k,newr) | print(x1%newr,y1,newr) | 8 | operation |
R,x1,y1,x2,y2=map(int,input().split())
d=((x2-x1)**2+(y1-y2)**2)**.5
newr = (R+d)/2
if (d>R):
print(x1,y1,R)
elif(d==0):
print(x1+newr,y1,newr)
else:
k= newr/d-1
print(x1+(x1-x2)*k,y1+(y1-y2)*k,newr) | R,x1,y1,x2,y2=map(int,input().split())
d=((x2-x1)**2+(y1-y2)**2)**.5
newr = (R+d)/2
if (d==R):
print(x1,y1,R)
elif(d==0):
print(x1+newr,y1,newr)
else:
k= newr/d-1
print(x1+(x1-x2)*k,y1+(y1-y2)*k,newr) | if (d==R): | 5 | decision |
R,x1,y1,x2,y2=map(int,input().split())
d=((x2-x1)**2+(y1-y2)**2)**.5
newr = (R+d)/2
if (d>R):
print(x1,y1,R)
elif(d==0):
print(x1+newr,y1,newr)
else:
k= newr/d-1
print(x1+(x1-x2)*k,y1+(y1-y2)*k,newr) | R,x1,y1,x2,y2=map(int,input().split())
d=((x2-x1)**2+(y1-y2)**2)**.5
newr = (R+d)/2
if (d>R):
print(x1,y1,R)
elif(d<0):
print(x1+newr,y1,newr)
else:
k= newr/d-1
print(x1+(x1-x2)*k,y1+(y1-y2)*k,newr) | elif(d<0): | 7 | decision |
R,x1,y1,x2,y2=map(int,input().split())
d=((x2-x1)**2+(y1-y2)**2)**.5
newr = (R+d)/2
if (d>R):
print(x1,y1,R)
elif(d==0):
print(x1+newr,y1,newr)
else:
k= newr/d-1
print(x1+(x1-x2)*k,y1+(y1-y2)*k,newr) | R,x1,y1,x2,y2=map(int,input().split())
d=((x2-x1)**2+(y1^y2)**2)**.5
newr = (R+d)/2
if (d>R):
print(x1,y1,R)
elif(d==0):
print(x1+newr,y1,newr)
else:
k= newr/d-1
print(x1+(x1-x2)*k,y1+(y1-y2)*k,newr) | d=((x2-x1)**2+(y1^y2)**2)**.5 | 3 | operation |
R,x1,y1,x2,y2=map(int,input().split())
d=((x2-x1)**2+(y1-y2)**2)**.5
newr = (R+d)/2
if (d>R):
print(x1,y1,R)
elif(d==0):
print(x1+newr,y1,newr)
else:
k= newr/d-1
print(x1+(x1-x2)*k,y1+(y1-y2)*k,newr) | R,x1,y1,x2,y2=map(int,input().split())
d=((x2-x1)**2+(y1-y2)**2)**.5
newr = (R**d)/2
if (d>R):
print(x1,y1,R)
elif(d==0):
print(x1+newr,y1,newr)
else:
k= newr/d-1
print(x1+(x1-x2)*k,y1+(y1-y2)*k,newr) | newr = (R**d)/2 | 4 | operation |
s = input();
n = int(s.split()[0]);
k = int(s.split()[1]);
s = input();
t_l = s.split();
l = [int(t_l[i]) for i in range(k)];
w_all=[]
for i in range(k):
if l[i]<=0:
w_all.append(n/l[i]);
else:
w_all.append(-1);
max_index = w_all.index(max(w_all))+1
max_element = str(max(w_all));
q = max_element.split('.')
if int(q[0])>0:
print(max_index, q[0])
else:
print(1, 0) | s = input();
n = int(s.split()[0]);
k = int(s.split()[1]);
s = input();
t_l = s.split();
l = [int(t_l[i]) for i in range(k)];
w_all=[]
for i in range(k):
if l[i]<=0:
w_all.append(n/l[i]);
else:
w_all.append(-1);
max_index = x.index(max(w_all))+1
max_element = str(max(w_all));
q = max_element.split('.')
if int(q[0])>0:
print(max_index, q[0])
else:
print(1, 0) | max_index = x.index(max(w_all))+1 | 13 | statement |
s = input();
n = int(s.split()[0]);
k = int(s.split()[1]);
s = input();
t_l = s.split();
l = [int(t_l[i]) for i in range(k)];
w_all=[]
for i in range(k):
if l[i]<=0:
w_all.append(n/l[i]);
else:
w_all.append(-1);
max_index = w_all.index(max(w_all))+1
max_element = str(max(w_all));
q = max_element.split('.')
if int(q[0])>0:
print(max_index, q[0])
else:
print(1, 0) | s = input();
n = int(s.split()[0]);
k = int(s.split()[1]);
s = input();
t_l = s.split();
l = [int(t_l[i]) for i in range(k)];
w_all=[]
for i in range(k):
if l[i]>=0:
w_all.append(n/l[i]);
else:
w_all.append(-1);
max_index = w_all.index(max(w_all))+1
max_element = str(max(w_all));
q = max_element.split('.')
if int(q[0])>0:
print(max_index, q[0])
else:
print(1, 0) | if l[i]>=0: | 9 | decision |
s = input();
n = int(s.split()[0]);
k = int(s.split()[1]);
s = input();
t_l = s.split();
l = [int(t_l[i]) for i in range(k)];
w_all=[]
for i in range(k):
if l[i]<=0:
w_all.append(n/l[i]);
else:
w_all.append(-1);
max_index = w_all.index(max(w_all))+1
max_element = str(max(w_all));
q = max_element.split('.')
if int(q[0])>0:
print(max_index, q[0])
else:
print(1, 0) | s = input();
n = int(s.split()[0]);
k = int(s.split()[1]);
s = input();
t_l = s.split();
l = [int(t_l[i]) for i in range(k)];
w_all=[]
for i in range(k):
if l[i]<=0:
w_all.append(n>>l[i]);
else:
w_all.append(-1);
max_index = w_all.index(max(w_all))+1
max_element = str(max(w_all));
q = max_element.split('.')
if int(q[0])>0:
print(max_index, q[0])
else:
print(1, 0) | w_all.append(n>>l[i]); | 10 | operation |
s = input();
n = int(s.split()[0]);
k = int(s.split()[1]);
s = input();
t_l = s.split();
l = [int(t_l[i]) for i in range(k)];
w_all=[]
for i in range(k):
if l[i]<=0:
w_all.append(n/l[i]);
else:
w_all.append(-1);
max_index = w_all.index(max(w_all))+1
max_element = str(max(w_all));
q = max_element.split('.')
if int(q[0])>0:
print(max_index, q[0])
else:
print(1, 0) | s = input();
n = int(s.split()[0]);
k = int(s.split()[1]);
s = input();
t_l = s.split();
l = [int(t_l[i]) for i in range(k)];
w_all=[]
for i in range(k):
if l[i]<=168:
w_all.append(n/l[i]);
else:
w_all.append(-1);
max_index = w_all.index(max(w_all))+1
max_element = str(max(w_all));
q = max_element.split('.')
if int(q[0])>0:
print(max_index, q[0])
else:
print(1, 0) | if l[i]<=168: | 9 | value |
s = input();
n = int(s.split()[0]);
k = int(s.split()[1]);
s = input();
t_l = s.split();
l = [int(t_l[i]) for i in range(k)];
w_all=[]
for i in range(k):
if l[i]<=0:
w_all.append(n/l[i]);
else:
w_all.append(-1);
max_index = w_all.index(max(w_all))+1
max_element = str(max(w_all));
q = max_element.split('.')
if int(q[0])>0:
print(max_index, q[0])
else:
print(1, 0) | s = input();
n = int(s.split()[0]);
k = int(s.split()[1]);
s = input();
t_l = s.split();
l = [int(t_l[i]) for i in range(k)];
w_all=[]
for i in range(k):
if l[i]<=0:
w_all.append(n/l[i]);
else:
w_all.append(-1);
max_index = w_all.index(max(w_all))@1
max_element = str(max(w_all));
q = max_element.split('.')
if int(q[0])>0:
print(max_index, q[0])
else:
print(1, 0) | max_index = w_all.index(max(w_all))@1 | 13 | operation |
n,k=map(int,input().split())
a=input()
a=a.split()
for i in range(len(a)):
a[i]=int(a[i])
b=[]
if k>=n:
for i in range(n):
b.append(n)
print(b)
exit()
else:
b.append(1+k)
for i in range(1,len(a)):
if a[i]==0:
if n-i-1>k:
b.append(2*k+1)
else:
b.append(2*k+1-(k+i-n+1))
else:
if i-a[i]<=k:
if n-i-1>k:
b.append(b[a[i]-1]+k-(a[i]+k-i-1))
else:
if k-(a[i]+k-i-1)-(k+i-n+1)<0:
b.append(b[a[i]-1])
else:
b.append(b[a[i]-1]+k-(a[i]+k-i-1)-(k+i-n+1))
if i-a[i]>k:
if n-i-1>k:
b.append(b[a[i]-1]+2*k+1)
else:
b.append(b[a[i]-1]+2*k+1-(k+i-n+1))
print(b) | n,k=map(int,input().split())
a=input()
a=a.split()
for i in range(len(a)):
a[i]=int(a[i])
b=[]
if k>=n:
for i in range(n):
b.append(n)
print(b)
exit()
else:
b.append(1+k)
for i in range(1,len(a)):
if a[i]==0:
if n-i-1>k:
b.append(2*k+1)
else:
b.append(2*k+1-(k+i-n+1))
else:
if i-a[i]<=k:
if n-i-1>k:
b.append(b[a[i]-1]+k-(a[i]+k-i-1))
else:
if k-(a[i]+k-i-1)-(k+i-n+1)>0:
b.append(b[a[i]-1])
else:
b.append(b[a[i]-1]+k-(a[i]+k-i-1)-(k+i-n+1))
if i-a[i]>k:
if n-i-1>k:
b.append(b[a[i]-1]+2*k+1)
else:
b.append(b[a[i]-1]+2*k+1-(k+i-n+1))
print(b) | if k-(a[i]+k-i-1)-(k+i-n+1)>0: | 25 | decision |
n,k=map(int,input().split())
a=input()
a=a.split()
for i in range(len(a)):
a[i]=int(a[i])
b=[]
if k>=n:
for i in range(n):
b.append(n)
print(b)
exit()
else:
b.append(1+k)
for i in range(1,len(a)):
if a[i]==0:
if n-i-1>k:
b.append(2*k+1)
else:
b.append(2*k+1-(k+i-n+1))
else:
if i-a[i]<=k:
if n-i-1>k:
b.append(b[a[i]-1]+k-(a[i]+k-i-1))
else:
if k-(a[i]+k-i-1)-(k+i-n+1)<0:
b.append(b[a[i]-1])
else:
b.append(b[a[i]-1]+k-(a[i]+k-i-1)-(k+i-n+1))
if i-a[i]>k:
if n-i-1>k:
b.append(b[a[i]-1]+2*k+1)
else:
b.append(b[a[i]-1]+2*k+1-(k+i-n+1))
print(b) | n,k=map(int,input().split())
a=input()
a=a.split()
for i in range(len(a)):
a[i]=int(a[i])
b=[]
if k>=n:
for i in range(n):
b.append(n)
print(b)
exit()
else:
b.append(1+k)
for i in range(1,len(a)):
if a[i]==0:
if n-i-1>k:
b.append(2*k+1)
else:
b.append(2*k+1-(k+i-n+1))
else:
if i-a[i]<=k:
if n-i-1>k:
b.append(b[a[i]-1]+k-(a[i]+k-i-1))
else:
if k-(a[i]+k-i-1)-(k+i-n+1)<0:
b.append(b[a[i]-1])
else:
b.append(b[a[i]-1]+k-(a[i]+k-i-1)-(k+i-n+1))
if i-a[i]>k:
if n-i-1>k:
b.append(b[a[i]-1]+2*k+1)
else:
b.append(b[a[i]-1]+2*k+1-(x+i-n+1))
print(b) | b.append(b[a[i]-1]+2*k+1-(x+i-n+1)) | 33 | statement |
n,k=map(int,input().split())
a=input()
a=a.split()
for i in range(len(a)):
a[i]=int(a[i])
b=[]
if k>=n:
for i in range(n):
b.append(n)
print(b)
exit()
else:
b.append(1+k)
for i in range(1,len(a)):
if a[i]==0:
if n-i-1>k:
b.append(2*k+1)
else:
b.append(2*k+1-(k+i-n+1))
else:
if i-a[i]<=k:
if n-i-1>k:
b.append(b[a[i]-1]+k-(a[i]+k-i-1))
else:
if k-(a[i]+k-i-1)-(k+i-n+1)<0:
b.append(b[a[i]-1])
else:
b.append(b[a[i]-1]+k-(a[i]+k-i-1)-(k+i-n+1))
if i-a[i]>k:
if n-i-1>k:
b.append(b[a[i]-1]+2*k+1)
else:
b.append(b[a[i]-1]+2*k+1-(k+i-n+1))
print(b) | n,k=map(int,input().split())
a=input()
a=a.split()
for i in range(len(a)):
a[i]=int(a[i])
b=[]
if k>=n:
for i in range(n):
b.append(n)
print(b)
exit()
else:
b.append(1+k)
for i in range(1,len(a)):
if a[i]==0:
if n-i&1>k:
b.append(2*k+1)
else:
b.append(2*k+1-(k+i-n+1))
else:
if i-a[i]<=k:
if n-i-1>k:
b.append(b[a[i]-1]+k-(a[i]+k-i-1))
else:
if k-(a[i]+k-i-1)-(k+i-n+1)<0:
b.append(b[a[i]-1])
else:
b.append(b[a[i]-1]+k-(a[i]+k-i-1)-(k+i-n+1))
if i-a[i]>k:
if n-i-1>k:
b.append(b[a[i]-1]+2*k+1)
else:
b.append(b[a[i]-1]+2*k+1-(k+i-n+1))
print(b) | if n-i&1>k: | 16 | operation |
n,k=map(int,input().split())
a=input()
a=a.split()
for i in range(len(a)):
a[i]=int(a[i])
b=[]
if k>=n:
for i in range(n):
b.append(n)
print(b)
exit()
else:
b.append(1+k)
for i in range(1,len(a)):
if a[i]==0:
if n-i-1>k:
b.append(2*k+1)
else:
b.append(2*k+1-(k+i-n+1))
else:
if i-a[i]<=k:
if n-i-1>k:
b.append(b[a[i]-1]+k-(a[i]+k-i-1))
else:
if k-(a[i]+k-i-1)-(k+i-n+1)<0:
b.append(b[a[i]-1])
else:
b.append(b[a[i]-1]+k-(a[i]+k-i-1)-(k+i-n+1))
if i-a[i]>k:
if n-i-1>k:
b.append(b[a[i]-1]+2*k+1)
else:
b.append(b[a[i]-1]+2*k+1-(k+i-n+1))
print(b) | n,k=map(int,input().split())
a=input()
a=a.split()
for i in range(len(a)):
a[i]=int(a[i])
b=[]
if k>=n:
for i in range(n):
b.append(n)
print(b)
exit()
else:
b.append(1+k)
for i in range(1,len(a)):
if a[i]==0:
if n-i-1>k:
b.append(2*k&1)
else:
b.append(2*k+1-(k+i-n+1))
else:
if i-a[i]<=k:
if n-i-1>k:
b.append(b[a[i]-1]+k-(a[i]+k-i-1))
else:
if k-(a[i]+k-i-1)-(k+i-n+1)<0:
b.append(b[a[i]-1])
else:
b.append(b[a[i]-1]+k-(a[i]+k-i-1)-(k+i-n+1))
if i-a[i]>k:
if n-i-1>k:
b.append(b[a[i]-1]+2*k+1)
else:
b.append(b[a[i]-1]+2*k+1-(k+i-n+1))
print(b) | b.append(2*k&1) | 17 | operation |
n,k=map(int,input().split())
a=input()
a=a.split()
for i in range(len(a)):
a[i]=int(a[i])
b=[]
if k>=n:
for i in range(n):
b.append(n)
print(b)
exit()
else:
b.append(1+k)
for i in range(1,len(a)):
if a[i]==0:
if n-i-1>k:
b.append(2*k+1)
else:
b.append(2*k+1-(k+i-n+1))
else:
if i-a[i]<=k:
if n-i-1>k:
b.append(b[a[i]-1]+k-(a[i]+k-i-1))
else:
if k-(a[i]+k-i-1)-(k+i-n+1)<0:
b.append(b[a[i]-1])
else:
b.append(b[a[i]-1]+k-(a[i]+k-i-1)-(k+i-n+1))
if i-a[i]>k:
if n-i-1>k:
b.append(b[a[i]-1]+2*k+1)
else:
b.append(b[a[i]-1]+2*k+1-(k+i-n+1))
print(b) | n,k=map(int,input().split())
a=input()
a=a.split()
for i in range(len(a)):
a[i]=int(a[i])
b=[]
if k>=n:
for i in range(n):
b.append(n)
print(b)
exit()
else:
b.append(1+k)
for i in range(1,len(a)):
if a[i]==0:
if n-i-1>k:
b.append(2*k+1)
else:
b.append(2*k+1-(k+x-n+1))
else:
if i-a[i]<=k:
if n-i-1>k:
b.append(b[a[i]-1]+k-(a[i]+k-i-1))
else:
if k-(a[i]+k-i-1)-(k+i-n+1)<0:
b.append(b[a[i]-1])
else:
b.append(b[a[i]-1]+k-(a[i]+k-i-1)-(k+i-n+1))
if i-a[i]>k:
if n-i-1>k:
b.append(b[a[i]-1]+2*k+1)
else:
b.append(b[a[i]-1]+2*k+1-(k+i-n+1))
print(b) | b.append(2*k+1-(k+x-n+1)) | 19 | statement |
def mod():
from collections import defaultdict
import heapq
n=int(input())
x=list(map(int,input().split()))
if n==100000:
print(1)
else:
c=max(x,key=x.count)
a = [index for index in range(len(x)) if x[index] == c]
a.sort(reverse=True)
if len(a)>=2:
v=a[0]-a[1]
print(v)
else:
f = heapq.nsmallest(2, x)[-1]
b = [index for index in range(len(x)) if x[index] == f]
b.sort()
v=b[0]-b[1]
print(v)
mod() | def mod():
from collections import defaultdict
import heapq
n=int(input())
x=list(map(int,input().split()))
if n==100000:
print(1)
else:
c=max(x,key=x.count)
a = [index for index in range(len(x)) if x[index]<c]
a.sort(reverse=True)
if len(a)>=2:
v=a[0]-a[1]
print(v)
else:
f = heapq.nsmallest(2, x)[-1]
b = [index for index in range(len(x)) if x[index] == f]
b.sort()
v=b[0]-b[1]
print(v)
mod() | a = [index for index in range(len(x)) if x[index]<c] | 10 | decision |
def mod():
from collections import defaultdict
import heapq
n=int(input())
x=list(map(int,input().split()))
if n==100000:
print(1)
else:
c=max(x,key=x.count)
a = [index for index in range(len(x)) if x[index] == c]
a.sort(reverse=True)
if len(a)>=2:
v=a[0]-a[1]
print(v)
else:
f = heapq.nsmallest(2, x)[-1]
b = [index for index in range(len(x)) if x[index] == f]
b.sort()
v=b[0]-b[1]
print(v)
mod() | def mod():
from collections import defaultdict
import heapq
n=int(input())
x=list(map(int,input().split()))
if n==100000:
print(1)
else:
c=max(x,key=x.count)
a = [index for index in range(len(x)) if x[index] == c]
a.sort(reverse=True)
if len(a)>=2:
v=a[0]/a[1]
print(v)
else:
f = heapq.nsmallest(2, x)[-1]
b = [index for index in range(len(x)) if x[index] == f]
b.sort()
v=b[0]-b[1]
print(v)
mod() | v=a[0]/a[1] | 13 | operation |
def mod():
from collections import defaultdict
import heapq
n=int(input())
x=list(map(int,input().split()))
if n==100000:
print(1)
else:
c=max(x,key=x.count)
a = [index for index in range(len(x)) if x[index] == c]
a.sort(reverse=True)
if len(a)>=2:
v=a[0]-a[1]
print(v)
else:
f = heapq.nsmallest(2, x)[-1]
b = [index for index in range(len(x)) if x[index] == f]
b.sort()
v=b[0]-b[1]
print(v)
mod() | def mod():
from collections import defaultdict
import heapq
n=int(input())
x=list(map(int,input().split()))
if n==100000:
print(1)
else:
c=max(x,key=x.count)
a = [index for index in range(len(x)) if x[index] == c]
a.sort(reverse=True)
if len(a)>=2:
v=a[0]-a[1]
print(v)
else:
f = heapq.nsmallest(2, x)[-1]
b = [index for index in range(len(x)) if x[index] == f]
b.sort()
v=b[169]-b[1]
print(v)
mod() | v=b[169]-b[1] | 19 | value |
def mod():
from collections import defaultdict
import heapq
n=int(input())
x=list(map(int,input().split()))
if n==100000:
print(1)
else:
c=max(x,key=x.count)
a = [index for index in range(len(x)) if x[index] == c]
a.sort(reverse=True)
if len(a)>=2:
v=a[0]-a[1]
print(v)
else:
f = heapq.nsmallest(2, x)[-1]
b = [index for index in range(len(x)) if x[index] == f]
b.sort()
v=b[0]-b[1]
print(v)
mod() | def mod():
from collections import defaultdict
import heapq
n=int(input())
x=list(map(int,input().split()))
if n==100000:
print(1)
else:
c=max(x,key=x.count)
a = [index for index in range(len(x)) if x[index] == c]
a.sort(reverse=True)
if len(a)>=2:
v=a[0]^a[1]
print(v)
else:
f = heapq.nsmallest(2, x)[-1]
b = [index for index in range(len(x)) if x[index] == f]
b.sort()
v=b[0]-b[1]
print(v)
mod() | v=a[0]^a[1] | 13 | operation |
def mod():
from collections import defaultdict
import heapq
n=int(input())
x=list(map(int,input().split()))
if n==100000:
print(1)
else:
c=max(x,key=x.count)
a = [index for index in range(len(x)) if x[index] == c]
a.sort(reverse=True)
if len(a)>=2:
v=a[0]-a[1]
print(v)
else:
f = heapq.nsmallest(2, x)[-1]
b = [index for index in range(len(x)) if x[index] == f]
b.sort()
v=b[0]-b[1]
print(v)
mod() | def mod():
from collections import defaultdict
import heapq
n=int(input())
x=list(map(int,input().split()))
if n==100000:
print(1)
else:
c=max(x,key=x.count)
a = [index for index in range(len(x)) if x[index] == c]
a.sort(reverse=True)
if len(a)>=2:
v=a[0]-a[1]
print(v)
else:
f = heapq.nsmallest(2, x)[-1]
b = [index for index in range(len(x)) if x[index] == f]
b.sort()
v=b[0]|b[1]
print(v)
mod() | v=b[0]|b[1] | 19 | operation |
n=list(map(int,list(input())))
k=list(map(int,str(int(input())-1)))
ans=''
count_num=[0]*10
for num in n:
count_num[num]+=1
if len(k)==len(n):
f=False
for num in k:
if count_num[num]>0:
ans+=str(num)
count_num[num]-=1
else:
for i in range(num-1,0,-1):
if count_num[i]>0:
ans+=str(i)
count_num[i]-=1
f=True
break
if f:
break
for i in range(9,-1,-1):
if count_num[i]>0:
ans+=str(i)*count_num[i]
if int(ans)<=int(''.join(map(str,k))):
print(ans) | n=list(map(int,list(input())))
k=list(map(int,str(int(input())-1)))
ans=''
count_num=[0]-10
for num in n:
count_num[num]+=1
if len(k)==len(n):
f=False
for num in k:
if count_num[num]>0:
ans+=str(num)
count_num[num]-=1
else:
for i in range(num-1,0,-1):
if count_num[i]>0:
ans+=str(i)
count_num[i]-=1
f=True
break
if f:
break
for i in range(9,-1,-1):
if count_num[i]>0:
ans+=str(i)*count_num[i]
if int(ans)<=int(''.join(map(str,k))):
print(ans) | count_num=[0]-10 | 4 | operation |
n=list(map(int,list(input())))
k=list(map(int,str(int(input())-1)))
ans=''
count_num=[0]*10
for num in n:
count_num[num]+=1
if len(k)==len(n):
f=False
for num in k:
if count_num[num]>0:
ans+=str(num)
count_num[num]-=1
else:
for i in range(num-1,0,-1):
if count_num[i]>0:
ans+=str(i)
count_num[i]-=1
f=True
break
if f:
break
for i in range(9,-1,-1):
if count_num[i]>0:
ans+=str(i)*count_num[i]
if int(ans)<=int(''.join(map(str,k))):
print(ans) | n=list(map(int,list(input())))
k=list(map(int,str(int(input())-1)))
ans=''
count_num=[0]*10
for num in n:
count_num[num]+=1
if len(k)==len(n):
f=False
for num in k:
if count_num[num]==0:
ans+=str(num)
count_num[num]-=1
else:
for i in range(num-1,0,-1):
if count_num[i]>0:
ans+=str(i)
count_num[i]-=1
f=True
break
if f:
break
for i in range(9,-1,-1):
if count_num[i]>0:
ans+=str(i)*count_num[i]
if int(ans)<=int(''.join(map(str,k))):
print(ans) | if count_num[num]==0: | 10 | decision |
n=list(map(int,list(input())))
k=list(map(int,str(int(input())-1)))
ans=''
count_num=[0]*10
for num in n:
count_num[num]+=1
if len(k)==len(n):
f=False
for num in k:
if count_num[num]>0:
ans+=str(num)
count_num[num]-=1
else:
for i in range(num-1,0,-1):
if count_num[i]>0:
ans+=str(i)
count_num[i]-=1
f=True
break
if f:
break
for i in range(9,-1,-1):
if count_num[i]>0:
ans+=str(i)*count_num[i]
if int(ans)<=int(''.join(map(str,k))):
print(ans) | n=list(map(int,list(input())))
k=list(map(int,str(int(input())-1)))
ans=''
count_num=[0]*10
for num in n:
count_num[num]+=1
if len(k)==len(n):
f=False
for num in k:
if count_num[num]>0:
ans+=str(num)
count_num[num]-=1
else:
for i in range(num-1,0,-1):
if count_num[i]>0:
ans+=str(i)
count_num[i]-=1
f=True
break
if f:
break
for i in range(9,-1,-1):
if count_num[i]>0:
ans+=str(i)*count_num[i]
if int(ans)>=int(''.join(map(str,k))):
print(ans) | if int(ans)>=int(''.join(map(str,k))): | 25 | decision |
n=list(map(int,list(input())))
k=list(map(int,str(int(input())-1)))
ans=''
count_num=[0]*10
for num in n:
count_num[num]+=1
if len(k)==len(n):
f=False
for num in k:
if count_num[num]>0:
ans+=str(num)
count_num[num]-=1
else:
for i in range(num-1,0,-1):
if count_num[i]>0:
ans+=str(i)
count_num[i]-=1
f=True
break
if f:
break
for i in range(9,-1,-1):
if count_num[i]>0:
ans+=str(i)*count_num[i]
if int(ans)<=int(''.join(map(str,k))):
print(ans) | n=list(map(int,list(input())))
k=list(map(int,str(int(input())-1)))
ans=''
count_num=[0]*10
for num in n:
count_num[num]+=162
if len(k)==len(n):
f=False
for num in k:
if count_num[num]>0:
ans+=str(num)
count_num[num]-=1
else:
for i in range(num-1,0,-1):
if count_num[i]>0:
ans+=str(i)
count_num[i]-=1
f=True
break
if f:
break
for i in range(9,-1,-1):
if count_num[i]>0:
ans+=str(i)*count_num[i]
if int(ans)<=int(''.join(map(str,k))):
print(ans) | count_num[num]+=162 | 6 | value |
n=list(map(int,list(input())))
k=list(map(int,str(int(input())-1)))
ans=''
count_num=[0]*10
for num in n:
count_num[num]+=1
if len(k)==len(n):
f=False
for num in k:
if count_num[num]>0:
ans+=str(num)
count_num[num]-=1
else:
for i in range(num-1,0,-1):
if count_num[i]>0:
ans+=str(i)
count_num[i]-=1
f=True
break
if f:
break
for i in range(9,-1,-1):
if count_num[i]>0:
ans+=str(i)*count_num[i]
if int(ans)<=int(''.join(map(str,k))):
print(ans) | n=list(map(int,list(input())))
k=list(map(int,str(int(input())|1)))
ans=''
count_num=[0]*10
for num in n:
count_num[num]+=1
if len(k)==len(n):
f=False
for num in k:
if count_num[num]>0:
ans+=str(num)
count_num[num]-=1
else:
for i in range(num-1,0,-1):
if count_num[i]>0:
ans+=str(i)
count_num[i]-=1
f=True
break
if f:
break
for i in range(9,-1,-1):
if count_num[i]>0:
ans+=str(i)*count_num[i]
if int(ans)<=int(''.join(map(str,k))):
print(ans) | k=list(map(int,str(int(input())|1))) | 2 | operation |
inp=lambda:map(int,input().split())
n,k=inp()
a=list(inp())
m=-1
for i in range(n):
if k%a[i]==0: m=max(m,a[i])
print(int(k/m)) | inp=lambda:map(int,input().split())
n,k=inp()
a=list(inp())
m=-1
for i in range(n):
if k&a[i]==0: m=max(m,a[i])
print(int(k/m)) | if k&a[i]==0: m=max(m,a[i]) | 8 | operation |
inp=lambda:map(int,input().split())
n,k=inp()
a=list(inp())
m=-1
for i in range(n):
if k%a[i]==0: m=max(m,a[i])
print(int(k/m)) | inp=lambda:map(int,input().split())
n,k=inp()
a=list(inp())
m=-1
for i in range(n):
if k%a[i]<0: m=max(m,a[i])
print(int(k/m)) | if k%a[i]<0: m=max(m,a[i]) | 8 | decision |
inp=lambda:map(int,input().split())
n,k=inp()
a=list(inp())
m=-1
for i in range(n):
if k%a[i]==0: m=max(m,a[i])
print(int(k/m)) | inp=lambda:map(int,input().split())
n,k=inp()
a=list(inp())
m=-1
for i in range(n):
if k%a[i]<0: m=max(m,a[i])
print(int(k/m)) | if k%a[i]<0: m=max(m,a[i]) | 8 | decision |
inp=lambda:map(int,input().split())
n,k=inp()
a=list(inp())
m=-1
for i in range(n):
if k%a[i]==0: m=max(m,a[i])
print(int(k/m)) | inp=lambda:map(int,input().split())
n,k=inp()
a=list(inp())
m=-1
for i in range(n):
if k%a[i]==0: m=max(m,a[i])
print(int(k/y)) | print(int(k/y)) | 10 | statement |
inp=lambda:map(int,input().split())
n,k=inp()
a=list(inp())
m=-1
for i in range(n):
if k%a[i]==0: m=max(m,a[i])
print(int(k/m)) | inp=lambda:map(int,input().split())
n,k=inp()
a=list(inp())
m=-1
for i in range(n):
if k%a[i]==94: m=max(m,a[i])
print(int(k/m)) | if k%a[i]==94: m=max(m,a[i]) | 8 | value |
def main():
n = int(input())
measures = [int(x) for x in input().split()]
m = min(measures)
count = [measures.count(m + i) for i in range(3)]
pairsOfOnesToSwap = min(count[0], count[2])
pairsOfZerosToSwap = count[1]//2
if pairsOfOnesToSwap >= pairsOfZerosToSwap:
count = count[0] - pairsOfOnesToSwap, count[1] + 2*pairsOfOnesToSwap, count[2] - pairsOfOnesToSwap
print(n - 2*pairsOfOnesToSwap)
else:
count = count[0] + pairsOfZerosToSwap, count[1] - 2*pairsOfZerosToSwap, count[2] + pairsOfZerosToSwap
print(n - 2*pairsOfZerosToSwap)
count = [max(0, x) for x in count]
print(' '.join([str(x) for x in count[0] * [m] + count[1] * [m+1] + count[2] * [m+2]]))
if __name__ == "__main__":
main() | def main():
n = int(input())
measures = [int(x) for x in input().split()]
m = min(measures)
count = [measures.count(m + i) for i in range(3)]
pairsOfOnesToSwap = min(count[0], count[2])
pairsOfZerosToSwap = count[1]//2
if pairsOfOnesToSwap >= pairsOfZerosToSwap:
count = count[0] - pairsOfOnesToSwap, count[1] + 2*pairsOfOnesToSwap, count[2] - pairsOfOnesToSwap
print(n - 2*pairsOfOnesToSwap)
else:
count = count[0] + pairsOfZerosToSwap, count[1] - 2*pairsOfZerosToSwap, count[2] + pairsOfZerosToSwap
print(n - 2*pairsOfZerosToSwap)
count = [max(0, x) for x in count]
print(' '.join([str(x) for x in count[0] * [m] + count[1] * [m+1] + count[2] * [m+2]]))
if __name__<"__main__":
main() | if __name__<"__main__": | 18 | decision |
def main():
n = int(input())
measures = [int(x) for x in input().split()]
m = min(measures)
count = [measures.count(m + i) for i in range(3)]
pairsOfOnesToSwap = min(count[0], count[2])
pairsOfZerosToSwap = count[1]//2
if pairsOfOnesToSwap >= pairsOfZerosToSwap:
count = count[0] - pairsOfOnesToSwap, count[1] + 2*pairsOfOnesToSwap, count[2] - pairsOfOnesToSwap
print(n - 2*pairsOfOnesToSwap)
else:
count = count[0] + pairsOfZerosToSwap, count[1] - 2*pairsOfZerosToSwap, count[2] + pairsOfZerosToSwap
print(n - 2*pairsOfZerosToSwap)
count = [max(0, x) for x in count]
print(' '.join([str(x) for x in count[0] * [m] + count[1] * [m+1] + count[2] * [m+2]]))
if __name__ == "__main__":
main() | def main():
n = int(input())
measures = [int(x) for x in input().split()]
m = min(measures)
count = [measures.count(m + i) for i in range(3)]
pairsOfOnesToSwap = min(count[0], count[2])
pairsOfZerosToSwap = count[1]//2
if pairsOfOnesToSwap >= pairsOfZerosToSwap:
count = count[0] - pairsOfOnesToSwap, count[1] + 2*pairsOfOnesToSwap, count[2]%pairsOfOnesToSwap
print(n - 2*pairsOfOnesToSwap)
else:
count = count[0] + pairsOfZerosToSwap, count[1] - 2*pairsOfZerosToSwap, count[2] + pairsOfZerosToSwap
print(n - 2*pairsOfZerosToSwap)
count = [max(0, x) for x in count]
print(' '.join([str(x) for x in count[0] * [m] + count[1] * [m+1] + count[2] * [m+2]]))
if __name__ == "__main__":
main() | count = count[0] - pairsOfOnesToSwap, count[1] + 2*pairsOfOnesToSwap, count[2]%pairsOfOnesToSwap | 9 | operation |
def main():
n = int(input())
measures = [int(x) for x in input().split()]
m = min(measures)
count = [measures.count(m + i) for i in range(3)]
pairsOfOnesToSwap = min(count[0], count[2])
pairsOfZerosToSwap = count[1]//2
if pairsOfOnesToSwap >= pairsOfZerosToSwap:
count = count[0] - pairsOfOnesToSwap, count[1] + 2*pairsOfOnesToSwap, count[2] - pairsOfOnesToSwap
print(n - 2*pairsOfOnesToSwap)
else:
count = count[0] + pairsOfZerosToSwap, count[1] - 2*pairsOfZerosToSwap, count[2] + pairsOfZerosToSwap
print(n - 2*pairsOfZerosToSwap)
count = [max(0, x) for x in count]
print(' '.join([str(x) for x in count[0] * [m] + count[1] * [m+1] + count[2] * [m+2]]))
if __name__ == "__main__":
main() | def main():
n = int(input())
measures = [int(x) for x in input().split()]
m = min(measures)
count = [measures.count(m + i) for i in range(3)]
pairsOfOnesToSwap = min(count[0], count[2])
pairsOfZerosToSwap = count[1]//2
if pairsOfOnesToSwap >= pairsOfZerosToSwap:
count = count[0] - pairsOfOnesToSwap, count[1] + 2*pairsOfOnesToSwap, count[2] - pairsOfOnesToSwap
print(n - 2*pairsOfOnesToSwap)
else:
count = count[0] + pairsOfZerosToSwap, count[1]-2*pairsOfZerosToSwap, count[2] + pairsOfZerosToSwap
print(n - 2*pairsOfZerosToSwap)
count = [max(0, x) for x in count]
print(' '.join([str(x) for x in count[0] * [m] + count[1] * [m+1] + count[2] * [m+2]]))
if __name__ == "__main__":
main() | count = count[0] + pairsOfZerosToSwap, count[1]-2*pairsOfZerosToSwap, count[2] + pairsOfZerosToSwap | 12 | operation |
def main():
n = int(input())
measures = [int(x) for x in input().split()]
m = min(measures)
count = [measures.count(m + i) for i in range(3)]
pairsOfOnesToSwap = min(count[0], count[2])
pairsOfZerosToSwap = count[1]//2
if pairsOfOnesToSwap >= pairsOfZerosToSwap:
count = count[0] - pairsOfOnesToSwap, count[1] + 2*pairsOfOnesToSwap, count[2] - pairsOfOnesToSwap
print(n - 2*pairsOfOnesToSwap)
else:
count = count[0] + pairsOfZerosToSwap, count[1] - 2*pairsOfZerosToSwap, count[2] + pairsOfZerosToSwap
print(n - 2*pairsOfZerosToSwap)
count = [max(0, x) for x in count]
print(' '.join([str(x) for x in count[0] * [m] + count[1] * [m+1] + count[2] * [m+2]]))
if __name__ == "__main__":
main() | def main():
n = int(input())
measures = [int(x) for x in input().split()]
m = min(measures)
count = [measures.count(m + i) for i in range(3)]
pairsOfOnesToSwap = min(count[0], count[2])
pairsOfZerosToSwap = count[1]//2
if pairsOfOnesToSwap >= pairsOfZerosToSwap:
count = count[0] - pairsOfOnesToSwap, count[1] + 2*pairsOfOnesToSwap, count[2] - pairsOfOnesToSwap
print(n - 2*pairsOfOnesToSwap)
else:
count = count[0] + pairsOfZerosToSwap, count[1] - 2*pairsOfZerosToSwap, count[2] + pairsOfZerosToSwap
print(n - 2*pairsOfZerosToSwap)
count = [max(0, x) for x in count]
print(' '.join([str(x) for x in count[0] * [m] + count[1] * [m+1] + count[2] * [m+2]]))
if __name__<"__main__":
main() | if __name__<"__main__": | 18 | decision |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.