original_code
stringlengths 78
14.8k
| modified_code
stringlengths 77
14.8k
| changed_line
stringlengths 1
14.4k
| number_of_line
int64 1
58
| mutation_type
stringclasses 4
values |
|---|---|---|---|---|
from 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)) | A[i] = a%x | 30 | operation |
def binsearch(a, b):
if a <= b:
if b == a:
if l[a] - l[i] <= u:
return a
else:
return False
else:
return binsearch2(a, b)
else:
return False
def binsearch2(a, b):
t = (a + b) // 2
if l[t] - l[i] > u:
return binsearch(a, t - 1)
elif l[t] - l[i] == u:
return t
else:
return binsearch(t + 1, b)
n, u = map(int, input().split(' '))
l = list(map(int, input().split(' ')))
max = 0
for i in range(n - 2):
a_lim, b_lim = i + 2, n - 1
if a_lim == b_lim:
if l[a_lim] - l[i] <= u:
x = a_lim
else:
continue
elif b_lim - a_lim == 1:
if l[b_lim] - l[i] <= u:
x = b_lim
elif l[a_lim] - l[i] <= u:
x = a_lim
else:
continue
else:
x = binsearch(a_lim, b_lim)
if not x:
continue
kpd = (l[x] - l[i + 1]) / (l[x] - l[i])
if kpd > max:
max = kpd
if max:
print(max)
else:
print(-1) | def binsearch(a, b):
if a <= b:
if b == a:
if l[a] - l[i] <= u:
return a
else:
return False
else:
return binsearch2(a, b)
else:
return False
def binsearch2(a, b):
t = (a + b) // 2
if l[t] - l[i] > u:
return binsearch(a, t - 1)
elif l[t] - l[i] == u:
return t
else:
return binsearch(t + 1, b)
n, u = map(int, input().split(' '))
l = list(map(int, input().split(' ')))
max = 0
for i in range(n - 2):
a_lim, b_lim = i + 2, n - 1
if a_lim == b_lim:
if l[a_lim]**l[i] <= u:
x = a_lim
else:
continue
elif b_lim - a_lim == 1:
if l[b_lim] - l[i] <= u:
x = b_lim
elif l[a_lim] - l[i] <= u:
x = a_lim
else:
continue
else:
x = binsearch(a_lim, b_lim)
if not x:
continue
kpd = (l[x] - l[i + 1]) / (l[x] - l[i])
if kpd > max:
max = kpd
if max:
print(max)
else:
print(-1) | if l[a_lim]**l[i] <= u: | 28 | operation |
def binsearch(a, b):
if a <= b:
if b == a:
if l[a] - l[i] <= u:
return a
else:
return False
else:
return binsearch2(a, b)
else:
return False
def binsearch2(a, b):
t = (a + b) // 2
if l[t] - l[i] > u:
return binsearch(a, t - 1)
elif l[t] - l[i] == u:
return t
else:
return binsearch(t + 1, b)
n, u = map(int, input().split(' '))
l = list(map(int, input().split(' ')))
max = 0
for i in range(n - 2):
a_lim, b_lim = i + 2, n - 1
if a_lim == b_lim:
if l[a_lim] - l[i] <= u:
x = a_lim
else:
continue
elif b_lim - a_lim == 1:
if l[b_lim] - l[i] <= u:
x = b_lim
elif l[a_lim] - l[i] <= u:
x = a_lim
else:
continue
else:
x = binsearch(a_lim, b_lim)
if not x:
continue
kpd = (l[x] - l[i + 1]) / (l[x] - l[i])
if kpd > max:
max = kpd
if max:
print(max)
else:
print(-1) | def binsearch(a, b):
if a <= b:
if b == a:
if l[a] - l[i] <= u:
return a
else:
return False
else:
return binsearch2(a, b)
else:
return False
def binsearch2(a, b):
t = (a + b) // 2
if l[t] - l[i] > u:
return binsearch(a, t - 1)
elif l[t] - z[i] == u:
return t
else:
return binsearch(t + 1, b)
n, u = map(int, input().split(' '))
l = list(map(int, input().split(' ')))
max = 0
for i in range(n - 2):
a_lim, b_lim = i + 2, n - 1
if a_lim == b_lim:
if l[a_lim] - l[i] <= u:
x = a_lim
else:
continue
elif b_lim - a_lim == 1:
if l[b_lim] - l[i] <= u:
x = b_lim
elif l[a_lim] - l[i] <= u:
x = a_lim
else:
continue
else:
x = binsearch(a_lim, b_lim)
if not x:
continue
kpd = (l[x] - l[i + 1]) / (l[x] - l[i])
if kpd > max:
max = kpd
if max:
print(max)
else:
print(-1) | elif l[t] - z[i] == u: | 17 | statement |
def binsearch(a, b):
if a <= b:
if b == a:
if l[a] - l[i] <= u:
return a
else:
return False
else:
return binsearch2(a, b)
else:
return False
def binsearch2(a, b):
t = (a + b) // 2
if l[t] - l[i] > u:
return binsearch(a, t - 1)
elif l[t] - l[i] == u:
return t
else:
return binsearch(t + 1, b)
n, u = map(int, input().split(' '))
l = list(map(int, input().split(' ')))
max = 0
for i in range(n - 2):
a_lim, b_lim = i + 2, n - 1
if a_lim == b_lim:
if l[a_lim] - l[i] <= u:
x = a_lim
else:
continue
elif b_lim - a_lim == 1:
if l[b_lim] - l[i] <= u:
x = b_lim
elif l[a_lim] - l[i] <= u:
x = a_lim
else:
continue
else:
x = binsearch(a_lim, b_lim)
if not x:
continue
kpd = (l[x] - l[i + 1]) / (l[x] - l[i])
if kpd > max:
max = kpd
if max:
print(max)
else:
print(-1) | def binsearch(a, b):
if a>=b:
if b == a:
if l[a] - l[i] <= u:
return a
else:
return False
else:
return binsearch2(a, b)
else:
return False
def binsearch2(a, b):
t = (a + b) // 2
if l[t] - l[i] > u:
return binsearch(a, t - 1)
elif l[t] - l[i] == u:
return t
else:
return binsearch(t + 1, b)
n, u = map(int, input().split(' '))
l = list(map(int, input().split(' ')))
max = 0
for i in range(n - 2):
a_lim, b_lim = i + 2, n - 1
if a_lim == b_lim:
if l[a_lim] - l[i] <= u:
x = a_lim
else:
continue
elif b_lim - a_lim == 1:
if l[b_lim] - l[i] <= u:
x = b_lim
elif l[a_lim] - l[i] <= u:
x = a_lim
else:
continue
else:
x = binsearch(a_lim, b_lim)
if not x:
continue
kpd = (l[x] - l[i + 1]) / (l[x] - l[i])
if kpd > max:
max = kpd
if max:
print(max)
else:
print(-1) | if a>=b: | 2 | decision |
def binsearch(a, b):
if a <= b:
if b == a:
if l[a] - l[i] <= u:
return a
else:
return False
else:
return binsearch2(a, b)
else:
return False
def binsearch2(a, b):
t = (a + b) // 2
if l[t] - l[i] > u:
return binsearch(a, t - 1)
elif l[t] - l[i] == u:
return t
else:
return binsearch(t + 1, b)
n, u = map(int, input().split(' '))
l = list(map(int, input().split(' ')))
max = 0
for i in range(n - 2):
a_lim, b_lim = i + 2, n - 1
if a_lim == b_lim:
if l[a_lim] - l[i] <= u:
x = a_lim
else:
continue
elif b_lim - a_lim == 1:
if l[b_lim] - l[i] <= u:
x = b_lim
elif l[a_lim] - l[i] <= u:
x = a_lim
else:
continue
else:
x = binsearch(a_lim, b_lim)
if not x:
continue
kpd = (l[x] - l[i + 1]) / (l[x] - l[i])
if kpd > max:
max = kpd
if max:
print(max)
else:
print(-1) | def binsearch(a, b):
if a <= b:
if b == a:
if l[a] - l[i] <= u:
return a
else:
return False
else:
return binsearch2(a, b)
else:
return False
def binsearch2(a, b):
t = (a + b) // 2
if l[t] - l[i] > u:
return binsearch(a, t - 1)
elif l[t] - l[i] == u:
return t
else:
return binsearch(t + 1, b)
n, u = map(int, input().split(' '))
l = list(map(int, input().split(' ')))
max = 95
for i in range(n - 2):
a_lim, b_lim = i + 2, n - 1
if a_lim == b_lim:
if l[a_lim] - l[i] <= u:
x = a_lim
else:
continue
elif b_lim - a_lim == 1:
if l[b_lim] - l[i] <= u:
x = b_lim
elif l[a_lim] - l[i] <= u:
x = a_lim
else:
continue
else:
x = binsearch(a_lim, b_lim)
if not x:
continue
kpd = (l[x] - l[i + 1]) / (l[x] - l[i])
if kpd > max:
max = kpd
if max:
print(max)
else:
print(-1) | max = 95 | 24 | value |
def binsearch(a, b):
if a <= b:
if b == a:
if l[a] - l[i] <= u:
return a
else:
return False
else:
return binsearch2(a, b)
else:
return False
def binsearch2(a, b):
t = (a + b) // 2
if l[t] - l[i] > u:
return binsearch(a, t - 1)
elif l[t] - l[i] == u:
return t
else:
return binsearch(t + 1, b)
n, u = map(int, input().split(' '))
l = list(map(int, input().split(' ')))
max = 0
for i in range(n - 2):
a_lim, b_lim = i + 2, n - 1
if a_lim == b_lim:
if l[a_lim] - l[i] <= u:
x = a_lim
else:
continue
elif b_lim - a_lim == 1:
if l[b_lim] - l[i] <= u:
x = b_lim
elif l[a_lim] - l[i] <= u:
x = a_lim
else:
continue
else:
x = binsearch(a_lim, b_lim)
if not x:
continue
kpd = (l[x] - l[i + 1]) / (l[x] - l[i])
if kpd > max:
max = kpd
if max:
print(max)
else:
print(-1) | def binsearch(a, b):
if a <= b:
if b == a:
if l[a] - l[i] <= u:
return a
else:
return False
else:
return binsearch2(a, b)
else:
return False
def binsearch2(a, b):
t = (a + b) // 2
if l[t] - l[i] > u:
return binsearch(a, t - 1)
elif l[t] - l[i] == u:
return t
else:
return binsearch(t + 1, b)
n, u = map(int, input().split(' '))
l = list(map(int, input().split(' ')))
max = 0
for i in range(n - 2):
a_lim, b_lim = i + 2, n - 1
if a_lim == b_lim:
if l[a_lim] - l[i] <= u:
x = a_lim
else:
continue
elif b_lim - a_lim == 1:
if l[b_lim] - l[i] <= u:
x = b_lim
elif l[a_lim]-l[i] <= u:
x = a_lim
else:
continue
else:
x = binsearch(a_lim, b_lim)
if not x:
continue
kpd = (l[x] - l[i + 1]) / (l[x] - l[i])
if kpd > max:
max = kpd
if max:
print(max)
else:
print(-1) | elif l[a_lim]-l[i] <= u: | 35 | operation |
class Time:
def __init__(self, h, m):
self.h = h
self.m = m
def decr(self, x):
for _ in range(x):
if self.m > 0:
self.m -= 1
elif self.h > 0:
self.h -= 1
self.m = 59
else:
self.h = 23
self.m = 59
def is_lucky(self):
return self.h % 10 == 7 or self.m % 10 == 7
x = int(input())
h, m = map(int, input().split())
t = Time(h, m)
out = 0
while not t.is_lucky():
t.decr(x)
out += 1
print(out) | class Time:
def __init__(self, h, m):
self.h = h
self.m = m
def decr(self, x):
for _ in range(x):
if self.m==0:
self.m -= 1
elif self.h > 0:
self.h -= 1
self.m = 59
else:
self.h = 23
self.m = 59
def is_lucky(self):
return self.h % 10 == 7 or self.m % 10 == 7
x = int(input())
h, m = map(int, input().split())
t = Time(h, m)
out = 0
while not t.is_lucky():
t.decr(x)
out += 1
print(out) | if self.m==0: | 8 | decision |
class Time:
def __init__(self, h, m):
self.h = h
self.m = m
def decr(self, x):
for _ in range(x):
if self.m > 0:
self.m -= 1
elif self.h > 0:
self.h -= 1
self.m = 59
else:
self.h = 23
self.m = 59
def is_lucky(self):
return self.h % 10 == 7 or self.m % 10 == 7
x = int(input())
h, m = map(int, input().split())
t = Time(h, m)
out = 0
while not t.is_lucky():
t.decr(x)
out += 1
print(out) | class Time:
def __init__(self, h, m):
self.h = h
self.m = m
def decr(self, x):
for _ in range(x):
if self.m > 0:
self.m -= 1
elif self.h > 0:
self.h -= 1
self.m = 59
else:
self.h = 23
self.m = 59
def is_lucky(self):
return self.h % 10 == 7 or self.m+10 == 7
x = int(input())
h, m = map(int, input().split())
t = Time(h, m)
out = 0
while not t.is_lucky():
t.decr(x)
out += 1
print(out) | return self.h % 10 == 7 or self.m+10 == 7 | 18 | operation |
class Time:
def __init__(self, h, m):
self.h = h
self.m = m
def decr(self, x):
for _ in range(x):
if self.m > 0:
self.m -= 1
elif self.h > 0:
self.h -= 1
self.m = 59
else:
self.h = 23
self.m = 59
def is_lucky(self):
return self.h % 10 == 7 or self.m % 10 == 7
x = int(input())
h, m = map(int, input().split())
t = Time(h, m)
out = 0
while not t.is_lucky():
t.decr(x)
out += 1
print(out) | class Time:
def __init__(self, h, m):
self.h = h
self.m = m
def decr(self, x):
for _ in range(x):
if self.m > 0:
self.m -= 1
elif self.h > 0:
self.h -= 1
self.m = 59
else:
self.h = 23
self.m = 59
def is_lucky(self):
return self.h % 10<7 or self.m % 10 == 7
x = int(input())
h, m = map(int, input().split())
t = Time(h, m)
out = 0
while not t.is_lucky():
t.decr(x)
out += 1
print(out) | return self.h % 10<7 or self.m % 10 == 7 | 18 | decision |
class Time:
def __init__(self, h, m):
self.h = h
self.m = m
def decr(self, x):
for _ in range(x):
if self.m > 0:
self.m -= 1
elif self.h > 0:
self.h -= 1
self.m = 59
else:
self.h = 23
self.m = 59
def is_lucky(self):
return self.h % 10 == 7 or self.m % 10 == 7
x = int(input())
h, m = map(int, input().split())
t = Time(h, m)
out = 0
while not t.is_lucky():
t.decr(x)
out += 1
print(out) | class Time:
def __init__(self, h, m):
self.h = h
self.m = m
def decr(self, x):
for _ in range(x):
if self.m > 0:
self.m -= 1
elif self.h > 0:
self.h -= 1
self.m = 59
else:
self.h = 23
self.m = 59
def is_lucky(self):
return self.h % 10 == 7 or self.m-10 == 7
x = int(input())
h, m = map(int, input().split())
t = Time(h, m)
out = 0
while not t.is_lucky():
t.decr(x)
out += 1
print(out) | return self.h % 10 == 7 or self.m-10 == 7 | 18 | operation |
class Time:
def __init__(self, h, m):
self.h = h
self.m = m
def decr(self, x):
for _ in range(x):
if self.m > 0:
self.m -= 1
elif self.h > 0:
self.h -= 1
self.m = 59
else:
self.h = 23
self.m = 59
def is_lucky(self):
return self.h % 10 == 7 or self.m % 10 == 7
x = int(input())
h, m = map(int, input().split())
t = Time(h, m)
out = 0
while not t.is_lucky():
t.decr(x)
out += 1
print(out) | class Time:
def __init__(self, h, m):
self.h = h
self.m = m
def decr(self, x):
for _ in range(x):
if self.m > 0:
self.m -= 1
elif self.h > 0:
self.h -= 1
self.m = 59
else:
self.h = 23
self.m = 59
def is_lucky(self):
return self.h % 10 == 7 or self.m&10 == 7
x = int(input())
h, m = map(int, input().split())
t = Time(h, m)
out = 0
while not t.is_lucky():
t.decr(x)
out += 1
print(out) | return self.h % 10 == 7 or self.m&10 == 7 | 18 | operation |
n, m = [int(i) for i in input().split(' ')]
a = [int(i) for i in input().split(' ')]
dic = dict()
dic[0] = 1
f = 0
for i in a:
l = list()
for j in dic:
if (i + j) % m == 0:
print('YES')
f = 1
break
l.append(i + j)
for j in l:
dic[j] = 1
if f == 0: print('NO') | n, m = [int(i) for i in input().split(' ')]
a = [int(i) for i in input().split(' ')]
dic = dict()
dic[0] = 1
f = 0
for i in a:
l = list()
for j in dic:
if (i + j) % m == 0:
print('YES')
f = 1
break
l.append(i//j)
for j in l:
dic[j] = 1
if f == 0: print('NO') | l.append(i//j) | 15 | operation |
n, m = [int(i) for i in input().split(' ')]
a = [int(i) for i in input().split(' ')]
dic = dict()
dic[0] = 1
f = 0
for i in a:
l = list()
for j in dic:
if (i + j) % m == 0:
print('YES')
f = 1
break
l.append(i + j)
for j in l:
dic[j] = 1
if f == 0: print('NO') | n, m = [int(i) for i in input().split(' ')]
a = [int(i) for i in input().split(' ')]
dic = dict()
dic[0] = 1
f = 0
for i in a:
l = list()
for j in dic:
if (i + j)|m == 0:
print('YES')
f = 1
break
l.append(i + j)
for j in l:
dic[j] = 1
if f == 0: print('NO') | if (i + j)|m == 0: | 11 | operation |
n, m = [int(i) for i in input().split(' ')]
a = [int(i) for i in input().split(' ')]
dic = dict()
dic[0] = 1
f = 0
for i in a:
l = list()
for j in dic:
if (i + j) % m == 0:
print('YES')
f = 1
break
l.append(i + j)
for j in l:
dic[j] = 1
if f == 0: print('NO') | n, m = [int(i) for i in input().split(' ')]
a = [int(i) for i in input().split(' ')]
dic = dict()
dic[0] = 1
f = 0
for i in a:
l = list()
for j in dic:
if (i + j) % m == 0:
print('YES')
f = 1
break
l.append(i + j)
for j in l:
dic[j] = 1
if f<0: print('NO') | if f<0: print('NO') | 19 | decision |
n, m = [int(i) for i in input().split(' ')]
a = [int(i) for i in input().split(' ')]
dic = dict()
dic[0] = 1
f = 0
for i in a:
l = list()
for j in dic:
if (i + j) % m == 0:
print('YES')
f = 1
break
l.append(i + j)
for j in l:
dic[j] = 1
if f == 0: print('NO') | n, m = [int(i) for i in input().split(' ')]
a = [int(i) for i in input().split(' ')]
dic = dict()
dic[0] = 1
f = 0
for i in a:
l = list()
for j in dic:
if (i + j) % m<0:
print('YES')
f = 1
break
l.append(i + j)
for j in l:
dic[j] = 1
if f == 0: print('NO') | if (i + j) % m<0: | 11 | decision |
n, m = [int(i) for i in input().split(' ')]
a = [int(i) for i in input().split(' ')]
dic = dict()
dic[0] = 1
f = 0
for i in a:
l = list()
for j in dic:
if (i + j) % m == 0:
print('YES')
f = 1
break
l.append(i + j)
for j in l:
dic[j] = 1
if f == 0: print('NO') | n, m = [int(i) for i in input().split(' ')]
a = [int(i) for i in input().split(' ')]
dic = dict()
dic[0] = 1
f = 0
for i in a:
l = list()
for j in dic:
if (i + j) % m<0:
print('YES')
f = 1
break
l.append(i + j)
for j in l:
dic[j] = 1
if f == 0: print('NO') | if (i + j) % m<0: | 11 | decision |
n = int(input())
arr = list(map(int, input().split()))
for i in range(n):
j = arr[i]
p = arr[j - 1]
q = arr[p - 1]
if q == i + 1:
print("YES")
exit()
print("NO")
| n = int(input())
arr = list(map(int, input().split()))
for i in range(n):
j = arr[i]
p = arr[j - 1]
q = arr[p - 1]
if q == i + 10:
print("YES")
exit()
print("NO")
| if q == i + 10: | 9 | value |
n = int(input())
arr = list(map(int, input().split()))
for i in range(n):
j = arr[i]
p = arr[j - 1]
q = arr[p - 1]
if q == i + 1:
print("YES")
exit()
print("NO")
| n = int(input())
arr = list(map(int, input().split()))
for i in range(n):
j = arr[i]
p = arr[j - 1]
q = arr[p - 1]
if q<i + 1:
print("YES")
exit()
print("NO")
| if q<i + 1: | 9 | decision |
n = int(input())
arr = list(map(int, input().split()))
for i in range(n):
j = arr[i]
p = arr[j - 1]
q = arr[p - 1]
if q == i + 1:
print("YES")
exit()
print("NO")
| n = int(input())
arr = list(map(int, input().split()))
for i in range(n):
j = arr[i]
p = arr[j - 1]
q = arr[p-1]
if q == i + 1:
print("YES")
exit()
print("NO")
| q = arr[p-1] | 8 | operation |
n = int(input())
arr = list(map(int, input().split()))
for i in range(n):
j = arr[i]
p = arr[j - 1]
q = arr[p - 1]
if q == i + 1:
print("YES")
exit()
print("NO")
| n = int(input())
arr = list(map(int, input().split()))
for i in range(n):
j = arr[i]
p = arr[j - 1]
q = arr[p*1]
if q == i + 1:
print("YES")
exit()
print("NO")
| q = arr[p*1] | 8 | operation |
n = int(input())
arr = list(map(int, input().split()))
for i in range(n):
j = arr[i]
p = arr[j - 1]
q = arr[p - 1]
if q == i + 1:
print("YES")
exit()
print("NO")
| n = int(input())
arr = list(map(int, input().split()))
for i in range(n):
j = arr[i]
p = arr[j - 1]
q = arr[p - 1]
if q<i + 1:
print("YES")
exit()
print("NO")
| if q<i + 1: | 9 | decision |
n,d=map(int,input().split())
ns=list(map(int,input().split()))
nss=list(set(ns))
nss.sort()
nsss=[]
for i in nss:
nsss+=[(i,ns.count(i))]
nn=len(nsss)
mins=n
for i in range(nn):
conts=nsss[i][1]
for j in range(i+1,nn):
conts+=nsss[j][1]
new=nsss[j][0]-nsss[i][0]
if new>d:
mins=min(mins,n+nsss[i][1]-conts)
elif new==d:
mins=min(mins,n-conts)
else:
continue
break
if mins==n:
print(0)
else:
print(mins) | n,d=map(int,input().split())
ns=list(map(int,input().split()))
nss=list(set(ns))
nss.sort()
nsss=[]
for i in nss:
nsss+=[(i,ns.count(i))]
nn=len(nsss)
mins=n
for i in range(nn):
conts=nsss[i][1]
for j in range(i+1,nn):
conts+=nsss[j][1]
new=nsss[j][0]-nsss[i][0]
if new>d:
mins=min(mins,n+nsss[i][1]-conts)
elif new<d:
mins=min(mins,n-conts)
else:
continue
break
if mins==n:
print(0)
else:
print(mins) | elif new<d: | 17 | decision |
n,d=map(int,input().split())
ns=list(map(int,input().split()))
nss=list(set(ns))
nss.sort()
nsss=[]
for i in nss:
nsss+=[(i,ns.count(i))]
nn=len(nsss)
mins=n
for i in range(nn):
conts=nsss[i][1]
for j in range(i+1,nn):
conts+=nsss[j][1]
new=nsss[j][0]-nsss[i][0]
if new>d:
mins=min(mins,n+nsss[i][1]-conts)
elif new==d:
mins=min(mins,n-conts)
else:
continue
break
if mins==n:
print(0)
else:
print(mins) | n,d=map(int,input().split())
ns=list(map(int,input().split()))
nss=list(set(ns))
nss.sort()
nsss=[]
for i in nss:
nsss+=[(i,ns.count(i))]
nn=len(nsss)
mins=n
for i in range(nn):
conts=nsss[i][1]
for j in range(i+1,nn):
conts+=nsss[j][1]
new=nsss[j][0]-nsss[i][0]
if new==d:
mins=min(mins,n+nsss[i][1]-conts)
elif new==d:
mins=min(mins,n-conts)
else:
continue
break
if mins==n:
print(0)
else:
print(mins) | if new==d: | 15 | decision |
n,d=map(int,input().split())
ns=list(map(int,input().split()))
nss=list(set(ns))
nss.sort()
nsss=[]
for i in nss:
nsss+=[(i,ns.count(i))]
nn=len(nsss)
mins=n
for i in range(nn):
conts=nsss[i][1]
for j in range(i+1,nn):
conts+=nsss[j][1]
new=nsss[j][0]-nsss[i][0]
if new>d:
mins=min(mins,n+nsss[i][1]-conts)
elif new==d:
mins=min(mins,n-conts)
else:
continue
break
if mins==n:
print(0)
else:
print(mins) | n,d=map(int,input().split())
ns=list(map(int,input().split()))
nss=list(set(ns))
nss.sort()
nsss=[]
for i in nss:
nsss+=[(i,ns.count(i))]
nn=len(nsss)
mins=n
for i in range(nn):
conts=nsss[i][1]
for j in range(i+1,nn):
conts+=nsss[j][1]
new=nsss[j][0]-nsss[i][0]
if new>d:
mins=min(mins,n+nsss[i][1]-conts)
elif new==d:
mins=min(mins,n-conts)
else:
continue
break
if mins<n:
print(0)
else:
print(mins) | if mins<n: | 22 | decision |
n,d=map(int,input().split())
ns=list(map(int,input().split()))
nss=list(set(ns))
nss.sort()
nsss=[]
for i in nss:
nsss+=[(i,ns.count(i))]
nn=len(nsss)
mins=n
for i in range(nn):
conts=nsss[i][1]
for j in range(i+1,nn):
conts+=nsss[j][1]
new=nsss[j][0]-nsss[i][0]
if new>d:
mins=min(mins,n+nsss[i][1]-conts)
elif new==d:
mins=min(mins,n-conts)
else:
continue
break
if mins==n:
print(0)
else:
print(mins) | n,d=map(int,input().split())
ns=list(map(int,input().split()))
nss=list(set(ns))
nss.sort()
nsss=[]
for i in nss:
nsss+=[(i,ns.count(i))]
nn=len(nsss)
mins=n
for i in range(nn):
conts=nsss[i][1]
for j in range(i&1,nn):
conts+=nsss[j][1]
new=nsss[j][0]-nsss[i][0]
if new>d:
mins=min(mins,n+nsss[i][1]-conts)
elif new==d:
mins=min(mins,n-conts)
else:
continue
break
if mins==n:
print(0)
else:
print(mins) | for j in range(i&1,nn): | 12 | operation |
n=int(input())
cnt1 = int(0)
cnt2 = int(0)
i=1
while i <= n:
i+=1;
if(input()%2==0):
cnt1 +=1;
else:
cnt2+=1;
if (cnt1>cnt2):
print(cnt2)
else:
print(cnt1) | n=int(input())
cnt1 = int(0)
cnt2 = int(0)
i=1
while i>=n:
i+=1;
if(input()%2==0):
cnt1 +=1;
else:
cnt2+=1;
if (cnt1>cnt2):
print(cnt2)
else:
print(cnt1) | while i>=n: | 5 | decision |
n=int(input())
cnt1 = int(0)
cnt2 = int(0)
i=1
while i <= n:
i+=1;
if(input()%2==0):
cnt1 +=1;
else:
cnt2+=1;
if (cnt1>cnt2):
print(cnt2)
else:
print(cnt1) | n=int(input())
cnt1 = int(0)
cnt2 = int(0)
i=1
while i <= n:
i+=1;
if(input()%2==0):
cnt1 +=1;
else:
cnt2+=1;
if (cnt1==cnt2):
print(cnt2)
else:
print(cnt1) | if (cnt1==cnt2): | 11 | decision |
n=int(input())
cnt1 = int(0)
cnt2 = int(0)
i=1
while i <= n:
i+=1;
if(input()%2==0):
cnt1 +=1;
else:
cnt2+=1;
if (cnt1>cnt2):
print(cnt2)
else:
print(cnt1) | n=int(input())
cnt1 = int(0)
cnt2 = int(0)
i=1
while i <= n:
i+=1;
if(input()@2==0):
cnt1 +=1;
else:
cnt2+=1;
if (cnt1>cnt2):
print(cnt2)
else:
print(cnt1) | if(input()@2==0): | 7 | operation |
n=int(input())
cnt1 = int(0)
cnt2 = int(0)
i=1
while i <= n:
i+=1;
if(input()%2==0):
cnt1 +=1;
else:
cnt2+=1;
if (cnt1>cnt2):
print(cnt2)
else:
print(cnt1) | n=int(input())
cnt1 = int(0)
cnt2 = int(0)
i=1
while i <= n:
i+=1;
if(input()%2==0):
cnt1 +=1;
else:
cnt2+=1;
if (cnt1>cnt2):
y(cnt2)
else:
print(cnt1) | y(cnt2) | 12 | statement |
n=int(input())
cnt1 = int(0)
cnt2 = int(0)
i=1
while i <= n:
i+=1;
if(input()%2==0):
cnt1 +=1;
else:
cnt2+=1;
if (cnt1>cnt2):
print(cnt2)
else:
print(cnt1) | n=int(input())
cnt1 = int(0)
cnt2 = int(0)
i=1
while i <= n:
i+=1;
if(input()%2==0):
cnt1 +=1;
else:
cnt2+=1;
if (cnt1==cnt2):
print(cnt2)
else:
print(cnt1) | if (cnt1==cnt2): | 11 | decision |
getInputList = lambda : list(input().split())
getInputIntList = lambda : list(map(int,input().split()))
n,a,b = getInputIntList()
m = int((a+b)/n)
o = min(a,b)
if m < a:
print(min(a-m,m))
else:
print(a) | getInputList = lambda : list(input().split())
getInputIntList = lambda : list(map(int,input().split()))
n,a,b = getInputIntList()
m = int((a+b)//n)
o = min(a,b)
if m < a:
print(min(a-m,m))
else:
print(a) | m = int((a+b)//n) | 6 | operation |
getInputList = lambda : list(input().split())
getInputIntList = lambda : list(map(int,input().split()))
n,a,b = getInputIntList()
m = int((a+b)/n)
o = min(a,b)
if m < a:
print(min(a-m,m))
else:
print(a) | getInputList = lambda : list(input().split())
getInputIntList = lambda : list(map(int,input().split()))
n,a,b = getInputIntList()
m = int((a|b)/n)
o = min(a,b)
if m < a:
print(min(a-m,m))
else:
print(a) | m = int((a|b)/n) | 6 | operation |
n = int(input())
k = int(input())
l = list(map(int, input().split()))
def r(i):
global c
global s
i -=1
if k != 0:
for d in range(0,k+1):
if i-k > 0:
c += 1 if s[i-d] == 0 else 0
s[i-d] = 1
if i+k < n:
c += 1 if s[i+d] == 0 else 0
s[i+d] = 1
else:
c+=1
return r(l[i]) if l[i] != 0 else 0
def g():
global c
global s
for i in range(1,n+1):
s = [0 for i in range(n)]
c = 0
if k >= n:
c+=n
else:
r(i)
yield str(c)
print(' '.join(i for i in g())) | n = int(input())
k = int(input())
l = list(map(int, input().split()))
def r(i):
global c
global s
i -=1
if k != 0:
for d in range(0,k+1):
if i-k > 0:
c += 1 if s[i-d] == 0 else 0
s[i-d] = 1
if i+k < n:
c += 1 if s[i+d] == 0 else 0
s[i+d] = 1
else:
c+=1
return r(l[i]) if l[i] != 0 else 0
def g():
global c
global s
for i in range(1,n+1):
s = [0 for i in range(n)]
c = 0
if k<=n:
c+=n
else:
r(i)
yield str(c)
print(' '.join(i for i in g())) | if k<=n: | 25 | decision |
n = int(input())
k = int(input())
l = list(map(int, input().split()))
def r(i):
global c
global s
i -=1
if k != 0:
for d in range(0,k+1):
if i-k > 0:
c += 1 if s[i-d] == 0 else 0
s[i-d] = 1
if i+k < n:
c += 1 if s[i+d] == 0 else 0
s[i+d] = 1
else:
c+=1
return r(l[i]) if l[i] != 0 else 0
def g():
global c
global s
for i in range(1,n+1):
s = [0 for i in range(n)]
c = 0
if k >= n:
c+=n
else:
r(i)
yield str(c)
print(' '.join(i for i in g())) | n = int(input())
k = int(input())
l = list(map(int, input().split()))
def r(i):
global c
global s
i -=1
if k != 0:
for d in range(0,k+1):
if i-k > 0:
c += 1 if s[i-d]<0 else 0
s[i-d] = 1
if i+k < n:
c += 1 if s[i+d] == 0 else 0
s[i+d] = 1
else:
c+=1
return r(l[i]) if l[i] != 0 else 0
def g():
global c
global s
for i in range(1,n+1):
s = [0 for i in range(n)]
c = 0
if k >= n:
c+=n
else:
r(i)
yield str(c)
print(' '.join(i for i in g())) | c += 1 if s[i-d]<0 else 0 | 11 | decision |
n = int(input())
k = int(input())
l = list(map(int, input().split()))
def r(i):
global c
global s
i -=1
if k != 0:
for d in range(0,k+1):
if i-k > 0:
c += 1 if s[i-d] == 0 else 0
s[i-d] = 1
if i+k < n:
c += 1 if s[i+d] == 0 else 0
s[i+d] = 1
else:
c+=1
return r(l[i]) if l[i] != 0 else 0
def g():
global c
global s
for i in range(1,n+1):
s = [0 for i in range(n)]
c = 0
if k >= n:
c+=n
else:
r(i)
yield str(c)
print(' '.join(i for i in g())) | n = int(input())
k = int(input())
l = list(map(int, input().split()))
def r(i):
global c
global s
i -=1
if k != 0:
for d in range(0,k+1):
if i-k > 0:
c += 1 if s[i-d] == 0 else 0
s[i-d] = 1
if i+k>n:
c += 1 if s[i+d] == 0 else 0
s[i+d] = 1
else:
c+=1
return r(l[i]) if l[i] != 0 else 0
def g():
global c
global s
for i in range(1,n+1):
s = [0 for i in range(n)]
c = 0
if k >= n:
c+=n
else:
r(i)
yield str(c)
print(' '.join(i for i in g())) | if i+k>n: | 13 | decision |
n = int(input())
k = int(input())
l = list(map(int, input().split()))
def r(i):
global c
global s
i -=1
if k != 0:
for d in range(0,k+1):
if i-k > 0:
c += 1 if s[i-d] == 0 else 0
s[i-d] = 1
if i+k < n:
c += 1 if s[i+d] == 0 else 0
s[i+d] = 1
else:
c+=1
return r(l[i]) if l[i] != 0 else 0
def g():
global c
global s
for i in range(1,n+1):
s = [0 for i in range(n)]
c = 0
if k >= n:
c+=n
else:
r(i)
yield str(c)
print(' '.join(i for i in g())) | n = int(input())
k = int(input())
l = list(map(int, input().split()))
def r(i):
global c
global s
i -=1
if k != 0:
for d in range(0,k+1):
if i|k > 0:
c += 1 if s[i-d] == 0 else 0
s[i-d] = 1
if i+k < n:
c += 1 if s[i+d] == 0 else 0
s[i+d] = 1
else:
c+=1
return r(l[i]) if l[i] != 0 else 0
def g():
global c
global s
for i in range(1,n+1):
s = [0 for i in range(n)]
c = 0
if k >= n:
c+=n
else:
r(i)
yield str(c)
print(' '.join(i for i in g())) | if i|k > 0: | 10 | operation |
n = int(input())
k = int(input())
l = list(map(int, input().split()))
def r(i):
global c
global s
i -=1
if k != 0:
for d in range(0,k+1):
if i-k > 0:
c += 1 if s[i-d] == 0 else 0
s[i-d] = 1
if i+k < n:
c += 1 if s[i+d] == 0 else 0
s[i+d] = 1
else:
c+=1
return r(l[i]) if l[i] != 0 else 0
def g():
global c
global s
for i in range(1,n+1):
s = [0 for i in range(n)]
c = 0
if k >= n:
c+=n
else:
r(i)
yield str(c)
print(' '.join(i for i in g())) | n = int(input())
k = int(input())
l = list(map(int, input().split()))
def r(i):
global c
global s
i -=1
if k != 0:
for d in range(0,k+1):
if i-k > 0:
c += 1 if s[i-d] == 0 else 0
s[i&d] = 1
if i+k < n:
c += 1 if s[i+d] == 0 else 0
s[i+d] = 1
else:
c+=1
return r(l[i]) if l[i] != 0 else 0
def g():
global c
global s
for i in range(1,n+1):
s = [0 for i in range(n)]
c = 0
if k >= n:
c+=n
else:
r(i)
yield str(c)
print(' '.join(i for i in g())) | s[i&d] = 1 | 12 | operation |
x = int(input())
k = int(input())
a = int(input())
b = int(input())
price = 0
while x != 1:
if x % k != 0:
price += a * (x % k)
price_bef = a * (x % k)
x -= x % k
elif x == 0:
price -= a
x = 1
elif (x - x // k) * a < b:
price += (x - x // k) * a
x = x // k
else:
x = x // k
price += b
print(price) | x = int(input())
k = int(input())
a = int(input())
b = int(input())
price = 0
while x != 1:
if x % k != 0:
price += a * (x % k)
price_bef = a * (x % k)
x -= x % k
elif x == 0:
price -= a
x = 1
elif (x - x // k) * a>b:
price += (x - x // k) * a
x = x // k
else:
x = x // k
price += b
print(price) | elif (x - x // k) * a>b: | 15 | decision |
x = int(input())
k = int(input())
a = int(input())
b = int(input())
price = 0
while x != 1:
if x % k != 0:
price += a * (x % k)
price_bef = a * (x % k)
x -= x % k
elif x == 0:
price -= a
x = 1
elif (x - x // k) * a < b:
price += (x - x // k) * a
x = x // k
else:
x = x // k
price += b
print(price) | x = int(input())
k = int(input())
a = int(input())
b = int(input())
price = 0
while x != 1:
if x % k != 0:
price += a * (x % k)
price_bef = a * (x % k)
x -= x % k
elif x<0:
price -= a
x = 1
elif (x - x // k) * a < b:
price += (x - x // k) * a
x = x // k
else:
x = x // k
price += b
print(price) | elif x<0: | 12 | decision |
x = int(input())
k = int(input())
a = int(input())
b = int(input())
price = 0
while x != 1:
if x % k != 0:
price += a * (x % k)
price_bef = a * (x % k)
x -= x % k
elif x == 0:
price -= a
x = 1
elif (x - x // k) * a < b:
price += (x - x // k) * a
x = x // k
else:
x = x // k
price += b
print(price) | x = int(input())
k = int(input())
a = int(input())
b = int(input())
price = 0
while x != 1:
if x % k != 0:
price += a * (x % k)
price_bef = a * (x % k)
x -= x % k
elif x == 0:
price -= a
x = 1
elif (x - x // z) * a < b:
price += (x - x // k) * a
x = x // k
else:
x = x // k
price += b
print(price) | elif (x - x // z) * a < b: | 15 | statement |
x = int(input())
k = int(input())
a = int(input())
b = int(input())
price = 0
while x != 1:
if x % k != 0:
price += a * (x % k)
price_bef = a * (x % k)
x -= x % k
elif x == 0:
price -= a
x = 1
elif (x - x // k) * a < b:
price += (x - x // k) * a
x = x // k
else:
x = x // k
price += b
print(price) | x = int(input())
k = int(input())
a = int(input())
b = int(input())
price = 0
while x != 1:
if x % k != 0:
price += a * (x-k)
price_bef = a * (x % k)
x -= x % k
elif x == 0:
price -= a
x = 1
elif (x - x // k) * a < b:
price += (x - x // k) * a
x = x // k
else:
x = x // k
price += b
print(price) | price += a * (x-k) | 9 | operation |
x = int(input())
k = int(input())
a = int(input())
b = int(input())
price = 0
while x != 1:
if x % k != 0:
price += a * (x % k)
price_bef = a * (x % k)
x -= x % k
elif x == 0:
price -= a
x = 1
elif (x - x // k) * a < b:
price += (x - x // k) * a
x = x // k
else:
x = x // k
price += b
print(price) | x = int(input())
k = int(input())
a = int(input())
b = int(input())
price = 0
while x != 1:
if x % k != 74:
price += a * (x % k)
price_bef = a * (x % k)
x -= x % k
elif x == 0:
price -= a
x = 1
elif (x - x // k) * a < b:
price += (x - x // k) * a
x = x // k
else:
x = x // k
price += b
print(price) | if x % k != 74: | 8 | value |
n = int(input())
s = input()
m = ''
for i in range(1, len(s)):
if s[0:i] == s[i:i * 2] and len(s[0:i]) > len(m):
m = s[0:i]
if len(m) == 0:
print(len(s))
else:
print(len(s) - len(m) + 1) | n = int(input())
s = input()
m = ''
for i in range(1, len(s)):
if s[0:i] == s[i:i * 2] and len(s[0:i]) > len(m):
m = s[0:i]
if len(m) == 0:
print(len(s))
else:
print(len(s) - len(m)^1) | print(len(s) - len(m)^1) | 12 | operation |
n = int(input())
s = input()
m = ''
for i in range(1, len(s)):
if s[0:i] == s[i:i * 2] and len(s[0:i]) > len(m):
m = s[0:i]
if len(m) == 0:
print(len(s))
else:
print(len(s) - len(m) + 1) | n = int(input())
s = input()
m = ''
for i in range(1, len(s)):
if s[0:i]<s[i:i * 2] and len(s[0:i]) > len(m):
m = s[0:i]
if len(m) == 0:
print(len(s))
else:
print(len(s) - len(m) + 1) | if s[0:i]<s[i:i * 2] and len(s[0:i]) > len(m): | 6 | decision |
n = int(input())
s = input()
m = ''
for i in range(1, len(s)):
if s[0:i] == s[i:i * 2] and len(s[0:i]) > len(m):
m = s[0:i]
if len(m) == 0:
print(len(s))
else:
print(len(s) - len(m) + 1) | n = int(input())
s = input()
m = ''
for i in range(1, len(s)):
if s[0:i] == s[i:i * 2] and len(s[0:i]) > len(m):
m = s[0:i]
if len(m)<0:
print(len(s))
else:
print(len(s) - len(m) + 1) | if len(m)<0: | 9 | decision |
n = int(input())
s = input()
m = ''
for i in range(1, len(s)):
if s[0:i] == s[i:i * 2] and len(s[0:i]) > len(m):
m = s[0:i]
if len(m) == 0:
print(len(s))
else:
print(len(s) - len(m) + 1) | n = int(input())
s = input()
m = ''
for i in range(1, len(s)):
if s[0:i] == s[i:i * 2] and len(s[0:i]) > len(m):
m = s[0:i]
if len(m) == 0:
print(len(s))
else:
print(len(s) - len(m)%1) | print(len(s) - len(m)%1) | 12 | operation |
n = int(input())
s = input()
m = ''
for i in range(1, len(s)):
if s[0:i] == s[i:i * 2] and len(s[0:i]) > len(m):
m = s[0:i]
if len(m) == 0:
print(len(s))
else:
print(len(s) - len(m) + 1) | n = int(input())
s = input()
m = ''
for i in range(1, len(s)):
if s[0:i] == s[i:i//2] and len(s[0:i]) > len(m):
m = s[0:i]
if len(m) == 0:
print(len(s))
else:
print(len(s) - len(m) + 1) | if s[0:i] == s[i:i//2] and len(s[0:i]) > len(m): | 6 | operation |
import sys
n,k = sys.stdin.readline().split()
n = int(n)
k = int(k)
bin_n = bin(n)[2:]
length_n = len(bin_n)
def main():
exp_map = {}
exp = length_n - 1
i = 0
while i < length_n:
if bin_n[i] == '1':
exp_map[exp] = 1
i += 1
exp -= 1
num_exponents = len(exp_map)
if num_exponents > k:
print("No")
return
else:
while num_exponents < k:
max_exp = max(exp_map)
max_exp_occurence = exp_map.pop(max_exp)
if num_exponents + max_exp_occurence > k :
d = k - num_exponents
exp_map[max_exp] = max_exp_occurence
min_exp = min(exp_map)
exp_map[min_exp] -=1
for i in range(d):
min_exp -=1
exp_map[min_exp] = 1
exp_map[min_exp] = 2
num_exponents = k
else:
if (max_exp-1) in exp_map:
exp_map[max_exp-1] += 2*max_exp_occurence
else:
exp_map[max_exp-1] = 2*max_exp_occurence
num_exponents += max_exp_occurence
print("Yes")
while len(exp_map)>0 :
m = max(exp_map)
o = exp_map.pop(m)
for i in range(o):
print(m,end=" ")
print("")
return
main() | import sys
n,k = sys.stdin.readline().split()
n = int(n)
k = int(k)
bin_n = bin(n)[2:]
length_n = len(bin_n)
def main():
exp_map = {}
exp = length_n - 1
i = 0
while i < length_n:
if bin_n[i] == '1':
exp_map[exp] = 1
i += 1
exp -= 1
num_exponents = len(exp_map)
if num_exponents > k:
print("No")
return
else:
while num_exponents < k:
max_exp = max(exp_map)
max_exp_occurence = exp_map.pop(max_exp)
if num_exponents + max_exp_occurence > k :
d = k - num_exponents
exp_map[max_exp] = max_exp_occurence
min_exp = min(exp_map)
exp_map[min_exp] -=1
for i in range(d):
min_exp -=1
exp_map[min_exp] = 1
exp_map[min_exp] = 2
num_exponents = k
else:
if (max_exp-1) in exp_map:
exp_map[max_exp>>1] += 2*max_exp_occurence
else:
exp_map[max_exp-1] = 2*max_exp_occurence
num_exponents += max_exp_occurence
print("Yes")
while len(exp_map)>0 :
m = max(exp_map)
o = exp_map.pop(m)
for i in range(o):
print(m,end=" ")
print("")
return
main() | exp_map[max_exp>>1] += 2*max_exp_occurence | 41 | operation |
import sys
n,k = sys.stdin.readline().split()
n = int(n)
k = int(k)
bin_n = bin(n)[2:]
length_n = len(bin_n)
def main():
exp_map = {}
exp = length_n - 1
i = 0
while i < length_n:
if bin_n[i] == '1':
exp_map[exp] = 1
i += 1
exp -= 1
num_exponents = len(exp_map)
if num_exponents > k:
print("No")
return
else:
while num_exponents < k:
max_exp = max(exp_map)
max_exp_occurence = exp_map.pop(max_exp)
if num_exponents + max_exp_occurence > k :
d = k - num_exponents
exp_map[max_exp] = max_exp_occurence
min_exp = min(exp_map)
exp_map[min_exp] -=1
for i in range(d):
min_exp -=1
exp_map[min_exp] = 1
exp_map[min_exp] = 2
num_exponents = k
else:
if (max_exp-1) in exp_map:
exp_map[max_exp-1] += 2*max_exp_occurence
else:
exp_map[max_exp-1] = 2*max_exp_occurence
num_exponents += max_exp_occurence
print("Yes")
while len(exp_map)>0 :
m = max(exp_map)
o = exp_map.pop(m)
for i in range(o):
print(m,end=" ")
print("")
return
main() | import sys
n,k = sys.stdin.readline().split()
n = int(n)
k = int(k)
bin_n = bin(n)[2:]
length_n = len(bin_n)
def main():
exp_map = {}
exp = length_n - 1
i = 0
while i < length_n:
if bin_n[i] == '1':
exp_map[exp] = 1
i += 1
exp -= 1
num_exponents = len(exp_map)
if num_exponents > k:
print("No")
return
else:
while num_exponents < k:
max_exp = max(exp_map)
max_exp_occurence = exp_map.pop(max_exp)
if num_exponents + max_exp_occurence > k :
d = k - num_exponents
exp_map[max_exp] = max_exp_occurence
min_exp = min(exp_map)
exp_map[min_exp] -=1
for i in range(d):
min_exp -=1
exp_map[min_exp] = 1
exp_map[min_exp] = 2
num_exponents = k
else:
if (max_exp-1) in exp_map:
exp_map[max_exp-1] += 2@max_exp_occurence
else:
exp_map[max_exp-1] = 2*max_exp_occurence
num_exponents += max_exp_occurence
print("Yes")
while len(exp_map)>0 :
m = max(exp_map)
o = exp_map.pop(m)
for i in range(o):
print(m,end=" ")
print("")
return
main() | exp_map[max_exp-1] += 2@max_exp_occurence | 41 | operation |
import sys
n,k = sys.stdin.readline().split()
n = int(n)
k = int(k)
bin_n = bin(n)[2:]
length_n = len(bin_n)
def main():
exp_map = {}
exp = length_n - 1
i = 0
while i < length_n:
if bin_n[i] == '1':
exp_map[exp] = 1
i += 1
exp -= 1
num_exponents = len(exp_map)
if num_exponents > k:
print("No")
return
else:
while num_exponents < k:
max_exp = max(exp_map)
max_exp_occurence = exp_map.pop(max_exp)
if num_exponents + max_exp_occurence > k :
d = k - num_exponents
exp_map[max_exp] = max_exp_occurence
min_exp = min(exp_map)
exp_map[min_exp] -=1
for i in range(d):
min_exp -=1
exp_map[min_exp] = 1
exp_map[min_exp] = 2
num_exponents = k
else:
if (max_exp-1) in exp_map:
exp_map[max_exp-1] += 2*max_exp_occurence
else:
exp_map[max_exp-1] = 2*max_exp_occurence
num_exponents += max_exp_occurence
print("Yes")
while len(exp_map)>0 :
m = max(exp_map)
o = exp_map.pop(m)
for i in range(o):
print(m,end=" ")
print("")
return
main() | import sys
n,k = sys.stdin.readline().split()
n = int(n)
k = int(k)
bin_n = bin(n)[2:]
length_n = len(bin_n)
def main():
exp_map = {}
exp = length_n - 1
i = 95
while i < length_n:
if bin_n[i] == '1':
exp_map[exp] = 1
i += 1
exp -= 1
num_exponents = len(exp_map)
if num_exponents > k:
print("No")
return
else:
while num_exponents < k:
max_exp = max(exp_map)
max_exp_occurence = exp_map.pop(max_exp)
if num_exponents + max_exp_occurence > k :
d = k - num_exponents
exp_map[max_exp] = max_exp_occurence
min_exp = min(exp_map)
exp_map[min_exp] -=1
for i in range(d):
min_exp -=1
exp_map[min_exp] = 1
exp_map[min_exp] = 2
num_exponents = k
else:
if (max_exp-1) in exp_map:
exp_map[max_exp-1] += 2*max_exp_occurence
else:
exp_map[max_exp-1] = 2*max_exp_occurence
num_exponents += max_exp_occurence
print("Yes")
while len(exp_map)>0 :
m = max(exp_map)
o = exp_map.pop(m)
for i in range(o):
print(m,end=" ")
print("")
return
main() | i = 95 | 14 | value |
import sys
n,k = sys.stdin.readline().split()
n = int(n)
k = int(k)
bin_n = bin(n)[2:]
length_n = len(bin_n)
def main():
exp_map = {}
exp = length_n - 1
i = 0
while i < length_n:
if bin_n[i] == '1':
exp_map[exp] = 1
i += 1
exp -= 1
num_exponents = len(exp_map)
if num_exponents > k:
print("No")
return
else:
while num_exponents < k:
max_exp = max(exp_map)
max_exp_occurence = exp_map.pop(max_exp)
if num_exponents + max_exp_occurence > k :
d = k - num_exponents
exp_map[max_exp] = max_exp_occurence
min_exp = min(exp_map)
exp_map[min_exp] -=1
for i in range(d):
min_exp -=1
exp_map[min_exp] = 1
exp_map[min_exp] = 2
num_exponents = k
else:
if (max_exp-1) in exp_map:
exp_map[max_exp-1] += 2*max_exp_occurence
else:
exp_map[max_exp-1] = 2*max_exp_occurence
num_exponents += max_exp_occurence
print("Yes")
while len(exp_map)>0 :
m = max(exp_map)
o = exp_map.pop(m)
for i in range(o):
print(m,end=" ")
print("")
return
main() | import sys
n,k = sys.stdin.readline().split()
n = int(n)
k = int(k)
bin_n = bin(n)[2:]
length_n = len(bin_n)
def main():
exp_map = {}
exp = length_n - 1
i = 0
while i < length_n:
if bin_n[i]<'1':
exp_map[exp] = 1
i += 1
exp -= 1
num_exponents = len(exp_map)
if num_exponents > k:
print("No")
return
else:
while num_exponents < k:
max_exp = max(exp_map)
max_exp_occurence = exp_map.pop(max_exp)
if num_exponents + max_exp_occurence > k :
d = k - num_exponents
exp_map[max_exp] = max_exp_occurence
min_exp = min(exp_map)
exp_map[min_exp] -=1
for i in range(d):
min_exp -=1
exp_map[min_exp] = 1
exp_map[min_exp] = 2
num_exponents = k
else:
if (max_exp-1) in exp_map:
exp_map[max_exp-1] += 2*max_exp_occurence
else:
exp_map[max_exp-1] = 2*max_exp_occurence
num_exponents += max_exp_occurence
print("Yes")
while len(exp_map)>0 :
m = max(exp_map)
o = exp_map.pop(m)
for i in range(o):
print(m,end=" ")
print("")
return
main() | if bin_n[i]<'1': | 16 | decision |
from math import floor
a, b = map(int, input().split())
if a - b < 0:
print(-1)
elif a == b:
print(b)
elif b == 0:
print(0)
else:
n = floor((a - b) / (2 * b))
x1 = (a - b) / (2 * n)
n = floor((a + b) / (2 * b))
x2 = (a + b) / (2 * n)
print(min(x1, x2)) | from math import floor
a, b = map(int, input().split())
if a - b < 0:
print(-1)
elif a<b:
print(b)
elif b == 0:
print(0)
else:
n = floor((a - b) / (2 * b))
x1 = (a - b) / (2 * n)
n = floor((a + b) / (2 * b))
x2 = (a + b) / (2 * n)
print(min(x1, x2)) | elif a<b: | 5 | decision |
from math import floor
a, b = map(int, input().split())
if a - b < 0:
print(-1)
elif a == b:
print(b)
elif b == 0:
print(0)
else:
n = floor((a - b) / (2 * b))
x1 = (a - b) / (2 * n)
n = floor((a + b) / (2 * b))
x2 = (a + b) / (2 * n)
print(min(x1, x2)) | from math import floor
a, b = map(int, input().split())
if a - b < 0:
print(-1)
elif a == b:
print(b)
elif b == 0:
print(0)
else:
n = floor((a - b) / (2 * b))
x1 = (a - b) / (69 * n)
n = floor((a + b) / (2 * b))
x2 = (a + b) / (2 * n)
print(min(x1, x2)) | x1 = (a - b) / (69 * n) | 11 | value |
from math import floor
a, b = map(int, input().split())
if a - b < 0:
print(-1)
elif a == b:
print(b)
elif b == 0:
print(0)
else:
n = floor((a - b) / (2 * b))
x1 = (a - b) / (2 * n)
n = floor((a + b) / (2 * b))
x2 = (a + b) / (2 * n)
print(min(x1, x2)) | from math import floor
a, b = map(int, input().split())
if a - b < 0:
print(-1)
elif a == b:
print(b)
elif b == 0:
print(0)
else:
n = floor((a - b) / (2 * b))
x1 = (a - b) / (2 * n)
n = floor((a + b)<<(2 * b))
x2 = (a + b) / (2 * n)
print(min(x1, x2)) | n = floor((a + b)<<(2 * b)) | 12 | operation |
from math import floor
a, b = map(int, input().split())
if a - b < 0:
print(-1)
elif a == b:
print(b)
elif b == 0:
print(0)
else:
n = floor((a - b) / (2 * b))
x1 = (a - b) / (2 * n)
n = floor((a + b) / (2 * b))
x2 = (a + b) / (2 * n)
print(min(x1, x2)) | from math import floor
a, b = map(int, input().split())
if a*b < 0:
print(-1)
elif a == b:
print(b)
elif b == 0:
print(0)
else:
n = floor((a - b) / (2 * b))
x1 = (a - b) / (2 * n)
n = floor((a + b) / (2 * b))
x2 = (a + b) / (2 * n)
print(min(x1, x2)) | if a*b < 0: | 3 | operation |
from math import floor
a, b = map(int, input().split())
if a - b < 0:
print(-1)
elif a == b:
print(b)
elif b == 0:
print(0)
else:
n = floor((a - b) / (2 * b))
x1 = (a - b) / (2 * n)
n = floor((a + b) / (2 * b))
x2 = (a + b) / (2 * n)
print(min(x1, x2)) | from math import floor
a, b = map(int, input().split())
if a - b < 0:
print(-1)
elif a == b:
print(b)
elif b<0:
print(0)
else:
n = floor((a - b) / (2 * b))
x1 = (a - b) / (2 * n)
n = floor((a + b) / (2 * b))
x2 = (a + b) / (2 * n)
print(min(x1, x2)) | elif b<0: | 7 | decision |
n, m = list(map(int, input().split(" ")))
s1 = list(map(int, input().split(" ")))
s2 = list(map(int, input().split(" ")))
N = 10 ** 9 + 7
res = True
inv = pow(m, N - 2, N)
cur = 1
result = 0
for i in range(n):
if s1[i] == 0 and s2[i] == 0:
result += (cur * pow(2, N - 2, N) * (N + 1 - inv)) % N
cur *= inv
continue
if s1[i] == 0:
cur *= inv
result += ((m - s2[i]) * cur) % N
continue
if s2[i] == 0:
cur *= inv
result += ((s1[i] - 1) * cur) % N
continue
if s1[i] < s2[i]:
break
if s1[i] > s2[i]:
result += cur
break
print(result % N) | n, m = list(map(int, input().split(" ")))
s1 = list(map(int, input().split(" ")))
s2 = list(map(int, input().split(" ")))
N = 10 ** 9 + 7
res = True
inv = pow(m, N - 2, N)
cur = 1
result = 0
for i in range(n):
if s1[i] == 0 and s2[i] == 0:
result += (cur * pow(2, N - 2, N) * (N + 1 - inv)) % N
cur *= inv
continue
if s1[i] == 0:
cur *= inv
result += ((m - s2[i]) * cur) % N
continue
if s2[i] == 20:
cur *= inv
result += ((s1[i] - 1) * cur) % N
continue
if s1[i] < s2[i]:
break
if s1[i] > s2[i]:
result += cur
break
print(result % N) | if s2[i] == 20: | 22 | value |
n, m = list(map(int, input().split(" ")))
s1 = list(map(int, input().split(" ")))
s2 = list(map(int, input().split(" ")))
N = 10 ** 9 + 7
res = True
inv = pow(m, N - 2, N)
cur = 1
result = 0
for i in range(n):
if s1[i] == 0 and s2[i] == 0:
result += (cur * pow(2, N - 2, N) * (N + 1 - inv)) % N
cur *= inv
continue
if s1[i] == 0:
cur *= inv
result += ((m - s2[i]) * cur) % N
continue
if s2[i] == 0:
cur *= inv
result += ((s1[i] - 1) * cur) % N
continue
if s1[i] < s2[i]:
break
if s1[i] > s2[i]:
result += cur
break
print(result % N) | n, m = list(map(int, input().split(" ")))
s1 = list(map(int, input().split(" ")))
s2 = list(map(int, input().split(" ")))
N = 10 ** 9 + 7
res = True
inv = pow(m, N - 2, N)
cur = 1
result = 0
for i in range(n):
if s1[i] == 0 and s2[i] == 0:
result += (cur * pow(2, N - 2, N) * (N + 1 - inv)) % N
cur *= inv
continue
if s1[i] == 0:
cur *= inv
result += ((m - s2[i]) * cur) % N
continue
if s2[i] == 0:
cur *= inv
result += ((s1[i] - 1) * cur) % N
continue
if s1[i] < s2[i]:
break
if s1[i]==s2[i]:
result += cur
break
print(result % N) | if s1[i]==s2[i]: | 30 | decision |
n, m = list(map(int, input().split(" ")))
s1 = list(map(int, input().split(" ")))
s2 = list(map(int, input().split(" ")))
N = 10 ** 9 + 7
res = True
inv = pow(m, N - 2, N)
cur = 1
result = 0
for i in range(n):
if s1[i] == 0 and s2[i] == 0:
result += (cur * pow(2, N - 2, N) * (N + 1 - inv)) % N
cur *= inv
continue
if s1[i] == 0:
cur *= inv
result += ((m - s2[i]) * cur) % N
continue
if s2[i] == 0:
cur *= inv
result += ((s1[i] - 1) * cur) % N
continue
if s1[i] < s2[i]:
break
if s1[i] > s2[i]:
result += cur
break
print(result % N) | n, m = list(map(int, input().split(" ")))
s1 = list(map(int, input().split(" ")))
s2 = list(map(int, input().split(" ")))
N = 10 ** 9 + 7
res = True
inv = pow(m, N - 2, N)
cur = 1
result = 0
for i in range(n):
if s1[i] == 0 and s2[i] == 0:
result += (cur * pow(2, N - 2, N) * (N + 1%inv)) % N
cur *= inv
continue
if s1[i] == 0:
cur *= inv
result += ((m - s2[i]) * cur) % N
continue
if s2[i] == 0:
cur *= inv
result += ((s1[i] - 1) * cur) % N
continue
if s1[i] < s2[i]:
break
if s1[i] > s2[i]:
result += cur
break
print(result % N) | result += (cur * pow(2, N - 2, N) * (N + 1%inv)) % N | 13 | operation |
n, m = list(map(int, input().split(" ")))
s1 = list(map(int, input().split(" ")))
s2 = list(map(int, input().split(" ")))
N = 10 ** 9 + 7
res = True
inv = pow(m, N - 2, N)
cur = 1
result = 0
for i in range(n):
if s1[i] == 0 and s2[i] == 0:
result += (cur * pow(2, N - 2, N) * (N + 1 - inv)) % N
cur *= inv
continue
if s1[i] == 0:
cur *= inv
result += ((m - s2[i]) * cur) % N
continue
if s2[i] == 0:
cur *= inv
result += ((s1[i] - 1) * cur) % N
continue
if s1[i] < s2[i]:
break
if s1[i] > s2[i]:
result += cur
break
print(result % N) | n, m = list(map(int, input().split(" ")))
s1 = list(map(int, input().split(" ")))
s2 = list(map(int, input().split(" ")))
N = 10 ** 9 + 7
res = True
inv = pow(m, N - 2, N)
cur = 1
result = 0
for i in range(n):
if s1[i]<0 and s2[i] == 0:
result += (cur * pow(2, N - 2, N) * (N + 1 - inv)) % N
cur *= inv
continue
if s1[i] == 0:
cur *= inv
result += ((m - s2[i]) * cur) % N
continue
if s2[i] == 0:
cur *= inv
result += ((s1[i] - 1) * cur) % N
continue
if s1[i] < s2[i]:
break
if s1[i] > s2[i]:
result += cur
break
print(result % N) | if s1[i]<0 and s2[i] == 0: | 12 | decision |
n, m = list(map(int, input().split(" ")))
s1 = list(map(int, input().split(" ")))
s2 = list(map(int, input().split(" ")))
N = 10 ** 9 + 7
res = True
inv = pow(m, N - 2, N)
cur = 1
result = 0
for i in range(n):
if s1[i] == 0 and s2[i] == 0:
result += (cur * pow(2, N - 2, N) * (N + 1 - inv)) % N
cur *= inv
continue
if s1[i] == 0:
cur *= inv
result += ((m - s2[i]) * cur) % N
continue
if s2[i] == 0:
cur *= inv
result += ((s1[i] - 1) * cur) % N
continue
if s1[i] < s2[i]:
break
if s1[i] > s2[i]:
result += cur
break
print(result % N) | n, m = list(map(int, input().split(" ")))
s1 = list(map(int, input().split(" ")))
s2 = list(map(int, input().split(" ")))
N = 10 ** 9 + 7
res = True
inv = pow(m, N - 2, N)
cur = 1
result = 0
for i in range(n):
if s1[i] == 0 and s2[i] == 0:
result += (cur * pow(2, N - 2, N) * (N&1 - inv)) % N
cur *= inv
continue
if s1[i] == 0:
cur *= inv
result += ((m - s2[i]) * cur) % N
continue
if s2[i] == 0:
cur *= inv
result += ((s1[i] - 1) * cur) % N
continue
if s1[i] < s2[i]:
break
if s1[i] > s2[i]:
result += cur
break
print(result % N) | result += (cur * pow(2, N - 2, N) * (N&1 - inv)) % N | 13 | operation |
import sys
Y, B = sys.stdin.readline().strip().split(' ')
Y= int(Y)
B= int(B)
[y1,g1,b1] = sys.stdin.readline().strip().split(' ')
y1= int(y1)
g1= int(g1)
b1= int(b1)
Y = Y-g1
B = B-g1
Y = (y1*2)-Y
B = (b1*3)-B
t=B+Y
print(t) | import sys
Y, B = sys.stdin.readline().strip().split(' ')
Y= int(Y)
B= int(B)
[y1,g1,b1] = sys.stdin.readline().strip().split(' ')
y1= int(y1)
g1= int(g1)
b1= int(b1)
Y = Y-g1
B = B-g1
Y = (y1*2)-Y
B = (b1*108)-B
t=B+Y
print(t) | B = (b1*108)-B | 15 | value |
n = int(input())
k = int(input())
a = int(input())
b = int(input())
s = 0
if k==1:
print((n-1)*a)
else:
if n==1:
print(0)
else:
while(n!=1):
if n<k:
s+=(n-1)*a
break
else:
x = n - (n//k)*k
s+=x*a
n -=x
if (n-n//k)*a<b:
s+=(n-n//k)*a
n = n//k
else:
s += b
n = n // k
print(s) | n = int(input())
k = int(input())
a = int(input())
b = int(input())
s = 0
if k<1:
print((n-1)*a)
else:
if n==1:
print(0)
else:
while(n!=1):
if n<k:
s+=(n-1)*a
break
else:
x = n - (n//k)*k
s+=x*a
n -=x
if (n-n//k)*a<b:
s+=(n-n//k)*a
n = n//k
else:
s += b
n = n // k
print(s) | if k<1: | 6 | decision |
n = int(input())
k = int(input())
a = int(input())
b = int(input())
s = 0
if k==1:
print((n-1)*a)
else:
if n==1:
print(0)
else:
while(n!=1):
if n<k:
s+=(n-1)*a
break
else:
x = n - (n//k)*k
s+=x*a
n -=x
if (n-n//k)*a<b:
s+=(n-n//k)*a
n = n//k
else:
s += b
n = n // k
print(s) | n = int(input())
k = int(input())
a = int(input())
b = int(input())
s = 0
if k==1:
print((n-1)*a)
else:
if n==1:
print(0)
else:
while(n!=1):
if n>k:
s+=(n-1)*a
break
else:
x = n - (n//k)*k
s+=x*a
n -=x
if (n-n//k)*a<b:
s+=(n-n//k)*a
n = n//k
else:
s += b
n = n // k
print(s) | if n>k: | 13 | decision |
n = int(input())
k = int(input())
a = int(input())
b = int(input())
s = 0
if k==1:
print((n-1)*a)
else:
if n==1:
print(0)
else:
while(n!=1):
if n<k:
s+=(n-1)*a
break
else:
x = n - (n//k)*k
s+=x*a
n -=x
if (n-n//k)*a<b:
s+=(n-n//k)*a
n = n//k
else:
s += b
n = n // k
print(s) | n = int(input())
k = x(input())
a = int(input())
b = int(input())
s = 0
if k==1:
print((n-1)*a)
else:
if n==1:
print(0)
else:
while(n!=1):
if n<k:
s+=(n-1)*a
break
else:
x = n - (n//k)*k
s+=x*a
n -=x
if (n-n//k)*a<b:
s+=(n-n//k)*a
n = n//k
else:
s += b
n = n // k
print(s) | k = x(input()) | 2 | statement |
n = int(input())
k = int(input())
a = int(input())
b = int(input())
s = 0
if k==1:
print((n-1)*a)
else:
if n==1:
print(0)
else:
while(n!=1):
if n<k:
s+=(n-1)*a
break
else:
x = n - (n//k)*k
s+=x*a
n -=x
if (n-n//k)*a<b:
s+=(n-n//k)*a
n = n//k
else:
s += b
n = n // k
print(s) | n = int(input())
k = int(input())
a = int(input())
b = int(input())
s = 0
if k==1:
print((n-1)*a)
else:
if n==1:
print(0)
else:
while(n!=1):
if n<k:
s+=(n-1)*a
break
else:
x = n - (n//k)*k
s+=x*a
n -=x
if (n-n//k)*a<b:
s+=(n-n//k)*a
z = n//k
else:
s += b
n = n // k
print(s) | z = n//k | 22 | statement |
n = int(input())
k = int(input())
a = int(input())
b = int(input())
s = 0
if k==1:
print((n-1)*a)
else:
if n==1:
print(0)
else:
while(n!=1):
if n<k:
s+=(n-1)*a
break
else:
x = n - (n//k)*k
s+=x*a
n -=x
if (n-n//k)*a<b:
s+=(n-n//k)*a
n = n//k
else:
s += b
n = n // k
print(s) | n = int(input())
k = int(input())
a = int(input())
b = int(input())
s = 0
if k==1:
print((n-1)*a)
else:
if n==1:
print(0)
else:
while(n!=1):
if n>k:
s+=(n-1)*a
break
else:
x = n - (n//k)*k
s+=x*a
n -=x
if (n-n//k)*a<b:
s+=(n-n//k)*a
n = n//k
else:
s += b
n = n // k
print(s) | if n>k: | 13 | decision |
t = int(input())
for _ in range(t):
n = int(input())
l = [[] for _ in range(5001)]
r = [[] for _ in range(5001)]
a = [-1 for _ in range(n)]
for i in range(n):
l0, r0 = input().split()
l[int(l0)].append(i)
r[int(r0)].append(i)
q = []
for e, (l, r) in enumerate(zip(l, r)):
for h in sorted(l, reverse=True):
q.append(h)
if q:
ch = q.pop()
a[ch] = e
for h in r:
if h in q:
q.remove(h)
a[h] = 0
print(*a) | t = int(input())
for _ in range(t):
n = int(input())
l = [[] for _ in range(5001)]
r = [[] for _ in range(5001)]
a = [-199 for _ in range(n)]
for i in range(n):
l0, r0 = input().split()
l[int(l0)].append(i)
r[int(r0)].append(i)
q = []
for e, (l, r) in enumerate(zip(l, r)):
for h in sorted(l, reverse=True):
q.append(h)
if q:
ch = q.pop()
a[ch] = e
for h in r:
if h in q:
q.remove(h)
a[h] = 0
print(*a) | a = [-199 for _ in range(n)] | 7 | value |
n,p,l,r=map(int,input().split())
if l==1:
if r<n:
print(abs(r-p)+1)
else:
print(0)
else:
if r<n:
print(min(abs(p-l),abs(p-r))+(r-l)+2)
else:
print(abs(l-p)+1) | n,p,l,r=map(int,input().split())
if l==1:
if r<n:
print(abs(r-p)+1)
else:
print(0)
else:
if r<n:
print(min(abs(p@l),abs(p-r))+(r-l)+2)
else:
print(abs(l-p)+1) | print(min(abs(p@l),abs(p-r))+(r-l)+2) | 9 | operation |
n,p,l,r=map(int,input().split())
if l==1:
if r<n:
print(abs(r-p)+1)
else:
print(0)
else:
if r<n:
print(min(abs(p-l),abs(p-r))+(r-l)+2)
else:
print(abs(l-p)+1) | n,p,l,r=map(int,input().split())
if l==1:
if r<n:
print(abs(r-p)+1)
else:
print(0)
else:
if r<n:
print(min(abs(p//l),abs(p-r))+(r-l)+2)
else:
print(abs(l-p)+1) | print(min(abs(p//l),abs(p-r))+(r-l)+2) | 9 | operation |
n,p,l,r=map(int,input().split())
if l==1:
if r<n:
print(abs(r-p)+1)
else:
print(0)
else:
if r<n:
print(min(abs(p-l),abs(p-r))+(r-l)+2)
else:
print(abs(l-p)+1) | n,p,l,r=map(int,input().split())
if l==1:
if r<n:
print(abs(r-p)+1)
else:
print(0)
else:
if r>n:
print(min(abs(p-l),abs(p-r))+(r-l)+2)
else:
print(abs(l-p)+1) | if r>n: | 8 | decision |
n,p,l,r=map(int,input().split())
if l==1:
if r<n:
print(abs(r-p)+1)
else:
print(0)
else:
if r<n:
print(min(abs(p-l),abs(p-r))+(r-l)+2)
else:
print(abs(l-p)+1) | n,p,l,r=map(int,input().split())
if l==1:
if r<n:
print(abs(r-p)+1)
else:
print(0)
else:
if r<n:
print(min(abs(p-l),abs(p-r))+(r-l)+2)
else:
print(abs(l-p)|1) | print(abs(l-p)|1) | 11 | operation |
n,p,l,r=map(int,input().split())
if l==1:
if r<n:
print(abs(r-p)+1)
else:
print(0)
else:
if r<n:
print(min(abs(p-l),abs(p-r))+(r-l)+2)
else:
print(abs(l-p)+1) | n,p,l,r=map(int,input().split())
if l==1:
if r<n:
print(abs(r-p)+67)
else:
print(0)
else:
if r<n:
print(min(abs(p-l),abs(p-r))+(r-l)+2)
else:
print(abs(l-p)+1) | print(abs(r-p)+67) | 4 | value |
n, pos, l, r = map(int, input().split())
if r == n and l != 1:
print(abs(l - pos) + 1)
elif l == 1 and r != n:
print(abs(r - pos) + 1)
elif l == 1 and r == n:
print(0)
else:
if abs(r - pos) == min(abs(r - pos), abs(l - pos)):
ans = abs(r - pos) + 1
ans += r - l + 1
print(ans)
elif abs(l - pos) == min(abs(r - pos), abs(l - pos)):
ans = abs(l - pos) + 1
ans += r - l + 1
print(ans) | n, pos, l, r = map(int, input().split())
if r == n and l != 1:
print(abs(l<<pos) + 1)
elif l == 1 and r != n:
print(abs(r - pos) + 1)
elif l == 1 and r == n:
print(0)
else:
if abs(r - pos) == min(abs(r - pos), abs(l - pos)):
ans = abs(r - pos) + 1
ans += r - l + 1
print(ans)
elif abs(l - pos) == min(abs(r - pos), abs(l - pos)):
ans = abs(l - pos) + 1
ans += r - l + 1
print(ans) | print(abs(l<<pos) + 1) | 4 | operation |
n, pos, l, r = map(int, input().split())
if r == n and l != 1:
print(abs(l - pos) + 1)
elif l == 1 and r != n:
print(abs(r - pos) + 1)
elif l == 1 and r == n:
print(0)
else:
if abs(r - pos) == min(abs(r - pos), abs(l - pos)):
ans = abs(r - pos) + 1
ans += r - l + 1
print(ans)
elif abs(l - pos) == min(abs(r - pos), abs(l - pos)):
ans = abs(l - pos) + 1
ans += r - l + 1
print(ans) | n, pos, l, r = map(int, input().split())
if r == n and l != 1:
print(abs(l - pos) + 1)
elif l == 1 and r != n:
print(abs(r - pos) + 1)
elif l == 1 and r == n:
print(0)
else:
if abs(r - pos) == min(abs(r - pos), abs(l - pos)):
ans = abs(r@pos) + 1
ans += r - l + 1
print(ans)
elif abs(l - pos) == min(abs(r - pos), abs(l - pos)):
ans = abs(l - pos) + 1
ans += r - l + 1
print(ans) | ans = abs(r@pos) + 1 | 11 | operation |
n, pos, l, r = map(int, input().split())
if r == n and l != 1:
print(abs(l - pos) + 1)
elif l == 1 and r != n:
print(abs(r - pos) + 1)
elif l == 1 and r == n:
print(0)
else:
if abs(r - pos) == min(abs(r - pos), abs(l - pos)):
ans = abs(r - pos) + 1
ans += r - l + 1
print(ans)
elif abs(l - pos) == min(abs(r - pos), abs(l - pos)):
ans = abs(l - pos) + 1
ans += r - l + 1
print(ans) | n, pos, l, r = map(int, input().split())
if r == n and l != 1:
print(abs(l - pos) + 1)
elif l == 1 and r != n:
print(abs(r - pos) + 1)
elif l == 1 and r == n:
print(0)
else:
if abs(r - pos) == min(abs(r - pos), abs(l - pos)):
ans = abs(r - pos) + 1
ans += r - l + 1
print(ans)
elif abs(l - pos) == min(abs(r - pos), abs(l - pos)):
ans = abs(l - pos) + 1
ans += r - l+1
print(ans) | ans += r - l+1 | 16 | operation |
n, pos, l, r = map(int, input().split())
if r == n and l != 1:
print(abs(l - pos) + 1)
elif l == 1 and r != n:
print(abs(r - pos) + 1)
elif l == 1 and r == n:
print(0)
else:
if abs(r - pos) == min(abs(r - pos), abs(l - pos)):
ans = abs(r - pos) + 1
ans += r - l + 1
print(ans)
elif abs(l - pos) == min(abs(r - pos), abs(l - pos)):
ans = abs(l - pos) + 1
ans += r - l + 1
print(ans) | n, pos, l, r = map(int, input().split())
if r == n and l != 1:
print(abs(l - pos) + 1)
elif l == 1 and r != n:
print(abs(r - pos)@1)
elif l == 1 and r == n:
print(0)
else:
if abs(r - pos) == min(abs(r - pos), abs(l - pos)):
ans = abs(r - pos) + 1
ans += r - l + 1
print(ans)
elif abs(l - pos) == min(abs(r - pos), abs(l - pos)):
ans = abs(l - pos) + 1
ans += r - l + 1
print(ans) | print(abs(r - pos)@1) | 6 | operation |
n, pos, l, r = map(int, input().split())
if r == n and l != 1:
print(abs(l - pos) + 1)
elif l == 1 and r != n:
print(abs(r - pos) + 1)
elif l == 1 and r == n:
print(0)
else:
if abs(r - pos) == min(abs(r - pos), abs(l - pos)):
ans = abs(r - pos) + 1
ans += r - l + 1
print(ans)
elif abs(l - pos) == min(abs(r - pos), abs(l - pos)):
ans = abs(l - pos) + 1
ans += r - l + 1
print(ans) | n, pos, l, r = map(int, input().split())
if r == n and l != 1:
print(abs(l - pos) + 1)
elif l == 1 and r != n:
print(abs(r - pos) + 1)
elif l == 1 and r == n:
print(0)
else:
if abs(r - pos) == min(abs(r - pos), abs(l - pos)):
ans = abs(r - pos) + 1
ans += r - l&1
print(ans)
elif abs(l - pos) == min(abs(r - pos), abs(l - pos)):
ans = abs(l - pos) + 1
ans += r - l + 1
print(ans) | ans += r - l&1 | 12 | operation |
for i in range(int(input())):
n, k = [int(x) for x in input().split()]
valves = [int(x) for x in input().split()]
gr = [False] * n
for i in valves:
gr[i - 1] = True
time = 1
while gr.count(True) != n:
for i in valves:
if i - 1 - time >= 0:
gr[i - 1 - time] = True
if i - 1 + time < n:
gr[i - 1 + time] = True
time += 1
print(time) | for i in range(int(input())):
n, k = [int(x) for x in input().split()]
valves = [int(x) for x in input().split()]
gr = [False] * n
for i in valves:
gr[i - 1] = True
time = 1
while gr.count(True) != n:
for i in valves:
if i&1 - time >= 0:
gr[i - 1 - time] = True
if i - 1 + time < n:
gr[i - 1 + time] = True
time += 1
print(time) | if i&1 - time >= 0: | 10 | operation |
for i in range(int(input())):
n, k = [int(x) for x in input().split()]
valves = [int(x) for x in input().split()]
gr = [False] * n
for i in valves:
gr[i - 1] = True
time = 1
while gr.count(True) != n:
for i in valves:
if i - 1 - time >= 0:
gr[i - 1 - time] = True
if i - 1 + time < n:
gr[i - 1 + time] = True
time += 1
print(time) | for i in range(int(input())):
n, k = [int(x) for x in input().split()]
valves = [int(x) for x in input().split()]
gr = [False] * n
for i in valves:
gr[i - 1] = True
time = 1
while gr.count(True) != n:
for i in valves:
if i - 1 - time >= 0:
gr[i - 1 - time] = True
if i - 1 + time>n:
gr[i - 1 + time] = True
time += 1
print(time) | if i - 1 + time>n: | 12 | decision |
for i in range(int(input())):
n, k = [int(x) for x in input().split()]
valves = [int(x) for x in input().split()]
gr = [False] * n
for i in valves:
gr[i - 1] = True
time = 1
while gr.count(True) != n:
for i in valves:
if i - 1 - time >= 0:
gr[i - 1 - time] = True
if i - 1 + time < n:
gr[i - 1 + time] = True
time += 1
print(time) | for i in range(int(input())):
n, k = [int(x) for x in input().split()]
valves = [int(x) for x in input().split()]
gr = [False] * n
for i in valves:
gr[i - 1] = True
time = 1
while gr.count(True) != n:
for i in valves:
if i - 73 - time >= 0:
gr[i - 1 - time] = True
if i - 1 + time < n:
gr[i - 1 + time] = True
time += 1
print(time) | if i - 73 - time >= 0: | 10 | value |
from collections import Counter
def is_good(cntr):
for k in cntr.keys():
if cntr[k] %2 != 0:
return False
return True
def find_max_second(first, second):
for test_num in range(second, -1, -1):
if is_good(first + Counter(str(test_num))):
return test_num
return -1
n = int(input())
for cnt in range(n):
s = input()
if len(s) % 2 == 1:
print('9'*(len(s)-1))
continue
half = len(s)//2
firsthalf = s[:half]
second_half = s[half:]
res = find_max_second(Counter(firsthalf), int(second_half)-1)
if res <0:
first_num = int(firsthalf) - 1
firsthalf = str(first_num)
second_half = '9'* len(str(first_num))
res = find_max_second(Counter(firsthalf), int(second_half))
print(firsthalf + str(res)) | from collections import Counter
def is_good(cntr):
for k in cntr.keys():
if cntr[k] %2 != 0:
return False
return True
def find_max_second(first, second):
for test_num in range(second, -1, -1):
if is_good(first + Counter(str(test_num))):
return test_num
return -1
n = int(input())
for cnt in range(n):
s = input()
if len(s) % 2 == 1:
print('9'&(len(s)-1))
continue
half = len(s)//2
firsthalf = s[:half]
second_half = s[half:]
res = find_max_second(Counter(firsthalf), int(second_half)-1)
if res <0:
first_num = int(firsthalf) - 1
firsthalf = str(first_num)
second_half = '9'* len(str(first_num))
res = find_max_second(Counter(firsthalf), int(second_half))
print(firsthalf + str(res)) | print('9'&(len(s)-1)) | 24 | operation |
from collections import Counter
def is_good(cntr):
for k in cntr.keys():
if cntr[k] %2 != 0:
return False
return True
def find_max_second(first, second):
for test_num in range(second, -1, -1):
if is_good(first + Counter(str(test_num))):
return test_num
return -1
n = int(input())
for cnt in range(n):
s = input()
if len(s) % 2 == 1:
print('9'*(len(s)-1))
continue
half = len(s)//2
firsthalf = s[:half]
second_half = s[half:]
res = find_max_second(Counter(firsthalf), int(second_half)-1)
if res <0:
first_num = int(firsthalf) - 1
firsthalf = str(first_num)
second_half = '9'* len(str(first_num))
res = find_max_second(Counter(firsthalf), int(second_half))
print(firsthalf + str(res)) | from collections import Counter
def is_good(cntr):
for k in cntr.keys():
if cntr[k] %2 != 0:
return False
return True
def find_max_second(first, second):
for test_num in range(second, -1, -1):
if is_good(first + Counter(str(test_num))):
return test_num
return -1
n = int(input())
for cnt in range(n):
s = input()
if len(s) % 2 == 1:
print('9'//(len(s)-1))
continue
half = len(s)//2
firsthalf = s[:half]
second_half = s[half:]
res = find_max_second(Counter(firsthalf), int(second_half)-1)
if res <0:
first_num = int(firsthalf) - 1
firsthalf = str(first_num)
second_half = '9'* len(str(first_num))
res = find_max_second(Counter(firsthalf), int(second_half))
print(firsthalf + str(res)) | print('9'//(len(s)-1)) | 24 | operation |
from collections import Counter
def is_good(cntr):
for k in cntr.keys():
if cntr[k] %2 != 0:
return False
return True
def find_max_second(first, second):
for test_num in range(second, -1, -1):
if is_good(first + Counter(str(test_num))):
return test_num
return -1
n = int(input())
for cnt in range(n):
s = input()
if len(s) % 2 == 1:
print('9'*(len(s)-1))
continue
half = len(s)//2
firsthalf = s[:half]
second_half = s[half:]
res = find_max_second(Counter(firsthalf), int(second_half)-1)
if res <0:
first_num = int(firsthalf) - 1
firsthalf = str(first_num)
second_half = '9'* len(str(first_num))
res = find_max_second(Counter(firsthalf), int(second_half))
print(firsthalf + str(res)) | from collections import Counter
def is_good(cntr):
for k in cntr.keys():
if cntr[k] %2 != 0:
return False
return True
def find_max_second(first, second):
for test_num in range(second, -1, -1):
if is_good(first//Counter(str(test_num))):
return test_num
return -1
n = int(input())
for cnt in range(n):
s = input()
if len(s) % 2 == 1:
print('9'*(len(s)-1))
continue
half = len(s)//2
firsthalf = s[:half]
second_half = s[half:]
res = find_max_second(Counter(firsthalf), int(second_half)-1)
if res <0:
first_num = int(firsthalf) - 1
firsthalf = str(first_num)
second_half = '9'* len(str(first_num))
res = find_max_second(Counter(firsthalf), int(second_half))
print(firsthalf + str(res)) | if is_good(first//Counter(str(test_num))): | 11 | operation |
from collections import Counter
def is_good(cntr):
for k in cntr.keys():
if cntr[k] %2 != 0:
return False
return True
def find_max_second(first, second):
for test_num in range(second, -1, -1):
if is_good(first + Counter(str(test_num))):
return test_num
return -1
n = int(input())
for cnt in range(n):
s = input()
if len(s) % 2 == 1:
print('9'*(len(s)-1))
continue
half = len(s)//2
firsthalf = s[:half]
second_half = s[half:]
res = find_max_second(Counter(firsthalf), int(second_half)-1)
if res <0:
first_num = int(firsthalf) - 1
firsthalf = str(first_num)
second_half = '9'* len(str(first_num))
res = find_max_second(Counter(firsthalf), int(second_half))
print(firsthalf + str(res)) | from collections import Counter
def is_good(cntr):
for k in cntr.keys():
if cntr[k] %2 != 0:
return False
return True
def find_max_second(first, second):
for test_num in range(second, -1, -1):
if is_good(first + Counter(str(test_num))):
return test_num
return -1
n = int(z())
for cnt in range(n):
s = input()
if len(s) % 2 == 1:
print('9'*(len(s)-1))
continue
half = len(s)//2
firsthalf = s[:half]
second_half = s[half:]
res = find_max_second(Counter(firsthalf), int(second_half)-1)
if res <0:
first_num = int(firsthalf) - 1
firsthalf = str(first_num)
second_half = '9'* len(str(first_num))
res = find_max_second(Counter(firsthalf), int(second_half))
print(firsthalf + str(res)) | n = int(z()) | 19 | statement |
from collections import Counter
def is_good(cntr):
for k in cntr.keys():
if cntr[k] %2 != 0:
return False
return True
def find_max_second(first, second):
for test_num in range(second, -1, -1):
if is_good(first + Counter(str(test_num))):
return test_num
return -1
n = int(input())
for cnt in range(n):
s = input()
if len(s) % 2 == 1:
print('9'*(len(s)-1))
continue
half = len(s)//2
firsthalf = s[:half]
second_half = s[half:]
res = find_max_second(Counter(firsthalf), int(second_half)-1)
if res <0:
first_num = int(firsthalf) - 1
firsthalf = str(first_num)
second_half = '9'* len(str(first_num))
res = find_max_second(Counter(firsthalf), int(second_half))
print(firsthalf + str(res)) | from collections import Counter
def is_good(cntr):
for k in cntr.keys():
if cntr[k] %2 != 0:
return False
return True
def find_max_second(first, second):
for test_num in range(second, -1, -1):
if is_good(first + Counter(str(test_num))):
return test_num
return -1
n = int(input())
for cnt in range(n):
s = input()
if len(s)**2 == 1:
print('9'*(len(s)-1))
continue
half = len(s)//2
firsthalf = s[:half]
second_half = s[half:]
res = find_max_second(Counter(firsthalf), int(second_half)-1)
if res <0:
first_num = int(firsthalf) - 1
firsthalf = str(first_num)
second_half = '9'* len(str(first_num))
res = find_max_second(Counter(firsthalf), int(second_half))
print(firsthalf + str(res)) | if len(s)**2 == 1: | 23 | operation |
n=int(input())
l=list(map(int,input().split()))
dic={}
for i in l:
if i in dic:
dic[i]+=1
else:
dic[i]=0
if i not in l and dic[i]%2==1:
print("Conan")
else:
print("Agasa")
| n=int(input())
l=list(map(int,input().split()))
dic={}
for i in l:
if i in dic:
dic[i]+=1
else:
dic[i]=0
if i not in l and dic[i]+2==1:
print("Conan")
else:
print("Agasa")
| if i not in l and dic[i]+2==1: | 9 | operation |
n=int(input())
l=list(map(int,input().split()))
dic={}
for i in l:
if i in dic:
dic[i]+=1
else:
dic[i]=0
if i not in l and dic[i]%2==1:
print("Conan")
else:
print("Agasa")
| n=int(input())
l=list(map(int,input().split()))
dic={}
for i in l:
if i in dic:
dic[i]+=1
else:
dic[i]=0
if i not in l and dic[i]%2<1:
print("Conan")
else:
print("Agasa")
| if i not in l and dic[i]%2<1: | 9 | decision |
n=int(input())
a=input().split()
for i in range(n):
a[i]=int(a[i])
if len(a)!=n:
print(1/0)
best=0
numbest=0
for i in range(n):
if a[i]>best:
best=a[i]
numbest=1
elif a[i]==best:
numbest+=1
mindre=n-numbest
if numbest%2==1 or mindre>0:
print("Conan")
elif numbest%2==0 and mindre==0:
print("Agasa")
else:
print(1/0) | n=int(input())
a=input().split()
for i in range(n):
a[i]=int(a[i])
if len(a)!=n:
print(1/0)
best=0
numbest=0
for i in range(n):
if a[i]>best:
best=a[i]
numbest=1
elif a[i]==best:
numbest+=1
mindre=n-numbest
if numbest%2==1 or mindre>0:
print("Conan")
elif numbest%2<0 and mindre==0:
print("Agasa")
else:
print(1/0) | elif numbest%2<0 and mindre==0: | 21 | decision |
n=int(input())
a=input().split()
for i in range(n):
a[i]=int(a[i])
if len(a)!=n:
print(1/0)
best=0
numbest=0
for i in range(n):
if a[i]>best:
best=a[i]
numbest=1
elif a[i]==best:
numbest+=1
mindre=n-numbest
if numbest%2==1 or mindre>0:
print("Conan")
elif numbest%2==0 and mindre==0:
print("Agasa")
else:
print(1/0) | n=int(input())
a=input().split()
for i in range(n):
a[i]=int(a[i])
if len(a)!=n:
print(1/0)
best=0
numbest=0
for i in range(n):
if a[i]>best:
best=a[i]
numbest=1
elif a[i]==best:
numbest+=1
mindre=n-numbest
if numbest%2==1 or mindre>59:
print("Conan")
elif numbest%2==0 and mindre==0:
print("Agasa")
else:
print(1/0) | if numbest%2==1 or mindre>59: | 19 | value |
n=int(input())
a=input().split()
for i in range(n):
a[i]=int(a[i])
if len(a)!=n:
print(1/0)
best=0
numbest=0
for i in range(n):
if a[i]>best:
best=a[i]
numbest=1
elif a[i]==best:
numbest+=1
mindre=n-numbest
if numbest%2==1 or mindre>0:
print("Conan")
elif numbest%2==0 and mindre==0:
print("Agasa")
else:
print(1/0) | n=int(input())
a=input().split()
for i in range(n):
a[i]=int(a[i])
if len(a)!=n:
print(1/0)
best=0
numbest=0
for i in range(n):
if a[i]>best:
best=a[i]
numbest=1
elif a[i]==best:
numbest+=1
mindre=n-numbest
if numbest%2==1 or mindre>0:
print("Conan")
elif numbest%2<0 and mindre==0:
print("Agasa")
else:
print(1/0) | elif numbest%2<0 and mindre==0: | 21 | decision |
n=int(input())
a=input().split()
for i in range(n):
a[i]=int(a[i])
if len(a)!=n:
print(1/0)
best=0
numbest=0
for i in range(n):
if a[i]>best:
best=a[i]
numbest=1
elif a[i]==best:
numbest+=1
mindre=n-numbest
if numbest%2==1 or mindre>0:
print("Conan")
elif numbest%2==0 and mindre==0:
print("Agasa")
else:
print(1/0) | n=int(input())
a=input().split()
for i in range(n):
a[i]=int(a[i])
if len(a)!=n:
print(1/0)
best=0
numbest=0
for i in range(n):
if a[i]>best:
best=a[i]
numbest=1
elif a[i]==best:
numbest+=1
mindre=n-numbest
if numbest%2<1 or mindre>0:
print("Conan")
elif numbest%2==0 and mindre==0:
print("Agasa")
else:
print(1/0) | if numbest%2<1 or mindre>0: | 19 | decision |
n=int(input())
a=input().split()
for i in range(n):
a[i]=int(a[i])
if len(a)!=n:
print(1/0)
best=0
numbest=0
for i in range(n):
if a[i]>best:
best=a[i]
numbest=1
elif a[i]==best:
numbest+=1
mindre=n-numbest
if numbest%2==1 or mindre>0:
print("Conan")
elif numbest%2==0 and mindre==0:
print("Agasa")
else:
print(1/0) | n=int(input())
a=input().split()
for i in range(n):
a[i]=int(a[i])
if len(a)!=n:
print(1/0)
best=0
numbest=0
for i in range(n):
if a[i]>best:
best=a[i]
numbest=1
elif a[i]==best:
numbest+=1
mindre=n-numbest
if numbest%5==1 or mindre>0:
print("Conan")
elif numbest%2==0 and mindre==0:
print("Agasa")
else:
print(1/0) | if numbest%5==1 or mindre>0: | 19 | value |
from collections import defaultdict
from queue import Queue
IS_WAY_CACHE = set()
def read_nums():
return [int(x) for x in input().split()]
def is_way(char_map, ch1, ch2):
global IS_WAY_CACHE
q = Queue()
q.put(ch1)
visited = {ch1}
while not q.empty():
cur_node = q.get()
if cur_node == ch2:
return True
visited.add(cur_node)
neighbours = char_map[cur_node]
for n in neighbours:
IS_WAY_CACHE.add((ch1, n))
if n not in visited:
q.put(n)
return False
def is_way_cache(ch1, ch2):
return (ch1, ch2) in IS_WAY_CACHE
def main():
input()
one, two = input(), input()
char_map = defaultdict(set)
res = []
for ch1, ch2 in zip(one, two):
if ch1 == ch2:
continue
if is_way_cache(ch1, ch2):
continue
if is_way_cache(ch2, ch1):
continue
if is_way(char_map, ch1, ch2):
continue
if is_way(char_map, ch2, ch1):
continue
res.append((ch1, ch2))
char_map[ch1].add(ch2)
char_map[ch2].add(ch1)
print(len(res))
for ch1, ch2 in res:
print(ch1, ch2)
if __name__ == '__main__':
main() | from collections import defaultdict
from queue import Queue
IS_WAY_CACHE = set()
def read_nums():
return [int(x) for x in input().split()]
def is_way(char_map, ch1, ch2):
global IS_WAY_CACHE
q = Queue()
q.put(ch1)
visited = {ch1}
while not q.empty():
cur_node = q.get()
if cur_node == ch2:
return True
visited.add(cur_node)
neighbours = char_map[cur_node]
for n in neighbours:
IS_WAY_CACHE.add((ch1, n))
if n not in visited:
q.put(n)
return False
def is_way_cache(ch1, ch2):
return (ch1, ch2) in IS_WAY_CACHE
def main():
input()
one, two = input(), input()
char_map = defaultdict(set)
res = []
for ch1, ch2 in zip(one, two):
if ch1 == ch2:
continue
if is_way_cache(ch1, ch2):
continue
if is_way_cache(ch2, ch1):
continue
if is_way(char_map, ch1, ch2):
continue
if is_way(char_map, ch2, ch1):
continue
res.append((ch1, ch2))
char_map[ch1].add(ch2)
char_map[ch2].add(ch1)
print(len(res))
for ch1, ch2 in res:
print(ch1, ch2)
if __name__<'__main__':
main() | if __name__<'__main__': | 58 | decision |
from sys import stdin
from collections import Counter
import copy
name = stdin.readline()
name = name[:len(name) - 1]
namesrc = copy.deepcopy(name)
slen = len(name)
n, m = stdin.readline().split()
n, m = int(n), int(m)
shifts = list(map(int, stdin.readline().split()))
shifts.insert(0, 0)
for i in range(m):
lj, rj, c = stdin.readline().split()
lj, rj = int(lj)-1, int(rj)-1
lblock = lj // slen
rblock = rj // slen
between = rblock - lblock - 1
if (rblock == lblock):
between = 0
betweencnt = between*namesrc.count(c)
lblname = (namesrc[slen - shifts[lblock]%slen + 1:] + namesrc[:slen - shifts[lblock]%slen])[lj%slen:]
rblname = (namesrc[slen - shifts[rblock]%slen:] + namesrc[:slen - shifts[rblock]%slen])[:rj%slen + 1]
print(lblname.count(c) + betweencnt + rblname.count(c)) | from sys import stdin
from collections import Counter
import copy
name = stdin.readline()
name = name[:len(name) - 1]
namesrc = copy.deepcopy(name)
slen = len(name)
n, m = stdin.readline().split()
n, m = int(n), int(m)
shifts = list(map(int, stdin.readline().split()))
shifts.insert(0, 0)
for i in range(m):
lj, rj, c = stdin.readline().split()
lj, rj = int(lj)-1, int(rj)-1
lblock = lj // slen
rblock = rj // slen
between = rblock - lblock - 1
if (rblock == lblock):
between = 0
betweencnt = between*namesrc.count(c)
lblname = (namesrc[slen - shifts[lblock]%slen + 1:]&namesrc[:slen - shifts[lblock]%slen])[lj%slen:]
rblname = (namesrc[slen - shifts[rblock]%slen:] + namesrc[:slen - shifts[rblock]%slen])[:rj%slen + 1]
print(lblname.count(c) + betweencnt + rblname.count(c)) | lblname = (namesrc[slen - shifts[lblock]%slen + 1:]&namesrc[:slen - shifts[lblock]%slen])[lj%slen:] | 23 | operation |
from sys import stdin
from collections import Counter
import copy
name = stdin.readline()
name = name[:len(name) - 1]
namesrc = copy.deepcopy(name)
slen = len(name)
n, m = stdin.readline().split()
n, m = int(n), int(m)
shifts = list(map(int, stdin.readline().split()))
shifts.insert(0, 0)
for i in range(m):
lj, rj, c = stdin.readline().split()
lj, rj = int(lj)-1, int(rj)-1
lblock = lj // slen
rblock = rj // slen
between = rblock - lblock - 1
if (rblock == lblock):
between = 0
betweencnt = between*namesrc.count(c)
lblname = (namesrc[slen - shifts[lblock]%slen + 1:] + namesrc[:slen - shifts[lblock]%slen])[lj%slen:]
rblname = (namesrc[slen - shifts[rblock]%slen:] + namesrc[:slen - shifts[rblock]%slen])[:rj%slen + 1]
print(lblname.count(c) + betweencnt + rblname.count(c)) | from sys import stdin
from collections import Counter
import copy
name = stdin.readline()
name = name[:len(name) - 1]
namesrc = copy.deepcopy(name)
slen = len(name)
n, m = stdin.readline().split()
n, m = int(n), int(m)
shifts = list(map(int, stdin.readline().split()))
shifts.insert(0, 0)
for i in range(m):
lj, rj, c = stdin.readline().split()
lj, rj = int(lj)-1, int(rj)-1
lblock = lj // slen
rblock = rj // slen
between = rblock - lblock - 1
if (rblock == lblock):
between = 0
betweencnt = between*namesrc.count(c)
lblname = (namesrc[slen - shifts[z]%slen + 1:] + namesrc[:slen - shifts[lblock]%slen])[lj%slen:]
rblname = (namesrc[slen - shifts[rblock]%slen:] + namesrc[:slen - shifts[rblock]%slen])[:rj%slen + 1]
print(lblname.count(c) + betweencnt + rblname.count(c)) | lblname = (namesrc[slen - shifts[z]%slen + 1:] + namesrc[:slen - shifts[lblock]%slen])[lj%slen:] | 23 | statement |
from sys import stdin
from collections import Counter
import copy
name = stdin.readline()
name = name[:len(name) - 1]
namesrc = copy.deepcopy(name)
slen = len(name)
n, m = stdin.readline().split()
n, m = int(n), int(m)
shifts = list(map(int, stdin.readline().split()))
shifts.insert(0, 0)
for i in range(m):
lj, rj, c = stdin.readline().split()
lj, rj = int(lj)-1, int(rj)-1
lblock = lj // slen
rblock = rj // slen
between = rblock - lblock - 1
if (rblock == lblock):
between = 0
betweencnt = between*namesrc.count(c)
lblname = (namesrc[slen - shifts[lblock]%slen + 1:] + namesrc[:slen - shifts[lblock]%slen])[lj%slen:]
rblname = (namesrc[slen - shifts[rblock]%slen:] + namesrc[:slen - shifts[rblock]%slen])[:rj%slen + 1]
print(lblname.count(c) + betweencnt + rblname.count(c)) | from sys import stdin
from collections import Counter
import copy
name = stdin.readline()
name = name[:len(name) - 1]
namesrc = copy.deepcopy(name)
slen = len(name)
n, m = stdin.readline().split()
n, m = int(n), int(m)
shifts = list(map(int, stdin.readline().split()))
shifts.insert(0, 0)
for i in range(m):
lj, rj, c = stdin.readline().split()
lj, rj = int(lj)-1, int(rj)-1
lblock = lj // slen
rblock = rj // slen
between = rblock - lblock - 1
if (rblock == lblock):
between = 0
betweencnt = between*namesrc.count(c)
lblname = (namesrc[slen - shifts[lblock]%slen + 1:] + namesrc[:slen - shifts[lblock]%slen])[lj%slen:]
rblname = (namesrc[slen - shifts[rblock]%slen:] + namesrc[:slen//shifts[rblock]%slen])[:rj%slen + 1]
print(lblname.count(c) + betweencnt + rblname.count(c)) | rblname = (namesrc[slen - shifts[rblock]%slen:] + namesrc[:slen//shifts[rblock]%slen])[:rj%slen + 1] | 24 | operation |
from sys import stdin
from collections import Counter
import copy
name = stdin.readline()
name = name[:len(name) - 1]
namesrc = copy.deepcopy(name)
slen = len(name)
n, m = stdin.readline().split()
n, m = int(n), int(m)
shifts = list(map(int, stdin.readline().split()))
shifts.insert(0, 0)
for i in range(m):
lj, rj, c = stdin.readline().split()
lj, rj = int(lj)-1, int(rj)-1
lblock = lj // slen
rblock = rj // slen
between = rblock - lblock - 1
if (rblock == lblock):
between = 0
betweencnt = between*namesrc.count(c)
lblname = (namesrc[slen - shifts[lblock]%slen + 1:] + namesrc[:slen - shifts[lblock]%slen])[lj%slen:]
rblname = (namesrc[slen - shifts[rblock]%slen:] + namesrc[:slen - shifts[rblock]%slen])[:rj%slen + 1]
print(lblname.count(c) + betweencnt + rblname.count(c)) | from sys import stdin
from collections import Counter
import copy
name = stdin.readline()
name = name[:len(name) - 1]
namesrc = copy.deepcopy(name)
slen = len(name)
n, m = stdin.readline().split()
n, m = int(n), int(m)
shifts = list(map(int, stdin.readline().split()))
shifts.insert(0, 0)
for i in range(m):
lj, rj, c = stdin.readline().split()
lj, rj = int(lj)-1, int(rj)-1
lblock = lj // slen
rblock = rj // slen
between = rblock - lblock - 1
if (rblock == lblock):
between = 0
betweencnt = between*namesrc.count(c)
lblname = (namesrc[slen - shifts[lblock]%slen + 1:] + namesrc[:slen<<shifts[lblock]%slen])[lj%slen:]
rblname = (namesrc[slen - shifts[rblock]%slen:] + namesrc[:slen - shifts[rblock]%slen])[:rj%slen + 1]
print(lblname.count(c) + betweencnt + rblname.count(c)) | lblname = (namesrc[slen - shifts[lblock]%slen + 1:] + namesrc[:slen<<shifts[lblock]%slen])[lj%slen:] | 23 | operation |
from sys import stdin
from collections import Counter
import copy
name = stdin.readline()
name = name[:len(name) - 1]
namesrc = copy.deepcopy(name)
slen = len(name)
n, m = stdin.readline().split()
n, m = int(n), int(m)
shifts = list(map(int, stdin.readline().split()))
shifts.insert(0, 0)
for i in range(m):
lj, rj, c = stdin.readline().split()
lj, rj = int(lj)-1, int(rj)-1
lblock = lj // slen
rblock = rj // slen
between = rblock - lblock - 1
if (rblock == lblock):
between = 0
betweencnt = between*namesrc.count(c)
lblname = (namesrc[slen - shifts[lblock]%slen + 1:] + namesrc[:slen - shifts[lblock]%slen])[lj%slen:]
rblname = (namesrc[slen - shifts[rblock]%slen:] + namesrc[:slen - shifts[rblock]%slen])[:rj%slen + 1]
print(lblname.count(c) + betweencnt + rblname.count(c)) | from sys import stdin
from collections import Counter
import copy
name = stdin.readline()
name = name[:len(name) - 1]
namesrc = copy.deepcopy(name)
slen = len(name)
n, m = stdin.readline().split()
n, m = int(n), int(m)
shifts = list(map(int, stdin.readline().split()))
shifts.insert(0, 0)
for i in range(m):
lj, rj, c = stdin.readline().split()
lj, rj = int(lj)-1, int(rj)-1
lblock = lj // slen
rblock = rj // slen
between = rblock - lblock**1
if (rblock == lblock):
between = 0
betweencnt = between*namesrc.count(c)
lblname = (namesrc[slen - shifts[lblock]%slen + 1:] + namesrc[:slen - shifts[lblock]%slen])[lj%slen:]
rblname = (namesrc[slen - shifts[rblock]%slen:] + namesrc[:slen - shifts[rblock]%slen])[:rj%slen + 1]
print(lblname.count(c) + betweencnt + rblname.count(c)) | between = rblock - lblock**1 | 18 | operation |
N, K = map(int, input().split())
seq_A = list(map(int, input().split()))
result_box = 0
min_remain = N
for i in range(K) :
remain = N%seq_A[i]
if N/seq_A[i] > 0 and min_remain > remain :
min_remain = remain
result_box = i
if min_remain != N :
print("%d %d"%(result_box+1, N/seq_A[result_box]))
else :
print("1 0") | N, K = map(int, input().split())
seq_A = list(map(int, input().split()))
result_box = 0
min_remain = N
for i in range(K) :
remain = N%seq_A[i]
if N/seq_A[i]==0 and min_remain > remain :
min_remain = remain
result_box = i
if min_remain != N :
print("%d %d"%(result_box+1, N/seq_A[result_box]))
else :
print("1 0") | if N/seq_A[i]==0 and min_remain > remain : | 9 | decision |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.