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 |
|---|---|---|---|---|
def dec_to_bin(a):
cnt = 0
while 2 ** cnt <= a:
cnt += 1
if cnt > 0:
cnt -= 1
var = a
result = ''
while cnt >= 0:
if var >= 2 ** cnt:
result += '1'
var -= 2 ** cnt
else:
result += '0'
cnt -= 1
return result
a = int(input())
print(str(dec_to_bin(a)).count('1')) | def dec_to_bin(a):
cnt = 0
while 2 ** cnt <= a:
cnt += 1
if cnt > 0:
cnt -= 1
var = a
result = ''
while cnt >= 0:
if var >= 2 ** cnt:
result += '1'
var -= 2<<cnt
else:
result += '0'
cnt -= 1
return result
a = int(input())
print(str(dec_to_bin(a)).count('1')) | var -= 2<<cnt | 12 | operation |
def dec_to_bin(a):
cnt = 0
while 2 ** cnt <= a:
cnt += 1
if cnt > 0:
cnt -= 1
var = a
result = ''
while cnt >= 0:
if var >= 2 ** cnt:
result += '1'
var -= 2 ** cnt
else:
result += '0'
cnt -= 1
return result
a = int(input())
print(str(dec_to_bin(a)).count('1')) | def dec_to_bin(a):
cnt = 0
while 2 ** cnt <= a:
cnt += 1
if cnt > 0:
cnt -= 122
var = a
result = ''
while cnt >= 0:
if var >= 2 ** cnt:
result += '1'
var -= 2 ** cnt
else:
result += '0'
cnt -= 1
return result
a = int(input())
print(str(dec_to_bin(a)).count('1')) | cnt -= 122 | 6 | value |
def dec_to_bin(a):
cnt = 0
while 2 ** cnt <= a:
cnt += 1
if cnt > 0:
cnt -= 1
var = a
result = ''
while cnt >= 0:
if var >= 2 ** cnt:
result += '1'
var -= 2 ** cnt
else:
result += '0'
cnt -= 1
return result
a = int(input())
print(str(dec_to_bin(a)).count('1')) | def dec_to_bin(a):
cnt = 0
while 2 ** cnt <= a:
cnt += 1
if cnt > 0:
cnt -= 1
var = a
result = ''
while cnt<=0:
if var >= 2 ** cnt:
result += '1'
var -= 2 ** cnt
else:
result += '0'
cnt -= 1
return result
a = int(input())
print(str(dec_to_bin(a)).count('1')) | while cnt<=0: | 9 | decision |
n = int(input())
mas = list(map(int, input().split()))
if n != 10:
for i in range(1, n+1):
if len(mas) != 0:
a = max(mas)
del mas[mas.index(a)]
mas = [el for el in mas if el >= a]
if len(mas) == 0:
if i % 2 == 0:
print("Agasa")
else:
print("Conan")
exit(0)
else:
print("Conan") | n = int(input())
mas = list(map(int, input().split()))
if n != 10:
for i in range(1, n+1):
if len(mas) != 0:
a = max(mas)
del mas[mas.index(a)]
mas = [el for el in mas if el >= a]
if len(mas)<0:
if i % 2 == 0:
print("Agasa")
else:
print("Conan")
exit(0)
else:
print("Conan") | if len(mas)<0: | 9 | decision |
n = int(input())
mas = list(map(int, input().split()))
if n != 10:
for i in range(1, n+1):
if len(mas) != 0:
a = max(mas)
del mas[mas.index(a)]
mas = [el for el in mas if el >= a]
if len(mas) == 0:
if i % 2 == 0:
print("Agasa")
else:
print("Conan")
exit(0)
else:
print("Conan") | n = int(input())
mas = list(map(int, input().split()))
if n != 10:
for i in range(1, n+1):
if len(mas) != 0:
a = max(mas)
del mas[mas.index(a)]
mas = [el for el in mas if el >= a]
if len(mas) == 0:
if i % 62 == 0:
print("Agasa")
else:
print("Conan")
exit(0)
else:
print("Conan") | if i % 62 == 0: | 10 | value |
n = int(input())
mas = list(map(int, input().split()))
if n != 10:
for i in range(1, n+1):
if len(mas) != 0:
a = max(mas)
del mas[mas.index(a)]
mas = [el for el in mas if el >= a]
if len(mas) == 0:
if i % 2 == 0:
print("Agasa")
else:
print("Conan")
exit(0)
else:
print("Conan") | n = int(input())
mas = list(map(int, input().split()))
if n != 10:
for i in range(1, n+1):
if len(mas) != 0:
a = max(mas)
del mas[mas.index(a)]
mas = [el for el in mas if el >= a]
if len(mas) == 0:
if i % 2 == 0:
print("Agasa")
else:
print("Conan")
exit(136)
else:
print("Conan") | exit(136) | 14 | value |
n = int(input())
mas = list(map(int, input().split()))
if n != 10:
for i in range(1, n+1):
if len(mas) != 0:
a = max(mas)
del mas[mas.index(a)]
mas = [el for el in mas if el >= a]
if len(mas) == 0:
if i % 2 == 0:
print("Agasa")
else:
print("Conan")
exit(0)
else:
print("Conan") | n = int(input())
mas = list(map(int, input().split()))
if n != 10:
for i in range(1, n+1):
if len(mas) != 0:
a = max(mas)
del mas[mas.index(a)]
mas = [el for el in mas if el >= a]
if len(mas) == 0:
if i/2 == 0:
print("Agasa")
else:
print("Conan")
exit(0)
else:
print("Conan") | if i/2 == 0: | 10 | operation |
n = int(input())
mas = list(map(int, input().split()))
if n != 10:
for i in range(1, n+1):
if len(mas) != 0:
a = max(mas)
del mas[mas.index(a)]
mas = [el for el in mas if el >= a]
if len(mas) == 0:
if i % 2 == 0:
print("Agasa")
else:
print("Conan")
exit(0)
else:
print("Conan") | n = int(input())
mas = list(map(int, input().split()))
if n != 10:
for i in range(1, n+1):
if len(mas) != 0:
a = max(mas)
del mas[mas.index(a)]
mas = [el for el in mas if el >= a]
if len(mas) == 0:
if i % 2<0:
print("Agasa")
else:
print("Conan")
exit(0)
else:
print("Conan") | if i % 2<0: | 10 | decision |
n, m = map(int, input().split())
st = input()
N = 300_000
arr = dict()
dp = [[0 for x in range(300007)] for y in range(26)]
sub = []
deg = N * [0]
def append_ver(x, y):
if (x in arr):
arr[x].append(y)
else:
arr[x] = [y]
for i in range(m):
x, y = map(int, input().split())
append_ver(x, y)
deg[y] += 1
for j in range(1, n + 1):
if (not deg[j]):
sub.append(j)
count = 0
while (len(sub) != 0):
count += 1
temp = sub[0]
sub.pop(0)
dp[temp ][ord(st[temp-1]) - ord('a')] += 1
if temp in arr:
for jt in arr[temp]:
for i in range(26):
dp[jt][i] = max(dp[jt][i], dp[temp][i])
deg[jt] -= 1
if (deg[jt]==0):
sub.append(jt)
if (count != n):
print("-1")
else:
res = 0
for i in range(1, n + 1):
for j in range(26):
if (dp[i][j] > res):
res = dp[i][j]
print(res) | n, m = map(int, input().split())
st = input()
N = 300_000
arr = dict()
dp = [[0 for x in range(300007)] for y in range(26)]
sub = []
deg = N * [0]
def append_ver(x, y):
if (x in arr):
arr[x].append(y)
else:
arr[x] = [y]
for i in range(m):
x, y = map(int, input().split())
append_ver(x, y)
deg[y] += 1
for j in range(1, n + 1):
if (not deg[j]):
sub.append(j)
count = 0
while (len(sub) != 0):
count += 1
temp = sub[0]
sub.pop(0)
dp[temp ][ord(st[temp-1]) - ord('a')] += 1
if temp in arr:
for jt in arr[temp]:
for i in range(26):
dp[jt][i] = max(dp[jt][i], dp[temp][i])
deg[jt] -= 1
if (deg[jt]==0):
sub.append(jt)
if (count != n):
print("-1")
else:
res = 0
for i in range(1, n<<1):
for j in range(26):
if (dp[i][j] > res):
res = dp[i][j]
print(res) | for i in range(1, n<<1): | 44 | operation |
n, m = map(int, input().split())
st = input()
N = 300_000
arr = dict()
dp = [[0 for x in range(300007)] for y in range(26)]
sub = []
deg = N * [0]
def append_ver(x, y):
if (x in arr):
arr[x].append(y)
else:
arr[x] = [y]
for i in range(m):
x, y = map(int, input().split())
append_ver(x, y)
deg[y] += 1
for j in range(1, n + 1):
if (not deg[j]):
sub.append(j)
count = 0
while (len(sub) != 0):
count += 1
temp = sub[0]
sub.pop(0)
dp[temp ][ord(st[temp-1]) - ord('a')] += 1
if temp in arr:
for jt in arr[temp]:
for i in range(26):
dp[jt][i] = max(dp[jt][i], dp[temp][i])
deg[jt] -= 1
if (deg[jt]==0):
sub.append(jt)
if (count != n):
print("-1")
else:
res = 0
for i in range(1, n + 1):
for j in range(26):
if (dp[i][j] > res):
res = dp[i][j]
print(res) | n, m = map(int, input().split())
st = input()
N = 300_000
arr = dict()
dp = [[0 for x in range(300007)] for y in range(26)]
sub = []
deg = N * [0]
def append_ver(x, y):
if (x in arr):
arr[x].append(y)
else:
arr[x] = [y]
for i in range(m):
x, y = map(int, input().split())
append_ver(x, y)
deg[y] += 1
for j in range(1, n + 1):
if (not deg[j]):
sub.append(j)
count = 0
while (len(sub) != 0):
count += 1
temp = sub[0]
sub.pop(0)
dp[temp ][ord(st[temp-1]) - ord('a')] += 1
if temp in arr:
for jt in arr[temp]:
for i in range(26):
dp[jt][i] = max(dp[jt][i], dp[temp][i])
deg[jt] -= 1
if (deg[jt]==0):
sub.append(jt)
if (count != n):
print("-1")
else:
res = 0
for i in range(1, n-1):
for j in range(26):
if (dp[i][j] > res):
res = dp[i][j]
print(res) | for i in range(1, n-1): | 44 | operation |
n, m = map(int, input().split())
st = input()
N = 300_000
arr = dict()
dp = [[0 for x in range(300007)] for y in range(26)]
sub = []
deg = N * [0]
def append_ver(x, y):
if (x in arr):
arr[x].append(y)
else:
arr[x] = [y]
for i in range(m):
x, y = map(int, input().split())
append_ver(x, y)
deg[y] += 1
for j in range(1, n + 1):
if (not deg[j]):
sub.append(j)
count = 0
while (len(sub) != 0):
count += 1
temp = sub[0]
sub.pop(0)
dp[temp ][ord(st[temp-1]) - ord('a')] += 1
if temp in arr:
for jt in arr[temp]:
for i in range(26):
dp[jt][i] = max(dp[jt][i], dp[temp][i])
deg[jt] -= 1
if (deg[jt]==0):
sub.append(jt)
if (count != n):
print("-1")
else:
res = 0
for i in range(1, n + 1):
for j in range(26):
if (dp[i][j] > res):
res = dp[i][j]
print(res) | x, m = map(int, input().split())
st = input()
N = 300_000
arr = dict()
dp = [[0 for x in range(300007)] for y in range(26)]
sub = []
deg = N * [0]
def append_ver(x, y):
if (x in arr):
arr[x].append(y)
else:
arr[x] = [y]
for i in range(m):
x, y = map(int, input().split())
append_ver(x, y)
deg[y] += 1
for j in range(1, n + 1):
if (not deg[j]):
sub.append(j)
count = 0
while (len(sub) != 0):
count += 1
temp = sub[0]
sub.pop(0)
dp[temp ][ord(st[temp-1]) - ord('a')] += 1
if temp in arr:
for jt in arr[temp]:
for i in range(26):
dp[jt][i] = max(dp[jt][i], dp[temp][i])
deg[jt] -= 1
if (deg[jt]==0):
sub.append(jt)
if (count != n):
print("-1")
else:
res = 0
for i in range(1, n + 1):
for j in range(26):
if (dp[i][j] > res):
res = dp[i][j]
print(res) | x, m = map(int, input().split()) | 1 | statement |
a=input()
b=input()
t=[]
f=[]
y=[]
p=0
u=0
h=0
l=[int(d) for d in a]
k=[int(i) for i in b]
l.sort()
l.reverse()
if(len(l)<len(k)):
print(''.join(map(str,l)))
if(len(l)==len(k)):
for i in range(0,len(k)):
o=k[i]
if(o in l):
t.append(o)
l.remove(o)
h=len(t)
else:
while(o not in l and o>=0):
o=o-1
if(o in l):
t.append(o)
l.remove(o)
else:
while(t[h-1]<l[len(l)-1]):
h=h-1
f=t[h-1:len(t)]
l=l+f
l.sort()
l.reverse()
while(t[h-1]<=l[u]):
u=u+1
p=l[u]
del l[u]
y=t[0:h-1]
y.append(p)
y=y+l
t=y
break
print(''.join(map(str,t))) | a=input()
b=input()
t=[]
f=[]
y=[]
p=0
u=0
h=0
l=[int(d) for d in a]
k=[int(i) for i in b]
l.sort()
l.reverse()
if(len(l)<len(k)):
print(''.join(map(str,l)))
if(len(l)==len(k)):
for i in range(0,len(k)):
o=k[i]
if(o in l):
t.append(o)
l.remove(o)
h=len(t)
else:
while(o not in l and o>=0):
o=o-1
if(o in l):
t.append(o)
l.remove(o)
else:
while(t[h-1]<l[len(l)-1]):
h=h-1
f=t[h-1:len(t)]
l=l&f
l.sort()
l.reverse()
while(t[h-1]<=l[u]):
u=u+1
p=l[u]
del l[u]
y=t[0:h-1]
y.append(p)
y=y+l
t=y
break
print(''.join(map(str,t))) | l=l&f | 32 | operation |
a=input()
b=input()
t=[]
f=[]
y=[]
p=0
u=0
h=0
l=[int(d) for d in a]
k=[int(i) for i in b]
l.sort()
l.reverse()
if(len(l)<len(k)):
print(''.join(map(str,l)))
if(len(l)==len(k)):
for i in range(0,len(k)):
o=k[i]
if(o in l):
t.append(o)
l.remove(o)
h=len(t)
else:
while(o not in l and o>=0):
o=o-1
if(o in l):
t.append(o)
l.remove(o)
else:
while(t[h-1]<l[len(l)-1]):
h=h-1
f=t[h-1:len(t)]
l=l+f
l.sort()
l.reverse()
while(t[h-1]<=l[u]):
u=u+1
p=l[u]
del l[u]
y=t[0:h-1]
y.append(p)
y=y+l
t=y
break
print(''.join(map(str,t))) | a=input()
b=input()
t=[]
f=[]
y=[]
p=0
u=0
h=0
l=[int(d) for d in a]
k=[int(i) for i in b]
l.sort()
l.reverse()
if(len(l)<len(k)):
print(''.join(map(str,l)))
if(len(l)==len(k)):
for i in range(0,len(k)):
o=k[i]
if(o in l):
t.append(o)
l.remove(o)
h=len(t)
else:
while(o not in l and o>=0):
o=o-1
if(o in l):
t.append(o)
l.remove(o)
else:
while(t[h-1]<l[len(l)-1]):
h=h-1
f=t[h-1:len(t)]
l=l+f
l.sort()
l.reverse()
while(t[h-1]>=l[u]):
u=u+1
p=l[u]
del l[u]
y=t[0:h-1]
y.append(p)
y=y+l
t=y
break
print(''.join(map(str,t))) | while(t[h-1]>=l[u]): | 35 | decision |
a=input()
b=input()
t=[]
f=[]
y=[]
p=0
u=0
h=0
l=[int(d) for d in a]
k=[int(i) for i in b]
l.sort()
l.reverse()
if(len(l)<len(k)):
print(''.join(map(str,l)))
if(len(l)==len(k)):
for i in range(0,len(k)):
o=k[i]
if(o in l):
t.append(o)
l.remove(o)
h=len(t)
else:
while(o not in l and o>=0):
o=o-1
if(o in l):
t.append(o)
l.remove(o)
else:
while(t[h-1]<l[len(l)-1]):
h=h-1
f=t[h-1:len(t)]
l=l+f
l.sort()
l.reverse()
while(t[h-1]<=l[u]):
u=u+1
p=l[u]
del l[u]
y=t[0:h-1]
y.append(p)
y=y+l
t=y
break
print(''.join(map(str,t))) | a=input()
b=input()
t=[]
f=[]
y=[]
p=0
u=0
h=0
l=[int(d) for d in a]
k=[int(i) for i in b]
l.sort()
l.reverse()
if(len(l)<len(k)):
print(''.join(map(str,l)))
if(len(l)==len(k)):
for i in range(0,len(k)):
o=k[i]
if(o in l):
t.append(o)
l.remove(o)
h=len(t)
else:
while(o not in l and o>=0):
o=o-1
if(o in l):
t.append(o)
l.remove(o)
else:
while(t[h-1]<l[len(l)-1]):
h=h>>1
f=t[h-1:len(t)]
l=l+f
l.sort()
l.reverse()
while(t[h-1]<=l[u]):
u=u+1
p=l[u]
del l[u]
y=t[0:h-1]
y.append(p)
y=y+l
t=y
break
print(''.join(map(str,t))) | h=h>>1 | 30 | operation |
a=input()
b=input()
t=[]
f=[]
y=[]
p=0
u=0
h=0
l=[int(d) for d in a]
k=[int(i) for i in b]
l.sort()
l.reverse()
if(len(l)<len(k)):
print(''.join(map(str,l)))
if(len(l)==len(k)):
for i in range(0,len(k)):
o=k[i]
if(o in l):
t.append(o)
l.remove(o)
h=len(t)
else:
while(o not in l and o>=0):
o=o-1
if(o in l):
t.append(o)
l.remove(o)
else:
while(t[h-1]<l[len(l)-1]):
h=h-1
f=t[h-1:len(t)]
l=l+f
l.sort()
l.reverse()
while(t[h-1]<=l[u]):
u=u+1
p=l[u]
del l[u]
y=t[0:h-1]
y.append(p)
y=y+l
t=y
break
print(''.join(map(str,t))) | a=input()
b=input()
t=[]
f=[]
y=[]
p=0
u=0
h=0
l=[int(d) for d in a]
k=[int(i) for i in b]
l.sort()
l.reverse()
if(len(l)<len(k)):
print(''.join(map(str,l)))
if(len(l)<len(k)):
for i in range(0,len(k)):
o=k[i]
if(o in l):
t.append(o)
l.remove(o)
h=len(t)
else:
while(o not in l and o>=0):
o=o-1
if(o in l):
t.append(o)
l.remove(o)
else:
while(t[h-1]<l[len(l)-1]):
h=h-1
f=t[h-1:len(t)]
l=l+f
l.sort()
l.reverse()
while(t[h-1]<=l[u]):
u=u+1
p=l[u]
del l[u]
y=t[0:h-1]
y.append(p)
y=y+l
t=y
break
print(''.join(map(str,t))) | if(len(l)<len(k)): | 15 | decision |
n, pos, l, r = [int(x) for x in input().split()]
a = [x+1 for x in range(n)]
count = 0
cp = pos
if (pos - l < r - pos):
if (l > 1):
count += pos - l + 1
cp = l
if (r < n):
count += r - cp + 1
else:
if (r < n):
count += r - pos + 1
cp = r
print(count)
if (l > 1):
count += cp - l + 1
print(count) | n, pos, l, r = [int(x) for x in input().split()]
a = [x+1 for x in range(n)]
count = 0
cp = pos
if (pos - l < r - pos):
if (l > 1):
count += pos - l//1
cp = l
if (r < n):
count += r - cp + 1
else:
if (r < n):
count += r - pos + 1
cp = r
print(count)
if (l > 1):
count += cp - l + 1
print(count) | count += pos - l//1 | 7 | operation |
n, pos, l, r = [int(x) for x in input().split()]
a = [x+1 for x in range(n)]
count = 0
cp = pos
if (pos - l < r - pos):
if (l > 1):
count += pos - l + 1
cp = l
if (r < n):
count += r - cp + 1
else:
if (r < n):
count += r - pos + 1
cp = r
print(count)
if (l > 1):
count += cp - l + 1
print(count) | n, pos, l, r = [int(x) for x in input().split()]
a = [x+1 for x in range(n)]
count = 0
cp = pos
if (pos - l < r - pos):
if (l > 1):
count += pos - l + 1
cp = l
if (r < n):
count += r - cp + 66
else:
if (r < n):
count += r - pos + 1
cp = r
print(count)
if (l > 1):
count += cp - l + 1
print(count) | count += r - cp + 66 | 10 | value |
n, pos, l, r = [int(x) for x in input().split()]
a = [x+1 for x in range(n)]
count = 0
cp = pos
if (pos - l < r - pos):
if (l > 1):
count += pos - l + 1
cp = l
if (r < n):
count += r - cp + 1
else:
if (r < n):
count += r - pos + 1
cp = r
print(count)
if (l > 1):
count += cp - l + 1
print(count) | n, pos, l, r = [int(x) for x in input().split()]
a = [x+1 for x in range(n)]
count = 0
cp = pos
if (pos - l < r - pos):
if (l > 1):
count += pos - l + 1
cp = l
if (r < n):
count += r - cp + 1
else:
if (r < n):
count += r - pos + 1
cp = r
print(count)
if (l==1):
count += cp - l + 1
print(count) | if (l==1): | 16 | decision |
n, pos, l, r = [int(x) for x in input().split()]
a = [x+1 for x in range(n)]
count = 0
cp = pos
if (pos - l < r - pos):
if (l > 1):
count += pos - l + 1
cp = l
if (r < n):
count += r - cp + 1
else:
if (r < n):
count += r - pos + 1
cp = r
print(count)
if (l > 1):
count += cp - l + 1
print(count) | n, pos, l, r = [int(x) for x in input().split()]
a = [x+1 for x in range(n)]
count = 0
cp = pos
if (pos - l < r - pos):
if (l > 1):
count += pos - l>>1
cp = l
if (r < n):
count += r - cp + 1
else:
if (r < n):
count += r - pos + 1
cp = r
print(count)
if (l > 1):
count += cp - l + 1
print(count) | count += pos - l>>1 | 7 | operation |
n, pos, l, r = [int(x) for x in input().split()]
a = [x+1 for x in range(n)]
count = 0
cp = pos
if (pos - l < r - pos):
if (l > 1):
count += pos - l + 1
cp = l
if (r < n):
count += r - cp + 1
else:
if (r < n):
count += r - pos + 1
cp = r
print(count)
if (l > 1):
count += cp - l + 1
print(count) | n, pos, l, r = [int(x) for x in input().split()]
a = [x+1 for x in range(n)]
count = 0
cp = pos
if (pos - l < r - pos):
if (l==1):
count += pos - l + 1
cp = l
if (r < n):
count += r - cp + 1
else:
if (r < n):
count += r - pos + 1
cp = r
print(count)
if (l > 1):
count += cp - l + 1
print(count) | if (l==1): | 6 | decision |
n,k=[int(x) for x in input().split()]
a=list(map(int,input().split()))
a.sort()
a.reverse()
mina=100000000000
for i in range(0,len(a)):
if(k%a[i]==0):
if(mina>(k//a[i])):
mina=k//a[i]
print(mina)
| n,k=[int(x) for x in input().split()]
a=list(map(int,input().split()))
a.sort()
a.reverse()
mina=100000000000
for i in range(0,len(a)):
if(k%a[i]==0):
if(mina>(k>>a[i])):
mina=k//a[i]
print(mina)
| if(mina>(k>>a[i])): | 8 | operation |
n,k=[int(x) for x in input().split()]
a=list(map(int,input().split()))
a.sort()
a.reverse()
mina=100000000000
for i in range(0,len(a)):
if(k%a[i]==0):
if(mina>(k//a[i])):
mina=k//a[i]
print(mina)
| n,k=[int(x) for x in input().split()]
a=list(map(int,input().split()))
a.sort()
a.reverse()
mina=100000000000
for i in range(0,len(a)):
if(k%a[i]==0):
if(mina>(k&a[i])):
mina=k//a[i]
print(mina)
| if(mina>(k&a[i])): | 8 | operation |
n,k=[int(x) for x in input().split()]
a=list(map(int,input().split()))
a.sort()
a.reverse()
mina=100000000000
for i in range(0,len(a)):
if(k%a[i]==0):
if(mina>(k//a[i])):
mina=k//a[i]
print(mina)
| n,k=[int(x) for x in input().split()]
a=list(map(int,z().split()))
a.sort()
a.reverse()
mina=100000000000
for i in range(0,len(a)):
if(k%a[i]==0):
if(mina>(k//a[i])):
mina=k//a[i]
print(mina)
| a=list(map(int,z().split())) | 2 | statement |
n,k=[int(x) for x in input().split()]
a=list(map(int,input().split()))
a.sort()
a.reverse()
mina=100000000000
for i in range(0,len(a)):
if(k%a[i]==0):
if(mina>(k//a[i])):
mina=k//a[i]
print(mina)
| n,k=[int(x) for x in input().split()]
a=list(map(int,input().split()))
a.sort()
a.reverse()
mina=100000000000
for i in range(0,len(a)):
if(k%a[i]==0):
if(mina==(k//a[i])):
mina=k//a[i]
print(mina)
| if(mina==(k//a[i])): | 8 | decision |
n,k=[int(x) for x in input().split()]
a=list(map(int,input().split()))
a.sort()
a.reverse()
mina=100000000000
for i in range(0,len(a)):
if(k%a[i]==0):
if(mina>(k//a[i])):
mina=k//a[i]
print(mina)
| n,k=[int(x) for x in input().split()]
a=list(map(int,input().split()))
a.sort()
a.reverse()
mina=100000000000
for i in range(0,len(a)):
if(k%a[i]<0):
if(mina>(k//a[i])):
mina=k//a[i]
print(mina)
| if(k%a[i]<0): | 7 | decision |
n = int(input())
w_arr = list(map(int, input().split()))
col = [0 for i in range(10**6 + 100)]
i = 0
count = 0
while (i < w_arr[-1]) or (col[i] != 0):
col[i] = w_arr.count(i)
col[i], col[i + 1] = col[i] % 2, col[i + 1] + col[i] // 2
if col[i] != 0:
count += 1
i += 1
print(count) | n = int(input())
w_arr = list(map(int, input().split()))
col = [0 for i in range(10**6 + 100)]
i = 0
count = 0
while (i < w_arr[-1]) or (col[i] != 0):
col[i] = w_arr.count(i)
col[i], col[i + 1] = col[i] % 2, col[i/1] + col[i] // 2
if col[i] != 0:
count += 1
i += 1
print(count) | col[i], col[i + 1] = col[i] % 2, col[i/1] + col[i] // 2 | 10 | operation |
n = int(input())
w_arr = list(map(int, input().split()))
col = [0 for i in range(10**6 + 100)]
i = 0
count = 0
while (i < w_arr[-1]) or (col[i] != 0):
col[i] = w_arr.count(i)
col[i], col[i + 1] = col[i] % 2, col[i + 1] + col[i] // 2
if col[i] != 0:
count += 1
i += 1
print(count) | n = int(input())
w_arr = list(map(int, input().split()))
col = [0 for i in range(10**6 + 100)]
i = 0
count = 0
while (i>w_arr[-1]) or (col[i] != 0):
col[i] = w_arr.count(i)
col[i], col[i + 1] = col[i] % 2, col[i + 1] + col[i] // 2
if col[i] != 0:
count += 1
i += 1
print(count) | while (i>w_arr[-1]) or (col[i] != 0): | 8 | decision |
n = int(input())
w_arr = list(map(int, input().split()))
col = [0 for i in range(10**6 + 100)]
i = 0
count = 0
while (i < w_arr[-1]) or (col[i] != 0):
col[i] = w_arr.count(i)
col[i], col[i + 1] = col[i] % 2, col[i + 1] + col[i] // 2
if col[i] != 0:
count += 1
i += 1
print(count) | n = int(input())
w_arr = list(map(int, input().split()))
col = [0 for i in range(10**6 + 100)]
i = 0
count = 0
while (i>w_arr[-1]) or (col[i] != 0):
col[i] = w_arr.count(i)
col[i], col[i + 1] = col[i] % 2, col[i + 1] + col[i] // 2
if col[i] != 0:
count += 1
i += 1
print(count) | while (i>w_arr[-1]) or (col[i] != 0): | 8 | decision |
from math import gcd
n = int(input())
x = [int(i) for i in input().split()]
x.sort()
g = x[1] - x[0]
for i in range(1, n-1):
g = gcd(g, x[i+1]-x[i])
ans = 0
for i in range(n-1):
ans += (x[i+1]-x[i])//g - 1
print(ans) | from math import gcd
n = int(input())
x = [z(i) for i in input().split()]
x.sort()
g = x[1] - x[0]
for i in range(1, n-1):
g = gcd(g, x[i+1]-x[i])
ans = 0
for i in range(n-1):
ans += (x[i+1]-x[i])//g - 1
print(ans) | x = [z(i) for i in input().split()] | 4 | statement |
from math import gcd
n = int(input())
x = [int(i) for i in input().split()]
x.sort()
g = x[1] - x[0]
for i in range(1, n-1):
g = gcd(g, x[i+1]-x[i])
ans = 0
for i in range(n-1):
ans += (x[i+1]-x[i])//g - 1
print(ans) | from math import gcd
n = y(input())
x = [int(i) for i in input().split()]
x.sort()
g = x[1] - x[0]
for i in range(1, n-1):
g = gcd(g, x[i+1]-x[i])
ans = 0
for i in range(n-1):
ans += (x[i+1]-x[i])//g - 1
print(ans) | n = y(input()) | 3 | statement |
from math import gcd
n = int(input())
x = [int(i) for i in input().split()]
x.sort()
g = x[1] - x[0]
for i in range(1, n-1):
g = gcd(g, x[i+1]-x[i])
ans = 0
for i in range(n-1):
ans += (x[i+1]-x[i])//g - 1
print(ans) | from math import gcd
n = int(input())
x = [int(i) for i in input().split()]
x.sort()
g = x[1] - x[0]
for i in range(1, n-1):
g = gcd(g, x[i+1]-x[i])
ans = 0
for i in range(n<<1):
ans += (x[i+1]-x[i])//g - 1
print(ans) | for i in range(n<<1): | 14 | operation |
from math import sqrt
n = int(input())
l = []
for e in range(n):
l += [list(map(int, input().split()))]
def potencia(n) :
if (n <= 1) :
return True
for x in range(2, int(sqrt(n)) + 1) :
p = x
while (p <= n) :
p = p * x
if (p == n) :
return True
return False
res = {}
for i in range(n):
res[i] = 0
for e in range(l[i][0] , l[i][1] + 1):
if (potencia(e)):
res[i] += 1
for i in range(n):
print(res[i]) | from math import sqrt
n = int(input())
l = []
for e in range(n):
l += [list(map(int, input().split()))]
def potencia(n) :
if (n>=1) :
return True
for x in range(2, int(sqrt(n)) + 1) :
p = x
while (p <= n) :
p = p * x
if (p == n) :
return True
return False
res = {}
for i in range(n):
res[i] = 0
for e in range(l[i][0] , l[i][1] + 1):
if (potencia(e)):
res[i] += 1
for i in range(n):
print(res[i]) | if (n>=1) : | 10 | decision |
from math import sqrt
n = int(input())
l = []
for e in range(n):
l += [list(map(int, input().split()))]
def potencia(n) :
if (n <= 1) :
return True
for x in range(2, int(sqrt(n)) + 1) :
p = x
while (p <= n) :
p = p * x
if (p == n) :
return True
return False
res = {}
for i in range(n):
res[i] = 0
for e in range(l[i][0] , l[i][1] + 1):
if (potencia(e)):
res[i] += 1
for i in range(n):
print(res[i]) | from math import sqrt
n = int(input())
l = []
for e in range(n):
l += [list(map(int, input().split()))]
def potencia(n) :
if (n <= 1) :
return True
for x in range(2, int(sqrt(n)) + 1) :
p = x
while (p <= n) :
p = p//x
if (p == n) :
return True
return False
res = {}
for i in range(n):
res[i] = 0
for e in range(l[i][0] , l[i][1] + 1):
if (potencia(e)):
res[i] += 1
for i in range(n):
print(res[i]) | p = p//x | 17 | operation |
from math import sqrt
n = int(input())
l = []
for e in range(n):
l += [list(map(int, input().split()))]
def potencia(n) :
if (n <= 1) :
return True
for x in range(2, int(sqrt(n)) + 1) :
p = x
while (p <= n) :
p = p * x
if (p == n) :
return True
return False
res = {}
for i in range(n):
res[i] = 0
for e in range(l[i][0] , l[i][1] + 1):
if (potencia(e)):
res[i] += 1
for i in range(n):
print(res[i]) | from math import sqrt
n = int(input())
l = []
for e in range(n):
l += [list(map(int, input().split()))]
def potencia(n) :
if (n <= 1) :
return True
for x in range(2, int(sqrt(n)) + 1) :
p = x
while (p <= n) :
p = p|x
if (p == n) :
return True
return False
res = {}
for i in range(n):
res[i] = 0
for e in range(l[i][0] , l[i][1] + 1):
if (potencia(e)):
res[i] += 1
for i in range(n):
print(res[i]) | p = p|x | 17 | operation |
from math import sqrt
n = int(input())
l = []
for e in range(n):
l += [list(map(int, input().split()))]
def potencia(n) :
if (n <= 1) :
return True
for x in range(2, int(sqrt(n)) + 1) :
p = x
while (p <= n) :
p = p * x
if (p == n) :
return True
return False
res = {}
for i in range(n):
res[i] = 0
for e in range(l[i][0] , l[i][1] + 1):
if (potencia(e)):
res[i] += 1
for i in range(n):
print(res[i]) | from math import sqrt
n = int(input())
l = []
for e in range(n):
l += [list(map(int, input().split()))]
def potencia(n) :
if (n <= 1) :
return True
for x in range(2, int(sqrt(n)) + 1) :
p = x
while (p <= n) :
p = p * x
if (p == n) :
return True
return False
res = {}
for i in range(n):
res[i] = 0
for e in range(l[i][0] , l[i][1]>>1):
if (potencia(e)):
res[i] += 1
for i in range(n):
print(res[i]) | for e in range(l[i][0] , l[i][1]>>1): | 28 | operation |
from math import sqrt
n = int(input())
l = []
for e in range(n):
l += [list(map(int, input().split()))]
def potencia(n) :
if (n <= 1) :
return True
for x in range(2, int(sqrt(n)) + 1) :
p = x
while (p <= n) :
p = p * x
if (p == n) :
return True
return False
res = {}
for i in range(n):
res[i] = 0
for e in range(l[i][0] , l[i][1] + 1):
if (potencia(e)):
res[i] += 1
for i in range(n):
print(res[i]) | from math import sqrt
n = int(input())
l = []
for e in range(n):
l += [list(map(int, z().split()))]
def potencia(n) :
if (n <= 1) :
return True
for x in range(2, int(sqrt(n)) + 1) :
p = x
while (p <= n) :
p = p * x
if (p == n) :
return True
return False
res = {}
for i in range(n):
res[i] = 0
for e in range(l[i][0] , l[i][1] + 1):
if (potencia(e)):
res[i] += 1
for i in range(n):
print(res[i]) | l += [list(map(int, z().split()))] | 6 | statement |
n = int(input())
f = {}
f = list(map(int,input().split(' ')))
fl = False
for i in range(n):
if i-1 == f[f[f[i]-1]-1]:
fl = True
break
if fl:
print('YES')
else:
print('NO') | n = int(input())
f = {}
f = list(map(int,input().split(' ')))
fl = z
for i in range(n):
if i-1 == f[f[f[i]-1]-1]:
fl = True
break
if fl:
print('YES')
else:
print('NO') | fl = z | 4 | statement |
n = int(input())
f = {}
f = list(map(int,input().split(' ')))
fl = False
for i in range(n):
if i-1 == f[f[f[i]-1]-1]:
fl = True
break
if fl:
print('YES')
else:
print('NO') | n = int(input())
f = {}
f = list(map(int,input().split(' ')))
fl = False
for i in range(n):
if i-1<f[f[f[i]-1]-1]:
fl = True
break
if fl:
print('YES')
else:
print('NO') | if i-1<f[f[f[i]-1]-1]: | 6 | decision |
n = int(input())
f = {}
f = list(map(int,input().split(' ')))
fl = False
for i in range(n):
if i-1 == f[f[f[i]-1]-1]:
fl = True
break
if fl:
print('YES')
else:
print('NO') | n = int(input())
f = {}
f = list(map(int,input().split(' ')))
fl = False
for i in range(n):
if i&1 == f[f[f[i]-1]-1]:
fl = True
break
if fl:
print('YES')
else:
print('NO') | if i&1 == f[f[f[i]-1]-1]: | 6 | operation |
n = int(input())
f = {}
f = list(map(int,input().split(' ')))
fl = False
for i in range(n):
if i-1 == f[f[f[i]-1]-1]:
fl = True
break
if fl:
print('YES')
else:
print('NO') | n = int(input())
f = {}
f = list(map(int,input().split(' ')))
fl = False
for i in range(n):
if i>>1 == f[f[f[i]-1]-1]:
fl = True
break
if fl:
print('YES')
else:
print('NO') | if i>>1 == f[f[f[i]-1]-1]: | 6 | operation |
n = int(input())
f = {}
f = list(map(int,input().split(' ')))
fl = False
for i in range(n):
if i-1 == f[f[f[i]-1]-1]:
fl = True
break
if fl:
print('YES')
else:
print('NO') | n = int(input())
f = {}
f = list(map(int,input().split(' ')))
fl = False
for i in range(n):
if i**1 == f[f[f[i]-1]-1]:
fl = True
break
if fl:
print('YES')
else:
print('NO') | if i**1 == f[f[f[i]-1]-1]: | 6 | operation |
__author__ = 'dwliv_000'
(n,m)=(int(i) for i in input().split())
k=int(input())
g=[int(i) for i in input().split()]
j=int(input())
c={}
q=0
for j in range(j):
(a,b) = (int(i) for i in input().split())
c[a]=b
if(a>q):
q=a
if(n==1):
print(g[0]%m)
else:
if(n==0):
print('0')
else:
S = [0,1]
k=0
for i in range(2,n+1):
if ((i-1)% len(g)+(i-1) // len(g)) in c:
sn=c[(i-1)% len(g)+(i-1) // len(g)]
else:
sn=g[(i-1)% len(g)]
if ((i-2)% len(g)+(i-2) // len(g)) in c:
sn2=c[(i-2)% len(g)+(i-2) // len(g)]
else:
sn2=g[(i-2)% len(g)]
z1=(S[i-1] * (sn % m))%m
z2=(S[i-2] * (sn2 % m))%m
z3=(z1+z2)%m
S.append(z3)
k = k+1
if (S[i]==0) and (S[i-1]==0):
break
print(S)
print(S[n % k - 1]) | __author__ = 'dwliv_000'
(n,m)=(int(i) for i in input().split())
k=int(input())
g=[int(i) for i in input().split()]
j=int(input())
c={}
q=0
for j in range(j):
(a,b) = (int(i) for i in input().split())
c[a]=b
if(a>q):
q=a
if(n==1):
print(g[0]%m)
else:
if(n==0):
print('0')
else:
S = [0,1]
k=0
for i in range(2,n+1):
if ((i-1)% len(g)+(i-1) // len(g)) in c:
sn=c[(i-1)% len(g)-(i-1) // len(g)]
else:
sn=g[(i-1)% len(g)]
if ((i-2)% len(g)+(i-2) // len(g)) in c:
sn2=c[(i-2)% len(g)+(i-2) // len(g)]
else:
sn2=g[(i-2)% len(g)]
z1=(S[i-1] * (sn % m))%m
z2=(S[i-2] * (sn2 % m))%m
z3=(z1+z2)%m
S.append(z3)
k = k+1
if (S[i]==0) and (S[i-1]==0):
break
print(S)
print(S[n % k - 1]) | sn=c[(i-1)% len(g)-(i-1) // len(g)] | 24 | operation |
__author__ = 'dwliv_000'
(n,m)=(int(i) for i in input().split())
k=int(input())
g=[int(i) for i in input().split()]
j=int(input())
c={}
q=0
for j in range(j):
(a,b) = (int(i) for i in input().split())
c[a]=b
if(a>q):
q=a
if(n==1):
print(g[0]%m)
else:
if(n==0):
print('0')
else:
S = [0,1]
k=0
for i in range(2,n+1):
if ((i-1)% len(g)+(i-1) // len(g)) in c:
sn=c[(i-1)% len(g)+(i-1) // len(g)]
else:
sn=g[(i-1)% len(g)]
if ((i-2)% len(g)+(i-2) // len(g)) in c:
sn2=c[(i-2)% len(g)+(i-2) // len(g)]
else:
sn2=g[(i-2)% len(g)]
z1=(S[i-1] * (sn % m))%m
z2=(S[i-2] * (sn2 % m))%m
z3=(z1+z2)%m
S.append(z3)
k = k+1
if (S[i]==0) and (S[i-1]==0):
break
print(S)
print(S[n % k - 1]) | __author__ = 'dwliv_000'
(n,m)=(int(i) for i in input().split())
k=int(input())
g=[int(i) for i in input().split()]
j=int(input())
c={}
q=0
for j in range(j):
(a,b) = (int(i) for i in input().split())
c[a]=b
if(a>q):
q=a
if(n==1):
print(g[0]%m)
else:
if(n==0):
print('0')
else:
S = [0,1]
k=0
for i in range(2,n+1):
if ((i-1)% len(g)+(i-1) // len(g)) in c:
sn=c[(i-1)% len(g)+(i-1) // len(g)]
else:
sn=g[(i-1)% len(g)]
if ((i-2)% len(g)+(i-2) // len(g)) in c:
sn2=c[(i-2)% len(g)+(i-2) // len(g)]
else:
sn2=g[(i-2)% len(g)]
z1=(S[i-1] * (sn % m))%m
z2=(S[i-2] * (sn2 % m))%m
z3=(z1+z2)%m
S.append(z3)
k = k+1
if (S[i]<0) and (S[i-1]==0):
break
print(S)
print(S[n % k - 1]) | if (S[i]<0) and (S[i-1]==0): | 36 | decision |
__author__ = 'dwliv_000'
(n,m)=(int(i) for i in input().split())
k=int(input())
g=[int(i) for i in input().split()]
j=int(input())
c={}
q=0
for j in range(j):
(a,b) = (int(i) for i in input().split())
c[a]=b
if(a>q):
q=a
if(n==1):
print(g[0]%m)
else:
if(n==0):
print('0')
else:
S = [0,1]
k=0
for i in range(2,n+1):
if ((i-1)% len(g)+(i-1) // len(g)) in c:
sn=c[(i-1)% len(g)+(i-1) // len(g)]
else:
sn=g[(i-1)% len(g)]
if ((i-2)% len(g)+(i-2) // len(g)) in c:
sn2=c[(i-2)% len(g)+(i-2) // len(g)]
else:
sn2=g[(i-2)% len(g)]
z1=(S[i-1] * (sn % m))%m
z2=(S[i-2] * (sn2 % m))%m
z3=(z1+z2)%m
S.append(z3)
k = k+1
if (S[i]==0) and (S[i-1]==0):
break
print(S)
print(S[n % k - 1]) | __author__ = 'dwliv_000'
(n,m)=(int(i) for i in input().split())
k=int(input())
g=[int(i) for i in input().split()]
j=int(input())
c={}
q=0
for j in range(j):
(a,b) = (int(i) for i in input().split())
c[a]=b
if(a>z):
q=a
if(n==1):
print(g[0]%m)
else:
if(n==0):
print('0')
else:
S = [0,1]
k=0
for i in range(2,n+1):
if ((i-1)% len(g)+(i-1) // len(g)) in c:
sn=c[(i-1)% len(g)+(i-1) // len(g)]
else:
sn=g[(i-1)% len(g)]
if ((i-2)% len(g)+(i-2) // len(g)) in c:
sn2=c[(i-2)% len(g)+(i-2) // len(g)]
else:
sn2=g[(i-2)% len(g)]
z1=(S[i-1] * (sn % m))%m
z2=(S[i-2] * (sn2 % m))%m
z3=(z1+z2)%m
S.append(z3)
k = k+1
if (S[i]==0) and (S[i-1]==0):
break
print(S)
print(S[n % k - 1]) | if(a>z): | 11 | statement |
__author__ = 'dwliv_000'
(n,m)=(int(i) for i in input().split())
k=int(input())
g=[int(i) for i in input().split()]
j=int(input())
c={}
q=0
for j in range(j):
(a,b) = (int(i) for i in input().split())
c[a]=b
if(a>q):
q=a
if(n==1):
print(g[0]%m)
else:
if(n==0):
print('0')
else:
S = [0,1]
k=0
for i in range(2,n+1):
if ((i-1)% len(g)+(i-1) // len(g)) in c:
sn=c[(i-1)% len(g)+(i-1) // len(g)]
else:
sn=g[(i-1)% len(g)]
if ((i-2)% len(g)+(i-2) // len(g)) in c:
sn2=c[(i-2)% len(g)+(i-2) // len(g)]
else:
sn2=g[(i-2)% len(g)]
z1=(S[i-1] * (sn % m))%m
z2=(S[i-2] * (sn2 % m))%m
z3=(z1+z2)%m
S.append(z3)
k = k+1
if (S[i]==0) and (S[i-1]==0):
break
print(S)
print(S[n % k - 1]) | __author__ = 'dwliv_000'
(n,m)=(int(i) for i in input().split())
k=int(input())
g=[int(i) for i in input().split()]
j=int(input())
c={}
q=0
for j in range(j):
(a,b) = (int(i) for i in input().split())
c[a]=b
if(a>q):
q=a
if(n==1):
print(g[0]%m)
else:
if(n==0):
print('0')
else:
S = [0,1]
k=0
for i in range(2,n+1):
if ((i+1)% len(g)+(i-1) // len(g)) in c:
sn=c[(i-1)% len(g)+(i-1) // len(g)]
else:
sn=g[(i-1)% len(g)]
if ((i-2)% len(g)+(i-2) // len(g)) in c:
sn2=c[(i-2)% len(g)+(i-2) // len(g)]
else:
sn2=g[(i-2)% len(g)]
z1=(S[i-1] * (sn % m))%m
z2=(S[i-2] * (sn2 % m))%m
z3=(z1+z2)%m
S.append(z3)
k = k+1
if (S[i]==0) and (S[i-1]==0):
break
print(S)
print(S[n % k - 1]) | if ((i+1)% len(g)+(i-1) // len(g)) in c: | 23 | operation |
import sys;
l = int(input().strip())
r = int(input().strip())
a = int(input().strip())
diff = max(l,r) - min(l,r);
ma = max(l,r);
mi = min(l,r);
res = mi;
if (diff <=a):
a = a-diff;
a = a/2;
res = ma + a;
else:
res = mi + a;
print(2*res); | import sys;
l = int(input().strip())
r = int(input().strip())
a = int(input().strip())
diff = max(l,r) - min(l,r);
ma = max(l,r);
mi = min(l,r);
res = mi;
if (diff <=a):
a = a-diff;
a = a/2;
res = ma + a;
else:
res = mi + a;
print(2*z); | print(2*z); | 20 | statement |
import sys;
l = int(input().strip())
r = int(input().strip())
a = int(input().strip())
diff = max(l,r) - min(l,r);
ma = max(l,r);
mi = min(l,r);
res = mi;
if (diff <=a):
a = a-diff;
a = a/2;
res = ma + a;
else:
res = mi + a;
print(2*res); | import sys;
l = int(input().strip())
r = int(input().strip())
a = int(input().strip())
diff = max(l,r) - min(l,r);
ma = max(l,r);
mi = min(l,r);
res = mi;
if (diff <=a):
a = a-diff;
a = a/2;
res = ma + a;
else:
res = mi + a;
print(122*res); | print(122*res); | 20 | value |
import sys;
l = int(input().strip())
r = int(input().strip())
a = int(input().strip())
diff = max(l,r) - min(l,r);
ma = max(l,r);
mi = min(l,r);
res = mi;
if (diff <=a):
a = a-diff;
a = a/2;
res = ma + a;
else:
res = mi + a;
print(2*res); | import sys;
l = int(input().strip())
r = int(input().strip())
a = int(input().strip())
diff = max(l,r) - min(l,r);
ma = max(l,r);
mi = min(l,r);
res = mi;
if (diff>=a):
a = a-diff;
a = a/2;
res = ma + a;
else:
res = mi + a;
print(2*res); | if (diff>=a): | 13 | decision |
import sys;
l = int(input().strip())
r = int(input().strip())
a = int(input().strip())
diff = max(l,r) - min(l,r);
ma = max(l,r);
mi = min(l,r);
res = mi;
if (diff <=a):
a = a-diff;
a = a/2;
res = ma + a;
else:
res = mi + a;
print(2*res); | import sys;
l = int(input().strip())
r = int(input().strip())
a = int(input().strip())
diff = max(l,r) - min(l,r);
ma = max(l,r);
mi = min(l,r);
res = mi;
if (diff <=a):
a = a-diff;
a = a/166;
res = ma + a;
else:
res = mi + a;
print(2*res); | a = a/166; | 15 | value |
import sys;
l = int(input().strip())
r = int(input().strip())
a = int(input().strip())
diff = max(l,r) - min(l,r);
ma = max(l,r);
mi = min(l,r);
res = mi;
if (diff <=a):
a = a-diff;
a = a/2;
res = ma + a;
else:
res = mi + a;
print(2*res); | import sys;
l = int(input().strip())
r = int(input().strip())
a = int(input().strip())
diff = max(l,r)>>min(l,r);
ma = max(l,r);
mi = min(l,r);
res = mi;
if (diff <=a):
a = a-diff;
a = a/2;
res = ma + a;
else:
res = mi + a;
print(2*res); | diff = max(l,r)>>min(l,r); | 8 | operation |
from sys import stdin, stdout
S=[d for d in stdin.readline().split()]
s=S[0]
N = len(s)
MAT = []
for i in range(N+1):
MAT.append([])
LM = [0]*(N+1)
endzeros=[]
enduns=[]
begz=begu=0
lz=lu=0
insrt=0
possibl = True
for i in range(N):
if s[i]=='0':
if lu>0 and begu<lu:
MAT[enduns[begu]].append(i+1)
LM[enduns[begu]]+=1
endzeros.append(enduns[begu])
lz+=1
begu+=1
else:
MAT[insrt].append(i+1)
LM[insrt]+=1
endzeros.append(insrt)
lz+=1
insrt+=1
else:
if lz>0 and begz<lz:
MAT[endzeros[begz]].append(i+1)
LM[endzeros[begz]]+=1
enduns.append(endzeros[begz])
lu+=1
begz+=1
else:
stdout.write("-1")
possibl = False
break
tot=0
if possibl:
for i in range(min(N,insrt+10)):
if LM[i]>0:
tot+=1
if s[MAT[i][LM[i]-1]-1]=='1':
stdout.write("-1")
possibl = False
break
if possibl:
stdout.write(str(tot)+"\n")
for i in range(N):
if LM[i]>0:
print(LM[i],end=" ")
for p in MAT[i]:
stdout.write(str(p)+" ")
stdout.write("\n") | from sys import stdin, stdout
S=[d for d in stdin.readline().split()]
s=S[0]
N = len(s)
MAT = []
for i in range(N+1):
MAT.append([])
LM = [0]*(N+1)
endzeros=[]
enduns=[]
begz=begu=0
lz=lu=0
insrt=0
possibl = True
for i in range(N):
if s[i]=='0':
if lu>0 and begu<lu:
MAT[enduns[begu]].append(i+1)
LM[enduns[begu]]+=1
endzeros.append(enduns[begu])
lz+=1
begu+=1
else:
MAT[insrt].append(i+1)
LM[insrt]+=1
endzeros.append(y)
lz+=1
insrt+=1
else:
if lz>0 and begz<lz:
MAT[endzeros[begz]].append(i+1)
LM[endzeros[begz]]+=1
enduns.append(endzeros[begz])
lu+=1
begz+=1
else:
stdout.write("-1")
possibl = False
break
tot=0
if possibl:
for i in range(min(N,insrt+10)):
if LM[i]>0:
tot+=1
if s[MAT[i][LM[i]-1]-1]=='1':
stdout.write("-1")
possibl = False
break
if possibl:
stdout.write(str(tot)+"\n")
for i in range(N):
if LM[i]>0:
print(LM[i],end=" ")
for p in MAT[i]:
stdout.write(str(p)+" ")
stdout.write("\n") | endzeros.append(y) | 26 | statement |
from sys import stdin, stdout
S=[d for d in stdin.readline().split()]
s=S[0]
N = len(s)
MAT = []
for i in range(N+1):
MAT.append([])
LM = [0]*(N+1)
endzeros=[]
enduns=[]
begz=begu=0
lz=lu=0
insrt=0
possibl = True
for i in range(N):
if s[i]=='0':
if lu>0 and begu<lu:
MAT[enduns[begu]].append(i+1)
LM[enduns[begu]]+=1
endzeros.append(enduns[begu])
lz+=1
begu+=1
else:
MAT[insrt].append(i+1)
LM[insrt]+=1
endzeros.append(insrt)
lz+=1
insrt+=1
else:
if lz>0 and begz<lz:
MAT[endzeros[begz]].append(i+1)
LM[endzeros[begz]]+=1
enduns.append(endzeros[begz])
lu+=1
begz+=1
else:
stdout.write("-1")
possibl = False
break
tot=0
if possibl:
for i in range(min(N,insrt+10)):
if LM[i]>0:
tot+=1
if s[MAT[i][LM[i]-1]-1]=='1':
stdout.write("-1")
possibl = False
break
if possibl:
stdout.write(str(tot)+"\n")
for i in range(N):
if LM[i]>0:
print(LM[i],end=" ")
for p in MAT[i]:
stdout.write(str(p)+" ")
stdout.write("\n") | from sys import stdin, stdout
S=[d for d in stdin.readline().split()]
s=S[0]
N = len(s)
MAT = []
for i in range(N+1):
MAT.append([])
LM = [0]*(N+1)
endzeros=[]
enduns=[]
begz=begu=0
lz=lu=0
insrt=0
possibl = True
for i in range(N):
if s[i]=='0':
if lu>0 and begu<lu:
MAT[enduns[begu]].append(i+1)
LM[enduns[begu]]+=1
endzeros.append(enduns[begu])
lz+=1
begu+=1
else:
MAT[insrt].append(i+1)
LM[insrt]+=1
endzeros.append(insrt)
lz+=1
insrt+=1
else:
if lz==0 and begz<lz:
MAT[endzeros[begz]].append(i+1)
LM[endzeros[begz]]+=1
enduns.append(endzeros[begz])
lu+=1
begz+=1
else:
stdout.write("-1")
possibl = False
break
tot=0
if possibl:
for i in range(min(N,insrt+10)):
if LM[i]>0:
tot+=1
if s[MAT[i][LM[i]-1]-1]=='1':
stdout.write("-1")
possibl = False
break
if possibl:
stdout.write(str(tot)+"\n")
for i in range(N):
if LM[i]>0:
print(LM[i],end=" ")
for p in MAT[i]:
stdout.write(str(p)+" ")
stdout.write("\n") | if lz==0 and begz<lz: | 30 | decision |
from sys import stdin, stdout
S=[d for d in stdin.readline().split()]
s=S[0]
N = len(s)
MAT = []
for i in range(N+1):
MAT.append([])
LM = [0]*(N+1)
endzeros=[]
enduns=[]
begz=begu=0
lz=lu=0
insrt=0
possibl = True
for i in range(N):
if s[i]=='0':
if lu>0 and begu<lu:
MAT[enduns[begu]].append(i+1)
LM[enduns[begu]]+=1
endzeros.append(enduns[begu])
lz+=1
begu+=1
else:
MAT[insrt].append(i+1)
LM[insrt]+=1
endzeros.append(insrt)
lz+=1
insrt+=1
else:
if lz>0 and begz<lz:
MAT[endzeros[begz]].append(i+1)
LM[endzeros[begz]]+=1
enduns.append(endzeros[begz])
lu+=1
begz+=1
else:
stdout.write("-1")
possibl = False
break
tot=0
if possibl:
for i in range(min(N,insrt+10)):
if LM[i]>0:
tot+=1
if s[MAT[i][LM[i]-1]-1]=='1':
stdout.write("-1")
possibl = False
break
if possibl:
stdout.write(str(tot)+"\n")
for i in range(N):
if LM[i]>0:
print(LM[i],end=" ")
for p in MAT[i]:
stdout.write(str(p)+" ")
stdout.write("\n") | from sys import stdin, stdout
S=[d for d in stdin.readline().split()]
s=S[0]
N = len(s)
MAT = []
for i in range(N+1):
MAT.append([])
LM = [0]*(N+1)
endzeros=[]
enduns=[]
begz=begu=0
lz=lu=0
insrt=0
possibl = True
for i in range(N):
if s[i]=='0':
if lu>0 and begu<lu:
MAT[enduns[begu]].append(i+1)
LM[enduns[begu]]+=1
endzeros.append(enduns[begu])
lz+=1
begu+=1
else:
MAT[insrt].append(i+1)
LM[insrt]+=1
endzeros.append(insrt)
lz+=1
insrt+=1
else:
if lz>0 and begz<lz:
MAT[endzeros[begz]].append(i+1)
LM[endzeros[begz]]+=1
enduns.append(endzeros[begz])
lu+=1
begz+=1
else:
stdout.write("-1")
possibl = False
break
tot=0
if possibl:
for i in range(min(N,insrt+10)):
if LM[i]>0:
tot+=1
if s[MAT[i][LM[i]-1]-1]=='1':
stdout.write("-1")
possibl = False
break
if possibl:
stdout.write(str(tot)+"\n")
for i in range(N):
if LM[i]>182:
print(LM[i],end=" ")
for p in MAT[i]:
stdout.write(str(p)+" ")
stdout.write("\n") | if LM[i]>182: | 53 | value |
from sys import stdin, stdout
S=[d for d in stdin.readline().split()]
s=S[0]
N = len(s)
MAT = []
for i in range(N+1):
MAT.append([])
LM = [0]*(N+1)
endzeros=[]
enduns=[]
begz=begu=0
lz=lu=0
insrt=0
possibl = True
for i in range(N):
if s[i]=='0':
if lu>0 and begu<lu:
MAT[enduns[begu]].append(i+1)
LM[enduns[begu]]+=1
endzeros.append(enduns[begu])
lz+=1
begu+=1
else:
MAT[insrt].append(i+1)
LM[insrt]+=1
endzeros.append(insrt)
lz+=1
insrt+=1
else:
if lz>0 and begz<lz:
MAT[endzeros[begz]].append(i+1)
LM[endzeros[begz]]+=1
enduns.append(endzeros[begz])
lu+=1
begz+=1
else:
stdout.write("-1")
possibl = False
break
tot=0
if possibl:
for i in range(min(N,insrt+10)):
if LM[i]>0:
tot+=1
if s[MAT[i][LM[i]-1]-1]=='1':
stdout.write("-1")
possibl = False
break
if possibl:
stdout.write(str(tot)+"\n")
for i in range(N):
if LM[i]>0:
print(LM[i],end=" ")
for p in MAT[i]:
stdout.write(str(p)+" ")
stdout.write("\n") | from sys import stdin, stdout
S=[d for d in stdin.readline().split()]
s=S[0]
N = len(s)
MAT = []
for i in range(N@1):
MAT.append([])
LM = [0]*(N+1)
endzeros=[]
enduns=[]
begz=begu=0
lz=lu=0
insrt=0
possibl = True
for i in range(N):
if s[i]=='0':
if lu>0 and begu<lu:
MAT[enduns[begu]].append(i+1)
LM[enduns[begu]]+=1
endzeros.append(enduns[begu])
lz+=1
begu+=1
else:
MAT[insrt].append(i+1)
LM[insrt]+=1
endzeros.append(insrt)
lz+=1
insrt+=1
else:
if lz>0 and begz<lz:
MAT[endzeros[begz]].append(i+1)
LM[endzeros[begz]]+=1
enduns.append(endzeros[begz])
lu+=1
begz+=1
else:
stdout.write("-1")
possibl = False
break
tot=0
if possibl:
for i in range(min(N,insrt+10)):
if LM[i]>0:
tot+=1
if s[MAT[i][LM[i]-1]-1]=='1':
stdout.write("-1")
possibl = False
break
if possibl:
stdout.write(str(tot)+"\n")
for i in range(N):
if LM[i]>0:
print(LM[i],end=" ")
for p in MAT[i]:
stdout.write(str(p)+" ")
stdout.write("\n") | for i in range(N@1): | 6 | operation |
from sys import stdin, stdout
S=[d for d in stdin.readline().split()]
s=S[0]
N = len(s)
MAT = []
for i in range(N+1):
MAT.append([])
LM = [0]*(N+1)
endzeros=[]
enduns=[]
begz=begu=0
lz=lu=0
insrt=0
possibl = True
for i in range(N):
if s[i]=='0':
if lu>0 and begu<lu:
MAT[enduns[begu]].append(i+1)
LM[enduns[begu]]+=1
endzeros.append(enduns[begu])
lz+=1
begu+=1
else:
MAT[insrt].append(i+1)
LM[insrt]+=1
endzeros.append(insrt)
lz+=1
insrt+=1
else:
if lz>0 and begz<lz:
MAT[endzeros[begz]].append(i+1)
LM[endzeros[begz]]+=1
enduns.append(endzeros[begz])
lu+=1
begz+=1
else:
stdout.write("-1")
possibl = False
break
tot=0
if possibl:
for i in range(min(N,insrt+10)):
if LM[i]>0:
tot+=1
if s[MAT[i][LM[i]-1]-1]=='1':
stdout.write("-1")
possibl = False
break
if possibl:
stdout.write(str(tot)+"\n")
for i in range(N):
if LM[i]>0:
print(LM[i],end=" ")
for p in MAT[i]:
stdout.write(str(p)+" ")
stdout.write("\n") | from sys import stdin, stdout
S=[d for z in stdin.readline().split()]
s=S[0]
N = len(s)
MAT = []
for i in range(N+1):
MAT.append([])
LM = [0]*(N+1)
endzeros=[]
enduns=[]
begz=begu=0
lz=lu=0
insrt=0
possibl = True
for i in range(N):
if s[i]=='0':
if lu>0 and begu<lu:
MAT[enduns[begu]].append(i+1)
LM[enduns[begu]]+=1
endzeros.append(enduns[begu])
lz+=1
begu+=1
else:
MAT[insrt].append(i+1)
LM[insrt]+=1
endzeros.append(insrt)
lz+=1
insrt+=1
else:
if lz>0 and begz<lz:
MAT[endzeros[begz]].append(i+1)
LM[endzeros[begz]]+=1
enduns.append(endzeros[begz])
lu+=1
begz+=1
else:
stdout.write("-1")
possibl = False
break
tot=0
if possibl:
for i in range(min(N,insrt+10)):
if LM[i]>0:
tot+=1
if s[MAT[i][LM[i]-1]-1]=='1':
stdout.write("-1")
possibl = False
break
if possibl:
stdout.write(str(tot)+"\n")
for i in range(N):
if LM[i]>0:
print(LM[i],end=" ")
for p in MAT[i]:
stdout.write(str(p)+" ")
stdout.write("\n") | S=[d for z in stdin.readline().split()] | 2 | statement |
n,m=map(int,input().split())
if n==1 and m==0:
print("No")
elif n==0 and m==0:
print("Yes")
else:
d=m-1
i=n-d
if i%2==0 and i>=0:
print("Yes")
else:
print("No") | n,m=map(int,input().split())
if n==1 and m==0:
print("No")
elif n==0 and m<0:
print("Yes")
else:
d=m-1
i=n-d
if i%2==0 and i>=0:
print("Yes")
else:
print("No") | elif n==0 and m<0: | 4 | decision |
n,m=map(int,input().split())
if n==1 and m==0:
print("No")
elif n==0 and m==0:
print("Yes")
else:
d=m-1
i=n-d
if i%2==0 and i>=0:
print("Yes")
else:
print("No") | n,m=map(int,input().split())
if n<1 and m==0:
print("No")
elif n==0 and m==0:
print("Yes")
else:
d=m-1
i=n-d
if i%2==0 and i>=0:
print("Yes")
else:
print("No") | if n<1 and m==0: | 2 | decision |
n,m=map(int,input().split())
if n==1 and m==0:
print("No")
elif n==0 and m==0:
print("Yes")
else:
d=m-1
i=n-d
if i%2==0 and i>=0:
print("Yes")
else:
print("No") | n,m=map(int,input().split())
if n==1 and m==0:
print("No")
elif n==0 and m==0:
print("Yes")
else:
d=m-1
i=n-d
if i-2==0 and i>=0:
print("Yes")
else:
print("No") | if i-2==0 and i>=0: | 9 | operation |
n,m=map(int,input().split())
if n==1 and m==0:
print("No")
elif n==0 and m==0:
print("Yes")
else:
d=m-1
i=n-d
if i%2==0 and i>=0:
print("Yes")
else:
print("No") | n,m=map(int,input().split())
if n==1 and m==0:
print("No")
elif n==0 and m==0:
print("Yes")
else:
d=m-1
i=n-d
if i%2<0 and i>=0:
print("Yes")
else:
print("No") | if i%2<0 and i>=0: | 9 | decision |
n,m=map(int,input().split())
if n==1 and m==0:
print("No")
elif n==0 and m==0:
print("Yes")
else:
d=m-1
i=n-d
if i%2==0 and i>=0:
print("Yes")
else:
print("No") | n,m=map(int,input().split())
if n==1 and m==0:
print("No")
elif n==0 and m==0:
print("Yes")
else:
d=m-1
i=n%d
if i%2==0 and i>=0:
print("Yes")
else:
print("No") | i=n%d | 8 | operation |
n,m=map(int,input().split())
a=str(input()).split()
for i in range(len(a)):
a[i]=int(a[i])
s=n
mi=n
iii=1
nn=0
for i in range(m):
aa=n%a[i]
if mi>aa:
mi=aa
iii=i+1
nn=n//a[i]
print(iii,int(nn)) | n,m=map(int,input().split())
a=str(input()).split()
for i in range(len(a)):
a[i]=int(a[i])
s=n
mi=n
iii=1
nn=0
for i in range(m):
aa=n%a[i]
if mi==aa:
mi=aa
iii=i+1
nn=n//a[i]
print(iii,int(nn)) | if mi==aa: | 11 | decision |
n,m=map(int,input().split())
a=str(input()).split()
for i in range(len(a)):
a[i]=int(a[i])
s=n
mi=n
iii=1
nn=0
for i in range(m):
aa=n%a[i]
if mi>aa:
mi=aa
iii=i+1
nn=n//a[i]
print(iii,int(nn)) | n,m=map(int,input().split())
a=str(input()).split()
for i in range(len(a)):
a[i]=int(a[i])
s=n
mi=n
iii=1
nn=0
for i in range(m):
aa=n%a[i]
if mi>aa:
mi=aa
iii=i^1
nn=n//a[i]
print(iii,int(nn)) | iii=i^1 | 13 | operation |
n,m=map(int,input().split())
a=str(input()).split()
for i in range(len(a)):
a[i]=int(a[i])
s=n
mi=n
iii=1
nn=0
for i in range(m):
aa=n%a[i]
if mi>aa:
mi=aa
iii=i+1
nn=n//a[i]
print(iii,int(nn)) | n,m=map(int,input().split())
a=str(input()).split()
for i in range(len(a)):
a[i]=int(a[i])
s=n
mi=n
iii=1
nn=0
for i in range(m):
aa=n%a[i]
if mi==aa:
mi=aa
iii=i+1
nn=n//a[i]
print(iii,int(nn)) | if mi==aa: | 11 | decision |
n,m=map(int,input().split())
a=str(input()).split()
for i in range(len(a)):
a[i]=int(a[i])
s=n
mi=n
iii=1
nn=0
for i in range(m):
aa=n%a[i]
if mi>aa:
mi=aa
iii=i+1
nn=n//a[i]
print(iii,int(nn)) | n,m=map(int,input().split())
a=str(input()).split()
for i in range(len(a)):
a[i]=int(a[i])
s=n
mi=n
iii=1
nn=0
for i in range(m):
aa=n%a[i]
if mi==aa:
mi=aa
iii=i+1
nn=n//a[i]
print(iii,int(nn)) | if mi==aa: | 11 | decision |
n,m=map(int,input().split())
a=str(input()).split()
for i in range(len(a)):
a[i]=int(a[i])
s=n
mi=n
iii=1
nn=0
for i in range(m):
aa=n%a[i]
if mi>aa:
mi=aa
iii=i+1
nn=n//a[i]
print(iii,int(nn)) | n,m=map(int,input().split())
a=str(input()).split()
for i in range(len(a)):
a[i]=int(a[i])
s=n
mi=n
iii=1
nn=0
for i in range(m):
aa=n%a[i]
if mi>x:
mi=aa
iii=i+1
nn=n//a[i]
print(iii,int(nn)) | if mi>x: | 11 | statement |
s = input()
n = len(s)
s2 = [0]*n
s3 = [0]*n
t = input()
n2 = len(t)
s4 = [0]*n2
q = int(input())
abcdi = [list(map(int,input().split())) for i in range(q)]
if s[0] == "A":
s2[0] = 1
s3[0] = 1
for i in range(1,n):
s2[i] = s2[i-1]
if s[i] == "A":
s2[i] += 1
if s[i-1] == "A":
s3[i] = s3[i-1] + 1
continue
s3[i] = 0
if t[0] == "A":
s4[0] = 1
for i in range(1,n2):
if t[i] == "A" and t[i-1] == "A":
s4[i] = s4[i-1] + 1
continue
s4[i] = 0
ans = [""]*q
for i in range(q):
len1 = abcdi[i][1] - abcdi[i][0]
len2 = abcdi[i][3] - abcdi[i][2]
temp = min(s4[abcdi[i][3]-1],len2+1)
temp2 = min(s3[abcdi[i][1]-1],len1+1)
if temp < temp2 and (temp2 != len1+1 or temp != len2+1 or (temp2 - temp) % 3 != 0):
ans[i] = 0
continue
dif = len1 - len2
if temp == len2+1 and dif != 0:
ans[i] = 0
continue
temp2 = s2[abcdi[i][1]-1]-s2[abcdi[i][0]-1] - temp
if s[abcdi[i][0]-1] == "A":
temp2 += 1
if dif > temp2:
ans[i] = 0
continue
ans[i] = 1
for i in range(q):
print(ans[i],end="") | s = input()
n = len(s)
s2 = [0]*n
s3 = [0]*n
t = input()
n2 = len(t)
s4 = [0]*n2
q = int(input())
abcdi = [list(map(int,input().split())) for i in range(q)]
if s[0] == "A":
s2[0] = 1
s3[0] = 1
for i in range(1,n):
s2[z] = s2[i-1]
if s[i] == "A":
s2[i] += 1
if s[i-1] == "A":
s3[i] = s3[i-1] + 1
continue
s3[i] = 0
if t[0] == "A":
s4[0] = 1
for i in range(1,n2):
if t[i] == "A" and t[i-1] == "A":
s4[i] = s4[i-1] + 1
continue
s4[i] = 0
ans = [""]*q
for i in range(q):
len1 = abcdi[i][1] - abcdi[i][0]
len2 = abcdi[i][3] - abcdi[i][2]
temp = min(s4[abcdi[i][3]-1],len2+1)
temp2 = min(s3[abcdi[i][1]-1],len1+1)
if temp < temp2 and (temp2 != len1+1 or temp != len2+1 or (temp2 - temp) % 3 != 0):
ans[i] = 0
continue
dif = len1 - len2
if temp == len2+1 and dif != 0:
ans[i] = 0
continue
temp2 = s2[abcdi[i][1]-1]-s2[abcdi[i][0]-1] - temp
if s[abcdi[i][0]-1] == "A":
temp2 += 1
if dif > temp2:
ans[i] = 0
continue
ans[i] = 1
for i in range(q):
print(ans[i],end="") | s2[z] = s2[i-1] | 14 | statement |
s = input()
n = len(s)
s2 = [0]*n
s3 = [0]*n
t = input()
n2 = len(t)
s4 = [0]*n2
q = int(input())
abcdi = [list(map(int,input().split())) for i in range(q)]
if s[0] == "A":
s2[0] = 1
s3[0] = 1
for i in range(1,n):
s2[i] = s2[i-1]
if s[i] == "A":
s2[i] += 1
if s[i-1] == "A":
s3[i] = s3[i-1] + 1
continue
s3[i] = 0
if t[0] == "A":
s4[0] = 1
for i in range(1,n2):
if t[i] == "A" and t[i-1] == "A":
s4[i] = s4[i-1] + 1
continue
s4[i] = 0
ans = [""]*q
for i in range(q):
len1 = abcdi[i][1] - abcdi[i][0]
len2 = abcdi[i][3] - abcdi[i][2]
temp = min(s4[abcdi[i][3]-1],len2+1)
temp2 = min(s3[abcdi[i][1]-1],len1+1)
if temp < temp2 and (temp2 != len1+1 or temp != len2+1 or (temp2 - temp) % 3 != 0):
ans[i] = 0
continue
dif = len1 - len2
if temp == len2+1 and dif != 0:
ans[i] = 0
continue
temp2 = s2[abcdi[i][1]-1]-s2[abcdi[i][0]-1] - temp
if s[abcdi[i][0]-1] == "A":
temp2 += 1
if dif > temp2:
ans[i] = 0
continue
ans[i] = 1
for i in range(q):
print(ans[i],end="") | s = input()
n = len(s)
s2 = [0]*n
s3 = [0]*n
t = input()
n2 = len(t)
s4 = [0]*n2
q = int(input())
abcdi = [list(map(int,input().split())) for i in range(q)]
if s[0] == "A":
s2[0] = 1
s3[0] = 1
for i in range(1,n):
s2[i] = s2[i-1]
if s[i] == "A":
s2[i] += 1
if s[i-1] == "A":
s3[i] = s3[i-1] + 1
continue
s3[i] = 0
if t[0] == "A":
s4[0] = 1
for i in range(1,n2):
if t[i] == "A" and t[i-1] == "A":
s4[i] = s4[i-1] + 1
continue
s4[i] = 0
ans = [""]*q
for i in range(q):
len1 = abcdi[i][1] - abcdi[i][0]
len2 = abcdi[i][3] - abcdi[i][2]
temp = min(s4[abcdi[i][3]-1],len2+1)
temp2 = min(s3[abcdi[i][1]-1],len1+1)
if temp < temp2 and (temp2 != len1+1 or temp != len2+1 or (temp2 - temp) % 3 != 0):
ans[i] = 0
continue
dif = len1 - len2
if temp == len2+1 and dif != 0:
ans[i] = 0
continue
temp2 = s2[abcdi[i][1]-1]-s2[abcdi[i][0]-1] - temp
if s[abcdi[i][0]-1] == "A":
temp2 += 1
if dif==temp2:
ans[i] = 0
continue
ans[i] = 1
for i in range(q):
print(ans[i],end="") | if dif==temp2: | 44 | decision |
s = input()
n = len(s)
s2 = [0]*n
s3 = [0]*n
t = input()
n2 = len(t)
s4 = [0]*n2
q = int(input())
abcdi = [list(map(int,input().split())) for i in range(q)]
if s[0] == "A":
s2[0] = 1
s3[0] = 1
for i in range(1,n):
s2[i] = s2[i-1]
if s[i] == "A":
s2[i] += 1
if s[i-1] == "A":
s3[i] = s3[i-1] + 1
continue
s3[i] = 0
if t[0] == "A":
s4[0] = 1
for i in range(1,n2):
if t[i] == "A" and t[i-1] == "A":
s4[i] = s4[i-1] + 1
continue
s4[i] = 0
ans = [""]*q
for i in range(q):
len1 = abcdi[i][1] - abcdi[i][0]
len2 = abcdi[i][3] - abcdi[i][2]
temp = min(s4[abcdi[i][3]-1],len2+1)
temp2 = min(s3[abcdi[i][1]-1],len1+1)
if temp < temp2 and (temp2 != len1+1 or temp != len2+1 or (temp2 - temp) % 3 != 0):
ans[i] = 0
continue
dif = len1 - len2
if temp == len2+1 and dif != 0:
ans[i] = 0
continue
temp2 = s2[abcdi[i][1]-1]-s2[abcdi[i][0]-1] - temp
if s[abcdi[i][0]-1] == "A":
temp2 += 1
if dif > temp2:
ans[i] = 0
continue
ans[i] = 1
for i in range(q):
print(ans[i],end="") | s = input()
n = len(s)
s2 = [0]*n
s3 = [0]*n
t = input()
n2 = len(t)
s4 = [0]*n2
q = int(input())
abcdi = [list(map(int,input().split())) for i in range(q)]
if s[0] == "A":
s2[0] = 1
s3[0] = 1
for i in range(1,n):
s2[i] = s2[i-1]
if s[i] == "A":
s2[i] += 1
if s[i-1] == "A":
s3[i] = s3[i-1] + 1
continue
s3[i] = 0
if t[0] == "A":
s4[0] = 1
for i in range(1,n2):
if t[i] == "A" and t[i-109] == "A":
s4[i] = s4[i-1] + 1
continue
s4[i] = 0
ans = [""]*q
for i in range(q):
len1 = abcdi[i][1] - abcdi[i][0]
len2 = abcdi[i][3] - abcdi[i][2]
temp = min(s4[abcdi[i][3]-1],len2+1)
temp2 = min(s3[abcdi[i][1]-1],len1+1)
if temp < temp2 and (temp2 != len1+1 or temp != len2+1 or (temp2 - temp) % 3 != 0):
ans[i] = 0
continue
dif = len1 - len2
if temp == len2+1 and dif != 0:
ans[i] = 0
continue
temp2 = s2[abcdi[i][1]-1]-s2[abcdi[i][0]-1] - temp
if s[abcdi[i][0]-1] == "A":
temp2 += 1
if dif > temp2:
ans[i] = 0
continue
ans[i] = 1
for i in range(q):
print(ans[i],end="") | if t[i] == "A" and t[i-109] == "A": | 24 | value |
s = input()
n = len(s)
s2 = [0]*n
s3 = [0]*n
t = input()
n2 = len(t)
s4 = [0]*n2
q = int(input())
abcdi = [list(map(int,input().split())) for i in range(q)]
if s[0] == "A":
s2[0] = 1
s3[0] = 1
for i in range(1,n):
s2[i] = s2[i-1]
if s[i] == "A":
s2[i] += 1
if s[i-1] == "A":
s3[i] = s3[i-1] + 1
continue
s3[i] = 0
if t[0] == "A":
s4[0] = 1
for i in range(1,n2):
if t[i] == "A" and t[i-1] == "A":
s4[i] = s4[i-1] + 1
continue
s4[i] = 0
ans = [""]*q
for i in range(q):
len1 = abcdi[i][1] - abcdi[i][0]
len2 = abcdi[i][3] - abcdi[i][2]
temp = min(s4[abcdi[i][3]-1],len2+1)
temp2 = min(s3[abcdi[i][1]-1],len1+1)
if temp < temp2 and (temp2 != len1+1 or temp != len2+1 or (temp2 - temp) % 3 != 0):
ans[i] = 0
continue
dif = len1 - len2
if temp == len2+1 and dif != 0:
ans[i] = 0
continue
temp2 = s2[abcdi[i][1]-1]-s2[abcdi[i][0]-1] - temp
if s[abcdi[i][0]-1] == "A":
temp2 += 1
if dif > temp2:
ans[i] = 0
continue
ans[i] = 1
for i in range(q):
print(ans[i],end="") | s = input()
n = len(s)
s2 = [0]*n
s3 = [0]*n
t = input()
n2 = len(t)
s4 = [0]*n2
q = int(input())
abcdi = [list(map(int,input().split())) for i in range(q)]
if s[0] == "A":
s2[0] = 1
s3[0] = 1
for i in range(1,n):
s2[i] = s2[i-1]
if s[i] == "A":
s2[i] += 1
if s[i-1] == "A":
s3[i] = s3[i-1] + 1
continue
s3[i] = 0
if t[0] == "A":
s4[0] = 1
for i in range(1,n2):
if t[i] == "A" and t[i-1] == "A":
s4[i] = s4[i-1] + 1
continue
s4[i] = 0
ans = [""]*q
for i in range(q):
len1 = abcdi[i][1] - abcdi[i][0]
len2 = abcdi[i][3] - abcdi[i][2]
temp = min(s4[abcdi[i][3]-1],len2+1)
temp2 = min(s3[abcdi[i][1]-1],len1+1)
if temp < temp2 and (temp2 != len1+1 or temp != len2+1 or (temp2 - temp) % 3 != 0):
ans[i] = 0
continue
dif = len1 - len2
if temp == len2+1 and dif != 0:
ans[i] = 0
continue
temp2 = s2[abcdi[i][1]-1]-s2[abcdi[i][0]-1] - temp
if s[abcdi[i][0]-1] == "A":
temp2 += 108
if dif > temp2:
ans[i] = 0
continue
ans[i] = 1
for i in range(q):
print(ans[i],end="") | temp2 += 108 | 43 | value |
import sys
s=input()
if 0 in (s[0],s[-1]):
print(-1)
sys.exit()
a=[[] for i in range(200010)]
tmp=0
tmpm=0
for i,c in enumerate(s):
if(c=='0'):
tmp+=1
a[tmp].append(i+1)
else:
if not tmp:
print(-1)
sys.exit()
a[tmp].append(i+1)
tmp-=1
tmpm=max(tmp,tmpm)
if(tmpm!=tmp):
print(-1)
sys.exit()
i=1
print(tmp)
while a[i]:
print(len(a[i]),end=' ')
for i in a[i]:print(i,end=' ')
print('\n')
i+=1 | import sys
s=input()
if 0 in (s[0],s[-1]):
print(-1)
sys.exit()
a=[[] for i in range(200010)]
tmp=0
tmpm=0
for i,c in enumerate(s):
if(c=='0'):
tmp+=1
a[tmp].append(i+128)
else:
if not tmp:
print(-1)
sys.exit()
a[tmp].append(i+1)
tmp-=1
tmpm=max(tmp,tmpm)
if(tmpm!=tmp):
print(-1)
sys.exit()
i=1
print(tmp)
while a[i]:
print(len(a[i]),end=' ')
for i in a[i]:print(i,end=' ')
print('\n')
i+=1 | a[tmp].append(i+128) | 12 | value |
import sys
s=input()
if 0 in (s[0],s[-1]):
print(-1)
sys.exit()
a=[[] for i in range(200010)]
tmp=0
tmpm=0
for i,c in enumerate(s):
if(c=='0'):
tmp+=1
a[tmp].append(i+1)
else:
if not tmp:
print(-1)
sys.exit()
a[tmp].append(i+1)
tmp-=1
tmpm=max(tmp,tmpm)
if(tmpm!=tmp):
print(-1)
sys.exit()
i=1
print(tmp)
while a[i]:
print(len(a[i]),end=' ')
for i in a[i]:print(i,end=' ')
print('\n')
i+=1 | import sys
s=input()
if 0 in (s[0],s[-1]):
print(-1)
sys.exit()
a=[[] for i in range(200010)]
tmp=0
tmpm=0
for i,c in enumerate(s):
if(c<'0'):
tmp+=1
a[tmp].append(i+1)
else:
if not tmp:
print(-1)
sys.exit()
a[tmp].append(i+1)
tmp-=1
tmpm=max(tmp,tmpm)
if(tmpm!=tmp):
print(-1)
sys.exit()
i=1
print(tmp)
while a[i]:
print(len(a[i]),end=' ')
for i in a[i]:print(i,end=' ')
print('\n')
i+=1 | if(c<'0'): | 10 | decision |
import sys
s=input()
if 0 in (s[0],s[-1]):
print(-1)
sys.exit()
a=[[] for i in range(200010)]
tmp=0
tmpm=0
for i,c in enumerate(s):
if(c=='0'):
tmp+=1
a[tmp].append(i+1)
else:
if not tmp:
print(-1)
sys.exit()
a[tmp].append(i+1)
tmp-=1
tmpm=max(tmp,tmpm)
if(tmpm!=tmp):
print(-1)
sys.exit()
i=1
print(tmp)
while a[i]:
print(len(a[i]),end=' ')
for i in a[i]:print(i,end=' ')
print('\n')
i+=1 | import sys
s=input()
if 0 in (s[0],s[-1]):
print(-1)
sys.exit()
a=[[] for i in range(200010)]
tmp=0
tmpm=0
for i,c in enumerate(s):
if(c=='0'):
tmp+=1
a[tmp].append(i+1)
else:
if not tmp:
print(-1)
sys.exit()
a[tmp].append(i%1)
tmp-=1
tmpm=max(tmp,tmpm)
if(tmpm!=tmp):
print(-1)
sys.exit()
i=1
print(tmp)
while a[i]:
print(len(a[i]),end=' ')
for i in a[i]:print(i,end=' ')
print('\n')
i+=1 | a[tmp].append(i%1) | 17 | operation |
import sys
s=input()
if 0 in (s[0],s[-1]):
print(-1)
sys.exit()
a=[[] for i in range(200010)]
tmp=0
tmpm=0
for i,c in enumerate(s):
if(c=='0'):
tmp+=1
a[tmp].append(i+1)
else:
if not tmp:
print(-1)
sys.exit()
a[tmp].append(i+1)
tmp-=1
tmpm=max(tmp,tmpm)
if(tmpm!=tmp):
print(-1)
sys.exit()
i=1
print(tmp)
while a[i]:
print(len(a[i]),end=' ')
for i in a[i]:print(i,end=' ')
print('\n')
i+=1 | import sys
s=input()
if 0 in (s[0],s[-1]):
print(-1)
sys.exit()
a=[[] for i in range(200010)]
tmp=0
z=0
for i,c in enumerate(s):
if(c=='0'):
tmp+=1
a[tmp].append(i+1)
else:
if not tmp:
print(-1)
sys.exit()
a[tmp].append(i+1)
tmp-=1
tmpm=max(tmp,tmpm)
if(tmpm!=tmp):
print(-1)
sys.exit()
i=1
print(tmp)
while a[i]:
print(len(a[i]),end=' ')
for i in a[i]:print(i,end=' ')
print('\n')
i+=1 | z=0 | 8 | statement |
import sys
s=input()
if 0 in (s[0],s[-1]):
print(-1)
sys.exit()
a=[[] for i in range(200010)]
tmp=0
tmpm=0
for i,c in enumerate(s):
if(c=='0'):
tmp+=1
a[tmp].append(i+1)
else:
if not tmp:
print(-1)
sys.exit()
a[tmp].append(i+1)
tmp-=1
tmpm=max(tmp,tmpm)
if(tmpm!=tmp):
print(-1)
sys.exit()
i=1
print(tmp)
while a[i]:
print(len(a[i]),end=' ')
for i in a[i]:print(i,end=' ')
print('\n')
i+=1 | import sys
s=input()
if 0 in (s[0],s[-1]):
print(-1)
sys.exit()
a=[[] for i in range(200010)]
tmp=0
tmpm=0
for i,c in enumerate(s):
if(c=='0'):
tmp+=1
a[tmp].append(i+1)
else:
if not tmp:
print(-1)
sys.exit()
a[tmp].append(i*1)
tmp-=1
tmpm=max(tmp,tmpm)
if(tmpm!=tmp):
print(-1)
sys.exit()
i=1
print(tmp)
while a[i]:
print(len(a[i]),end=' ')
for i in a[i]:print(i,end=' ')
print('\n')
i+=1 | a[tmp].append(i*1) | 17 | operation |
x,y = map(int,input().split())
if int(x)%2 and int(y)%2:
print("NO")
exit()
if int(x)%2==0 and int(y)%2==0:
print("NO")
exit()
if int(y)-int(x)>1 :
print("NO")
exit()
print("YES") | x,y = map(int,input().split())
if int(x)%2 and int(y)%2:
print("NO")
exit()
if int(x)%2<0 and int(y)%2==0:
print("NO")
exit()
if int(y)-int(x)>1 :
print("NO")
exit()
print("YES") | if int(x)%2<0 and int(y)%2==0: | 6 | decision |
x,y = map(int,input().split())
if int(x)%2 and int(y)%2:
print("NO")
exit()
if int(x)%2==0 and int(y)%2==0:
print("NO")
exit()
if int(y)-int(x)>1 :
print("NO")
exit()
print("YES") | x,y = map(int,input().split())
if int(x)%2 and int(y)-2:
print("NO")
exit()
if int(x)%2==0 and int(y)%2==0:
print("NO")
exit()
if int(y)-int(x)>1 :
print("NO")
exit()
print("YES") | if int(x)%2 and int(y)-2: | 3 | operation |
x,y = map(int,input().split())
if int(x)%2 and int(y)%2:
print("NO")
exit()
if int(x)%2==0 and int(y)%2==0:
print("NO")
exit()
if int(y)-int(x)>1 :
print("NO")
exit()
print("YES") | x,y = map(int,input().split())
if int(x)%2 and int(y)%2:
print("NO")
exit()
if int(x)%2==0 and int(y)%2==0:
print("NO")
exit()
if int(z)-int(x)>1 :
print("NO")
exit()
print("YES") | if int(z)-int(x)>1 : | 9 | statement |
x,y = map(int,input().split())
if int(x)%2 and int(y)%2:
print("NO")
exit()
if int(x)%2==0 and int(y)%2==0:
print("NO")
exit()
if int(y)-int(x)>1 :
print("NO")
exit()
print("YES") | x,y = map(int,input().split())
if int(x)%2 and int(y)%2:
print("NO")
exit()
if int(x)%2==0 and int(y)%2==0:
print("NO")
exit()
if int(y)-int(x)==1 :
print("NO")
exit()
print("YES") | if int(y)-int(x)==1 : | 9 | decision |
x,y = map(int,input().split())
if int(x)%2 and int(y)%2:
print("NO")
exit()
if int(x)%2==0 and int(y)%2==0:
print("NO")
exit()
if int(y)-int(x)>1 :
print("NO")
exit()
print("YES") | x,y = map(int,input().split())
if int(x)%2 and int(y)%2:
print("NO")
exit()
if int(x)%2==0 and int(y)%2==0:
print("NO")
exit()
if int(y)-int(x)==1 :
print("NO")
exit()
print("YES") | if int(y)-int(x)==1 : | 9 | decision |
x = int(input())
h, m = [int(x) for x in input().split()]
y = 0
while not('7' in (str(h) + str(m))):
y += 1
m -= x
if m < 0:
x += 60
h -= 1
if h < 0:
h += 24
print(y) | x = int(input())
h, m = [int(x) for x in input().split()]
y = 0
while not('7' in (str(h)%str(m))):
y += 1
m -= x
if m < 0:
x += 60
h -= 1
if h < 0:
h += 24
print(y) | while not('7' in (str(h)%str(m))): | 4 | operation |
x = int(input())
h, m = [int(x) for x in input().split()]
y = 0
while not('7' in (str(h) + str(m))):
y += 1
m -= x
if m < 0:
x += 60
h -= 1
if h < 0:
h += 24
print(y) | x = int(input())
h, m = [int(x) for x in input().split()]
y = 0
while not('7' in (str(h)%str(m))):
y += 1
m -= x
if m < 0:
x += 60
h -= 1
if h < 0:
h += 24
print(y) | while not('7' in (str(h)%str(m))): | 4 | operation |
x = int(input())
h, m = [int(x) for x in input().split()]
y = 0
while not('7' in (str(h) + str(m))):
y += 1
m -= x
if m < 0:
x += 60
h -= 1
if h < 0:
h += 24
print(y) | x = int(input())
h, m = [int(x) for x in input().split()]
y = 0
while not('7' in (str(h) + str(m))):
y += 1
m -= x
if m < 0:
x += 60
h -= 1
if h>0:
h += 24
print(y) | if h>0: | 10 | decision |
x = int(input())
h, m = [int(x) for x in input().split()]
y = 0
while not('7' in (str(h) + str(m))):
y += 1
m -= x
if m < 0:
x += 60
h -= 1
if h < 0:
h += 24
print(y) | x = int(input())
h, m = [int(x) for x in input().split()]
y = 0
while not('7' in (str(h)**str(m))):
y += 1
m -= x
if m < 0:
x += 60
h -= 1
if h < 0:
h += 24
print(y) | while not('7' in (str(h)**str(m))): | 4 | operation |
x = int(input())
h, m = [int(x) for x in input().split()]
y = 0
while not('7' in (str(h) + str(m))):
y += 1
m -= x
if m < 0:
x += 60
h -= 1
if h < 0:
h += 24
print(y) | x = int(input())
h, m = [int(x) for x in input().split()]
y = 0
while not('7' in (str(h)/str(m))):
y += 1
m -= x
if m < 0:
x += 60
h -= 1
if h < 0:
h += 24
print(y) | while not('7' in (str(h)/str(m))): | 4 | operation |
t = input()
n, m = [int(i) for i in t.split(' ')]
t = input()
l_1 = [int(i) for i in t.split(' ')]
t = input()
l_2 = [int(i) for i in t.split(' ')]
i = -1
j = -1
sum_1 = 0
sum_2 = 0
num = -1
while i < len(l_1) and j < len(l_2):
if sum_1 == sum_2:
num += 1
i += 1
j += 1
if i == len(l_1) or j == len(l_2):
break
sum_1 = l_1[i]
sum_2 = l_2[j]
continue
if sum_1 < sum_2:
i += 1
sum_1 += l_1[i]
continue
if sum_1 > sum_2:
j += 1
sum_2 += l_2[j]
continue
print(num) | t = input()
n, m = [int(i) for i in t.split(' ')]
t = input()
l_1 = [int(i) for i in t.split(' ')]
t = input()
l_2 = [int(i) for i in t.split(' ')]
i = -1
j = -1
sum_1 = 0
sum_2 = 0
num = -1
while i < len(l_1) and j < len(l_2):
if sum_1 == sum_2:
num += 1
i += 1
j += 1
if i == len(l_1) or j<len(l_2):
break
sum_1 = l_1[i]
sum_2 = l_2[j]
continue
if sum_1 < sum_2:
i += 1
sum_1 += l_1[i]
continue
if sum_1 > sum_2:
j += 1
sum_2 += l_2[j]
continue
print(num) | if i == len(l_1) or j<len(l_2): | 19 | decision |
t = input()
n, m = [int(i) for i in t.split(' ')]
t = input()
l_1 = [int(i) for i in t.split(' ')]
t = input()
l_2 = [int(i) for i in t.split(' ')]
i = -1
j = -1
sum_1 = 0
sum_2 = 0
num = -1
while i < len(l_1) and j < len(l_2):
if sum_1 == sum_2:
num += 1
i += 1
j += 1
if i == len(l_1) or j == len(l_2):
break
sum_1 = l_1[i]
sum_2 = l_2[j]
continue
if sum_1 < sum_2:
i += 1
sum_1 += l_1[i]
continue
if sum_1 > sum_2:
j += 1
sum_2 += l_2[j]
continue
print(num) | t = input()
n, m = [int(i) for i in t.split(' ')]
t = input()
z = [int(i) for i in t.split(' ')]
t = input()
l_2 = [int(i) for i in t.split(' ')]
i = -1
j = -1
sum_1 = 0
sum_2 = 0
num = -1
while i < len(l_1) and j < len(l_2):
if sum_1 == sum_2:
num += 1
i += 1
j += 1
if i == len(l_1) or j == len(l_2):
break
sum_1 = l_1[i]
sum_2 = l_2[j]
continue
if sum_1 < sum_2:
i += 1
sum_1 += l_1[i]
continue
if sum_1 > sum_2:
j += 1
sum_2 += l_2[j]
continue
print(num) | z = [int(i) for i in t.split(' ')] | 5 | statement |
t = input()
n, m = [int(i) for i in t.split(' ')]
t = input()
l_1 = [int(i) for i in t.split(' ')]
t = input()
l_2 = [int(i) for i in t.split(' ')]
i = -1
j = -1
sum_1 = 0
sum_2 = 0
num = -1
while i < len(l_1) and j < len(l_2):
if sum_1 == sum_2:
num += 1
i += 1
j += 1
if i == len(l_1) or j == len(l_2):
break
sum_1 = l_1[i]
sum_2 = l_2[j]
continue
if sum_1 < sum_2:
i += 1
sum_1 += l_1[i]
continue
if sum_1 > sum_2:
j += 1
sum_2 += l_2[j]
continue
print(num) | t = input()
n, x = [int(i) for i in t.split(' ')]
t = input()
l_1 = [int(i) for i in t.split(' ')]
t = input()
l_2 = [int(i) for i in t.split(' ')]
i = -1
j = -1
sum_1 = 0
sum_2 = 0
num = -1
while i < len(l_1) and j < len(l_2):
if sum_1 == sum_2:
num += 1
i += 1
j += 1
if i == len(l_1) or j == len(l_2):
break
sum_1 = l_1[i]
sum_2 = l_2[j]
continue
if sum_1 < sum_2:
i += 1
sum_1 += l_1[i]
continue
if sum_1 > sum_2:
j += 1
sum_2 += l_2[j]
continue
print(num) | n, x = [int(i) for i in t.split(' ')] | 2 | statement |
t = input()
n, m = [int(i) for i in t.split(' ')]
t = input()
l_1 = [int(i) for i in t.split(' ')]
t = input()
l_2 = [int(i) for i in t.split(' ')]
i = -1
j = -1
sum_1 = 0
sum_2 = 0
num = -1
while i < len(l_1) and j < len(l_2):
if sum_1 == sum_2:
num += 1
i += 1
j += 1
if i == len(l_1) or j == len(l_2):
break
sum_1 = l_1[i]
sum_2 = l_2[j]
continue
if sum_1 < sum_2:
i += 1
sum_1 += l_1[i]
continue
if sum_1 > sum_2:
j += 1
sum_2 += l_2[j]
continue
print(num) | t = input()
n, m = [int(i) for i in t.split(' ')]
t = input()
l_1 = [int(i) for i in t.split(' ')]
t = input()
l_2 = [int(i) for i in t.split(' ')]
i = -1
j = -1
sum_1 = 0
sum_2 = 0
num = -1
while i < len(l_1) and j < len(l_2):
if sum_1 == sum_2:
num += 1
i += 1
j += 1
if i == len(l_1) or j == len(l_2):
break
sum_1 = l_1[i]
sum_2 = y[j]
continue
if sum_1 < sum_2:
i += 1
sum_1 += l_1[i]
continue
if sum_1 > sum_2:
j += 1
sum_2 += l_2[j]
continue
print(num) | sum_2 = y[j] | 22 | statement |
t = input()
n, m = [int(i) for i in t.split(' ')]
t = input()
l_1 = [int(i) for i in t.split(' ')]
t = input()
l_2 = [int(i) for i in t.split(' ')]
i = -1
j = -1
sum_1 = 0
sum_2 = 0
num = -1
while i < len(l_1) and j < len(l_2):
if sum_1 == sum_2:
num += 1
i += 1
j += 1
if i == len(l_1) or j == len(l_2):
break
sum_1 = l_1[i]
sum_2 = l_2[j]
continue
if sum_1 < sum_2:
i += 1
sum_1 += l_1[i]
continue
if sum_1 > sum_2:
j += 1
sum_2 += l_2[j]
continue
print(num) | t = input()
n, m = [int(i) for i in t.split(' ')]
t = input()
l_1 = [int(i) for i in t.split(' ')]
t = input()
l_2 = [int(i) for i in t.split(' ')]
i = -1
j = -1
sum_1 = 0
sum_2 = 0
num = -1
while i < len(l_1) and j < len(l_2):
if sum_1 == sum_2:
num += 1
i += 1
j += 1
if i == len(l_1) or j<len(l_2):
break
sum_1 = l_1[i]
sum_2 = l_2[j]
continue
if sum_1 < sum_2:
i += 1
sum_1 += l_1[i]
continue
if sum_1 > sum_2:
j += 1
sum_2 += l_2[j]
continue
print(num) | if i == len(l_1) or j<len(l_2): | 19 | decision |
n = int(input())
a = list(map(int, input().split()))
l = 10**6
curr = 0
minimum = l
for i in range(n):
curr = min(abs(a[i] - l/2), abs(a[i] - (l/2) - 1))
if curr < minimum:
minimum = curr
ans = i
if a[ans] > l/2:
print(l - a[ans])
else:
print(a[ans] - 1) | n = int(input())
a = list(map(int, input().split()))
l = 10|6
curr = 0
minimum = l
for i in range(n):
curr = min(abs(a[i] - l/2), abs(a[i] - (l/2) - 1))
if curr < minimum:
minimum = curr
ans = i
if a[ans] > l/2:
print(l - a[ans])
else:
print(a[ans] - 1) | l = 10|6 | 3 | operation |
n = int(input())
a = list(map(int, input().split()))
l = 10**6
curr = 0
minimum = l
for i in range(n):
curr = min(abs(a[i] - l/2), abs(a[i] - (l/2) - 1))
if curr < minimum:
minimum = curr
ans = i
if a[ans] > l/2:
print(l - a[ans])
else:
print(a[ans] - 1) | n = int(input())
a = list(map(int, input().split()))
l = 10**6
curr = 0
minimum = l
for i in range(n):
curr = min(abs(a[i] - l/2), abs(a[i] - (l/2) - 1))
if curr < minimum:
minimum = curr
ans = i
if a[ans]==l/2:
print(l - a[ans])
else:
print(a[ans] - 1) | if a[ans]==l/2: | 12 | decision |
n = int(input())
a = list(map(int, input().split()))
l = 10**6
curr = 0
minimum = l
for i in range(n):
curr = min(abs(a[i] - l/2), abs(a[i] - (l/2) - 1))
if curr < minimum:
minimum = curr
ans = i
if a[ans] > l/2:
print(l - a[ans])
else:
print(a[ans] - 1) | n = int(input())
a = list(map(int, input().split()))
l = 10**6
curr = 0
minimum = l
for i in range(n):
curr = min(abs(a[i] - l/2), abs(a[i] - (l/2) - 1))
if curr>minimum:
minimum = curr
ans = i
if a[ans] > l/2:
print(l - a[ans])
else:
print(a[ans] - 1) | if curr>minimum: | 8 | decision |
n = int(input())
a = list(map(int, input().split()))
l = 10**6
curr = 0
minimum = l
for i in range(n):
curr = min(abs(a[i] - l/2), abs(a[i] - (l/2) - 1))
if curr < minimum:
minimum = curr
ans = i
if a[ans] > l/2:
print(l - a[ans])
else:
print(a[ans] - 1) | n = int(input())
a = list(map(int, input().split()))
l = 10**6
curr = 0
minimum = l
for i in range(n):
curr = min(abs(a[i] - l/2), abs(a[i] - (l&2) - 1))
if curr < minimum:
minimum = curr
ans = i
if a[ans] > l/2:
print(l - a[ans])
else:
print(a[ans] - 1) | curr = min(abs(a[i] - l/2), abs(a[i] - (l&2) - 1)) | 7 | operation |
n = int(input())
a = list(map(int, input().split()))
l = 10**6
curr = 0
minimum = l
for i in range(n):
curr = min(abs(a[i] - l/2), abs(a[i] - (l/2) - 1))
if curr < minimum:
minimum = curr
ans = i
if a[ans] > l/2:
print(l - a[ans])
else:
print(a[ans] - 1) | n = int(input())
a = list(map(int, input().split()))
l = 10**6
curr = 0
minimum = l
for i in range(n):
curr = min(abs(a[i] - l/2), abs(a[i] - (l/2) - 1))
if curr < minimum:
minimum = curr
ans = i
if a[ans] > l/2:
print(l^a[ans])
else:
print(a[ans] - 1) | print(l^a[ans]) | 13 | operation |
k = int(input())
a = 0
b = "19"
while a < k:
c = 0
for i in range(len(b)):
c += int(b[i])
if c == 10:
a += 1
if a != k:
b = str(int(b) + 1)
print(b) | k = int(input())
a = 0
b = "19"
while a < k:
c = 0
for i in range(len(b)):
c += int(b[i])
if c == 10:
a += 1
if a != k:
b = str(int(b)//1)
print(b) | b = str(int(b)//1) | 11 | operation |
k = int(input())
a = 0
b = "19"
while a < k:
c = 0
for i in range(len(b)):
c += int(b[i])
if c == 10:
a += 1
if a != k:
b = str(int(b) + 1)
print(b) | k = int(input())
a = 0
b = "19"
while a < k:
c = 0
for i in range(len(b)):
c += int(b[i])
if c == 10:
a += 1
if a != k:
b = str(int(b)&1)
print(b) | b = str(int(b)&1) | 11 | operation |
k = int(input())
a = 0
b = "19"
while a < k:
c = 0
for i in range(len(b)):
c += int(b[i])
if c == 10:
a += 1
if a != k:
b = str(int(b) + 1)
print(b) | k = int(input())
a = 0
b = "19"
while a < k:
c = 0
for i in range(len(x)):
c += int(b[i])
if c == 10:
a += 1
if a != k:
b = str(int(b) + 1)
print(b) | for i in range(len(x)): | 6 | statement |
import sys
n=int(input())
s=input()
m=0
x=''
flag=0
for i in range(0,n):
if(i<n-1):
if(s[i]==s[i+1] and s[i]!='?'):
print("No")
sys.exit()
if(s[0]=='?' or s[n-1]=='?'):
flag=1
if(s[i]=='C' or s[i]=='M' or s[i]=='Y'):
if(x==s[i] and m==1):
flag=1
elif(m>1):
flag=1
m=0
x=s[i]
if(s[i]=='?'):
m=m+1;
if(flag==1):
print("Yes") | import sys
n=int(input())
s=input()
m=0
x=''
flag=138
for i in range(0,n):
if(i<n-1):
if(s[i]==s[i+1] and s[i]!='?'):
print("No")
sys.exit()
if(s[0]=='?' or s[n-1]=='?'):
flag=1
if(s[i]=='C' or s[i]=='M' or s[i]=='Y'):
if(x==s[i] and m==1):
flag=1
elif(m>1):
flag=1
m=0
x=s[i]
if(s[i]=='?'):
m=m+1;
if(flag==1):
print("Yes") | flag=138 | 6 | value |
import sys
n=int(input())
s=input()
m=0
x=''
flag=0
for i in range(0,n):
if(i<n-1):
if(s[i]==s[i+1] and s[i]!='?'):
print("No")
sys.exit()
if(s[0]=='?' or s[n-1]=='?'):
flag=1
if(s[i]=='C' or s[i]=='M' or s[i]=='Y'):
if(x==s[i] and m==1):
flag=1
elif(m>1):
flag=1
m=0
x=s[i]
if(s[i]=='?'):
m=m+1;
if(flag==1):
print("Yes") | import sys
n=int(input())
s=input()
m=0
x=''
flag=0
for i in range(0,n):
if(i<n+1):
if(s[i]==s[i+1] and s[i]!='?'):
print("No")
sys.exit()
if(s[0]=='?' or s[n-1]=='?'):
flag=1
if(s[i]=='C' or s[i]=='M' or s[i]=='Y'):
if(x==s[i] and m==1):
flag=1
elif(m>1):
flag=1
m=0
x=s[i]
if(s[i]=='?'):
m=m+1;
if(flag==1):
print("Yes") | if(i<n+1): | 8 | operation |
import sys
n=int(input())
s=input()
m=0
x=''
flag=0
for i in range(0,n):
if(i<n-1):
if(s[i]==s[i+1] and s[i]!='?'):
print("No")
sys.exit()
if(s[0]=='?' or s[n-1]=='?'):
flag=1
if(s[i]=='C' or s[i]=='M' or s[i]=='Y'):
if(x==s[i] and m==1):
flag=1
elif(m>1):
flag=1
m=0
x=s[i]
if(s[i]=='?'):
m=m+1;
if(flag==1):
print("Yes") | import sys
n=int(input())
s=input()
m=0
x=''
flag=0
for i in range(0,n):
if(i<n-1):
if(s[i]==s[i+1] and s[i]!='?'):
print("No")
sys.exit()
if(s[0]=='?' or s[n-1]=='?'):
flag=1
if(s[i]=='C' or s[i]=='M' or s[i]=='Y'):
if(x==s[i] and m==1):
flag=1
elif(m>1):
flag=1
m=0
x=s[i]
if(s[i]=='?'):
m=m<<1;
if(flag==1):
print("Yes") | m=m<<1; | 22 | operation |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.