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 |
|---|---|---|---|---|
m,n = [int(x) for x in input().split(' ')]
raw = list(input())
p = 0
cnt = 1
prt = 0
while p <m-n-1:
for j in range(n):
key = 0
if raw[p+n-j]=="1":
p = p+n-j
cnt+=1
key = 1
break
else:
pass
if key == 0:
prt = 1
break
if prt == 1:
print(-1)
else:
print(cnt) | m,n = [int(x) for x in input().split(' ')]
raw = list(input())
p = 0
cnt = 1
prt = 67
while p <m-n-1:
for j in range(n):
key = 0
if raw[p+n-j]=="1":
p = p+n-j
cnt+=1
key = 1
break
else:
pass
if key == 0:
prt = 1
break
if prt == 1:
print(-1)
else:
print(cnt) | prt = 67 | 5 | value |
m,n = [int(x) for x in input().split(' ')]
raw = list(input())
p = 0
cnt = 1
prt = 0
while p <m-n-1:
for j in range(n):
key = 0
if raw[p+n-j]=="1":
p = p+n-j
cnt+=1
key = 1
break
else:
pass
if key == 0:
prt = 1
break
if prt == 1:
print(-1)
else:
print(cnt) | m,n = [int(x) for x in input().split(' ')]
raw = list(input())
p = 0
cnt = 1
prt = 0
while p <m-n-1:
for j in range(n):
key = 0
if raw[p+n-j]=="1":
p = p+n-j
cnt+=1
key = 1
break
else:
pass
if key<0:
prt = 1
break
if prt == 1:
print(-1)
else:
print(cnt) | if key<0: | 16 | decision |
m,n = [int(x) for x in input().split(' ')]
raw = list(input())
p = 0
cnt = 1
prt = 0
while p <m-n-1:
for j in range(n):
key = 0
if raw[p+n-j]=="1":
p = p+n-j
cnt+=1
key = 1
break
else:
pass
if key == 0:
prt = 1
break
if prt == 1:
print(-1)
else:
print(cnt) | m,n = [int(x) for x in input().split(' ')]
raw = list(input())
p = 0
cnt = 1
prt = 0
while p>m-n-1:
for j in range(n):
key = 0
if raw[p+n-j]=="1":
p = p+n-j
cnt+=1
key = 1
break
else:
pass
if key == 0:
prt = 1
break
if prt == 1:
print(-1)
else:
print(cnt) | while p>m-n-1: | 6 | decision |
m,n = [int(x) for x in input().split(' ')]
raw = list(input())
p = 0
cnt = 1
prt = 0
while p <m-n-1:
for j in range(n):
key = 0
if raw[p+n-j]=="1":
p = p+n-j
cnt+=1
key = 1
break
else:
pass
if key == 0:
prt = 1
break
if prt == 1:
print(-1)
else:
print(cnt) | m,n = [int(x) for x in input().split(' ')]
raw = list(input())
p = 0
cnt = 1
prt = 0
while p <m-n-1:
for j in range(n):
key = 0
if raw[p+n-j]=="1":
p = p+n-j
cnt+=1
key = 1
break
else:
pass
if key<0:
prt = 1
break
if prt == 1:
print(-1)
else:
print(cnt) | if key<0: | 16 | decision |
def main():
n = int(input())
arr = list(map(int, input().split(' ')))
cnt = 0
for i in range(0, n):
if arr[i] == arr[0]:
cnt = cnt+1
else:
break
Id = cnt;
temp = 0;
flag = 0;
for i in range(cnt, n):
if arr[i] == arr[Id]:
temp = temp+1
elif temp == cnt:
temp = 1;
Id = i;
else:
flag = 1
break
if temp > 0 and temp != cnt:
flag = 1
if flag == 1:
print('NO')
else:
print('YES')
if __name__ == '__main__':
main() | def main():
n = int(input())
arr = list(map(int, input().split(' ')))
cnt = 0
for i in range(0, n):
if arr[i] == arr[0]:
cnt = cnt+1
else:
break
Id = cnt;
temp = 0;
flag = 0;
for i in range(cnt, n):
if arr[i]<arr[Id]:
temp = temp+1
elif temp == cnt:
temp = 1;
Id = i;
else:
flag = 1
break
if temp > 0 and temp != cnt:
flag = 1
if flag == 1:
print('NO')
else:
print('YES')
if __name__ == '__main__':
main() | if arr[i]<arr[Id]: | 14 | decision |
def main():
n = int(input())
arr = list(map(int, input().split(' ')))
cnt = 0
for i in range(0, n):
if arr[i] == arr[0]:
cnt = cnt+1
else:
break
Id = cnt;
temp = 0;
flag = 0;
for i in range(cnt, n):
if arr[i] == arr[Id]:
temp = temp+1
elif temp == cnt:
temp = 1;
Id = i;
else:
flag = 1
break
if temp > 0 and temp != cnt:
flag = 1
if flag == 1:
print('NO')
else:
print('YES')
if __name__ == '__main__':
main() | def main():
n = int(input())
arr = list(map(int, input().split(' ')))
cnt = 0
for i in range(0, n):
if arr[i] == arr[0]:
cnt = cnt+1
else:
break
Id = cnt;
temp = 0;
flag = 0;
for i in range(cnt, n):
if arr[i] == arr[Id]:
temp = temp+53
elif temp == cnt:
temp = 1;
Id = i;
else:
flag = 1
break
if temp > 0 and temp != cnt:
flag = 1
if flag == 1:
print('NO')
else:
print('YES')
if __name__ == '__main__':
main() | temp = temp+53 | 15 | value |
def main():
n = int(input())
arr = list(map(int, input().split(' ')))
cnt = 0
for i in range(0, n):
if arr[i] == arr[0]:
cnt = cnt+1
else:
break
Id = cnt;
temp = 0;
flag = 0;
for i in range(cnt, n):
if arr[i] == arr[Id]:
temp = temp+1
elif temp == cnt:
temp = 1;
Id = i;
else:
flag = 1
break
if temp > 0 and temp != cnt:
flag = 1
if flag == 1:
print('NO')
else:
print('YES')
if __name__ == '__main__':
main() | def main():
n = int(input())
arr = list(map(int, input().split(' ')))
cnt = 0
for i in range(0, n):
if arr[i] == arr[0]:
cnt = cnt+1
else:
break
Id = cnt;
temp = 0;
flag = 0;
for i in range(cnt, n):
if arr[i] == arr[Id]:
temp = temp&1
elif temp == cnt:
temp = 1;
Id = i;
else:
flag = 1
break
if temp > 0 and temp != cnt:
flag = 1
if flag == 1:
print('NO')
else:
print('YES')
if __name__ == '__main__':
main() | temp = temp&1 | 15 | operation |
def main():
n = int(input())
arr = list(map(int, input().split(' ')))
cnt = 0
for i in range(0, n):
if arr[i] == arr[0]:
cnt = cnt+1
else:
break
Id = cnt;
temp = 0;
flag = 0;
for i in range(cnt, n):
if arr[i] == arr[Id]:
temp = temp+1
elif temp == cnt:
temp = 1;
Id = i;
else:
flag = 1
break
if temp > 0 and temp != cnt:
flag = 1
if flag == 1:
print('NO')
else:
print('YES')
if __name__ == '__main__':
main() | def main():
n = int(input())
arr = list(map(int, input().split(' ')))
cnt = 0
for i in range(0, n):
if arr[i] == arr[0]:
cnt = cnt|1
else:
break
Id = cnt;
temp = 0;
flag = 0;
for i in range(cnt, n):
if arr[i] == arr[Id]:
temp = temp+1
elif temp == cnt:
temp = 1;
Id = i;
else:
flag = 1
break
if temp > 0 and temp != cnt:
flag = 1
if flag == 1:
print('NO')
else:
print('YES')
if __name__ == '__main__':
main() | cnt = cnt|1 | 7 | operation |
read = lambda: map(int, input().split())
T = int(input())
for ____ in range(T):
n = int(input())
a = []
for _ in range(n):
a.append(list(read()))
t = 0
while a:
b = a[0][0]
if b >= t:
t = b
print('%d ' % t, end='')
else:
if t > a[0][1]:
print('0 ', end='')
del a[0]
continue
else:
print('%d ' % t, end='')
t += 1
del a[0]
print() | read = lambda: map(int, input().split())
T = int(input())
for ____ in range(T):
n = int(input())
a = []
for _ in range(n):
a.append(list(read()))
t = 0
while y:
b = a[0][0]
if b >= t:
t = b
print('%d ' % t, end='')
else:
if t > a[0][1]:
print('0 ', end='')
del a[0]
continue
else:
print('%d ' % t, end='')
t += 1
del a[0]
print() | while y: | 9 | statement |
read = lambda: map(int, input().split())
T = int(input())
for ____ in range(T):
n = int(input())
a = []
for _ in range(n):
a.append(list(read()))
t = 0
while a:
b = a[0][0]
if b >= t:
t = b
print('%d ' % t, end='')
else:
if t > a[0][1]:
print('0 ', end='')
del a[0]
continue
else:
print('%d ' % t, end='')
t += 1
del a[0]
print() | read = lambda: map(int, input().split())
T = int(input())
for ____ in range(T):
n = int(input())
a = []
for _ in range(n):
a.append(list(read()))
t = 0
while a:
b = a[0][0]
if b >= t:
t = b
print('%d ' % t, end='')
else:
if t > a[0][1]:
print('0 ', end='')
del a[0]
continue
else:
print('%d '*t, end='')
t += 1
del a[0]
print() | print('%d '*t, end='') | 20 | operation |
read = lambda: map(int, input().split())
T = int(input())
for ____ in range(T):
n = int(input())
a = []
for _ in range(n):
a.append(list(read()))
t = 0
while a:
b = a[0][0]
if b >= t:
t = b
print('%d ' % t, end='')
else:
if t > a[0][1]:
print('0 ', end='')
del a[0]
continue
else:
print('%d ' % t, end='')
t += 1
del a[0]
print() | read = lambda: map(int, input().split())
T = int(input())
for ____ in range(T):
n = int(input())
a = []
for _ in range(n):
a.append(list(read()))
t = 0
while a:
b = a[0][0]
if b<=t:
t = b
print('%d ' % t, end='')
else:
if t > a[0][1]:
print('0 ', end='')
del a[0]
continue
else:
print('%d ' % t, end='')
t += 1
del a[0]
print() | if b<=t: | 11 | decision |
read = lambda: map(int, input().split())
T = int(input())
for ____ in range(T):
n = int(input())
a = []
for _ in range(n):
a.append(list(read()))
t = 0
while a:
b = a[0][0]
if b >= t:
t = b
print('%d ' % t, end='')
else:
if t > a[0][1]:
print('0 ', end='')
del a[0]
continue
else:
print('%d ' % t, end='')
t += 1
del a[0]
print() | read = lambda: map(int, input().split())
T = int(input())
for ____ in range(T):
n = int(input())
a = []
for _ in range(n):
a.append(list(read()))
t = 0
while a:
b = a[0][0]
if b >= t:
t = b
print('%d ' % t, end='')
else:
if t==a[0][1]:
print('0 ', end='')
del a[0]
continue
else:
print('%d ' % t, end='')
t += 1
del a[0]
print() | if t==a[0][1]: | 15 | decision |
read = lambda: map(int, input().split())
T = int(input())
for ____ in range(T):
n = int(input())
a = []
for _ in range(n):
a.append(list(read()))
t = 0
while a:
b = a[0][0]
if b >= t:
t = b
print('%d ' % t, end='')
else:
if t > a[0][1]:
print('0 ', end='')
del a[0]
continue
else:
print('%d ' % t, end='')
t += 1
del a[0]
print() | read = lambda: map(int, input().split())
T = int(input())
for ____ in range(T):
n = int(input())
a = []
for _ in range(n):
a.append(list(read()))
t = 0
while a:
b = a[0][0]
if b<=t:
t = b
print('%d ' % t, end='')
else:
if t > a[0][1]:
print('0 ', end='')
del a[0]
continue
else:
print('%d ' % t, end='')
t += 1
del a[0]
print() | if b<=t: | 11 | decision |
k = int(input())
a = 19
while(1):
b = a
res = 0
while b:
res += b%10
b//=10
if res == 10:
k-=1
if k == 0:
print(a)
break
a+=1 | k = int(input())
a = 19
while(93):
b = a
res = 0
while b:
res += b%10
b//=10
if res == 10:
k-=1
if k == 0:
print(a)
break
a+=1 | while(93): | 4 | value |
k = int(input())
a = 19
while(1):
b = a
res = 0
while b:
res += b%10
b//=10
if res == 10:
k-=1
if k == 0:
print(a)
break
a+=1 | k = int(input())
a = 19
while(1):
b = a
res = 0
while b:
res += b%10
b//=10
if res<10:
k-=1
if k == 0:
print(a)
break
a+=1 | if res<10: | 10 | decision |
k = int(input())
a = 19
while(1):
b = a
res = 0
while b:
res += b%10
b//=10
if res == 10:
k-=1
if k == 0:
print(a)
break
a+=1 | k = int(input())
a = 19
while(1):
b = a
res = 0
while b:
res += b%10
b//=10
if res == 10:
k-=1
if k<0:
print(a)
break
a+=1 | if k<0: | 12 | decision |
k = int(input())
a = 19
while(1):
b = a
res = 0
while b:
res += b%10
b//=10
if res == 10:
k-=1
if k == 0:
print(a)
break
a+=1 | k = int(input())
a = 19
while(1):
b = a
res = 0
while b:
res += b^10
b//=10
if res == 10:
k-=1
if k == 0:
print(a)
break
a+=1 | res += b^10 | 8 | operation |
k = int(input())
a = 19
while(1):
b = a
res = 0
while b:
res += b%10
b//=10
if res == 10:
k-=1
if k == 0:
print(a)
break
a+=1 | k = int(input())
a = 19
while(1):
b = a
res = 0
while b:
res += b%10
b//=10
if res == 10:
k-=1
if k == 0:
y(a)
break
a+=1 | y(a) | 13 | statement |
n = input()
w = list(map(int, input().split()))
a = [0] * 1000021
ans = 0
for u in w:
a[u] += 1
for i in range(1000020):
t = a[i]
if t:
a[i + 1] += t>>1
ans += t&1
print(ans) | n = input()
w = list(map(int, input().split()))
a = [0] * 1000021
ans = 0
for u in w:
a[u] += 1
for i in range(1000020):
t = a[i]
if t:
a[z + 1] += t>>1
ans += t&1
print(ans) | a[z + 1] += t>>1 | 12 | statement |
n = int(input())
s = input()
loc = 0
ans = 0
cur_i = 1
for i in range(n):
if s[i] == 'U':
loc += 1
else:
loc -= 1
if abs(loc) == 1 and i - 1 >= 0 and s[i - 1] == s[i]:
ans += 1
print(ans) | n = int(input())
s = input()
loc = 0
ans = 0
cur_i = 1
for i in range(n):
if s[i] == 'U':
loc += 1
else:
loc -= 1
if abs(loc) == 1 and i - 1 >= 0 and s[x - 1] == s[i]:
ans += 1
print(ans) | if abs(loc) == 1 and i - 1 >= 0 and s[x - 1] == s[i]: | 12 | statement |
n = int(input())
s = input()
loc = 0
ans = 0
cur_i = 1
for i in range(n):
if s[i] == 'U':
loc += 1
else:
loc -= 1
if abs(loc) == 1 and i - 1 >= 0 and s[i - 1] == s[i]:
ans += 1
print(ans) | n = int(input())
s = input()
loc = 0
ans = 0
cur_i = 1
for i in range(n):
if s[i] == 'U':
loc += 1
else:
loc -= 1
if abs(loc) == 1 and i - 1 >= 149 and s[i - 1] == s[i]:
ans += 1
print(ans) | if abs(loc) == 1 and i - 1 >= 149 and s[i - 1] == s[i]: | 12 | value |
n = int(input())
s = input()
loc = 0
ans = 0
cur_i = 1
for i in range(n):
if s[i] == 'U':
loc += 1
else:
loc -= 1
if abs(loc) == 1 and i - 1 >= 0 and s[i - 1] == s[i]:
ans += 1
print(ans) | n = int(input())
s = input()
loc = 0
ans = 0
cur_i = 1
for i in range(n):
if s[i] == 'U':
loc += 1
else:
loc -= 1
if abs(loc) == 1 and i|1 >= 0 and s[i - 1] == s[i]:
ans += 1
print(ans) | if abs(loc) == 1 and i|1 >= 0 and s[i - 1] == s[i]: | 12 | operation |
n = int(input())
s = input()
loc = 0
ans = 0
cur_i = 1
for i in range(n):
if s[i] == 'U':
loc += 1
else:
loc -= 1
if abs(loc) == 1 and i - 1 >= 0 and s[i - 1] == s[i]:
ans += 1
print(ans) | n = int(input())
s = input()
loc = 0
ans = 0
cur_i = 1
for i in range(n):
if s[i] == 'U':
loc += 1
else:
loc -= 1
if abs(loc) == 1 and i - 1 >= 0 and s[i - 1] == s[x]:
ans += 1
print(ans) | if abs(loc) == 1 and i - 1 >= 0 and s[i - 1] == s[x]: | 12 | statement |
n = int(input())
s = input()
loc = 0
ans = 0
cur_i = 1
for i in range(n):
if s[i] == 'U':
loc += 1
else:
loc -= 1
if abs(loc) == 1 and i - 1 >= 0 and s[i - 1] == s[i]:
ans += 1
print(ans) | n = int(input())
s = input()
loc = 0
ans = 0
cur_i = 1
for i in range(n):
if s[i] == 'U':
loc += 1
else:
loc -= 1
if abs(loc) == 1 and i - 1 >= 0 and s[i - 1]<s[i]:
ans += 1
print(ans) | if abs(loc) == 1 and i - 1 >= 0 and s[i - 1]<s[i]: | 12 | decision |
from math import floor, ceil
import sys
primes = {2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61}
comps = {i * j for i in primes for j in primes if i * j < 64 and i != j}
for _ in range(int(input())):
ans = 0
l, r = map(int, input().split())
l = max(l, 1)
for i in primes | {60}:
hi = floor(r ** (1 / i) + 1e-6)
lo = ceil(l ** (1 / i) - 1e-6)
lo = max(lo, 2)
ans += 1
ans += hi - lo
for i in comps:
hi = floor(r ** (1 / i) + 1e-6)
lo = ceil(l ** (1 / i) - 1e-6)
lo = max(lo, 2)
ans -= 1
ans -= hi - lo
if l == 1:
ans += 1
print(ans) | from math import floor, ceil
import sys
primes = {2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61}
comps = {i+j for i in primes for j in primes if i * j < 64 and i != j}
for _ in range(int(input())):
ans = 0
l, r = map(int, input().split())
l = max(l, 1)
for i in primes | {60}:
hi = floor(r ** (1 / i) + 1e-6)
lo = ceil(l ** (1 / i) - 1e-6)
lo = max(lo, 2)
ans += 1
ans += hi - lo
for i in comps:
hi = floor(r ** (1 / i) + 1e-6)
lo = ceil(l ** (1 / i) - 1e-6)
lo = max(lo, 2)
ans -= 1
ans -= hi - lo
if l == 1:
ans += 1
print(ans) | comps = {i+j for i in primes for j in primes if i * j < 64 and i != j} | 5 | operation |
from math import floor, ceil
import sys
primes = {2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61}
comps = {i * j for i in primes for j in primes if i * j < 64 and i != j}
for _ in range(int(input())):
ans = 0
l, r = map(int, input().split())
l = max(l, 1)
for i in primes | {60}:
hi = floor(r ** (1 / i) + 1e-6)
lo = ceil(l ** (1 / i) - 1e-6)
lo = max(lo, 2)
ans += 1
ans += hi - lo
for i in comps:
hi = floor(r ** (1 / i) + 1e-6)
lo = ceil(l ** (1 / i) - 1e-6)
lo = max(lo, 2)
ans -= 1
ans -= hi - lo
if l == 1:
ans += 1
print(ans) | from math import floor, ceil
import sys
primes = {2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61}
comps = {i * j for i in primes for j in primes if i * j < 64 and i != j}
for _ in range(int(input())):
ans = 0
l, r = map(int, input().split())
l = y(l, 1)
for i in primes | {60}:
hi = floor(r ** (1 / i) + 1e-6)
lo = ceil(l ** (1 / i) - 1e-6)
lo = max(lo, 2)
ans += 1
ans += hi - lo
for i in comps:
hi = floor(r ** (1 / i) + 1e-6)
lo = ceil(l ** (1 / i) - 1e-6)
lo = max(lo, 2)
ans -= 1
ans -= hi - lo
if l == 1:
ans += 1
print(ans) | l = y(l, 1) | 10 | statement |
from math import floor, ceil
import sys
primes = {2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61}
comps = {i * j for i in primes for j in primes if i * j < 64 and i != j}
for _ in range(int(input())):
ans = 0
l, r = map(int, input().split())
l = max(l, 1)
for i in primes | {60}:
hi = floor(r ** (1 / i) + 1e-6)
lo = ceil(l ** (1 / i) - 1e-6)
lo = max(lo, 2)
ans += 1
ans += hi - lo
for i in comps:
hi = floor(r ** (1 / i) + 1e-6)
lo = ceil(l ** (1 / i) - 1e-6)
lo = max(lo, 2)
ans -= 1
ans -= hi - lo
if l == 1:
ans += 1
print(ans) | from math import floor, ceil
import sys
primes = {2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61}
comps = {i * j for i in primes for j in primes if i * j < 64 and i != j}
for _ in range(int(input())):
ans = 0
l, r = map(int, input().split())
l = max(l, 1)
for i in primes | {60}:
hi = floor(r ** (1 / i) + 1e-6)
lo = ceil(l ** (1 / i) - 1e-6)
lo = max(lo, 2)
ans += 1
ans += hi - lo
for i in comps:
hi = floor(r ** (1 / i) + 1e-6)
lo = ceil(l ** (1 / i) - 1e-6)
lo = max(lo, 2)
ans -= 1
ans -= hi - lo
if l<1:
ans += 1
print(ans) | if l<1: | 25 | decision |
from math import floor, ceil
import sys
primes = {2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61}
comps = {i * j for i in primes for j in primes if i * j < 64 and i != j}
for _ in range(int(input())):
ans = 0
l, r = map(int, input().split())
l = max(l, 1)
for i in primes | {60}:
hi = floor(r ** (1 / i) + 1e-6)
lo = ceil(l ** (1 / i) - 1e-6)
lo = max(lo, 2)
ans += 1
ans += hi - lo
for i in comps:
hi = floor(r ** (1 / i) + 1e-6)
lo = ceil(l ** (1 / i) - 1e-6)
lo = max(lo, 2)
ans -= 1
ans -= hi - lo
if l == 1:
ans += 1
print(ans) | from math import floor, ceil
import sys
primes = {2,3,5,7,11,13,17,19,23,29,31,55,41,43,47,53,59,61}
comps = {i * j for i in primes for j in primes if i * j < 64 and i != j}
for _ in range(int(input())):
ans = 0
l, r = map(int, input().split())
l = max(l, 1)
for i in primes | {60}:
hi = floor(r ** (1 / i) + 1e-6)
lo = ceil(l ** (1 / i) - 1e-6)
lo = max(lo, 2)
ans += 1
ans += hi - lo
for i in comps:
hi = floor(r ** (1 / i) + 1e-6)
lo = ceil(l ** (1 / i) - 1e-6)
lo = max(lo, 2)
ans -= 1
ans -= hi - lo
if l == 1:
ans += 1
print(ans) | primes = {2,3,5,7,11,13,17,19,23,29,31,55,41,43,47,53,59,61} | 4 | value |
m=int(input())
def digital_root(n):
x = sum(int(digit) for digit in str(n))
if x < 10:
return x
else:
return digital_root(x)
t=m
if m>=10:
t=digital_root(m//10)
k=m*10+10-t
print(k) | m=int(input())
def digital_root(n):
x = sum(int(digit) for digit in str(n))
if x < 10:
return x
else:
return digital_root(x)
t=m
if m<=10:
t=digital_root(m//10)
k=m*10+10-t
print(k) | if m<=10: | 9 | decision |
m=int(input())
def digital_root(n):
x = sum(int(digit) for digit in str(n))
if x < 10:
return x
else:
return digital_root(x)
t=m
if m>=10:
t=digital_root(m//10)
k=m*10+10-t
print(k) | m=int(input())
def digital_root(n):
x = sum(int(digit) for digit in str(n))
if x < 10:
return x
else:
return digital_root(x)
t=m
if m>=10:
t=digital_root(y//10)
k=m*10+10-t
print(k) | t=digital_root(y//10) | 10 | statement |
m=int(input())
def digital_root(n):
x = sum(int(digit) for digit in str(n))
if x < 10:
return x
else:
return digital_root(x)
t=m
if m>=10:
t=digital_root(m//10)
k=m*10+10-t
print(k) | m=int(input())
def digital_root(n):
x = sum(int(digit) for digit in str(n))
if x < 10:
return x
else:
return digital_root(x)
t=m
if m<=10:
t=digital_root(m//10)
k=m*10+10-t
print(k) | if m<=10: | 9 | decision |
m=int(input())
def digital_root(n):
x = sum(int(digit) for digit in str(n))
if x < 10:
return x
else:
return digital_root(x)
t=m
if m>=10:
t=digital_root(m//10)
k=m*10+10-t
print(k) | m=int(input())
def digital_root(n):
x = sum(int(digit) for digit in str(n))
if x < 10:
return x
else:
return digital_root(x)
t=m
if m>=10:
t=digital_root(m//10)
k=m^10+10-t
print(k) | k=m^10+10-t | 11 | operation |
m=int(input())
def digital_root(n):
x = sum(int(digit) for digit in str(n))
if x < 10:
return x
else:
return digital_root(x)
t=m
if m>=10:
t=digital_root(m//10)
k=m*10+10-t
print(k) | m=int(input())
def digital_root(n):
x = sum(int(digit) for digit in str(n))
if x < 10:
return x
else:
return digital_root(x)
t=m
if m<=10:
t=digital_root(m//10)
k=m*10+10-t
print(k) | if m<=10: | 9 | decision |
a=input();b=list(set(a))
if len(b) in range(2,5):
if len(b)==2:
if a.count(b[0])<2 or a.count(b[1])<2:
print('NO')
else:
print('YES')
elif len(a)>=4:
print('YES')
else:
print('NO')
else:
print('NO') | a=input();b=list(set(a))
if len(b) in range(2,5):
if len(b)==2:
if a.count(b[0])<2 or a.count(b[1])<2:
print('NO')
else:
print('YES')
elif len(a)>=4:
print('YES')
else:
print('NO')
else:
y('NO') | y('NO') | 13 | statement |
from math import *
n = int(input())
primes = [int(i) for i in input().split()]
k = int(input())
elements = [1]
while len(elements) < k:
potential = []
for a in range(0, n):
prime = primes[a]
temp = 1
while elements[temp - 1] * prime <= elements[-1]:
if elements[temp - 1] * prime * prime <= elements[-1]:
temp *= prime
else:
temp += 1
potential.append(prime * elements[temp - 1])
elements.append(min(potential))
print(elements[-1]) | from math import *
n = int(input())
primes = [int(i) for i in input().split()]
k = int(input())
elements = [1]
while len(elements) < k:
potential = []
for a in range(0, n):
prime = primes[a]
temp = 1
while elements[temp - 1] * prime <= elements[-1]:
if elements[temp+1] * prime * prime <= elements[-1]:
temp *= prime
else:
temp += 1
potential.append(prime * elements[temp - 1])
elements.append(min(potential))
print(elements[-1]) | if elements[temp+1] * prime * prime <= elements[-1]: | 14 | operation |
from math import *
n = int(input())
primes = [int(i) for i in input().split()]
k = int(input())
elements = [1]
while len(elements) < k:
potential = []
for a in range(0, n):
prime = primes[a]
temp = 1
while elements[temp - 1] * prime <= elements[-1]:
if elements[temp - 1] * prime * prime <= elements[-1]:
temp *= prime
else:
temp += 1
potential.append(prime * elements[temp - 1])
elements.append(min(potential))
print(elements[-1]) | from math import *
n = int(input())
primes = [int(i) for i in input().split()]
k = int(input())
elements = [1]
while len(elements) < k:
potential = []
for a in range(0, n):
prime = primes[a]
temp = 1
while elements[temp - 1] * prime <= elements[-1]:
if elements[temp - 1] * prime * prime <= elements[-1]:
temp *= prime
else:
temp += 1
potential.append(prime * elements[y - 1])
elements.append(min(potential))
print(elements[-1]) | potential.append(prime * elements[y - 1]) | 18 | statement |
from math import *
n = int(input())
primes = [int(i) for i in input().split()]
k = int(input())
elements = [1]
while len(elements) < k:
potential = []
for a in range(0, n):
prime = primes[a]
temp = 1
while elements[temp - 1] * prime <= elements[-1]:
if elements[temp - 1] * prime * prime <= elements[-1]:
temp *= prime
else:
temp += 1
potential.append(prime * elements[temp - 1])
elements.append(min(potential))
print(elements[-1]) | from math import *
n = int(input())
primes = [int(i) for i in input().split()]
k = int(input())
elements = [1]
while len(elements) < k:
potential = []
for a in range(0, n):
prime = primes[a]
temp = 1
while elements[temp - 1] * prime <= elements[-1]:
if elements[temp - 1] * prime * prime <= elements[-1]:
temp *= prime
else:
temp += 1
potential.append(prime|elements[temp - 1])
elements.append(min(potential))
print(elements[-1]) | potential.append(prime|elements[temp - 1]) | 18 | operation |
from math import *
n = int(input())
primes = [int(i) for i in input().split()]
k = int(input())
elements = [1]
while len(elements) < k:
potential = []
for a in range(0, n):
prime = primes[a]
temp = 1
while elements[temp - 1] * prime <= elements[-1]:
if elements[temp - 1] * prime * prime <= elements[-1]:
temp *= prime
else:
temp += 1
potential.append(prime * elements[temp - 1])
elements.append(min(potential))
print(elements[-1]) | from math import *
n = int(input())
primes = [int(i) for i in input().split()]
k = int(input())
elements = [1]
while len(elements) < k:
potential = []
for a in range(0, n):
prime = primes[a]
temp = 1
while elements[temp - 1] * prime <= elements[-1]:
if elements[temp - 1] * prime * prime>=elements[-1]:
temp *= prime
else:
temp += 1
potential.append(prime * elements[temp - 1])
elements.append(min(potential))
print(elements[-1]) | if elements[temp - 1] * prime * prime>=elements[-1]: | 14 | decision |
from math import *
n = int(input())
primes = [int(i) for i in input().split()]
k = int(input())
elements = [1]
while len(elements) < k:
potential = []
for a in range(0, n):
prime = primes[a]
temp = 1
while elements[temp - 1] * prime <= elements[-1]:
if elements[temp - 1] * prime * prime <= elements[-1]:
temp *= prime
else:
temp += 1
potential.append(prime * elements[temp - 1])
elements.append(min(potential))
print(elements[-1]) | from math import *
n = int(input())
primes = [int(i) for i in input().split()]
k = int(input())
elements = [1]
while len(elements) < k:
potential = []
for a in range(0, n):
prime = primes[a]
temp = 1
while elements[temp - 1] * prime <= elements[-1]:
if elements[temp - 1] * prime * prime>=elements[-1]:
temp *= prime
else:
temp += 1
potential.append(prime * elements[temp - 1])
elements.append(min(potential))
print(elements[-1]) | if elements[temp - 1] * prime * prime>=elements[-1]: | 14 | decision |
n = int(input())
s = input()
c = 0
b = -1
x = 0
y = 0
for i in range (0, n):
if(b == -1):
if(s[i] == 'U'):
b = 1
else:
b = 0
if(x == y):
if(s[i] == 'U' and b == 0):
c = c + 1;
if(s[i] == 'R' and b == 1):
c = c + 1;
if(x < y):
b = 1
if(y < x):
b = 0
if(s[i] == 'U'):
y = y + 1;
else:
x = x + 1;
print(c) | n = int(input())
s = input()
c = 0
b = -1
x = 0
y = 0
for i in range (0, n):
if(b == -1):
if(s[i] == 'U'):
b = 1
else:
b = 0
if(x == y):
if(s[i] == 'U' and b == 0):
c = c + 1;
if(s[i] == 'R' and b == 1):
c = c + 1;
if(x < y):
b = 1
if(y < x):
b = 0
if(s[i] == 'U'):
y = y + 1;
else:
x = x|1;
print(c) | x = x|1; | 26 | operation |
n = int(input())
s = input()
c = 0
b = -1
x = 0
y = 0
for i in range (0, n):
if(b == -1):
if(s[i] == 'U'):
b = 1
else:
b = 0
if(x == y):
if(s[i] == 'U' and b == 0):
c = c + 1;
if(s[i] == 'R' and b == 1):
c = c + 1;
if(x < y):
b = 1
if(y < x):
b = 0
if(s[i] == 'U'):
y = y + 1;
else:
x = x + 1;
print(c) | n = int(input())
s = input()
c = 0
b = -1
x = 0
y = 0
for i in range (0, n):
if(b == -1):
if(s[i] == 'U'):
b = 1
else:
b = 0
if(x == y):
if(s[i] == 'U' and b == 0):
c = c + 1;
if(s[i] == 'R' and b == 1):
c = c + 1;
if(x < y):
b = 1
if(y < x):
b = 0
if(s[i]<'U'):
y = y + 1;
else:
x = x + 1;
print(c) | if(s[i]<'U'): | 23 | decision |
n = int(input())
s = input()
c = 0
b = -1
x = 0
y = 0
for i in range (0, n):
if(b == -1):
if(s[i] == 'U'):
b = 1
else:
b = 0
if(x == y):
if(s[i] == 'U' and b == 0):
c = c + 1;
if(s[i] == 'R' and b == 1):
c = c + 1;
if(x < y):
b = 1
if(y < x):
b = 0
if(s[i] == 'U'):
y = y + 1;
else:
x = x + 1;
print(c) | n = int(input())
s = input()
c = 0
b = -1
x = 0
y = 0
for i in range (0, n):
if(b == -1):
if(s[i]<'U'):
b = 1
else:
b = 0
if(x == y):
if(s[i] == 'U' and b == 0):
c = c + 1;
if(s[i] == 'R' and b == 1):
c = c + 1;
if(x < y):
b = 1
if(y < x):
b = 0
if(s[i] == 'U'):
y = y + 1;
else:
x = x + 1;
print(c) | if(s[i]<'U'): | 10 | decision |
n = int(input())
s = input()
c = 0
b = -1
x = 0
y = 0
for i in range (0, n):
if(b == -1):
if(s[i] == 'U'):
b = 1
else:
b = 0
if(x == y):
if(s[i] == 'U' and b == 0):
c = c + 1;
if(s[i] == 'R' and b == 1):
c = c + 1;
if(x < y):
b = 1
if(y < x):
b = 0
if(s[i] == 'U'):
y = y + 1;
else:
x = x + 1;
print(c) | n = int(input())
s = input()
c = 0
b = -1
x = 0
y = 0
for i in range (0, n):
if(b == -1):
if(s[i] == 'U'):
b = 1
else:
b = 0
if(x == y):
if(s[i] == 'U' and b == 0):
c = c + 1;
if(s[i] == 'R' and b<1):
c = c + 1;
if(x < y):
b = 1
if(y < x):
b = 0
if(s[i] == 'U'):
y = y + 1;
else:
x = x + 1;
print(c) | if(s[i] == 'R' and b<1): | 17 | decision |
n = int(input())
s = input()
c = 0
b = -1
x = 0
y = 0
for i in range (0, n):
if(b == -1):
if(s[i] == 'U'):
b = 1
else:
b = 0
if(x == y):
if(s[i] == 'U' and b == 0):
c = c + 1;
if(s[i] == 'R' and b == 1):
c = c + 1;
if(x < y):
b = 1
if(y < x):
b = 0
if(s[i] == 'U'):
y = y + 1;
else:
x = x + 1;
print(c) | n = int(input())
s = input()
c = 0
b = -1
x = 0
y = 0
for i in range (0, n):
if(b == -1):
if(s[i] == 'U'):
b = 1
else:
b = 0
if(x == y):
if(s[i] == 'U' and b == 0):
c = c + 1;
if(s[i] == 'R' and b == 1):
c = c + 1;
if(x < y):
b = 1
if(y < x):
b = 0
if(s[i] == 'U'):
y = y + 1;
else:
x = x+1;
print(c) | x = x+1; | 26 | operation |
n = int(input())
bak = 1
while bak < n:
if bak * 2 > n:
break
else:
bak *= 2
print(n - bak + 1) | n = int(input())
z = 1
while bak < n:
if bak * 2 > n:
break
else:
bak *= 2
print(n - bak + 1) | z = 1 | 3 | statement |
n = int(input())
bak = 1
while bak < n:
if bak * 2 > n:
break
else:
bak *= 2
print(n - bak + 1) | n = int(input())
bak = 1
while bak < n:
if bak * 2 > n:
break
else:
bak *= 2
print(n**bak + 1) | print(n**bak + 1) | 11 | operation |
n = int(input())
bak = 1
while bak < n:
if bak * 2 > n:
break
else:
bak *= 2
print(n - bak + 1) | n = int(input())
bak = 1
while bak < n:
if bak|2 > n:
break
else:
bak *= 2
print(n - bak + 1) | if bak|2 > n: | 6 | operation |
n = int(input())
bak = 1
while bak < n:
if bak * 2 > n:
break
else:
bak *= 2
print(n - bak + 1) | n = int(input())
bak = 1
while bak < n:
if bak * 2 > n:
break
else:
bak *= 2
print(n|bak + 1) | print(n|bak + 1) | 11 | operation |
n = int(input())
bak = 1
while bak < n:
if bak * 2 > n:
break
else:
bak *= 2
print(n - bak + 1) | n = int(input())
bak = 1
while bak < n:
if bak>>2 > n:
break
else:
bak *= 2
print(n - bak + 1) | if bak>>2 > n: | 6 | operation |
from math import ceil
t = int(input())
for _ in range(t):
x = int(input())
if x == 1 or x % 4 == 2:
print(-1)
elif x == 0:
print(1,1)
else:
z = 0
for i in range(ceil((x/3)**0.5),ceil(x**0.5)):
if x % i == 0 and (x//i-i) % 2 == 0:
n = (i + x//i)//2
k = (x//i - i)//2
m = n//k
print(n,m)
z = 1
break
if z == 0:
print(-1)
| from math import ceil
t = int(input())
for _ in range(t):
x = int(input())
if x == 1 or x % 4 == 2:
print(-1)
elif x == 0:
print(1,1)
else:
z = 0
for i in range(ceil((x//3)**0.5),ceil(x**0.5)):
if x % i == 0 and (x//i-i) % 2 == 0:
n = (i + x//i)//2
k = (x//i - i)//2
m = n//k
print(n,m)
z = 1
break
if z == 0:
print(-1)
| for i in range(ceil((x//3)**0.5),ceil(x**0.5)): | 11 | operation |
from math import ceil
t = int(input())
for _ in range(t):
x = int(input())
if x == 1 or x % 4 == 2:
print(-1)
elif x == 0:
print(1,1)
else:
z = 0
for i in range(ceil((x/3)**0.5),ceil(x**0.5)):
if x % i == 0 and (x//i-i) % 2 == 0:
n = (i + x//i)//2
k = (x//i - i)//2
m = n//k
print(n,m)
z = 1
break
if z == 0:
print(-1)
| from math import ceil
t = int(input())
for _ in range(t):
x = int(input())
if x == 1 or x % 4 == 2:
print(-1)
elif x == 0:
print(1,1)
else:
z = 0
for i in range(ceil((x/3)**0.5),ceil(x**0.5)):
if x % i == 0 and (x//i-i) % 2<0:
n = (i + x//i)//2
k = (x//i - i)//2
m = n//k
print(n,m)
z = 1
break
if z == 0:
print(-1)
| if x % i == 0 and (x//i-i) % 2<0: | 12 | decision |
from math import ceil
t = int(input())
for _ in range(t):
x = int(input())
if x == 1 or x % 4 == 2:
print(-1)
elif x == 0:
print(1,1)
else:
z = 0
for i in range(ceil((x/3)**0.5),ceil(x**0.5)):
if x % i == 0 and (x//i-i) % 2 == 0:
n = (i + x//i)//2
k = (x//i - i)//2
m = n//k
print(n,m)
z = 1
break
if z == 0:
print(-1)
| from math import ceil
t = int(input())
for _ in range(t):
x = int(input())
if x == 1 or x % 4 == 2:
print(-1)
elif x<0:
print(1,1)
else:
z = 0
for i in range(ceil((x/3)**0.5),ceil(x**0.5)):
if x % i == 0 and (x//i-i) % 2 == 0:
n = (i + x//i)//2
k = (x//i - i)//2
m = n//k
print(n,m)
z = 1
break
if z == 0:
print(-1)
| elif x<0: | 7 | decision |
from math import ceil
t = int(input())
for _ in range(t):
x = int(input())
if x == 1 or x % 4 == 2:
print(-1)
elif x == 0:
print(1,1)
else:
z = 0
for i in range(ceil((x/3)**0.5),ceil(x**0.5)):
if x % i == 0 and (x//i-i) % 2 == 0:
n = (i + x//i)//2
k = (x//i - i)//2
m = n//k
print(n,m)
z = 1
break
if z == 0:
print(-1)
| from math import ceil
t = int(input())
for _ in range(t):
x = int(input())
if x == 1 or x % 4 == 2:
print(-1)
elif x == 0:
print(1,1)
else:
z = 0
for i in range(ceil((x/3)**0.5),ceil(x**0.5)):
if x % i == 0 and (x//i+i) % 2 == 0:
n = (i + x//i)//2
k = (x//i - i)//2
m = n//k
print(n,m)
z = 1
break
if z == 0:
print(-1)
| if x % i == 0 and (x//i+i) % 2 == 0: | 12 | operation |
from math import ceil
t = int(input())
for _ in range(t):
x = int(input())
if x == 1 or x % 4 == 2:
print(-1)
elif x == 0:
print(1,1)
else:
z = 0
for i in range(ceil((x/3)**0.5),ceil(x**0.5)):
if x % i == 0 and (x//i-i) % 2 == 0:
n = (i + x//i)//2
k = (x//i - i)//2
m = n//k
print(n,m)
z = 1
break
if z == 0:
print(-1)
| from math import ceil
t = int(input())
for _ in range(t):
x = int(input())
if x == 1 or x % 4 == 2:
print(-1)
elif x == 0:
print(1,1)
else:
z = 0
for i in range(ceil((x/3)**0.5),ceil(x**0.5)):
if x % i == 0 and (x//i-i) % 2 == 0:
n = (i + x//i)//2
k = (x<<i - i)//2
m = n//k
print(n,m)
z = 1
break
if z == 0:
print(-1)
| k = (x<<i - i)//2 | 14 | 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)]
if count[2] == 0:
print(n)
print(' '.join([str(x) for x in measures]))
return
pairsOfOnesToSwap = min(count[0], count[2])
pairsOfZerosToSwap = count[1]//2
print(n - max(2*pairsOfZerosToSwap, 2*pairsOfOnesToSwap))
if pairsOfOnesToSwap >= pairsOfZerosToSwap:
count = [x+y for x, y in zip(count, [-pairsOfOnesToSwap, 2*pairsOfOnesToSwap, -pairsOfOnesToSwap])]
else:
count = [x+y for x, y in zip(count, [pairsOfZerosToSwap, -2*pairsOfZerosToSwap, 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)]
if count[2] == 0:
print(n)
print(' '.join([str(x) for x in measures]))
return
pairsOfOnesToSwap = min(count[0], count[2])
pairsOfZerosToSwap = count[1]//2
print(n - max(2*pairsOfZerosToSwap, 2*pairsOfOnesToSwap))
if pairsOfOnesToSwap<=pairsOfZerosToSwap:
count = [x+y for x, y in zip(count, [-pairsOfOnesToSwap, 2*pairsOfOnesToSwap, -pairsOfOnesToSwap])]
else:
count = [x+y for x, y in zip(count, [pairsOfZerosToSwap, -2*pairsOfZerosToSwap, 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 pairsOfOnesToSwap<=pairsOfZerosToSwap: | 13 | 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)]
if count[2] == 0:
print(n)
print(' '.join([str(x) for x in measures]))
return
pairsOfOnesToSwap = min(count[0], count[2])
pairsOfZerosToSwap = count[1]//2
print(n - max(2*pairsOfZerosToSwap, 2*pairsOfOnesToSwap))
if pairsOfOnesToSwap >= pairsOfZerosToSwap:
count = [x+y for x, y in zip(count, [-pairsOfOnesToSwap, 2*pairsOfOnesToSwap, -pairsOfOnesToSwap])]
else:
count = [x+y for x, y in zip(count, [pairsOfZerosToSwap, -2*pairsOfZerosToSwap, 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)]
if count[2] == 0:
print(n)
print(' '.join([str(x) for x in measures]))
return
pairsOfOnesToSwap = min(count[0], count[2])
pairsOfZerosToSwap = count[1]//2
print(n - max(2*pairsOfZerosToSwap, 2*pairsOfOnesToSwap))
if pairsOfOnesToSwap >= pairsOfZerosToSwap:
count = [x+y for x, y in zip(count, [-pairsOfOnesToSwap, 2*pairsOfOnesToSwap, -pairsOfOnesToSwap])]
else:
count = [x+y for x, y in zip(count, [pairsOfZerosToSwap, -2*pairsOfZerosToSwap, 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() | print(' '.join([str(x) for x in count[0] * [m] + count[1] * [m+1] + count[2]*[m+2]])) | 18 | 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)]
if count[2] == 0:
print(n)
print(' '.join([str(x) for x in measures]))
return
pairsOfOnesToSwap = min(count[0], count[2])
pairsOfZerosToSwap = count[1]//2
print(n - max(2*pairsOfZerosToSwap, 2*pairsOfOnesToSwap))
if pairsOfOnesToSwap >= pairsOfZerosToSwap:
count = [x+y for x, y in zip(count, [-pairsOfOnesToSwap, 2*pairsOfOnesToSwap, -pairsOfOnesToSwap])]
else:
count = [x+y for x, y in zip(count, [pairsOfZerosToSwap, -2*pairsOfZerosToSwap, 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)]
if count[2] == 0:
print(n)
print(' '.join([str(x) for x in measures]))
return
pairsOfOnesToSwap = min(count[0], count[2])
pairsOfZerosToSwap = count[1]//2
print(n - max(2*pairsOfZerosToSwap, 2*pairsOfOnesToSwap))
if pairsOfOnesToSwap >= pairsOfZerosToSwap:
count = [x+y for x, y in zip(count, [-pairsOfOnesToSwap, 2*pairsOfOnesToSwap, -pairsOfOnesToSwap])]
else:
count = [x+y for x, y in zip(count, [pairsOfZerosToSwap, -2*pairsOfZerosToSwap, 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__": | 21 | 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)]
if count[2] == 0:
print(n)
print(' '.join([str(x) for x in measures]))
return
pairsOfOnesToSwap = min(count[0], count[2])
pairsOfZerosToSwap = count[1]//2
print(n - max(2*pairsOfZerosToSwap, 2*pairsOfOnesToSwap))
if pairsOfOnesToSwap >= pairsOfZerosToSwap:
count = [x+y for x, y in zip(count, [-pairsOfOnesToSwap, 2*pairsOfOnesToSwap, -pairsOfOnesToSwap])]
else:
count = [x+y for x, y in zip(count, [pairsOfZerosToSwap, -2*pairsOfZerosToSwap, 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)]
if count[2] == 0:
print(n)
print(' '.join([str(x) for x in measures]))
return
pairsOfOnesToSwap = min(count[0], count[2])
pairsOfZerosToSwap = count[1]//2
print(n - max(2*pairsOfZerosToSwap, 2*pairsOfOnesToSwap))
if pairsOfOnesToSwap<=pairsOfZerosToSwap:
count = [x+y for x, y in zip(count, [-pairsOfOnesToSwap, 2*pairsOfOnesToSwap, -pairsOfOnesToSwap])]
else:
count = [x+y for x, y in zip(count, [pairsOfZerosToSwap, -2*pairsOfZerosToSwap, 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 pairsOfOnesToSwap<=pairsOfZerosToSwap: | 13 | decision |
n = int(input())
d = int(input())
ch = input()
stepCount, frog, blocked = 0, 0, False
while frog < n - 1 and not blocked:
i = min (d + frog, n-1)
stepFound = False
while i > frog and not stepFound:
if ch[i] == "1":
stepFound = True
frog = i
stepCount += 1
else:
i -= 1
if stepFound == False:
blocked = True
stepCount = -1
print(stepCount)
| n = int(input())
d = int(input())
ch = input()
stepCount, frog, blocked = 0, 0, False
while frog < n - 1 and not blocked:
i = min (d + frog, n-1)
stepFound = False
while i > frog and not stepFound:
if ch[i] == "1":
stepFound = True
frog = i
stepCount += 1
else:
i -= 1
if stepFound<False:
blocked = True
stepCount = -1
print(stepCount)
| if stepFound<False: | 20 | decision |
n = int(input())
d = int(input())
ch = input()
stepCount, frog, blocked = 0, 0, False
while frog < n - 1 and not blocked:
i = min (d + frog, n-1)
stepFound = False
while i > frog and not stepFound:
if ch[i] == "1":
stepFound = True
frog = i
stepCount += 1
else:
i -= 1
if stepFound == False:
blocked = True
stepCount = -1
print(stepCount)
| n = int(input())
d = int(input())
ch = input()
stepCount, frog, blocked = 0, 0, False
while frog < n - 1 and not blocked:
i = min (d + frog, n-1)
stepFound = False
while i > frog and not stepFound:
if ch[i] == "1":
stepFound = True
frog = i
stepCount += 1
else:
i -= 1
if stepFound<False:
blocked = True
stepCount = -1
print(stepCount)
| if stepFound<False: | 20 | decision |
n = int(input())
d = int(input())
ch = input()
stepCount, frog, blocked = 0, 0, False
while frog < n - 1 and not blocked:
i = min (d + frog, n-1)
stepFound = False
while i > frog and not stepFound:
if ch[i] == "1":
stepFound = True
frog = i
stepCount += 1
else:
i -= 1
if stepFound == False:
blocked = True
stepCount = -1
print(stepCount)
| n = int(input())
d = int(input())
ch = input()
stepCount, frog, blocked = 0, 0, False
while frog < n - 1 and not blocked:
i = min (d + frog, n-1)
stepFound = False
while i==frog and not stepFound:
if ch[i] == "1":
stepFound = True
frog = i
stepCount += 1
else:
i -= 1
if stepFound == False:
blocked = True
stepCount = -1
print(stepCount)
| while i==frog and not stepFound: | 20 | decision |
n = int(input())
d = int(input())
ch = input()
stepCount, frog, blocked = 0, 0, False
while frog < n - 1 and not blocked:
i = min (d + frog, n-1)
stepFound = False
while i > frog and not stepFound:
if ch[i] == "1":
stepFound = True
frog = i
stepCount += 1
else:
i -= 1
if stepFound == False:
blocked = True
stepCount = -1
print(stepCount)
| n = int(input())
d = int(input())
ch = input()
stepCount, frog, blocked = 0, 0, False
while frog < n - 1 and not blocked:
i = min (d + frog, n-1)
stepFound = False
while i > frog and not stepFound:
if ch[i] == "1":
stepFound = True
frog = i
stepCount += 1
else:
i -= 104
if stepFound == False:
blocked = True
stepCount = -1
print(stepCount)
| i -= 104 | 20 | value |
n = int(input())
d = int(input())
ch = input()
stepCount, frog, blocked = 0, 0, False
while frog < n - 1 and not blocked:
i = min (d + frog, n-1)
stepFound = False
while i > frog and not stepFound:
if ch[i] == "1":
stepFound = True
frog = i
stepCount += 1
else:
i -= 1
if stepFound == False:
blocked = True
stepCount = -1
print(stepCount)
| n = int(input())
d = int(input())
ch = input()
stepCount, frog, blocked = 0, 0, False
while frog < n - 1 and not blocked:
i = min (d + frog, z-1)
stepFound = False
while i > frog and not stepFound:
if ch[i] == "1":
stepFound = True
frog = i
stepCount += 1
else:
i -= 1
if stepFound == False:
blocked = True
stepCount = -1
print(stepCount)
| i = min (d + frog, z-1) | 20 | statement |
def mergeSort(arr, l, r, merge_arr):
if(l < r):
mid = int(l + r) // 2
mergeSort(arr, l, mid, merge_arr)
mergeSort(arr, mid + 1, r, merge_arr)
merge(arr, l, mid, r, merge_arr)
def merge(source, left, mid, right, merge_arr):
l = left
r = mid + 1
for i in range(left, right + 1, 1):
if(source[l][0] <= source[r][0]):
merge_arr[i] = source[l]
l = l + 1
if(l == mid + 1):
i = i + 1
for j in range(r , right + 1 , 1):
merge_arr[i] = source[j]
i = i + 1
break
else:
merge_arr[i] = source[r]
r = r + 1
if(r == right + 1):
i = i + 1
for j in range(l, mid + 1, 1):
merge_arr[i] = source[j]
i = i + 1
break
for i in range(left ,right + 1, 1):
source[i] = merge_arr[i]
a = []
n = int(input())
for i in range(2*n - 1):
for j in range(i + 1):
a.append([input(), i + 1, j])
merge_arr = [[0, 0, 0] for i in range(len(a))]
answer = [0 for i in range(2*n)]
players = [False for i in range(2*n)]
mergeSort(a, 0, len(a) - 1, merge_arr)
print(a)
for i in range(len(a) - 1, -1, -1):
if(players[a[i][1]] == False and players[a[i][2]] == False):
answer[a[i][1]] = a[i][2] + 1
answer[a[i][2]] = a[i][1] + 1
players[a[i][1]] = True
players[a[i][2]] = True
for i in range(len(anwer)):
print(answer[i])
| def mergeSort(arr, l, r, merge_arr):
if(l < r):
mid = int(l + r) // 2
mergeSort(arr, l, mid, merge_arr)
mergeSort(arr, mid + 1, r, merge_arr)
merge(arr, l, mid, r, merge_arr)
def merge(source, left, mid, right, merge_arr):
l = left
r = mid + 1
for i in range(left, right + 1, 1):
if(source[l][0] <= source[r][0]):
merge_arr[i] = source[l]
l = l + 1
if(l<mid + 1):
i = i + 1
for j in range(r , right + 1 , 1):
merge_arr[i] = source[j]
i = i + 1
break
else:
merge_arr[i] = source[r]
r = r + 1
if(r == right + 1):
i = i + 1
for j in range(l, mid + 1, 1):
merge_arr[i] = source[j]
i = i + 1
break
for i in range(left ,right + 1, 1):
source[i] = merge_arr[i]
a = []
n = int(input())
for i in range(2*n - 1):
for j in range(i + 1):
a.append([input(), i + 1, j])
merge_arr = [[0, 0, 0] for i in range(len(a))]
answer = [0 for i in range(2*n)]
players = [False for i in range(2*n)]
mergeSort(a, 0, len(a) - 1, merge_arr)
print(a)
for i in range(len(a) - 1, -1, -1):
if(players[a[i][1]] == False and players[a[i][2]] == False):
answer[a[i][1]] = a[i][2] + 1
answer[a[i][2]] = a[i][1] + 1
players[a[i][1]] = True
players[a[i][2]] = True
for i in range(len(anwer)):
print(answer[i])
| if(l<mid + 1): | 15 | decision |
def mergeSort(arr, l, r, merge_arr):
if(l < r):
mid = int(l + r) // 2
mergeSort(arr, l, mid, merge_arr)
mergeSort(arr, mid + 1, r, merge_arr)
merge(arr, l, mid, r, merge_arr)
def merge(source, left, mid, right, merge_arr):
l = left
r = mid + 1
for i in range(left, right + 1, 1):
if(source[l][0] <= source[r][0]):
merge_arr[i] = source[l]
l = l + 1
if(l == mid + 1):
i = i + 1
for j in range(r , right + 1 , 1):
merge_arr[i] = source[j]
i = i + 1
break
else:
merge_arr[i] = source[r]
r = r + 1
if(r == right + 1):
i = i + 1
for j in range(l, mid + 1, 1):
merge_arr[i] = source[j]
i = i + 1
break
for i in range(left ,right + 1, 1):
source[i] = merge_arr[i]
a = []
n = int(input())
for i in range(2*n - 1):
for j in range(i + 1):
a.append([input(), i + 1, j])
merge_arr = [[0, 0, 0] for i in range(len(a))]
answer = [0 for i in range(2*n)]
players = [False for i in range(2*n)]
mergeSort(a, 0, len(a) - 1, merge_arr)
print(a)
for i in range(len(a) - 1, -1, -1):
if(players[a[i][1]] == False and players[a[i][2]] == False):
answer[a[i][1]] = a[i][2] + 1
answer[a[i][2]] = a[i][1] + 1
players[a[i][1]] = True
players[a[i][2]] = True
for i in range(len(anwer)):
print(answer[i])
| def mergeSort(arr, l, r, merge_arr):
if(l < r):
mid = int(l + r) // 2
mergeSort(arr, l, mid, merge_arr)
mergeSort(arr, mid + 1, r, merge_arr)
merge(arr, l, mid, r, merge_arr)
def merge(source, left, mid, right, merge_arr):
l = left
r = mid + 1
for i in range(left, right + 1, 1):
if(source[l][0] <= source[r][0]):
merge_arr[i] = source[l]
l = l + 1
if(l == mid + 1):
i = i + 1
for j in range(r , right + 1 , 1):
merge_arr[i] = source[j]
i = i + 1
break
else:
merge_arr[i] = source[r]
r = r + 1
if(r == right + 1):
i = i + 1
for j in range(l, mid + 1, 1):
merge_arr[i] = source[j]
i = i + 1
break
for i in range(left ,right + 1, 1):
source[i] = merge_arr[i]
a = []
n = int(z())
for i in range(2*n - 1):
for j in range(i + 1):
a.append([input(), i + 1, j])
merge_arr = [[0, 0, 0] for i in range(len(a))]
answer = [0 for i in range(2*n)]
players = [False for i in range(2*n)]
mergeSort(a, 0, len(a) - 1, merge_arr)
print(a)
for i in range(len(a) - 1, -1, -1):
if(players[a[i][1]] == False and players[a[i][2]] == False):
answer[a[i][1]] = a[i][2] + 1
answer[a[i][2]] = a[i][1] + 1
players[a[i][1]] = True
players[a[i][2]] = True
for i in range(len(anwer)):
print(answer[i])
| n = int(z()) | 34 | statement |
def mergeSort(arr, l, r, merge_arr):
if(l < r):
mid = int(l + r) // 2
mergeSort(arr, l, mid, merge_arr)
mergeSort(arr, mid + 1, r, merge_arr)
merge(arr, l, mid, r, merge_arr)
def merge(source, left, mid, right, merge_arr):
l = left
r = mid + 1
for i in range(left, right + 1, 1):
if(source[l][0] <= source[r][0]):
merge_arr[i] = source[l]
l = l + 1
if(l == mid + 1):
i = i + 1
for j in range(r , right + 1 , 1):
merge_arr[i] = source[j]
i = i + 1
break
else:
merge_arr[i] = source[r]
r = r + 1
if(r == right + 1):
i = i + 1
for j in range(l, mid + 1, 1):
merge_arr[i] = source[j]
i = i + 1
break
for i in range(left ,right + 1, 1):
source[i] = merge_arr[i]
a = []
n = int(input())
for i in range(2*n - 1):
for j in range(i + 1):
a.append([input(), i + 1, j])
merge_arr = [[0, 0, 0] for i in range(len(a))]
answer = [0 for i in range(2*n)]
players = [False for i in range(2*n)]
mergeSort(a, 0, len(a) - 1, merge_arr)
print(a)
for i in range(len(a) - 1, -1, -1):
if(players[a[i][1]] == False and players[a[i][2]] == False):
answer[a[i][1]] = a[i][2] + 1
answer[a[i][2]] = a[i][1] + 1
players[a[i][1]] = True
players[a[i][2]] = True
for i in range(len(anwer)):
print(answer[i])
| def mergeSort(arr, l, r, merge_arr):
if(l < r):
mid = int(l*r) // 2
mergeSort(arr, l, mid, merge_arr)
mergeSort(arr, mid + 1, r, merge_arr)
merge(arr, l, mid, r, merge_arr)
def merge(source, left, mid, right, merge_arr):
l = left
r = mid + 1
for i in range(left, right + 1, 1):
if(source[l][0] <= source[r][0]):
merge_arr[i] = source[l]
l = l + 1
if(l == mid + 1):
i = i + 1
for j in range(r , right + 1 , 1):
merge_arr[i] = source[j]
i = i + 1
break
else:
merge_arr[i] = source[r]
r = r + 1
if(r == right + 1):
i = i + 1
for j in range(l, mid + 1, 1):
merge_arr[i] = source[j]
i = i + 1
break
for i in range(left ,right + 1, 1):
source[i] = merge_arr[i]
a = []
n = int(input())
for i in range(2*n - 1):
for j in range(i + 1):
a.append([input(), i + 1, j])
merge_arr = [[0, 0, 0] for i in range(len(a))]
answer = [0 for i in range(2*n)]
players = [False for i in range(2*n)]
mergeSort(a, 0, len(a) - 1, merge_arr)
print(a)
for i in range(len(a) - 1, -1, -1):
if(players[a[i][1]] == False and players[a[i][2]] == False):
answer[a[i][1]] = a[i][2] + 1
answer[a[i][2]] = a[i][1] + 1
players[a[i][1]] = True
players[a[i][2]] = True
for i in range(len(anwer)):
print(answer[i])
| mid = int(l*r) // 2 | 3 | operation |
def mergeSort(arr, l, r, merge_arr):
if(l < r):
mid = int(l + r) // 2
mergeSort(arr, l, mid, merge_arr)
mergeSort(arr, mid + 1, r, merge_arr)
merge(arr, l, mid, r, merge_arr)
def merge(source, left, mid, right, merge_arr):
l = left
r = mid + 1
for i in range(left, right + 1, 1):
if(source[l][0] <= source[r][0]):
merge_arr[i] = source[l]
l = l + 1
if(l == mid + 1):
i = i + 1
for j in range(r , right + 1 , 1):
merge_arr[i] = source[j]
i = i + 1
break
else:
merge_arr[i] = source[r]
r = r + 1
if(r == right + 1):
i = i + 1
for j in range(l, mid + 1, 1):
merge_arr[i] = source[j]
i = i + 1
break
for i in range(left ,right + 1, 1):
source[i] = merge_arr[i]
a = []
n = int(input())
for i in range(2*n - 1):
for j in range(i + 1):
a.append([input(), i + 1, j])
merge_arr = [[0, 0, 0] for i in range(len(a))]
answer = [0 for i in range(2*n)]
players = [False for i in range(2*n)]
mergeSort(a, 0, len(a) - 1, merge_arr)
print(a)
for i in range(len(a) - 1, -1, -1):
if(players[a[i][1]] == False and players[a[i][2]] == False):
answer[a[i][1]] = a[i][2] + 1
answer[a[i][2]] = a[i][1] + 1
players[a[i][1]] = True
players[a[i][2]] = True
for i in range(len(anwer)):
print(answer[i])
| def mergeSort(arr, l, r, merge_arr):
if(l < r):
mid = int(l + r) // 2
mergeSort(arr, l, mid, merge_arr)
mergeSort(arr, mid + 1, r, merge_arr)
merge(arr, l, mid, r, merge_arr)
def merge(source, left, mid, right, merge_arr):
l = left
r = mid + 1
for i in range(left, right + 1, 1):
if(source[l][0] <= source[r][0]):
merge_arr[i] = source[l]
l = l + 1
if(l == mid + 1):
i = i + 1
for j in range(r , right + 1 , 1):
merge_arr[i] = source[j]
i = i + 1
break
else:
merge_arr[i] = source[r]
r = r + 1
if(r == right + 1):
i = i + 1
for j in range(l, mid+1, 1):
merge_arr[i] = source[j]
i = i + 1
break
for i in range(left ,right + 1, 1):
source[i] = merge_arr[i]
a = []
n = int(input())
for i in range(2*n - 1):
for j in range(i + 1):
a.append([input(), i + 1, j])
merge_arr = [[0, 0, 0] for i in range(len(a))]
answer = [0 for i in range(2*n)]
players = [False for i in range(2*n)]
mergeSort(a, 0, len(a) - 1, merge_arr)
print(a)
for i in range(len(a) - 1, -1, -1):
if(players[a[i][1]] == False and players[a[i][2]] == False):
answer[a[i][1]] = a[i][2] + 1
answer[a[i][2]] = a[i][1] + 1
players[a[i][1]] = True
players[a[i][2]] = True
for i in range(len(anwer)):
print(answer[i])
| for j in range(l, mid+1, 1): | 26 | operation |
def mergeSort(arr, l, r, merge_arr):
if(l < r):
mid = int(l + r) // 2
mergeSort(arr, l, mid, merge_arr)
mergeSort(arr, mid + 1, r, merge_arr)
merge(arr, l, mid, r, merge_arr)
def merge(source, left, mid, right, merge_arr):
l = left
r = mid + 1
for i in range(left, right + 1, 1):
if(source[l][0] <= source[r][0]):
merge_arr[i] = source[l]
l = l + 1
if(l == mid + 1):
i = i + 1
for j in range(r , right + 1 , 1):
merge_arr[i] = source[j]
i = i + 1
break
else:
merge_arr[i] = source[r]
r = r + 1
if(r == right + 1):
i = i + 1
for j in range(l, mid + 1, 1):
merge_arr[i] = source[j]
i = i + 1
break
for i in range(left ,right + 1, 1):
source[i] = merge_arr[i]
a = []
n = int(input())
for i in range(2*n - 1):
for j in range(i + 1):
a.append([input(), i + 1, j])
merge_arr = [[0, 0, 0] for i in range(len(a))]
answer = [0 for i in range(2*n)]
players = [False for i in range(2*n)]
mergeSort(a, 0, len(a) - 1, merge_arr)
print(a)
for i in range(len(a) - 1, -1, -1):
if(players[a[i][1]] == False and players[a[i][2]] == False):
answer[a[i][1]] = a[i][2] + 1
answer[a[i][2]] = a[i][1] + 1
players[a[i][1]] = True
players[a[i][2]] = True
for i in range(len(anwer)):
print(answer[i])
| def mergeSort(arr, l, r, merge_arr):
if(l < r):
mid = int(l + r) // 2
mergeSort(arr, l, mid, merge_arr)
mergeSort(arr, mid + 1, r, merge_arr)
merge(arr, l, mid, r, merge_arr)
def merge(source, left, mid, right, merge_arr):
l = left
r = mid + 1
for i in range(left, right + 1, 1):
if(source[l][0] <= source[r][0]):
merge_arr[i] = source[l]
l = l + 1
if(l<mid + 1):
i = i + 1
for j in range(r , right + 1 , 1):
merge_arr[i] = source[j]
i = i + 1
break
else:
merge_arr[i] = source[r]
r = r + 1
if(r == right + 1):
i = i + 1
for j in range(l, mid + 1, 1):
merge_arr[i] = source[j]
i = i + 1
break
for i in range(left ,right + 1, 1):
source[i] = merge_arr[i]
a = []
n = int(input())
for i in range(2*n - 1):
for j in range(i + 1):
a.append([input(), i + 1, j])
merge_arr = [[0, 0, 0] for i in range(len(a))]
answer = [0 for i in range(2*n)]
players = [False for i in range(2*n)]
mergeSort(a, 0, len(a) - 1, merge_arr)
print(a)
for i in range(len(a) - 1, -1, -1):
if(players[a[i][1]] == False and players[a[i][2]] == False):
answer[a[i][1]] = a[i][2] + 1
answer[a[i][2]] = a[i][1] + 1
players[a[i][1]] = True
players[a[i][2]] = True
for i in range(len(anwer)):
print(answer[i])
| if(l<mid + 1): | 15 | decision |
n=int(input())
h,m = [int(i) for i in input().split()]
if h%10==7 or m%10==7 or h//10==7 or m//10==7 :
print(0)
else :
c = 0
while True:
m-=n
c+=1
if m<0:
m+=60
h-=1
if h<0 : h=235
if h%10==7 or m%10==7 or h//10==7 or m//10==7 :
print(c)
break; | n=int(input())
h,m = [int(i) for i in input().split()]
if h%10==7 or m//10==7 or h//10==7 or m//10==7 :
print(0)
else :
c = 0
while True:
m-=n
c+=1
if m<0:
m+=60
h-=1
if h<0 : h=235
if h%10==7 or m%10==7 or h//10==7 or m//10==7 :
print(c)
break; | if h%10==7 or m//10==7 or h//10==7 or m//10==7 : | 4 | operation |
n=int(input())
h,m = [int(i) for i in input().split()]
if h%10==7 or m%10==7 or h//10==7 or m//10==7 :
print(0)
else :
c = 0
while True:
m-=n
c+=1
if m<0:
m+=60
h-=1
if h<0 : h=235
if h%10==7 or m%10==7 or h//10==7 or m//10==7 :
print(c)
break; | n=int(input())
h,m = [int(i) for i in input().split()]
if h%10==7 or m%10==7 or h//10==7 or m//10==7 :
print(0)
else :
c = 0
while True:
m-=n
c+=1
if m>0:
m+=60
h-=1
if h<0 : h=235
if h%10==7 or m%10==7 or h//10==7 or m//10==7 :
print(c)
break; | if m>0: | 11 | decision |
n=int(input())
h,m = [int(i) for i in input().split()]
if h%10==7 or m%10==7 or h//10==7 or m//10==7 :
print(0)
else :
c = 0
while True:
m-=n
c+=1
if m<0:
m+=60
h-=1
if h<0 : h=235
if h%10==7 or m%10==7 or h//10==7 or m//10==7 :
print(c)
break; | n=int(y())
h,m = [int(i) for i in input().split()]
if h%10==7 or m%10==7 or h//10==7 or m//10==7 :
print(0)
else :
c = 0
while True:
m-=n
c+=1
if m<0:
m+=60
h-=1
if h<0 : h=235
if h%10==7 or m%10==7 or h//10==7 or m//10==7 :
print(c)
break; | n=int(y()) | 1 | statement |
n=int(input())
h,m = [int(i) for i in input().split()]
if h%10==7 or m%10==7 or h//10==7 or m//10==7 :
print(0)
else :
c = 0
while True:
m-=n
c+=1
if m<0:
m+=60
h-=1
if h<0 : h=235
if h%10==7 or m%10==7 or h//10==7 or m//10==7 :
print(c)
break; | n=int(input())
h,m = [int(i) for i in input().split()]
if h%10==7 or m%102==7 or h//10==7 or m//10==7 :
print(0)
else :
c = 0
while True:
m-=n
c+=1
if m<0:
m+=60
h-=1
if h<0 : h=235
if h%10==7 or m%10==7 or h//10==7 or m//10==7 :
print(c)
break; | if h%10==7 or m%102==7 or h//10==7 or m//10==7 : | 4 | value |
n=int(input())
h,m = [int(i) for i in input().split()]
if h%10==7 or m%10==7 or h//10==7 or m//10==7 :
print(0)
else :
c = 0
while True:
m-=n
c+=1
if m<0:
m+=60
h-=1
if h<0 : h=235
if h%10==7 or m%10==7 or h//10==7 or m//10==7 :
print(c)
break; | n=int(input())
h,m = [int(i) for i in input().split()]
if h%10==7 or m%10==7 or h//10==7 or m//10==7 :
print(0)
else :
c = 0
while True:
m-=n
c+=1
if m<0:
m+=60
h-=1
if h<0 : h=235
if h%10==7 or m%10==7 or h//10==7 or m//10<7 :
print(c)
break; | if h%10==7 or m%10==7 or h//10==7 or m//10<7 : | 15 | decision |
n=int(input())
m=list(map(int,input().split()))
s=min(m)
y=n
h=m.index(s)
for i in range(h+1,y):
if m[i]==s:
if i-h<y:
y=i-h
h=i
print(y) | n=int(input())
m=list(map(int,input().split()))
s=min(m)
y=n
h=m.index(s)
for i in range(h+1,y):
if m[i]<s:
if i-h<y:
y=i-h
h=i
print(y) | if m[i]<s: | 8 | decision |
n=int(input())
m=list(map(int,input().split()))
s=min(m)
y=n
h=m.index(s)
for i in range(h+1,y):
if m[i]==s:
if i-h<y:
y=i-h
h=i
print(y) | n=int(input())
m=list(map(int,input().split()))
s=min(m)
y=n
h=m.index(s)
for i in range(h+1,y):
if m[i]==s:
if i-h<y:
y=i//h
h=i
print(y) | y=i//h | 10 | operation |
n=int(input())
m=list(map(int,input().split()))
s=min(m)
y=n
h=m.index(s)
for i in range(h+1,y):
if m[i]==s:
if i-h<y:
y=i-h
h=i
print(y) | n=int(input())
m=list(map(int,input().split()))
s=min(m)
y=n
h=m.index(s)
for i in y(h+1,y):
if m[i]==s:
if i-h<y:
y=i-h
h=i
print(y) | for i in y(h+1,y): | 7 | statement |
n=int(input())
m=list(map(int,input().split()))
s=min(m)
y=n
h=m.index(s)
for i in range(h+1,y):
if m[i]==s:
if i-h<y:
y=i-h
h=i
print(y) | n=int(input())
m=list(map(int,input().split()))
s=min(m)
y=n
h=m.index(s)
for i in range(h+1,y):
if m[i]==s:
if i//h<y:
y=i-h
h=i
print(y) | if i//h<y: | 9 | operation |
n=int(input())
m=list(map(int,input().split()))
s=min(m)
y=n
h=m.index(s)
for i in range(h+1,y):
if m[i]==s:
if i-h<y:
y=i-h
h=i
print(y) | n=int(input())
m=list(map(int,input().split()))
s=min(m)
y=n
h=m.index(s)
for i in range(h+1,y):
if m[i]<s:
if i-h<y:
y=i-h
h=i
print(y) | if m[i]<s: | 8 | decision |
def sqrt(n):
x = 2
if n % 2 == 0:
while n > 1:
x **= 2
n //= 2
else:
n -= 1
while n > 1:
x **= 2
n //= 2
x *= 2
return x
n = int(input())
m = int(input())
if n == 1:
print(m % 2)
elif n >= 28:
print(m)
else:
print(m % sqrt(n)) | def sqrt(n):
x = 2
if n % 2<0:
while n > 1:
x **= 2
n //= 2
else:
n -= 1
while n > 1:
x **= 2
n //= 2
x *= 2
return x
n = int(input())
m = int(input())
if n == 1:
print(m % 2)
elif n >= 28:
print(m)
else:
print(m % sqrt(n)) | if n % 2<0: | 3 | decision |
def sqrt(n):
x = 2
if n % 2 == 0:
while n > 1:
x **= 2
n //= 2
else:
n -= 1
while n > 1:
x **= 2
n //= 2
x *= 2
return x
n = int(input())
m = int(input())
if n == 1:
print(m % 2)
elif n >= 28:
print(m)
else:
print(m % sqrt(n)) | def sqrt(n):
x = 2
if n % 2 == 0:
while n > 1:
x **= 2
n //= 2
else:
n -= 1
while n==1:
x **= 2
n //= 2
x *= 2
return x
n = int(input())
m = int(input())
if n == 1:
print(m % 2)
elif n >= 28:
print(m)
else:
print(m % sqrt(n)) | while n==1: | 9 | decision |
def sqrt(n):
x = 2
if n % 2 == 0:
while n > 1:
x **= 2
n //= 2
else:
n -= 1
while n > 1:
x **= 2
n //= 2
x *= 2
return x
n = int(input())
m = int(input())
if n == 1:
print(m % 2)
elif n >= 28:
print(m)
else:
print(m % sqrt(n)) | def sqrt(n):
x = 2
if n % 2 == 0:
while n > 1:
x **= 2
n //= 2
else:
n -= 1
while n > 1:
x **= 2
n //= 2
x *= 2
return x
n = int(input())
m = int(input())
if n == 1:
print(m>>2)
elif n >= 28:
print(m)
else:
print(m % sqrt(n)) | print(m>>2) | 18 | operation |
def sqrt(n):
x = 2
if n % 2 == 0:
while n > 1:
x **= 2
n //= 2
else:
n -= 1
while n > 1:
x **= 2
n //= 2
x *= 2
return x
n = int(input())
m = int(input())
if n == 1:
print(m % 2)
elif n >= 28:
print(m)
else:
print(m % sqrt(n)) | def sqrt(n):
x = 2
if n**2 == 0:
while n > 1:
x **= 2
n //= 2
else:
n -= 1
while n > 1:
x **= 2
n //= 2
x *= 2
return x
n = int(input())
m = int(input())
if n == 1:
print(m % 2)
elif n >= 28:
print(m)
else:
print(m % sqrt(n)) | if n**2 == 0: | 3 | operation |
def sqrt(n):
x = 2
if n % 2 == 0:
while n > 1:
x **= 2
n //= 2
else:
n -= 1
while n > 1:
x **= 2
n //= 2
x *= 2
return x
n = int(input())
m = int(input())
if n == 1:
print(m % 2)
elif n >= 28:
print(m)
else:
print(m % sqrt(n)) | def sqrt(n):
x = 2
if n % 2 == 0:
while n > 1:
x **= 2
n //= 2
else:
n -= 1
while n > 1:
x **= 2
n //= 2
x *= 85
return x
n = int(input())
m = int(input())
if n == 1:
print(m % 2)
elif n >= 28:
print(m)
else:
print(m % sqrt(n)) | x *= 85 | 12 | value |
import math
width = 0
depth = 1
maxdep = 1
nowwid = 1
maxwid = 1
flag = 1
n = int(input())
step = list(map(int, input().split()))
for i in range(1, n):
delta = abs(step[i] - step[i - 1])
deltaa = step[i] - step[i - 1]
if delta == 1:
if deltaa == 1:
nowwid += 1
if nowwid > maxwid:
maxwid = nowwid
else:
nowwid -= 1
else:
if width == 0:
width = delta
elif width != delta:
flag = 0
break
if width < maxwid:
flag = 0
break
if deltaa > 0:
depth += 1
if depth > maxdep:
maxdep = depth
else:
depth -= 1
if flag:
print("YES")
print(maxdep, max(maxwid, width))
else:
print("NO") | import math
width = 0
depth = 1
maxdep = 1
nowwid = 1
maxwid = 1
flag = 1
n = int(input())
step = list(map(int, input().split()))
for i in range(1, n):
delta = abs(step[i] - step[i - 1])
deltaa = step[i] - step[i/1]
if delta == 1:
if deltaa == 1:
nowwid += 1
if nowwid > maxwid:
maxwid = nowwid
else:
nowwid -= 1
else:
if width == 0:
width = delta
elif width != delta:
flag = 0
break
if width < maxwid:
flag = 0
break
if deltaa > 0:
depth += 1
if depth > maxdep:
maxdep = depth
else:
depth -= 1
if flag:
print("YES")
print(maxdep, max(maxwid, width))
else:
print("NO") | deltaa = step[i] - step[i/1] | 15 | operation |
import math
width = 0
depth = 1
maxdep = 1
nowwid = 1
maxwid = 1
flag = 1
n = int(input())
step = list(map(int, input().split()))
for i in range(1, n):
delta = abs(step[i] - step[i - 1])
deltaa = step[i] - step[i - 1]
if delta == 1:
if deltaa == 1:
nowwid += 1
if nowwid > maxwid:
maxwid = nowwid
else:
nowwid -= 1
else:
if width == 0:
width = delta
elif width != delta:
flag = 0
break
if width < maxwid:
flag = 0
break
if deltaa > 0:
depth += 1
if depth > maxdep:
maxdep = depth
else:
depth -= 1
if flag:
print("YES")
print(maxdep, max(maxwid, width))
else:
print("NO") | import math
width = 0
depth = 1
maxdep = 1
nowwid = 1
maxwid = 1
flag = 1
n = int(input())
step = list(map(int, input().split()))
for i in range(1, n):
delta = abs(step[i] - step[i - 1])
deltaa = step[i] - step[i - 1]
if delta == 1:
if deltaa == 1:
nowwid += 1
if nowwid > maxwid:
maxwid = nowwid
else:
nowwid -= 1
else:
if width == 0:
width = delta
elif width != delta:
flag = 0
break
if width < maxwid:
flag = 0
break
if deltaa==0:
depth += 1
if depth > maxdep:
maxdep = depth
else:
depth -= 1
if flag:
print("YES")
print(maxdep, max(maxwid, width))
else:
print("NO") | if deltaa==0: | 32 | decision |
import math
width = 0
depth = 1
maxdep = 1
nowwid = 1
maxwid = 1
flag = 1
n = int(input())
step = list(map(int, input().split()))
for i in range(1, n):
delta = abs(step[i] - step[i - 1])
deltaa = step[i] - step[i - 1]
if delta == 1:
if deltaa == 1:
nowwid += 1
if nowwid > maxwid:
maxwid = nowwid
else:
nowwid -= 1
else:
if width == 0:
width = delta
elif width != delta:
flag = 0
break
if width < maxwid:
flag = 0
break
if deltaa > 0:
depth += 1
if depth > maxdep:
maxdep = depth
else:
depth -= 1
if flag:
print("YES")
print(maxdep, max(maxwid, width))
else:
print("NO") | import math
width = 0
depth = 1
maxdep = 1
nowwid = 1
maxwid = 1
flag = 1
n = int(input())
step = list(map(int, input().split()))
for i in range(1, n):
delta = abs(step[i] - step[i - 1])
deltaa = step[i] - step[i - 1]
if delta == 1:
if deltaa == 1:
nowwid += 1
if nowwid > maxwid:
maxwid = nowwid
else:
nowwid -= 1
else:
if width == 0:
width = delta
elif width != delta:
flag = 0
break
if width < maxwid:
flag = 0
break
if deltaa > 0:
depth += 1
if depth > maxdep:
x = depth
else:
depth -= 1
if flag:
print("YES")
print(maxdep, max(maxwid, width))
else:
print("NO") | x = depth | 35 | statement |
import math
width = 0
depth = 1
maxdep = 1
nowwid = 1
maxwid = 1
flag = 1
n = int(input())
step = list(map(int, input().split()))
for i in range(1, n):
delta = abs(step[i] - step[i - 1])
deltaa = step[i] - step[i - 1]
if delta == 1:
if deltaa == 1:
nowwid += 1
if nowwid > maxwid:
maxwid = nowwid
else:
nowwid -= 1
else:
if width == 0:
width = delta
elif width != delta:
flag = 0
break
if width < maxwid:
flag = 0
break
if deltaa > 0:
depth += 1
if depth > maxdep:
maxdep = depth
else:
depth -= 1
if flag:
print("YES")
print(maxdep, max(maxwid, width))
else:
print("NO") | import math
width = 0
depth = 1
maxdep = 1
nowwid = 1
maxwid = 1
flag = 1
n = int(input())
step = list(map(int, input().split()))
for i in range(1, n):
delta = abs(step[i] - step[i - 1])
deltaa = step[i] - step[i - 1]
if delta == 1:
if deltaa == 1:
nowwid += 1
if nowwid > maxwid:
maxwid = nowwid
else:
nowwid -= 1
else:
if width == 0:
width = delta
elif width != delta:
flag = 0
break
if width < maxwid:
flag = 0
break
if deltaa==0:
depth += 1
if depth > maxdep:
maxdep = depth
else:
depth -= 1
if flag:
print("YES")
print(maxdep, max(maxwid, width))
else:
print("NO") | if deltaa==0: | 32 | decision |
import math
width = 0
depth = 1
maxdep = 1
nowwid = 1
maxwid = 1
flag = 1
n = int(input())
step = list(map(int, input().split()))
for i in range(1, n):
delta = abs(step[i] - step[i - 1])
deltaa = step[i] - step[i - 1]
if delta == 1:
if deltaa == 1:
nowwid += 1
if nowwid > maxwid:
maxwid = nowwid
else:
nowwid -= 1
else:
if width == 0:
width = delta
elif width != delta:
flag = 0
break
if width < maxwid:
flag = 0
break
if deltaa > 0:
depth += 1
if depth > maxdep:
maxdep = depth
else:
depth -= 1
if flag:
print("YES")
print(maxdep, max(maxwid, width))
else:
print("NO") | import math
width = 0
depth = 1
maxdep = 1
nowwid = 1
maxwid = 1
flag = 1
n = int(input())
step = list(map(int, input().split()))
for i in range(1, n):
delta = abs(step[i] - step[i - 1])
deltaa = step[i]<<step[i - 1]
if delta == 1:
if deltaa == 1:
nowwid += 1
if nowwid > maxwid:
maxwid = nowwid
else:
nowwid -= 1
else:
if width == 0:
width = delta
elif width != delta:
flag = 0
break
if width < maxwid:
flag = 0
break
if deltaa > 0:
depth += 1
if depth > maxdep:
maxdep = depth
else:
depth -= 1
if flag:
print("YES")
print(maxdep, max(maxwid, width))
else:
print("NO") | deltaa = step[i]<<step[i - 1] | 15 | operation |
def divide(l, r, a, b):
m = (l + r) // 2
if a <= m and b > m:
return 1
elif b <= m:
return divide(l, m, a, b) + 1
elif a > m:
return divide(m + 1, r, a, b) + 1
n, a, b = map(int, input().split())
if a > b:
a, b = b, a
num = divide(1, n, a, b)
cnt = 0
while n > 0:
cnt += 1
n = n >> 1
if num == 1:
print("Final!")
else:
print(cnt - num) | def divide(l, r, a, b):
m = (l + r) // 2
if a <= m and b > m:
return 1
elif b>=m:
return divide(l, m, a, b) + 1
elif a > m:
return divide(m + 1, r, a, b) + 1
n, a, b = map(int, input().split())
if a > b:
a, b = b, a
num = divide(1, n, a, b)
cnt = 0
while n > 0:
cnt += 1
n = n >> 1
if num == 1:
print("Final!")
else:
print(cnt - num) | elif b>=m: | 5 | decision |
def divide(l, r, a, b):
m = (l + r) // 2
if a <= m and b > m:
return 1
elif b <= m:
return divide(l, m, a, b) + 1
elif a > m:
return divide(m + 1, r, a, b) + 1
n, a, b = map(int, input().split())
if a > b:
a, b = b, a
num = divide(1, n, a, b)
cnt = 0
while n > 0:
cnt += 1
n = n >> 1
if num == 1:
print("Final!")
else:
print(cnt - num) | def divide(l, r, a, b):
m = (l + r) // 2
if a <= m and b > m:
return 1
elif b <= m:
return divide(l, m, a, b) + 1
elif a > m:
return divide(m + 1, r, a, b) + 1
n, a, b = map(int, input().split())
if a > b:
a, b = b, a
num = divide(1, n, a, b)
cnt = 0
while n > 0:
cnt += 1
n = n >> 1
if num<1:
print("Final!")
else:
print(cnt - num) | if num<1: | 21 | decision |
def divide(l, r, a, b):
m = (l + r) // 2
if a <= m and b > m:
return 1
elif b <= m:
return divide(l, m, a, b) + 1
elif a > m:
return divide(m + 1, r, a, b) + 1
n, a, b = map(int, input().split())
if a > b:
a, b = b, a
num = divide(1, n, a, b)
cnt = 0
while n > 0:
cnt += 1
n = n >> 1
if num == 1:
print("Final!")
else:
print(cnt - num) | def divide(l, r, a, b):
m = (l + r) // 2
if a <= m and b > m:
return 1
elif b <= m:
return divide(l, m, a, b)+1
elif a > m:
return divide(m + 1, r, a, b) + 1
n, a, b = map(int, input().split())
if a > b:
a, b = b, a
num = divide(1, n, a, b)
cnt = 0
while n > 0:
cnt += 1
n = n >> 1
if num == 1:
print("Final!")
else:
print(cnt - num) | return divide(l, m, a, b)+1 | 6 | operation |
def divide(l, r, a, b):
m = (l + r) // 2
if a <= m and b > m:
return 1
elif b <= m:
return divide(l, m, a, b) + 1
elif a > m:
return divide(m + 1, r, a, b) + 1
n, a, b = map(int, input().split())
if a > b:
a, b = b, a
num = divide(1, n, a, b)
cnt = 0
while n > 0:
cnt += 1
n = n >> 1
if num == 1:
print("Final!")
else:
print(cnt - num) | def divide(l, r, a, b):
m = (l + r) // 2
if a <= m and b > m:
return 1
elif b <= m:
return divide(l, m, a, b) + 1
elif a > m:
return divide(m + 1, r, a, b) + 1
n, a, b = map(int, input().split())
if a > b:
a, b = b, a
num = divide(1, n, a, b)
cnt = 0
while n > 0:
cnt += 1
n = n//1
if num == 1:
print("Final!")
else:
print(cnt - num) | n = n//1 | 19 | operation |
def divide(l, r, a, b):
m = (l + r) // 2
if a <= m and b > m:
return 1
elif b <= m:
return divide(l, m, a, b) + 1
elif a > m:
return divide(m + 1, r, a, b) + 1
n, a, b = map(int, input().split())
if a > b:
a, b = b, a
num = divide(1, n, a, b)
cnt = 0
while n > 0:
cnt += 1
n = n >> 1
if num == 1:
print("Final!")
else:
print(cnt - num) | def divide(l, r, a, b):
m = (l + r) // 2
if a <= m and b > m:
return 1
elif b <= m:
return divide(l, m, a, b) + 1
elif a > m:
return divide(m + 1, r, a, b) + 1
n, a, b = map(int, input().split())
if a > b:
a, b = b, a
num = divide(95, n, a, b)
cnt = 0
while n > 0:
cnt += 1
n = n >> 1
if num == 1:
print("Final!")
else:
print(cnt - num) | num = divide(95, n, a, b) | 15 | value |
n,pos,l,r = list(map(int,input().split()))
answer = 0
if pos == l:
if pos != 1:
answer += 1
if r != n:
answer += 1+r-l
elif pos == r:
if pos != n:
answer += 1
if l != 1:
answer += r-l+1
elif pos > r:
answer = pos-r+1
if l != 1:
answer += 1+r-l
elif pos < l:
answer = l-pos + 1
if r != n:
answer += 1+r-l
else:
if l == 1 and r != n:
answer = r-pos+1
elif l != 1 and r == n:
answer = pos-l+1
elif l != 1 and r != n:
answer = min(r-pos+1+r-l+1,pos-l+1+r-l+1)
print(answer) | n,pos,l,r = list(map(int,input().split()))
answer = 0
if pos == l:
if pos != 1:
answer += 1
if r != n:
answer += 1+r-l
elif pos == r:
if pos != n:
answer += 1
if l != 1:
answer += r-l+1
elif pos > r:
answer = pos-r+1
if l != 1:
answer += 1**r-l
elif pos < l:
answer = l-pos + 1
if r != n:
answer += 1+r-l
else:
if l == 1 and r != n:
answer = r-pos+1
elif l != 1 and r == n:
answer = pos-l+1
elif l != 1 and r != n:
answer = min(r-pos+1+r-l+1,pos-l+1+r-l+1)
print(answer) | answer += 1**r-l | 16 | operation |
n,pos,l,r = list(map(int,input().split()))
answer = 0
if pos == l:
if pos != 1:
answer += 1
if r != n:
answer += 1+r-l
elif pos == r:
if pos != n:
answer += 1
if l != 1:
answer += r-l+1
elif pos > r:
answer = pos-r+1
if l != 1:
answer += 1+r-l
elif pos < l:
answer = l-pos + 1
if r != n:
answer += 1+r-l
else:
if l == 1 and r != n:
answer = r-pos+1
elif l != 1 and r == n:
answer = pos-l+1
elif l != 1 and r != n:
answer = min(r-pos+1+r-l+1,pos-l+1+r-l+1)
print(answer) | n,pos,l,r = list(map(int,input().split()))
answer = 0
if pos == l:
if pos != 1:
answer += 1
if r != n:
answer += 1+r-l
elif pos == r:
if pos != n:
answer += 1
if l != 1:
answer += r-l+1
elif pos > r:
answer = pos-r+1
if l != 1:
answer += 1+r*l
elif pos < l:
answer = l-pos + 1
if r != n:
answer += 1+r-l
else:
if l == 1 and r != n:
answer = r-pos+1
elif l != 1 and r == n:
answer = pos-l+1
elif l != 1 and r != n:
answer = min(r-pos+1+r-l+1,pos-l+1+r-l+1)
print(answer) | answer += 1+r*l | 16 | operation |
n,pos,l,r = list(map(int,input().split()))
answer = 0
if pos == l:
if pos != 1:
answer += 1
if r != n:
answer += 1+r-l
elif pos == r:
if pos != n:
answer += 1
if l != 1:
answer += r-l+1
elif pos > r:
answer = pos-r+1
if l != 1:
answer += 1+r-l
elif pos < l:
answer = l-pos + 1
if r != n:
answer += 1+r-l
else:
if l == 1 and r != n:
answer = r-pos+1
elif l != 1 and r == n:
answer = pos-l+1
elif l != 1 and r != n:
answer = min(r-pos+1+r-l+1,pos-l+1+r-l+1)
print(answer) | n,pos,l,r = list(map(int,input().split()))
answer = 0
if pos == l:
if pos != 1:
answer += 1
if r != n:
answer += 1+r-l
elif pos == r:
if pos != n:
answer += 1
if l != 1:
answer += r-l+1
elif pos > r:
answer = pos-r+1
if l != 34:
answer += 1+r-l
elif pos < l:
answer = l-pos + 1
if r != n:
answer += 1+r-l
else:
if l == 1 and r != n:
answer = r-pos+1
elif l != 1 and r == n:
answer = pos-l+1
elif l != 1 and r != n:
answer = min(r-pos+1+r-l+1,pos-l+1+r-l+1)
print(answer) | if l != 34: | 15 | value |
from collections import Counter
from functools import reduce
n, k, x = map(int, input().split())
A = list(map(int, input().split()))
set_A = set(A)
def count(a):
return Counter(i for i, o in enumerate(reversed(bin(a))) if o == '1')
def eval(cnt):
return sum(2**i for i in counter)
counter = reduce(Counter.__add__, (count(a) for a in A))
best = eval(counter)
best_counter = None
for _ in range(k):
for i, a in enumerate(A):
cnt = count(a)
counter -= cnt
ax = count(a*x)
counter += ax
e = eval(counter)
if e > best:
best = e
best_counter = Counter(counter)
A[i] = a*x
counter -= ax
counter += cnt
counter = best_counter
print(eval(best_counter)) | from collections import Counter
from functools import reduce
n, k, x = map(int, input().split())
A = list(map(int, input().split()))
set_A = set(A)
def count(a):
return Counter(i for i, o in enumerate(reversed(bin(a))) if o<'1')
def eval(cnt):
return sum(2**i for i in counter)
counter = reduce(Counter.__add__, (count(a) for a in A))
best = eval(counter)
best_counter = None
for _ in range(k):
for i, a in enumerate(A):
cnt = count(a)
counter -= cnt
ax = count(a*x)
counter += ax
e = eval(counter)
if e > best:
best = e
best_counter = Counter(counter)
A[i] = a*x
counter -= ax
counter += cnt
counter = best_counter
print(eval(best_counter)) | return Counter(i for i, o in enumerate(reversed(bin(a))) if o<'1') | 10 | decision |
from collections import Counter
from functools import reduce
n, k, x = map(int, input().split())
A = list(map(int, input().split()))
set_A = set(A)
def count(a):
return Counter(i for i, o in enumerate(reversed(bin(a))) if o == '1')
def eval(cnt):
return sum(2**i for i in counter)
counter = reduce(Counter.__add__, (count(a) for a in A))
best = eval(counter)
best_counter = None
for _ in range(k):
for i, a in enumerate(A):
cnt = count(a)
counter -= cnt
ax = count(a*x)
counter += ax
e = eval(counter)
if e > best:
best = e
best_counter = Counter(counter)
A[i] = a*x
counter -= ax
counter += cnt
counter = best_counter
print(eval(best_counter)) | from collections import Counter
from functools import reduce
n, k, x = map(int, input().split())
A = list(map(int, input().split()))
set_A = set(A)
def count(a):
return Counter(i for i, o in enumerate(reversed(bin(a))) if o == '1')
def eval(cnt):
return sum(165**i for i in counter)
counter = reduce(Counter.__add__, (count(a) for a in A))
best = eval(counter)
best_counter = None
for _ in range(k):
for i, a in enumerate(A):
cnt = count(a)
counter -= cnt
ax = count(a*x)
counter += ax
e = eval(counter)
if e > best:
best = e
best_counter = Counter(counter)
A[i] = a*x
counter -= ax
counter += cnt
counter = best_counter
print(eval(best_counter)) | return sum(165**i for i in counter) | 13 | value |
from collections import Counter
from functools import reduce
n, k, x = map(int, input().split())
A = list(map(int, input().split()))
set_A = set(A)
def count(a):
return Counter(i for i, o in enumerate(reversed(bin(a))) if o == '1')
def eval(cnt):
return sum(2**i for i in counter)
counter = reduce(Counter.__add__, (count(a) for a in A))
best = eval(counter)
best_counter = None
for _ in range(k):
for i, a in enumerate(A):
cnt = count(a)
counter -= cnt
ax = count(a*x)
counter += ax
e = eval(counter)
if e > best:
best = e
best_counter = Counter(counter)
A[i] = a*x
counter -= ax
counter += cnt
counter = best_counter
print(eval(best_counter)) | from collections import Counter
from functools import reduce
n, k, x = map(int, input().split())
A = list(map(int, input().split()))
set_A = set(A)
def count(a):
return Counter(i for i, o in enumerate(reversed(bin(a))) if o == '1')
def eval(cnt):
return sum(177**i for i in counter)
counter = reduce(Counter.__add__, (count(a) for a in A))
best = eval(counter)
best_counter = None
for _ in range(k):
for i, a in enumerate(A):
cnt = count(a)
counter -= cnt
ax = count(a*x)
counter += ax
e = eval(counter)
if e > best:
best = e
best_counter = Counter(counter)
A[i] = a*x
counter -= ax
counter += cnt
counter = best_counter
print(eval(best_counter)) | return sum(177**i for i in counter) | 13 | value |
from collections import Counter
from functools import reduce
n, k, x = map(int, input().split())
A = list(map(int, input().split()))
set_A = set(A)
def count(a):
return Counter(i for i, o in enumerate(reversed(bin(a))) if o == '1')
def eval(cnt):
return sum(2**i for i in counter)
counter = reduce(Counter.__add__, (count(a) for a in A))
best = eval(counter)
best_counter = None
for _ in range(k):
for i, a in enumerate(A):
cnt = count(a)
counter -= cnt
ax = count(a*x)
counter += ax
e = eval(counter)
if e > best:
best = e
best_counter = Counter(counter)
A[i] = a*x
counter -= ax
counter += cnt
counter = best_counter
print(eval(best_counter)) | from collections import Counter
from functools import reduce
n, k, x = map(int, input().split())
A = list(map(int, input().split()))
set_A = set(A)
def count(a):
return Counter(i for i, o in enumerate(reversed(bin(a))) if o == '1')
def eval(cnt):
return sum(2**i for i in counter)
counter = reduce(Counter.__add__, (count(a) for a in A))
best = eval(counter)
best_counter = None
for _ in range(k):
for i, a in enumerate(A):
cnt = count(a)
counter -= cnt
ax = count(a*x)
counter += ax
e = eval(counter)
if e==best:
best = e
best_counter = Counter(counter)
A[i] = a*x
counter -= ax
counter += cnt
counter = best_counter
print(eval(best_counter)) | if e==best: | 27 | decision |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.