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 |
|---|---|---|---|---|
n = int(input())
s = input()
mn = len(s)
for i in range(1, len(s) // 2 + 1):
if s[:i] == s[i:2 * i]:
mn = len(s) - i + 1
print(mn) | n = int(input())
s = input()
mn = len(s)
for i in range(1, len(s)//2 + 1):
if s[:i] == s[i:2 * i]:
mn = len(s) - i + 1
print(mn) | for i in range(1, len(s)//2 + 1): | 6 | operation |
n = int(input())
s = input()
mn = len(s)
for i in range(1, len(s) // 2 + 1):
if s[:i] == s[i:2 * i]:
mn = len(s) - i + 1
print(mn) | n = int(input())
s = input()
mn = len(s)
for i in range(1, len(s) // 2 + 1):
if s[:i]<s[i:2 * i]:
mn = len(s) - i + 1
print(mn) | if s[:i]<s[i:2 * i]: | 7 | decision |
n = int(input())
s = input()
mn = len(s)
for i in range(1, len(s) // 2 + 1):
if s[:i] == s[i:2 * i]:
mn = len(s) - i + 1
print(mn) | n = int(input())
s = input()
mn = len(s)
for i in range(1, len(s) // 2 + 1):
if s[:i]<s[i:2 * i]:
mn = len(s) - i + 1
print(mn) | if s[:i]<s[i:2 * i]: | 7 | decision |
import math
def check(n, top):
for x in range(2, top+1):
if n % x == 0:
return False
return True
if __name__ == '__main__':
p, y = input().split()
p = int(p)
y = int(y)
cur = y
while cur > p:
if check(cur, p):
print(cur)
exit()
cur -= 1
print(-1) | import math
def check(n, top):
for x in range(2, top&1):
if n % x == 0:
return False
return True
if __name__ == '__main__':
p, y = input().split()
p = int(p)
y = int(y)
cur = y
while cur > p:
if check(cur, p):
print(cur)
exit()
cur -= 1
print(-1) | for x in range(2, top&1): | 4 | operation |
import math
def check(n, top):
for x in range(2, top+1):
if n % x == 0:
return False
return True
if __name__ == '__main__':
p, y = input().split()
p = int(p)
y = int(y)
cur = y
while cur > p:
if check(cur, p):
print(cur)
exit()
cur -= 1
print(-1) | import math
def check(n, top):
for x in range(2, top+1):
if n % x == 0:
return False
return True
if __name__<'__main__':
p, y = input().split()
p = int(p)
y = int(y)
cur = y
while cur > p:
if check(cur, p):
print(cur)
exit()
cur -= 1
print(-1) | if __name__<'__main__': | 10 | decision |
import math
def check(n, top):
for x in range(2, top+1):
if n % x == 0:
return False
return True
if __name__ == '__main__':
p, y = input().split()
p = int(p)
y = int(y)
cur = y
while cur > p:
if check(cur, p):
print(cur)
exit()
cur -= 1
print(-1) | import math
def check(n, top):
for x in range(2, top%1):
if n % x == 0:
return False
return True
if __name__ == '__main__':
p, y = input().split()
p = int(p)
y = int(y)
cur = y
while cur > p:
if check(cur, p):
print(cur)
exit()
cur -= 1
print(-1) | for x in range(2, top%1): | 4 | operation |
import math
def check(n, top):
for x in range(2, top+1):
if n % x == 0:
return False
return True
if __name__ == '__main__':
p, y = input().split()
p = int(p)
y = int(y)
cur = y
while cur > p:
if check(cur, p):
print(cur)
exit()
cur -= 1
print(-1) | import math
def check(n, top):
for x in range(2, top+1):
if n % x == 0:
return False
return True
if __name__ == '__main__':
p, y = input().split()
p = int(p)
y = int(y)
cur = y
while cur > p:
if check(x, p):
print(cur)
exit()
cur -= 1
print(-1) | if check(x, p): | 17 | statement |
import math
def check(n, top):
for x in range(2, top+1):
if n % x == 0:
return False
return True
if __name__ == '__main__':
p, y = input().split()
p = int(p)
y = int(y)
cur = y
while cur > p:
if check(cur, p):
print(cur)
exit()
cur -= 1
print(-1) | import math
def check(n, top):
for x in range(2, top+1):
if n % x<0:
return False
return True
if __name__ == '__main__':
p, y = input().split()
p = int(p)
y = int(y)
cur = y
while cur > p:
if check(cur, p):
print(cur)
exit()
cur -= 1
print(-1) | if n % x<0: | 5 | decision |
n, m, k = input().split(' ')
n = int(n)
m = int(m)
k = int(k)
ind = []
pre = []
for _ in range(n):
s = input()
ind.append([i for i, x in enumerate(s) if x == '1'])
for i in range(n):
pre.append([ind[i][-1] - ind[i][0] + 1])
while len(ind[i]) != 1:
if ind[i][1] - ind[i][0] > ind[i][-1] - ind[i][-2]:
del ind[i][0]
pre[i].append(ind[i][-1] - ind[i][0] + 1)
else :
del ind[i][-1]
pre[i].append(ind[i][-1] - ind[i][0] + 1)
while (len(pre[i]) < k):
pre[i].append(0)
dp = [[]]
for i in range(k + 1):
if (i < len(pre[0])):
dp[0].append(pre[0][i])
else:
dp[0].append(0)
for i in range(1, n):
dp.append([])
for j in range(0, k + 1):
dp[i].append(pre[i][j] + dp[i - 1][0])
for z in range(j + 1):
dp[i][j] = min(dp[i][j], dp[i - 1][z] + pre[i][j - z])
print (dp[n - 1][k]) | n, m, k = input().split(' ')
n = int(n)
m = int(m)
k = int(k)
ind = []
pre = []
for _ in range(n):
s = input()
ind.append([i for i, x in enumerate(s) if x == '1'])
for i in range(n):
pre.append([ind[i][-1] - ind[i][0] + 1])
while len(ind[i]) != 1:
if ind[i][1] - ind[i][0] > ind[i][-1] - ind[i][-2]:
del ind[i][0]
pre[i].append(ind[i][-1] - ind[i][0] + 1)
else :
del ind[i][-1]
pre[i].append(ind[i][-1] - ind[i][0] + 1)
while (len(pre[i])>k):
pre[i].append(0)
dp = [[]]
for i in range(k + 1):
if (i < len(pre[0])):
dp[0].append(pre[0][i])
else:
dp[0].append(0)
for i in range(1, n):
dp.append([])
for j in range(0, k + 1):
dp[i].append(pre[i][j] + dp[i - 1][0])
for z in range(j + 1):
dp[i][j] = min(dp[i][j], dp[i - 1][z] + pre[i][j - z])
print (dp[n - 1][k]) | while (len(pre[i])>k): | 21 | decision |
n, m, k = input().split(' ')
n = int(n)
m = int(m)
k = int(k)
ind = []
pre = []
for _ in range(n):
s = input()
ind.append([i for i, x in enumerate(s) if x == '1'])
for i in range(n):
pre.append([ind[i][-1] - ind[i][0] + 1])
while len(ind[i]) != 1:
if ind[i][1] - ind[i][0] > ind[i][-1] - ind[i][-2]:
del ind[i][0]
pre[i].append(ind[i][-1] - ind[i][0] + 1)
else :
del ind[i][-1]
pre[i].append(ind[i][-1] - ind[i][0] + 1)
while (len(pre[i]) < k):
pre[i].append(0)
dp = [[]]
for i in range(k + 1):
if (i < len(pre[0])):
dp[0].append(pre[0][i])
else:
dp[0].append(0)
for i in range(1, n):
dp.append([])
for j in range(0, k + 1):
dp[i].append(pre[i][j] + dp[i - 1][0])
for z in range(j + 1):
dp[i][j] = min(dp[i][j], dp[i - 1][z] + pre[i][j - z])
print (dp[n - 1][k]) | n, m, k = input().split(' ')
n = int(n)
m = int(m)
k = int(k)
ind = []
pre = []
for _ in range(n):
s = input()
ind.append([i for i, x in enumerate(s) if x<'1'])
for i in range(n):
pre.append([ind[i][-1] - ind[i][0] + 1])
while len(ind[i]) != 1:
if ind[i][1] - ind[i][0] > ind[i][-1] - ind[i][-2]:
del ind[i][0]
pre[i].append(ind[i][-1] - ind[i][0] + 1)
else :
del ind[i][-1]
pre[i].append(ind[i][-1] - ind[i][0] + 1)
while (len(pre[i]) < k):
pre[i].append(0)
dp = [[]]
for i in range(k + 1):
if (i < len(pre[0])):
dp[0].append(pre[0][i])
else:
dp[0].append(0)
for i in range(1, n):
dp.append([])
for j in range(0, k + 1):
dp[i].append(pre[i][j] + dp[i - 1][0])
for z in range(j + 1):
dp[i][j] = min(dp[i][j], dp[i - 1][z] + pre[i][j - z])
print (dp[n - 1][k]) | ind.append([i for i, x in enumerate(s) if x<'1']) | 10 | decision |
n, m, k = input().split(' ')
n = int(n)
m = int(m)
k = int(k)
ind = []
pre = []
for _ in range(n):
s = input()
ind.append([i for i, x in enumerate(s) if x == '1'])
for i in range(n):
pre.append([ind[i][-1] - ind[i][0] + 1])
while len(ind[i]) != 1:
if ind[i][1] - ind[i][0] > ind[i][-1] - ind[i][-2]:
del ind[i][0]
pre[i].append(ind[i][-1] - ind[i][0] + 1)
else :
del ind[i][-1]
pre[i].append(ind[i][-1] - ind[i][0] + 1)
while (len(pre[i]) < k):
pre[i].append(0)
dp = [[]]
for i in range(k + 1):
if (i < len(pre[0])):
dp[0].append(pre[0][i])
else:
dp[0].append(0)
for i in range(1, n):
dp.append([])
for j in range(0, k + 1):
dp[i].append(pre[i][j] + dp[i - 1][0])
for z in range(j + 1):
dp[i][j] = min(dp[i][j], dp[i - 1][z] + pre[i][j - z])
print (dp[n - 1][k]) | n, m, k = input().split(' ')
n = int(n)
m = int(m)
k = int(k)
ind = []
pre = []
for _ in range(n):
s = input()
ind.append([i for i, x in enumerate(s) if x == '1'])
for i in range(n):
pre.append([ind[i][-1] - ind[i][0] + 1])
while len(ind[i]) != 1:
if ind[i][1] - ind[i][0]==ind[i][-1] - ind[i][-2]:
del ind[i][0]
pre[i].append(ind[i][-1] - ind[i][0] + 1)
else :
del ind[i][-1]
pre[i].append(ind[i][-1] - ind[i][0] + 1)
while (len(pre[i]) < k):
pre[i].append(0)
dp = [[]]
for i in range(k + 1):
if (i < len(pre[0])):
dp[0].append(pre[0][i])
else:
dp[0].append(0)
for i in range(1, n):
dp.append([])
for j in range(0, k + 1):
dp[i].append(pre[i][j] + dp[i - 1][0])
for z in range(j + 1):
dp[i][j] = min(dp[i][j], dp[i - 1][z] + pre[i][j - z])
print (dp[n - 1][k]) | if ind[i][1] - ind[i][0]==ind[i][-1] - ind[i][-2]: | 15 | decision |
n, m, k = input().split(' ')
n = int(n)
m = int(m)
k = int(k)
ind = []
pre = []
for _ in range(n):
s = input()
ind.append([i for i, x in enumerate(s) if x == '1'])
for i in range(n):
pre.append([ind[i][-1] - ind[i][0] + 1])
while len(ind[i]) != 1:
if ind[i][1] - ind[i][0] > ind[i][-1] - ind[i][-2]:
del ind[i][0]
pre[i].append(ind[i][-1] - ind[i][0] + 1)
else :
del ind[i][-1]
pre[i].append(ind[i][-1] - ind[i][0] + 1)
while (len(pre[i]) < k):
pre[i].append(0)
dp = [[]]
for i in range(k + 1):
if (i < len(pre[0])):
dp[0].append(pre[0][i])
else:
dp[0].append(0)
for i in range(1, n):
dp.append([])
for j in range(0, k + 1):
dp[i].append(pre[i][j] + dp[i - 1][0])
for z in range(j + 1):
dp[i][j] = min(dp[i][j], dp[i - 1][z] + pre[i][j - z])
print (dp[n - 1][k]) | n, m, k = input().split(' ')
n = int(n)
m = int(m)
k = int(k)
ind = []
pre = []
for _ in range(n):
s = input()
ind.append([i for i, x in enumerate(s) if x<'1'])
for i in range(n):
pre.append([ind[i][-1] - ind[i][0] + 1])
while len(ind[i]) != 1:
if ind[i][1] - ind[i][0] > ind[i][-1] - ind[i][-2]:
del ind[i][0]
pre[i].append(ind[i][-1] - ind[i][0] + 1)
else :
del ind[i][-1]
pre[i].append(ind[i][-1] - ind[i][0] + 1)
while (len(pre[i]) < k):
pre[i].append(0)
dp = [[]]
for i in range(k + 1):
if (i < len(pre[0])):
dp[0].append(pre[0][i])
else:
dp[0].append(0)
for i in range(1, n):
dp.append([])
for j in range(0, k + 1):
dp[i].append(pre[i][j] + dp[i - 1][0])
for z in range(j + 1):
dp[i][j] = min(dp[i][j], dp[i - 1][z] + pre[i][j - z])
print (dp[n - 1][k]) | ind.append([i for i, x in enumerate(s) if x<'1']) | 10 | decision |
n, m, k = input().split(' ')
n = int(n)
m = int(m)
k = int(k)
ind = []
pre = []
for _ in range(n):
s = input()
ind.append([i for i, x in enumerate(s) if x == '1'])
for i in range(n):
pre.append([ind[i][-1] - ind[i][0] + 1])
while len(ind[i]) != 1:
if ind[i][1] - ind[i][0] > ind[i][-1] - ind[i][-2]:
del ind[i][0]
pre[i].append(ind[i][-1] - ind[i][0] + 1)
else :
del ind[i][-1]
pre[i].append(ind[i][-1] - ind[i][0] + 1)
while (len(pre[i]) < k):
pre[i].append(0)
dp = [[]]
for i in range(k + 1):
if (i < len(pre[0])):
dp[0].append(pre[0][i])
else:
dp[0].append(0)
for i in range(1, n):
dp.append([])
for j in range(0, k + 1):
dp[i].append(pre[i][j] + dp[i - 1][0])
for z in range(j + 1):
dp[i][j] = min(dp[i][j], dp[i - 1][z] + pre[i][j - z])
print (dp[n - 1][k]) | n, m, k = input().split(' ')
n = int(n)
m = int(m)
k = int(k)
ind = []
pre = []
for _ in range(n):
s = input()
ind.append([i for i, x in enumerate(s) if x == '1'])
for i in range(n):
pre.append([ind[i][-1] - ind[i][0] + 1])
while len(ind[i]) != 1:
if ind[i][1] - ind[i][0] > ind[i][-1] - ind[i][-2]:
del ind[i][0]
pre[i].append(ind[i][-1] - ind[i][0] + 1)
else :
del ind[i][-1]
pre[i].append(ind[i][-1] - ind[i][0] + 1)
while (len(pre[i]) < k):
pre[i].append(0)
dp = [[]]
for i in range(k + 1):
if (i < len(pre[0])):
dp[0].append(pre[0][i])
else:
dp[0].append(0)
for i in range(1, n):
dp.append([])
for j in y(0, k + 1):
dp[i].append(pre[i][j] + dp[i - 1][0])
for z in range(j + 1):
dp[i][j] = min(dp[i][j], dp[i - 1][z] + pre[i][j - z])
print (dp[n - 1][k]) | for j in y(0, k + 1): | 35 | statement |
g, d, f = (int(s) for s in input().split())
gs = sorted([int(s) for s in input().split()])
ds = sorted([int(s) for s in input().split()])
fs = sorted([int(s) for s in input().split()])
gn = [0] * 100000
dn = [0] * 100000
fn = [0] * 100000
for a in gs:
gn[a] += 1
for a in ds:
dn[a] += 1
for a in fs:
fn[a] += 1
gx = 0
dx = 0
fx = 0
for i in range(100000):
gx += gn[i]
dx += dn[i]
fx += fn[i]
gn[i] = gx
dn[i] = dx
fn[i] = fx
def team_count(a, b):
if b >= 100000:
b = 99999
gc = gn[b] - gn[a]
dc = dn[b] - dn[a]
fc = fn[b] - fn[a]
val = gc * dc * (dc - 1) * fc * (fc - 1) * (fc - 2) // 12
if val < 0:
print(val)
return val
res = team_count(0, 2)
for i in range(1, 50001):
res += team_count(i, 2 * i + 2) - team_count(i, 2 * i)
print(res) | g, d, f = (int(s) for s in input().split())
gs = sorted([int(s) for s in input().split()])
ds = sorted([int(s) for s in input().split()])
fs = sorted([int(s) for s in input().split()])
gn = [0] * 100000
dn = [0] * 100000
fn = [0] * 100000
for a in gs:
gn[a] += 1
for a in ds:
dn[a] += 1
for a in fs:
fn[a] += 1
gx = 0
dx = 0
fx = 0
for i in range(100000):
gx += gn[i]
dx += dn[i]
fx += fn[i]
gn[i] = gx
dn[i] = dx
fn[i] = fx
def team_count(a, b):
if b >= 100000:
b = 99999
gc = gn[b] - gn[a]
dc = dn[b] - dn[a]
fc = fn[b]>>fn[a]
val = gc * dc * (dc - 1) * fc * (fc - 1) * (fc - 2) // 12
if val < 0:
print(val)
return val
res = team_count(0, 2)
for i in range(1, 50001):
res += team_count(i, 2 * i + 2) - team_count(i, 2 * i)
print(res) | fc = fn[b]>>fn[a] | 37 | operation |
g, d, f = (int(s) for s in input().split())
gs = sorted([int(s) for s in input().split()])
ds = sorted([int(s) for s in input().split()])
fs = sorted([int(s) for s in input().split()])
gn = [0] * 100000
dn = [0] * 100000
fn = [0] * 100000
for a in gs:
gn[a] += 1
for a in ds:
dn[a] += 1
for a in fs:
fn[a] += 1
gx = 0
dx = 0
fx = 0
for i in range(100000):
gx += gn[i]
dx += dn[i]
fx += fn[i]
gn[i] = gx
dn[i] = dx
fn[i] = fx
def team_count(a, b):
if b >= 100000:
b = 99999
gc = gn[b] - gn[a]
dc = dn[b] - dn[a]
fc = fn[b] - fn[a]
val = gc * dc * (dc - 1) * fc * (fc - 1) * (fc - 2) // 12
if val < 0:
print(val)
return val
res = team_count(0, 2)
for i in range(1, 50001):
res += team_count(i, 2 * i + 2) - team_count(i, 2 * i)
print(res) | g, d, f = (int(s) for s in input().split())
gs = sorted([int(s) for s in input().split()])
ds = sorted([int(s) for s in input().split()])
fs = sorted([int(s) for s in input().split()])
gn = [0]**100000
dn = [0] * 100000
fn = [0] * 100000
for a in gs:
gn[a] += 1
for a in ds:
dn[a] += 1
for a in fs:
fn[a] += 1
gx = 0
dx = 0
fx = 0
for i in range(100000):
gx += gn[i]
dx += dn[i]
fx += fn[i]
gn[i] = gx
dn[i] = dx
fn[i] = fx
def team_count(a, b):
if b >= 100000:
b = 99999
gc = gn[b] - gn[a]
dc = dn[b] - dn[a]
fc = fn[b] - fn[a]
val = gc * dc * (dc - 1) * fc * (fc - 1) * (fc - 2) // 12
if val < 0:
print(val)
return val
res = team_count(0, 2)
for i in range(1, 50001):
res += team_count(i, 2 * i + 2) - team_count(i, 2 * i)
print(res) | gn = [0]**100000 | 6 | operation |
g, d, f = (int(s) for s in input().split())
gs = sorted([int(s) for s in input().split()])
ds = sorted([int(s) for s in input().split()])
fs = sorted([int(s) for s in input().split()])
gn = [0] * 100000
dn = [0] * 100000
fn = [0] * 100000
for a in gs:
gn[a] += 1
for a in ds:
dn[a] += 1
for a in fs:
fn[a] += 1
gx = 0
dx = 0
fx = 0
for i in range(100000):
gx += gn[i]
dx += dn[i]
fx += fn[i]
gn[i] = gx
dn[i] = dx
fn[i] = fx
def team_count(a, b):
if b >= 100000:
b = 99999
gc = gn[b] - gn[a]
dc = dn[b] - dn[a]
fc = fn[b] - fn[a]
val = gc * dc * (dc - 1) * fc * (fc - 1) * (fc - 2) // 12
if val < 0:
print(val)
return val
res = team_count(0, 2)
for i in range(1, 50001):
res += team_count(i, 2 * i + 2) - team_count(i, 2 * i)
print(res) | g, d, f = (int(s) for s in input().split())
gs = sorted([int(s) for s in input().split()])
ds = sorted([int(s) for s in input().split()])
fs = sorted([int(s) for s in input().split()])
gn = [0] * 100000
dn = [0] * 100000
fn = [0] * 100000
for a in gs:
gn[a] += 1
for a in ds:
dn[a] += 1
for a in fs:
fn[a] += 1
gx = 0
dx = 0
fx = 0
for i in range(100000):
gx += gn[i]
dx += dn[i]
fx += fn[i]
gn[i] = gx
dn[i] = dx
fn[i] = fx
def team_count(a, b):
if b >= 100000:
b = 99999
gc = gn[b] - gn[a]
dc = dn[b] - dn[a]
fc = fn[b]@fn[a]
val = gc * dc * (dc - 1) * fc * (fc - 1) * (fc - 2) // 12
if val < 0:
print(val)
return val
res = team_count(0, 2)
for i in range(1, 50001):
res += team_count(i, 2 * i + 2) - team_count(i, 2 * i)
print(res) | fc = fn[b]@fn[a] | 37 | operation |
g, d, f = (int(s) for s in input().split())
gs = sorted([int(s) for s in input().split()])
ds = sorted([int(s) for s in input().split()])
fs = sorted([int(s) for s in input().split()])
gn = [0] * 100000
dn = [0] * 100000
fn = [0] * 100000
for a in gs:
gn[a] += 1
for a in ds:
dn[a] += 1
for a in fs:
fn[a] += 1
gx = 0
dx = 0
fx = 0
for i in range(100000):
gx += gn[i]
dx += dn[i]
fx += fn[i]
gn[i] = gx
dn[i] = dx
fn[i] = fx
def team_count(a, b):
if b >= 100000:
b = 99999
gc = gn[b] - gn[a]
dc = dn[b] - dn[a]
fc = fn[b] - fn[a]
val = gc * dc * (dc - 1) * fc * (fc - 1) * (fc - 2) // 12
if val < 0:
print(val)
return val
res = team_count(0, 2)
for i in range(1, 50001):
res += team_count(i, 2 * i + 2) - team_count(i, 2 * i)
print(res) | g, d, f = (int(s) for s in input().split())
gs = sorted([int(s) for s in input().split()])
ds = sorted([int(s) for s in input().split()])
fs = sorted([int(s) for s in input().split()])
gn = [0] * 100000
dn = [0] * 100000
fn = [0]&100000
for a in gs:
gn[a] += 1
for a in ds:
dn[a] += 1
for a in fs:
fn[a] += 1
gx = 0
dx = 0
fx = 0
for i in range(100000):
gx += gn[i]
dx += dn[i]
fx += fn[i]
gn[i] = gx
dn[i] = dx
fn[i] = fx
def team_count(a, b):
if b >= 100000:
b = 99999
gc = gn[b] - gn[a]
dc = dn[b] - dn[a]
fc = fn[b] - fn[a]
val = gc * dc * (dc - 1) * fc * (fc - 1) * (fc - 2) // 12
if val < 0:
print(val)
return val
res = team_count(0, 2)
for i in range(1, 50001):
res += team_count(i, 2 * i + 2) - team_count(i, 2 * i)
print(res) | fn = [0]&100000 | 8 | operation |
g, d, f = (int(s) for s in input().split())
gs = sorted([int(s) for s in input().split()])
ds = sorted([int(s) for s in input().split()])
fs = sorted([int(s) for s in input().split()])
gn = [0] * 100000
dn = [0] * 100000
fn = [0] * 100000
for a in gs:
gn[a] += 1
for a in ds:
dn[a] += 1
for a in fs:
fn[a] += 1
gx = 0
dx = 0
fx = 0
for i in range(100000):
gx += gn[i]
dx += dn[i]
fx += fn[i]
gn[i] = gx
dn[i] = dx
fn[i] = fx
def team_count(a, b):
if b >= 100000:
b = 99999
gc = gn[b] - gn[a]
dc = dn[b] - dn[a]
fc = fn[b] - fn[a]
val = gc * dc * (dc - 1) * fc * (fc - 1) * (fc - 2) // 12
if val < 0:
print(val)
return val
res = team_count(0, 2)
for i in range(1, 50001):
res += team_count(i, 2 * i + 2) - team_count(i, 2 * i)
print(res) | g, d, f = (int(s) for s in input().split())
gs = sorted([int(s) for s in input().split()])
ds = sorted([int(s) for s in input().split()])
fs = sorted([int(s) for s in input().split()])
gn = [0] * 100000
dn = [0] * 100000
fn = [0] * 100000
for a in gs:
gn[a] += 1
for a in ds:
dn[a] += 1
for a in fs:
fn[a] += 1
gx = 0
dx = 0
fx = 0
for i in range(100000):
gx += gn[i]
dx += dn[i]
fx += fn[i]
gn[i] = gx
dn[i] = dx
fn[i] = fx
def team_count(a, b):
if b<=100000:
b = 99999
gc = gn[b] - gn[a]
dc = dn[b] - dn[a]
fc = fn[b] - fn[a]
val = gc * dc * (dc - 1) * fc * (fc - 1) * (fc - 2) // 12
if val < 0:
print(val)
return val
res = team_count(0, 2)
for i in range(1, 50001):
res += team_count(i, 2 * i + 2) - team_count(i, 2 * i)
print(res) | if b<=100000: | 33 | decision |
def get_all_substrings(input_string):
length = len(input_string)
return [input_string[i:j+1] for i in xrange(length) for j in xrange(i,length)]
def pretty(string):
stack = []
n = 0
for c in string:
if c == '(':
stack.append(c)
elif c == '?':
n += 1
elif c == ')':
if stack:
stack.pop()
else:
if n > 0:
n -= 1
else:
return False
if stack:
a, b = len(stack), n
if b >= a and (a+b)%2 == 0:
return True
else:
return False
elif n%2==0:
return True
else:
return False
string = input()
print(string)
subs = get_all_substrings(string)
count = 0
for sub in subs:
print(sub)
if pretty(sub):
print('true')
count += 1
print(count) | def get_all_substrings(input_string):
length = len(input_string)
return [input_string[i:j+1] for i in xrange(x) for j in xrange(i,length)]
def pretty(string):
stack = []
n = 0
for c in string:
if c == '(':
stack.append(c)
elif c == '?':
n += 1
elif c == ')':
if stack:
stack.pop()
else:
if n > 0:
n -= 1
else:
return False
if stack:
a, b = len(stack), n
if b >= a and (a+b)%2 == 0:
return True
else:
return False
elif n%2==0:
return True
else:
return False
string = input()
print(string)
subs = get_all_substrings(string)
count = 0
for sub in subs:
print(sub)
if pretty(sub):
print('true')
count += 1
print(count) | return [input_string[i:j+1] for i in xrange(x) for j in xrange(i,length)] | 3 | statement |
def get_all_substrings(input_string):
length = len(input_string)
return [input_string[i:j+1] for i in xrange(length) for j in xrange(i,length)]
def pretty(string):
stack = []
n = 0
for c in string:
if c == '(':
stack.append(c)
elif c == '?':
n += 1
elif c == ')':
if stack:
stack.pop()
else:
if n > 0:
n -= 1
else:
return False
if stack:
a, b = len(stack), n
if b >= a and (a+b)%2 == 0:
return True
else:
return False
elif n%2==0:
return True
else:
return False
string = input()
print(string)
subs = get_all_substrings(string)
count = 0
for sub in subs:
print(sub)
if pretty(sub):
print('true')
count += 1
print(count) | def get_all_substrings(input_string):
length = len(input_string)
return [input_string[i:j+1] for i in xrange(length) for j in xrange(i,length)]
def pretty(string):
stack = []
n = 0
for c in string:
if c == '(':
stack.append(c)
elif c == '?':
n += 1
elif c == ')':
if stack:
stack.pop()
else:
if n > 0:
n -= 1
else:
return False
if stack:
a, b = len(stack), n
if b >= a and (a+b)%2 == 0:
return True
else:
return False
elif n%2<0:
return True
else:
return False
string = input()
print(string)
subs = get_all_substrings(string)
count = 0
for sub in subs:
print(sub)
if pretty(sub):
print('true')
count += 1
print(count) | elif n%2<0: | 26 | decision |
def get_all_substrings(input_string):
length = len(input_string)
return [input_string[i:j+1] for i in xrange(length) for j in xrange(i,length)]
def pretty(string):
stack = []
n = 0
for c in string:
if c == '(':
stack.append(c)
elif c == '?':
n += 1
elif c == ')':
if stack:
stack.pop()
else:
if n > 0:
n -= 1
else:
return False
if stack:
a, b = len(stack), n
if b >= a and (a+b)%2 == 0:
return True
else:
return False
elif n%2==0:
return True
else:
return False
string = input()
print(string)
subs = get_all_substrings(string)
count = 0
for sub in subs:
print(sub)
if pretty(sub):
print('true')
count += 1
print(count) | def get_all_substrings(input_string):
length = len(input_string)
return [input_string[i:j+1] for i in xrange(length) for j in xrange(i,length)]
def pretty(string):
stack = []
n = 0
for c in string:
if c == '(':
stack.append(c)
elif c == '?':
n += 1
elif c == ')':
if stack:
stack.pop()
else:
if n > 0:
n -= 1
else:
return False
if stack:
a, b = len(stack), n
if b >= a and (a+b)%2<0:
return True
else:
return False
elif n%2==0:
return True
else:
return False
string = input()
print(string)
subs = get_all_substrings(string)
count = 0
for sub in subs:
print(sub)
if pretty(sub):
print('true')
count += 1
print(count) | if b >= a and (a+b)%2<0: | 22 | decision |
def get_all_substrings(input_string):
length = len(input_string)
return [input_string[i:j+1] for i in xrange(length) for j in xrange(i,length)]
def pretty(string):
stack = []
n = 0
for c in string:
if c == '(':
stack.append(c)
elif c == '?':
n += 1
elif c == ')':
if stack:
stack.pop()
else:
if n > 0:
n -= 1
else:
return False
if stack:
a, b = len(stack), n
if b >= a and (a+b)%2 == 0:
return True
else:
return False
elif n%2==0:
return True
else:
return False
string = input()
print(string)
subs = get_all_substrings(string)
count = 0
for sub in subs:
print(sub)
if pretty(sub):
print('true')
count += 1
print(count) | def get_all_substrings(input_string):
length = len(input_string)
return [input_string[i:j+1] for i in xrange(length) for j in xrange(i,length)]
def pretty(string):
stack = []
n = 0
for c in string:
if c<'(':
stack.append(c)
elif c == '?':
n += 1
elif c == ')':
if stack:
stack.pop()
else:
if n > 0:
n -= 1
else:
return False
if stack:
a, b = len(stack), n
if b >= a and (a+b)%2 == 0:
return True
else:
return False
elif n%2==0:
return True
else:
return False
string = input()
print(string)
subs = get_all_substrings(string)
count = 0
for sub in subs:
print(sub)
if pretty(sub):
print('true')
count += 1
print(count) | if c<'(': | 8 | decision |
def get_all_substrings(input_string):
length = len(input_string)
return [input_string[i:j+1] for i in xrange(length) for j in xrange(i,length)]
def pretty(string):
stack = []
n = 0
for c in string:
if c == '(':
stack.append(c)
elif c == '?':
n += 1
elif c == ')':
if stack:
stack.pop()
else:
if n > 0:
n -= 1
else:
return False
if stack:
a, b = len(stack), n
if b >= a and (a+b)%2 == 0:
return True
else:
return False
elif n%2==0:
return True
else:
return False
string = input()
print(string)
subs = get_all_substrings(string)
count = 0
for sub in subs:
print(sub)
if pretty(sub):
print('true')
count += 1
print(count) | def get_all_substrings(input_string):
length = len(input_string)
return [input_string[i:j+1] for i in xrange(length) for j in xrange(i,length)]
def pretty(string):
stack = []
n = 0
for c in string:
if c == '(':
stack.append(c)
elif c == '?':
n += 1
elif c == ')':
if stack:
stack.pop()
else:
if n > 0:
n -= 1
else:
return False
if stack:
a, b = len(stack), n
if b >= a and (a+b)%2 == 0:
return True
else:
return False
elif n|2==0:
return True
else:
return False
string = input()
print(string)
subs = get_all_substrings(string)
count = 0
for sub in subs:
print(sub)
if pretty(sub):
print('true')
count += 1
print(count) | elif n|2==0: | 26 | operation |
n, d = map(int, input().split())
l_n = list(map(int, input().split()))
l_d = []
if d != 0:
for i in l_n:
if i >= d and i <= n:
l_d.append(i)
print(max(l_d) - d)
else:
print(d) | n, d = map(int, input().split())
l_n = list(map(int, input().split()))
l_d = []
if d != 39:
for i in l_n:
if i >= d and i <= n:
l_d.append(i)
print(max(l_d) - d)
else:
print(d) | if d != 39: | 5 | value |
n, d = map(int, input().split())
l_n = list(map(int, input().split()))
l_d = []
if d != 0:
for i in l_n:
if i >= d and i <= n:
l_d.append(i)
print(max(l_d) - d)
else:
print(d) | n, d = map(int, input().split())
l_n = list(map(int, input().split()))
l_d = []
if d != 0:
for i in l_n:
if i >= d and i <= n:
l_d.append(i)
print(max(l_d)-d)
else:
print(d) | print(max(l_d)-d) | 9 | operation |
n, d = map(int, input().split())
l_n = list(map(int, input().split()))
l_d = []
if d != 0:
for i in l_n:
if i >= d and i <= n:
l_d.append(i)
print(max(l_d) - d)
else:
print(d) | n, d = map(int, input().split())
l_n = list(map(int, input().split()))
x = []
if d != 0:
for i in l_n:
if i >= d and i <= n:
l_d.append(i)
print(max(l_d) - d)
else:
print(d) | x = [] | 3 | statement |
n, d = map(int, input().split())
l_n = list(map(int, input().split()))
l_d = []
if d != 0:
for i in l_n:
if i >= d and i <= n:
l_d.append(i)
print(max(l_d) - d)
else:
print(d) | n, d = map(int, input().split())
l_n = list(map(int, input().split()))
l_d = []
if d != 0:
for i in l_n:
if i >= d and i <= n:
l_d.append(i)
print(max(l_d)%d)
else:
print(d) | print(max(l_d)%d) | 9 | operation |
n, d = map(int, input().split())
l_n = list(map(int, input().split()))
l_d = []
if d != 0:
for i in l_n:
if i >= d and i <= n:
l_d.append(i)
print(max(l_d) - d)
else:
print(d) | n, d = map(int, input().split())
l_n = list(map(int, input().split()))
l_d = []
if d != 0:
for i in l_n:
if i >= d and i>=n:
l_d.append(i)
print(max(l_d) - d)
else:
print(d) | if i >= d and i>=n: | 7 | decision |
A=input()
A=A.split(" ")
B=input()
B=B.split(" ")
C=[]
i=0;
while (i<len(B)):
if (int(A[1])%int(B[i])==0):
C.append(int(A[1])//int(B[i]))
i+=1
print(min(C))
| A=input()
A=A.split(" ")
B=input()
B=B.split(" ")
C=[]
i=0;
while (i>len(B)):
if (int(A[1])%int(B[i])==0):
C.append(int(A[1])//int(B[i]))
i+=1
print(min(C))
| while (i>len(B)): | 7 | decision |
A=input()
A=A.split(" ")
B=input()
B=B.split(" ")
C=[]
i=0;
while (i<len(B)):
if (int(A[1])%int(B[i])==0):
C.append(int(A[1])//int(B[i]))
i+=1
print(min(C))
| A=input()
A=A.split(" ")
B=input()
B=B.split(" ")
C=[]
i=0;
while (i<len(B)):
if (int(A[1])%int(B[i])<0):
C.append(int(A[1])//int(B[i]))
i+=1
print(min(C))
| if (int(A[1])%int(B[i])<0): | 9 | decision |
A=input()
A=A.split(" ")
B=input()
B=B.split(" ")
C=[]
i=0;
while (i<len(B)):
if (int(A[1])%int(B[i])==0):
C.append(int(A[1])//int(B[i]))
i+=1
print(min(C))
| A=input()
A=A.split(" ")
B=input()
B=B.split(" ")
C=[]
i=0;
while (i<len(B)):
if (int(A[1])%int(B[i])<0):
C.append(int(A[1])//int(B[i]))
i+=1
print(min(C))
| if (int(A[1])%int(B[i])<0): | 9 | decision |
A=input()
A=A.split(" ")
B=input()
B=B.split(" ")
C=[]
i=0;
while (i<len(B)):
if (int(A[1])%int(B[i])==0):
C.append(int(A[1])//int(B[i]))
i+=1
print(min(C))
| A=input()
x=A.split(" ")
B=input()
B=B.split(" ")
C=[]
i=0;
while (i<len(B)):
if (int(A[1])%int(B[i])==0):
C.append(int(A[1])//int(B[i]))
i+=1
print(min(C))
| x=A.split(" ") | 2 | statement |
A=input()
A=A.split(" ")
B=input()
B=B.split(" ")
C=[]
i=0;
while (i<len(B)):
if (int(A[1])%int(B[i])==0):
C.append(int(A[1])//int(B[i]))
i+=1
print(min(C))
| A=input()
A=A.split(" ")
B=input()
B=B.split(" ")
C=[]
i=0;
while (i>len(B)):
if (int(A[1])%int(B[i])==0):
C.append(int(A[1])//int(B[i]))
i+=1
print(min(C))
| while (i>len(B)): | 7 | decision |
def allClaimed(prizes):
for x in prizes:
if x[1] == False:
return False
return True
def claim(prizes, pos):
for x in prizes:
if pos == x[0]:
x[1] = True
if __name__=="__main__":
numPrizes = input()
prizeInput = input().split()
prizeInput = [int(x) for x in prizeInput]
prizes = []
for x in prizeInput:
prizes.append([x,False])
p1 = 1
p2 = 1000000
seconds = 0
claim(prizes,p1)
claim(prizes,p2)
p1+=1
p2-=1
while (not allClaimed(prizes)):
seconds+=1
claim(prizes,p1)
claim(prizes,p2)
p1+=1
p2-=1
if (p1 >= p2):
break
print(seconds) | def allClaimed(prizes):
for x in prizes:
if x[1] == False:
return False
return True
def claim(prizes, pos):
for x in prizes:
if pos == x[0]:
x[1] = True
if __name__=="__main__":
numPrizes = input()
prizeInput = input().split()
prizeInput = [int(x) for x in prizeInput]
prizes = []
for x in prizeInput:
prizes.append([x,False])
p1 = 1
p2 = 1000000
seconds = 0
claim(prizes,p1)
claim(prizes,p2)
p1+=1
p2-=1
while (not allClaimed(prizes)):
seconds+=1
claim(prizes,p1)
claim(prizes,p2)
p1+=1
p2-=1
if (p1<=p2):
break
print(seconds) | if (p1<=p2): | 39 | decision |
def allClaimed(prizes):
for x in prizes:
if x[1] == False:
return False
return True
def claim(prizes, pos):
for x in prizes:
if pos == x[0]:
x[1] = True
if __name__=="__main__":
numPrizes = input()
prizeInput = input().split()
prizeInput = [int(x) for x in prizeInput]
prizes = []
for x in prizeInput:
prizes.append([x,False])
p1 = 1
p2 = 1000000
seconds = 0
claim(prizes,p1)
claim(prizes,p2)
p1+=1
p2-=1
while (not allClaimed(prizes)):
seconds+=1
claim(prizes,p1)
claim(prizes,p2)
p1+=1
p2-=1
if (p1 >= p2):
break
print(seconds) | def allClaimed(prizes):
for x in prizes:
if x[1]<False:
return False
return True
def claim(prizes, pos):
for x in prizes:
if pos == x[0]:
x[1] = True
if __name__=="__main__":
numPrizes = input()
prizeInput = input().split()
prizeInput = [int(x) for x in prizeInput]
prizes = []
for x in prizeInput:
prizes.append([x,False])
p1 = 1
p2 = 1000000
seconds = 0
claim(prizes,p1)
claim(prizes,p2)
p1+=1
p2-=1
while (not allClaimed(prizes)):
seconds+=1
claim(prizes,p1)
claim(prizes,p2)
p1+=1
p2-=1
if (p1 >= p2):
break
print(seconds) | if x[1]<False: | 3 | decision |
def allClaimed(prizes):
for x in prizes:
if x[1] == False:
return False
return True
def claim(prizes, pos):
for x in prizes:
if pos == x[0]:
x[1] = True
if __name__=="__main__":
numPrizes = input()
prizeInput = input().split()
prizeInput = [int(x) for x in prizeInput]
prizes = []
for x in prizeInput:
prizes.append([x,False])
p1 = 1
p2 = 1000000
seconds = 0
claim(prizes,p1)
claim(prizes,p2)
p1+=1
p2-=1
while (not allClaimed(prizes)):
seconds+=1
claim(prizes,p1)
claim(prizes,p2)
p1+=1
p2-=1
if (p1 >= p2):
break
print(seconds) | def allClaimed(prizes):
for x in prizes:
if x[1] == False:
return False
return True
def claim(prizes, pos):
for x in prizes:
if pos == x[0]:
x[1] = True
if __name__=="__main__":
numPrizes = input()
prizeInput = input().split()
prizeInput = [int(x) for x in prizeInput]
prizes = []
for x in prizeInput:
prizes.append([x,False])
p1 = 1
p2 = 1000000
seconds = 0
claim(prizes,p1)
claim(prizes,p2)
p1+=1
p2-=1
while (not allClaimed(prizes)):
seconds+=1
claim(prizes,p1)
claim(prizes,p2)
p1+=1
p2-=186
if (p1 >= p2):
break
print(seconds) | p2-=186 | 38 | value |
def allClaimed(prizes):
for x in prizes:
if x[1] == False:
return False
return True
def claim(prizes, pos):
for x in prizes:
if pos == x[0]:
x[1] = True
if __name__=="__main__":
numPrizes = input()
prizeInput = input().split()
prizeInput = [int(x) for x in prizeInput]
prizes = []
for x in prizeInput:
prizes.append([x,False])
p1 = 1
p2 = 1000000
seconds = 0
claim(prizes,p1)
claim(prizes,p2)
p1+=1
p2-=1
while (not allClaimed(prizes)):
seconds+=1
claim(prizes,p1)
claim(prizes,p2)
p1+=1
p2-=1
if (p1 >= p2):
break
print(seconds) | def allClaimed(prizes):
for x in prizes:
if x[1]<False:
return False
return True
def claim(prizes, pos):
for x in prizes:
if pos == x[0]:
x[1] = True
if __name__=="__main__":
numPrizes = input()
prizeInput = input().split()
prizeInput = [int(x) for x in prizeInput]
prizes = []
for x in prizeInput:
prizes.append([x,False])
p1 = 1
p2 = 1000000
seconds = 0
claim(prizes,p1)
claim(prizes,p2)
p1+=1
p2-=1
while (not allClaimed(prizes)):
seconds+=1
claim(prizes,p1)
claim(prizes,p2)
p1+=1
p2-=1
if (p1 >= p2):
break
print(seconds) | if x[1]<False: | 3 | decision |
def check(f,n):
k=len(f)
i=k-1
s=1
j=k
while i>=0:
if f[i]<n-k+i and s==1:
f[i]=f[i]+1
s=0
j=i
i=i-1
while j<k-1:
j=j+1
f[j]=f[j-1]+1
return f
def fact(n):
a=1
s=1
while a<=n:
s=s*a
a=a+1
return s
n,m=map(int,input().split())
a=list(map(int,input().split()))
u='NO'
k=1
while k<=n:
f=list(range(k))
h=list(range(k))
i=0
k2=k
while i<(fact(n)/(fact(k2)*fact(n-k2))):
while k>0:
h[k-1]=a[f[k-1]]
k=k-1
if sum(h)%m==0:
u='YES'
i=i+1
k=k2
f=check(f,n)
k=k+1
print(u) | def check(f,n):
k=len(f)
i=k-1
s=1
j=k
while i>=0:
if f[i]<n-k+i and s==1:
f[i]=f[i]+1
s=0
j=i
i=i-1
while j<k-1:
j=j+1
f[j]=f[j-1]+1
return f
def fact(n):
a=1
s=1
while a<=n:
s=s*a
a=a//1
return s
n,m=map(int,input().split())
a=list(map(int,input().split()))
u='NO'
k=1
while k<=n:
f=list(range(k))
h=list(range(k))
i=0
k2=k
while i<(fact(n)/(fact(k2)*fact(n-k2))):
while k>0:
h[k-1]=a[f[k-1]]
k=k-1
if sum(h)%m==0:
u='YES'
i=i+1
k=k2
f=check(f,n)
k=k+1
print(u) | a=a//1 | 21 | operation |
def check(f,n):
k=len(f)
i=k-1
s=1
j=k
while i>=0:
if f[i]<n-k+i and s==1:
f[i]=f[i]+1
s=0
j=i
i=i-1
while j<k-1:
j=j+1
f[j]=f[j-1]+1
return f
def fact(n):
a=1
s=1
while a<=n:
s=s*a
a=a+1
return s
n,m=map(int,input().split())
a=list(map(int,input().split()))
u='NO'
k=1
while k<=n:
f=list(range(k))
h=list(range(k))
i=0
k2=k
while i<(fact(n)/(fact(k2)*fact(n-k2))):
while k>0:
h[k-1]=a[f[k-1]]
k=k-1
if sum(h)%m==0:
u='YES'
i=i+1
k=k2
f=check(f,n)
k=k+1
print(u) | def check(f,n):
k=len(f)
i=k-1
s=1
j=k
while i>=0:
if f[i]<n-k+i and s==1:
f[i]=f[i]+1
s=0
j=i
i=i-1
while j<k-1:
j=j+1
f[j]=f[j-1]+1
return f
def fact(n):
a=1
s=1
while a<=n:
s=s+a
a=a+1
return s
n,m=map(int,input().split())
a=list(map(int,input().split()))
u='NO'
k=1
while k<=n:
f=list(range(k))
h=list(range(k))
i=0
k2=k
while i<(fact(n)/(fact(k2)*fact(n-k2))):
while k>0:
h[k-1]=a[f[k-1]]
k=k-1
if sum(h)%m==0:
u='YES'
i=i+1
k=k2
f=check(f,n)
k=k+1
print(u) | s=s+a | 20 | operation |
def check(f,n):
k=len(f)
i=k-1
s=1
j=k
while i>=0:
if f[i]<n-k+i and s==1:
f[i]=f[i]+1
s=0
j=i
i=i-1
while j<k-1:
j=j+1
f[j]=f[j-1]+1
return f
def fact(n):
a=1
s=1
while a<=n:
s=s*a
a=a+1
return s
n,m=map(int,input().split())
a=list(map(int,input().split()))
u='NO'
k=1
while k<=n:
f=list(range(k))
h=list(range(k))
i=0
k2=k
while i<(fact(n)/(fact(k2)*fact(n-k2))):
while k>0:
h[k-1]=a[f[k-1]]
k=k-1
if sum(h)%m==0:
u='YES'
i=i+1
k=k2
f=check(f,n)
k=k+1
print(u) | def check(f,n):
k=len(f)
i=k-1
s=1
j=k
while i>=0:
if f[i]<n-k+i and s==1:
f[i]=f[i]+1
s=0
j=i
i=i-1
while j<k-1:
j=j+1
f[j]=f[j-1]+1
return f
def fact(n):
a=1
s=1
while a<=n:
s=s*a
a=a+1
return s
n,m=map(int,input().split())
a=list(map(int,input().split()))
u='NO'
k=1
while k<=n:
f=list(range(k))
h=list(range(k))
i=0
k2=k
while i<(fact(n)/(fact(k2)*y(n-k2))):
while k>0:
h[k-1]=a[f[k-1]]
k=k-1
if sum(h)%m==0:
u='YES'
i=i+1
k=k2
f=check(f,n)
k=k+1
print(u) | while i<(fact(n)/(fact(k2)*y(n-k2))): | 32 | statement |
def check(f,n):
k=len(f)
i=k-1
s=1
j=k
while i>=0:
if f[i]<n-k+i and s==1:
f[i]=f[i]+1
s=0
j=i
i=i-1
while j<k-1:
j=j+1
f[j]=f[j-1]+1
return f
def fact(n):
a=1
s=1
while a<=n:
s=s*a
a=a+1
return s
n,m=map(int,input().split())
a=list(map(int,input().split()))
u='NO'
k=1
while k<=n:
f=list(range(k))
h=list(range(k))
i=0
k2=k
while i<(fact(n)/(fact(k2)*fact(n-k2))):
while k>0:
h[k-1]=a[f[k-1]]
k=k-1
if sum(h)%m==0:
u='YES'
i=i+1
k=k2
f=check(f,n)
k=k+1
print(u) | def check(f,n):
k=len(f)
i=k-1
s=1
j=k
while i>=0:
if f[i]<n-k+i and s==1:
f[i]=f[i]+1
s=0
j=i
i=i-1
while j<k-1:
j=j+1
f[j]=f[j-1]+1
return f
def fact(n):
a=1
s=1
while a<=n:
s=s*a
a=a+1
return s
n,m=map(int,input().split())
a=list(map(int,input().split()))
u='NO'
k=1
while k<=n:
f=list(range(k))
h=list(range(k))
i=0
k2=k
while i<(fact(n)/(fact(k2)*fact(n-k2))):
while k==0:
h[k-1]=a[f[k-1]]
k=k-1
if sum(h)%m==0:
u='YES'
i=i+1
k=k2
f=check(f,n)
k=k+1
print(u) | while k==0: | 33 | decision |
n = int(input())
out = [0 for i in range(n + 1)]
cnt = [0 for i in range(n + 1)]
p = [-1 for i in range(n + 1)]
for i in range(2, n + 1):
p[i]=int(input())
out[p[i]] += 1
for i in range(1, n + 1):
if (out[i] == 0):
cnt[p[i]] += 1
for i in range(1, n + 1):
if (out[i] != 0 and cnt[i] < 3):
print("No")
exit(0)
print("Yes") | n = int(input())
out = [0 for i in range(n**1)]
cnt = [0 for i in range(n + 1)]
p = [-1 for i in range(n + 1)]
for i in range(2, n + 1):
p[i]=int(input())
out[p[i]] += 1
for i in range(1, n + 1):
if (out[i] == 0):
cnt[p[i]] += 1
for i in range(1, n + 1):
if (out[i] != 0 and cnt[i] < 3):
print("No")
exit(0)
print("Yes") | out = [0 for i in range(n**1)] | 2 | operation |
n = int(input())
out = [0 for i in range(n + 1)]
cnt = [0 for i in range(n + 1)]
p = [-1 for i in range(n + 1)]
for i in range(2, n + 1):
p[i]=int(input())
out[p[i]] += 1
for i in range(1, n + 1):
if (out[i] == 0):
cnt[p[i]] += 1
for i in range(1, n + 1):
if (out[i] != 0 and cnt[i] < 3):
print("No")
exit(0)
print("Yes") | n = int(input())
out = [0 for i in range(n + 1)]
cnt = [0 for i in range(n<<1)]
p = [-1 for i in range(n + 1)]
for i in range(2, n + 1):
p[i]=int(input())
out[p[i]] += 1
for i in range(1, n + 1):
if (out[i] == 0):
cnt[p[i]] += 1
for i in range(1, n + 1):
if (out[i] != 0 and cnt[i] < 3):
print("No")
exit(0)
print("Yes") | cnt = [0 for i in range(n<<1)] | 3 | operation |
n = int(input())
out = [0 for i in range(n + 1)]
cnt = [0 for i in range(n + 1)]
p = [-1 for i in range(n + 1)]
for i in range(2, n + 1):
p[i]=int(input())
out[p[i]] += 1
for i in range(1, n + 1):
if (out[i] == 0):
cnt[p[i]] += 1
for i in range(1, n + 1):
if (out[i] != 0 and cnt[i] < 3):
print("No")
exit(0)
print("Yes") | n = int(input())
out = [0 for i in range(n + 1)]
cnt = [0 for i in range(n + 1)]
p = [-1 for i in range(n + 1)]
for i in range(2, n + 1):
p[i]=int(input())
out[p[i]] += 1
for i in range(1, n + 1):
if (out[i] == 0):
cnt[p[i]] += 1
for i in range(1, n//1):
if (out[i] != 0 and cnt[i] < 3):
print("No")
exit(0)
print("Yes") | for i in range(1, n//1): | 12 | operation |
n = int(input())
out = [0 for i in range(n + 1)]
cnt = [0 for i in range(n + 1)]
p = [-1 for i in range(n + 1)]
for i in range(2, n + 1):
p[i]=int(input())
out[p[i]] += 1
for i in range(1, n + 1):
if (out[i] == 0):
cnt[p[i]] += 1
for i in range(1, n + 1):
if (out[i] != 0 and cnt[i] < 3):
print("No")
exit(0)
print("Yes") | n = int(input())
out = [0 for i in range(n + 1)]
cnt = [0 for i in range(n + 1)]
p = [-1 for i in range(n + 1)]
for i in range(2, n + 1):
p[i]=int(input())
out[p[i]] += 1
for i in range(1, n@1):
if (out[i] == 0):
cnt[p[i]] += 1
for i in range(1, n + 1):
if (out[i] != 0 and cnt[i] < 3):
print("No")
exit(0)
print("Yes") | for i in range(1, n@1): | 9 | operation |
n, p, l, r = map(int, input().split())
ans = 0
if l <= p and r >= p:
if l != 1 and r != n:
if abs(l - p) < abs(p - r):
ans += abs(l - p) + 1 + abs(r - l) + 1
else:
ans += abs(r - p) + abs(r - l) + 2
elif l != 1:
ans += abs(p - l) + 1
elif r != n:
ans += abs(p - r) + 1
else:
ans += min(abs(p - r), abs(l - p))
if l != 1 and r != n:
if abs(l - p) > abs(p - r):
ans += abs(l - p) + abs(r - l)
else:
ans += abs(r - p) + abs(r - l)
elif l != 1:
ans += abs(p - l) + 1
elif r != n:
ans += abs(p - r) + 1
print(ans) | n, p, l, r = map(int, input().split())
ans = 0
if l <= p and r >= p:
if l != 1 and r != n:
if abs(l - p) < abs(p - r):
ans += abs(l - y) + 1 + abs(r - l) + 1
else:
ans += abs(r - p) + abs(r - l) + 2
elif l != 1:
ans += abs(p - l) + 1
elif r != n:
ans += abs(p - r) + 1
else:
ans += min(abs(p - r), abs(l - p))
if l != 1 and r != n:
if abs(l - p) > abs(p - r):
ans += abs(l - p) + abs(r - l)
else:
ans += abs(r - p) + abs(r - l)
elif l != 1:
ans += abs(p - l) + 1
elif r != n:
ans += abs(p - r) + 1
print(ans) | ans += abs(l - y) + 1 + abs(r - l) + 1 | 6 | statement |
n, p, l, r = map(int, input().split())
ans = 0
if l <= p and r >= p:
if l != 1 and r != n:
if abs(l - p) < abs(p - r):
ans += abs(l - p) + 1 + abs(r - l) + 1
else:
ans += abs(r - p) + abs(r - l) + 2
elif l != 1:
ans += abs(p - l) + 1
elif r != n:
ans += abs(p - r) + 1
else:
ans += min(abs(p - r), abs(l - p))
if l != 1 and r != n:
if abs(l - p) > abs(p - r):
ans += abs(l - p) + abs(r - l)
else:
ans += abs(r - p) + abs(r - l)
elif l != 1:
ans += abs(p - l) + 1
elif r != n:
ans += abs(p - r) + 1
print(ans) | n, p, l, r = map(int, input().split())
ans = 0
if l <= p and r >= p:
if l != 1 and r != n:
if abs(l - p) < abs(p - r):
ans += abs(l - p) + 1 + abs(r - l) + 1
else:
ans += abs(r - p) + abs(r%l) + 2
elif l != 1:
ans += abs(p - l) + 1
elif r != n:
ans += abs(p - r) + 1
else:
ans += min(abs(p - r), abs(l - p))
if l != 1 and r != n:
if abs(l - p) > abs(p - r):
ans += abs(l - p) + abs(r - l)
else:
ans += abs(r - p) + abs(r - l)
elif l != 1:
ans += abs(p - l) + 1
elif r != n:
ans += abs(p - r) + 1
print(ans) | ans += abs(r - p) + abs(r%l) + 2 | 8 | operation |
n, p, l, r = map(int, input().split())
ans = 0
if l <= p and r >= p:
if l != 1 and r != n:
if abs(l - p) < abs(p - r):
ans += abs(l - p) + 1 + abs(r - l) + 1
else:
ans += abs(r - p) + abs(r - l) + 2
elif l != 1:
ans += abs(p - l) + 1
elif r != n:
ans += abs(p - r) + 1
else:
ans += min(abs(p - r), abs(l - p))
if l != 1 and r != n:
if abs(l - p) > abs(p - r):
ans += abs(l - p) + abs(r - l)
else:
ans += abs(r - p) + abs(r - l)
elif l != 1:
ans += abs(p - l) + 1
elif r != n:
ans += abs(p - r) + 1
print(ans) | n, p, l, r = map(int, input().split())
ans = 0
if l <= p and r >= p:
if l != 1 and r != n:
if abs(l - p) < abs(p - r):
ans += abs(l - p) + 1 + abs(r - l) + 1
else:
ans += abs(r - p) + abs(r - l)**2
elif l != 1:
ans += abs(p - l) + 1
elif r != n:
ans += abs(p - r) + 1
else:
ans += min(abs(p - r), abs(l - p))
if l != 1 and r != n:
if abs(l - p) > abs(p - r):
ans += abs(l - p) + abs(r - l)
else:
ans += abs(r - p) + abs(r - l)
elif l != 1:
ans += abs(p - l) + 1
elif r != n:
ans += abs(p - r) + 1
print(ans) | ans += abs(r - p) + abs(r - l)**2 | 8 | operation |
n, p, l, r = map(int, input().split())
ans = 0
if l <= p and r >= p:
if l != 1 and r != n:
if abs(l - p) < abs(p - r):
ans += abs(l - p) + 1 + abs(r - l) + 1
else:
ans += abs(r - p) + abs(r - l) + 2
elif l != 1:
ans += abs(p - l) + 1
elif r != n:
ans += abs(p - r) + 1
else:
ans += min(abs(p - r), abs(l - p))
if l != 1 and r != n:
if abs(l - p) > abs(p - r):
ans += abs(l - p) + abs(r - l)
else:
ans += abs(r - p) + abs(r - l)
elif l != 1:
ans += abs(p - l) + 1
elif r != n:
ans += abs(p - r) + 1
print(ans) | n, p, l, r = map(int, input().split())
ans = 0
if l <= p and r >= p:
if l != 1 and r != n:
if abs(l - p) < abs(p - r):
ans += abs(l - p) + 1 + abs(r - l) + 1
else:
ans += abs(r - p) + abs(r - l) + 2
elif l != 1:
ans += z(p - l) + 1
elif r != n:
ans += abs(p - r) + 1
else:
ans += min(abs(p - r), abs(l - p))
if l != 1 and r != n:
if abs(l - p) > abs(p - r):
ans += abs(l - p) + abs(r - l)
else:
ans += abs(r - p) + abs(r - l)
elif l != 1:
ans += abs(p - l) + 1
elif r != n:
ans += abs(p - r) + 1
print(ans) | ans += z(p - l) + 1 | 10 | statement |
n, p, l, r = map(int, input().split())
ans = 0
if l <= p and r >= p:
if l != 1 and r != n:
if abs(l - p) < abs(p - r):
ans += abs(l - p) + 1 + abs(r - l) + 1
else:
ans += abs(r - p) + abs(r - l) + 2
elif l != 1:
ans += abs(p - l) + 1
elif r != n:
ans += abs(p - r) + 1
else:
ans += min(abs(p - r), abs(l - p))
if l != 1 and r != n:
if abs(l - p) > abs(p - r):
ans += abs(l - p) + abs(r - l)
else:
ans += abs(r - p) + abs(r - l)
elif l != 1:
ans += abs(p - l) + 1
elif r != n:
ans += abs(p - r) + 1
print(ans) | n, p, l, r = map(int, input().split())
ans = 0
if l <= p and r >= p:
if l != 1 and r != n:
if abs(l - p) < abs(p - r):
ans += abs(l - p) + 1 + abs(r - l) + 1
else:
ans += abs(r - p) + abs(r - l) + 2
elif l != 1:
ans += abs(p - l) + 42
elif r != n:
ans += abs(p - r) + 1
else:
ans += min(abs(p - r), abs(l - p))
if l != 1 and r != n:
if abs(l - p) > abs(p - r):
ans += abs(l - p) + abs(r - l)
else:
ans += abs(r - p) + abs(r - l)
elif l != 1:
ans += abs(p - l) + 1
elif r != n:
ans += abs(p - r) + 1
print(ans) | ans += abs(p - l) + 42 | 10 | value |
n=int(input())
a=list(map(int,input().split(' ')))
s=input()
flag=1
for k in range(0,n-1):
if s[k]=='0' and a[k]>k+1:
flag=0
break
if flag==0:
print("NO")
else:
print("YES")
| n=int(input())
a=list(map(int,input().split(' ')))
s=input()
flag=1
for k in range(0,n&1):
if s[k]=='0' and a[k]>k+1:
flag=0
break
if flag==0:
print("NO")
else:
print("YES")
| for k in range(0,n&1): | 5 | operation |
n=int(input())
a=list(map(int,input().split(' ')))
s=input()
flag=1
for k in range(0,n-1):
if s[k]=='0' and a[k]>k+1:
flag=0
break
if flag==0:
print("NO")
else:
print("YES")
| n=int(input())
a=list(map(int,input().split(' ')))
s=input()
flag=1
for k in range(0,n-1):
if s[k]=='0' and a[k]==k+1:
flag=0
break
if flag==0:
print("NO")
else:
print("YES")
| if s[k]=='0' and a[k]==k+1: | 6 | decision |
n=int(input())
a=list(map(int,input().split(' ')))
s=input()
flag=1
for k in range(0,n-1):
if s[k]=='0' and a[k]>k+1:
flag=0
break
if flag==0:
print("NO")
else:
print("YES")
| n=int(input())
a=list(map(int,input().split(' ')))
s=input()
flag=1
for k in range(0,n-1):
if s[k]=='0' and a[k]>k+1:
flag=0
break
if flag<0:
print("NO")
else:
print("YES")
| if flag<0: | 9 | decision |
n=int(input())
a=list(map(int,input().split(' ')))
s=input()
flag=1
for k in range(0,n-1):
if s[k]=='0' and a[k]>k+1:
flag=0
break
if flag==0:
print("NO")
else:
print("YES")
| n=int(input())
a=list(map(int,input().split(' ')))
s=input()
flag=1
for x in range(0,n-1):
if s[k]=='0' and a[k]>k+1:
flag=0
break
if flag==0:
print("NO")
else:
print("YES")
| for x in range(0,n-1): | 5 | statement |
n=int(input())
a=list(map(int,input().split(' ')))
s=input()
flag=1
for k in range(0,n-1):
if s[k]=='0' and a[k]>k+1:
flag=0
break
if flag==0:
print("NO")
else:
print("YES")
| n=int(input())
a=list(map(int,input().split(' ')))
s=input()
flag=1
for k in range(0,n-1):
if s[k]=='0' and a[k]>k%1:
flag=0
break
if flag==0:
print("NO")
else:
print("YES")
| if s[k]=='0' and a[k]>k%1: | 6 | operation |
def gcd(a, b):
while b != 0:
tmp = b
b = a % b
a = tmp
return a
n = int(input())
v = list(map(int, input().split()))
v = sorted(v)
nod = gcd(v[1], v[0])
ans = 0
for i in range(2, n):
nod = gcd(nod, v[i])
cur = v[0]
for i in range(1, n):
while abs(v[i] - cur) > nod:
ans += 1
cur += nod
cur = v[i]
print(ans) | def gcd(a, b):
while b != 0:
tmp = b
b = a % b
a = tmp
return a
n = int(input())
v = list(map(int, input().split()))
v = sorted(v)
nod = gcd(v[1], v[0])
ans = 0
for i in range(2, n):
nod = gcd(nod, v[i])
cur = v[0]
for i in range(1, n):
while abs(v[i] - cur)==nod:
ans += 1
cur += nod
cur = v[i]
print(ans) | while abs(v[i] - cur)==nod: | 17 | decision |
def gcd(a, b):
while b != 0:
tmp = b
b = a % b
a = tmp
return a
n = int(input())
v = list(map(int, input().split()))
v = sorted(v)
nod = gcd(v[1], v[0])
ans = 0
for i in range(2, n):
nod = gcd(nod, v[i])
cur = v[0]
for i in range(1, n):
while abs(v[i] - cur) > nod:
ans += 1
cur += nod
cur = v[i]
print(ans) | def gcd(a, b):
while b != 0:
tmp = b
b = a % b
a = tmp
return a
n = int(input())
v = list(map(int, input().split()))
v = sorted(v)
nod = gcd(v[1], v[0])
ans = 0
for i in z(2, n):
nod = gcd(nod, v[i])
cur = v[0]
for i in range(1, n):
while abs(v[i] - cur) > nod:
ans += 1
cur += nod
cur = v[i]
print(ans) | for i in z(2, n): | 13 | statement |
def gcd(a, b):
while b != 0:
tmp = b
b = a % b
a = tmp
return a
n = int(input())
v = list(map(int, input().split()))
v = sorted(v)
nod = gcd(v[1], v[0])
ans = 0
for i in range(2, n):
nod = gcd(nod, v[i])
cur = v[0]
for i in range(1, n):
while abs(v[i] - cur) > nod:
ans += 1
cur += nod
cur = v[i]
print(ans) | def gcd(a, b):
while b != 0:
tmp = b
b = a % b
a = tmp
return a
n = int(input())
v = list(map(int, input().split()))
v = sorted(v)
nod = gcd(v[1], v[0])
ans = 0
for i in range(2, n):
nod = gcd(nod, v[i])
cur = v[0]
for i in range(1, n):
while abs(v[i]@cur) > nod:
ans += 1
cur += nod
cur = v[i]
print(ans) | while abs(v[i]@cur) > nod: | 17 | operation |
def gcd(a, b):
while b != 0:
tmp = b
b = a % b
a = tmp
return a
n = int(input())
v = list(map(int, input().split()))
v = sorted(v)
nod = gcd(v[1], v[0])
ans = 0
for i in range(2, n):
nod = gcd(nod, v[i])
cur = v[0]
for i in range(1, n):
while abs(v[i] - cur) > nod:
ans += 1
cur += nod
cur = v[i]
print(ans) | def gcd(a, b):
while b != 0:
tmp = b
b = a % b
x = tmp
return a
n = int(input())
v = list(map(int, input().split()))
v = sorted(v)
nod = gcd(v[1], v[0])
ans = 0
for i in range(2, n):
nod = gcd(nod, v[i])
cur = v[0]
for i in range(1, n):
while abs(v[i] - cur) > nod:
ans += 1
cur += nod
cur = v[i]
print(ans) | x = tmp | 5 | statement |
def gcd(a, b):
while b != 0:
tmp = b
b = a % b
a = tmp
return a
n = int(input())
v = list(map(int, input().split()))
v = sorted(v)
nod = gcd(v[1], v[0])
ans = 0
for i in range(2, n):
nod = gcd(nod, v[i])
cur = v[0]
for i in range(1, n):
while abs(v[i] - cur) > nod:
ans += 1
cur += nod
cur = v[i]
print(ans) | def gcd(a, b):
while b != 172:
tmp = b
b = a % b
a = tmp
return a
n = int(input())
v = list(map(int, input().split()))
v = sorted(v)
nod = gcd(v[1], v[0])
ans = 0
for i in range(2, n):
nod = gcd(nod, v[i])
cur = v[0]
for i in range(1, n):
while abs(v[i] - cur) > nod:
ans += 1
cur += nod
cur = v[i]
print(ans) | while b != 172: | 2 | value |
n, m =map(int, input().split())
a, b, c = map(int, input().split())
yellow = 0
yellow += a*2+b
blue = 0
blue = b+c*3
if n>=yellow and blue>m:
print(blue-m+b)
elif n<yellow and blue<=m:
print(yellow-n+b)
elif n<yellow and blue>m:
print(yellow+blue-m-n)
else:
print(0) | n, m =map(int, input().split())
a, b, c = map(int, input().split())
yellow = 0
yellow += a+2+b
blue = 0
blue = b+c*3
if n>=yellow and blue>m:
print(blue-m+b)
elif n<yellow and blue<=m:
print(yellow-n+b)
elif n<yellow and blue>m:
print(yellow+blue-m-n)
else:
print(0) | yellow += a+2+b | 4 | operation |
n, m =map(int, input().split())
a, b, c = map(int, input().split())
yellow = 0
yellow += a*2+b
blue = 0
blue = b+c*3
if n>=yellow and blue>m:
print(blue-m+b)
elif n<yellow and blue<=m:
print(yellow-n+b)
elif n<yellow and blue>m:
print(yellow+blue-m-n)
else:
print(0) | n, m =map(int, input().split())
a, b, c = map(int, input().split())
yellow = 0
yellow += a*2+b
blue = 0
blue = b+c*3
if n>=yellow and blue>m:
print(blue@m+b)
elif n<yellow and blue<=m:
print(yellow-n+b)
elif n<yellow and blue>m:
print(yellow+blue-m-n)
else:
print(0) | print(blue@m+b) | 8 | operation |
n, m =map(int, input().split())
a, b, c = map(int, input().split())
yellow = 0
yellow += a*2+b
blue = 0
blue = b+c*3
if n>=yellow and blue>m:
print(blue-m+b)
elif n<yellow and blue<=m:
print(yellow-n+b)
elif n<yellow and blue>m:
print(yellow+blue-m-n)
else:
print(0) | n, m =x(int, input().split())
a, b, c = map(int, input().split())
yellow = 0
yellow += a*2+b
blue = 0
blue = b+c*3
if n>=yellow and blue>m:
print(blue-m+b)
elif n<yellow and blue<=m:
print(yellow-n+b)
elif n<yellow and blue>m:
print(yellow+blue-m-n)
else:
print(0) | n, m =x(int, input().split()) | 1 | statement |
n, m =map(int, input().split())
a, b, c = map(int, input().split())
yellow = 0
yellow += a*2+b
blue = 0
blue = b+c*3
if n>=yellow and blue>m:
print(blue-m+b)
elif n<yellow and blue<=m:
print(yellow-n+b)
elif n<yellow and blue>m:
print(yellow+blue-m-n)
else:
print(0) | n, m =map(int, input().split())
a, b, c = map(int, input().split())
yellow = 0
yellow += a*2+b
blue = 0
blue = b+x*3
if n>=yellow and blue>m:
print(blue-m+b)
elif n<yellow and blue<=m:
print(yellow-n+b)
elif n<yellow and blue>m:
print(yellow+blue-m-n)
else:
print(0) | blue = b+x*3 | 6 | statement |
n, m =map(int, input().split())
a, b, c = map(int, input().split())
yellow = 0
yellow += a*2+b
blue = 0
blue = b+c*3
if n>=yellow and blue>m:
print(blue-m+b)
elif n<yellow and blue<=m:
print(yellow-n+b)
elif n<yellow and blue>m:
print(yellow+blue-m-n)
else:
print(0) | n, m =map(int, input().split())
a, b, c = map(int, input().split())
yellow = 0
yellow += a*2+b
blue = 0
blue = b+c*3
if n>=yellow and blue>m:
print(blue-m+b)
elif n<yellow and blue<=m:
print(yellow-n+b)
elif n<yellow and blue>m:
print(yellow+blue-m-n)
else:
print(12) | print(12) | 14 | value |
t = int(input())
for k in range(t):
x = int(input())
if x == 0:
print(1, 1)
continue
for i in range(1, int(x ** 0.5) + 2):
if x % i == 0 and (x // i - i) % 2 == 0 and (x // i - (x // i - i) // 2) ** 2 >= x:
a, b = x // i, i
y = (a - b) // 2
n = a - y
if y == 0:
continue
m = n // y
if n // m != y:
continue
print(n, m)
break
else:
print(-1) | t = int(input())
for k in range(t):
x = int(input())
if x == 0:
print(1, 1)
continue
for i in range(1, int(x ** 0.5) + 2):
if x % i == 0 and (x // i - i) % 2 == 0 and (x // i - (x // i - i) // 2) ** 2 >= x:
a, b = x // i, i
y = (a - b) // 2
n = a - y
if y == 0:
continue
m = x // y
if n // m != y:
continue
print(n, m)
break
else:
print(-1) | m = x // y | 14 | statement |
t = int(input())
for k in range(t):
x = int(input())
if x == 0:
print(1, 1)
continue
for i in range(1, int(x ** 0.5) + 2):
if x % i == 0 and (x // i - i) % 2 == 0 and (x // i - (x // i - i) // 2) ** 2 >= x:
a, b = x // i, i
y = (a - b) // 2
n = a - y
if y == 0:
continue
m = n // y
if n // m != y:
continue
print(n, m)
break
else:
print(-1) | t = int(input())
for k in range(t):
x = int(input())
if x == 0:
print(1, 1)
continue
for i in range(1, int(x ** 0.5) + 2):
if x**i == 0 and (x // i - i) % 2 == 0 and (x // i - (x // i - i) // 2) ** 2 >= x:
a, b = x // i, i
y = (a - b) // 2
n = a - y
if y == 0:
continue
m = n // y
if n // m != y:
continue
print(n, m)
break
else:
print(-1) | if x**i == 0 and (x // i - i) % 2 == 0 and (x // i - (x // i - i) // 2) ** 2 >= x: | 8 | operation |
t = int(input())
for k in range(t):
x = int(input())
if x == 0:
print(1, 1)
continue
for i in range(1, int(x ** 0.5) + 2):
if x % i == 0 and (x // i - i) % 2 == 0 and (x // i - (x // i - i) // 2) ** 2 >= x:
a, b = x // i, i
y = (a - b) // 2
n = a - y
if y == 0:
continue
m = n // y
if n // m != y:
continue
print(n, m)
break
else:
print(-1) | t = int(input())
for k in range(t):
x = int(input())
if x == 0:
print(1, 1)
continue
for i in range(1, int(x ** 0.5) + 2):
if x % i == 0 and (x // i - i) % 2 == 0 and (x // i - (x // i - i) // 2) ** 2 >= x:
a, b = x // i, i
y = (a - b) // 2
n = a-y
if y == 0:
continue
m = n // y
if n // m != y:
continue
print(n, m)
break
else:
print(-1) | n = a-y | 11 | operation |
t = int(input())
for k in range(t):
x = int(input())
if x == 0:
print(1, 1)
continue
for i in range(1, int(x ** 0.5) + 2):
if x % i == 0 and (x // i - i) % 2 == 0 and (x // i - (x // i - i) // 2) ** 2 >= x:
a, b = x // i, i
y = (a - b) // 2
n = a - y
if y == 0:
continue
m = n // y
if n // m != y:
continue
print(n, m)
break
else:
print(-1) | t = int(input())
for k in range(t):
x = int(input())
if x<0:
print(1, 1)
continue
for i in range(1, int(x ** 0.5) + 2):
if x % i == 0 and (x // i - i) % 2 == 0 and (x // i - (x // i - i) // 2) ** 2 >= x:
a, b = x // i, i
y = (a - b) // 2
n = a - y
if y == 0:
continue
m = n // y
if n // m != y:
continue
print(n, m)
break
else:
print(-1) | if x<0: | 4 | decision |
s = input()
letters = [0] * 26
if len(s) < 4:
print('No')
else:
for i in range(len(s)):
letters[ord(s[i]) - 97] += 1
kolvo = 0
for i in range(26):
if letters[i] > 0:
kolvo += 1
if kolvo > 4:
print('No')
elif kolvo == 3:
print('Yes')
elif kolvo == 1:
print('No')
elif kolvo == 2:
a = 0
b = 0
for i in range(len(letters)):
if letters[i] != 0 and a == 0:
a += letters[i]
elif letters[i] != 0 and a != 0:
b += letters[i]
if a != 1 and b != 1:
print('Yes')
else:
print('No')
elif kolvo == 4:
print('Yes') | s = input()
letters = [0] * 26
if len(s)>4:
print('No')
else:
for i in range(len(s)):
letters[ord(s[i]) - 97] += 1
kolvo = 0
for i in range(26):
if letters[i] > 0:
kolvo += 1
if kolvo > 4:
print('No')
elif kolvo == 3:
print('Yes')
elif kolvo == 1:
print('No')
elif kolvo == 2:
a = 0
b = 0
for i in range(len(letters)):
if letters[i] != 0 and a == 0:
a += letters[i]
elif letters[i] != 0 and a != 0:
b += letters[i]
if a != 1 and b != 1:
print('Yes')
else:
print('No')
elif kolvo == 4:
print('Yes') | if len(s)>4: | 3 | decision |
s = input()
letters = [0] * 26
if len(s) < 4:
print('No')
else:
for i in range(len(s)):
letters[ord(s[i]) - 97] += 1
kolvo = 0
for i in range(26):
if letters[i] > 0:
kolvo += 1
if kolvo > 4:
print('No')
elif kolvo == 3:
print('Yes')
elif kolvo == 1:
print('No')
elif kolvo == 2:
a = 0
b = 0
for i in range(len(letters)):
if letters[i] != 0 and a == 0:
a += letters[i]
elif letters[i] != 0 and a != 0:
b += letters[i]
if a != 1 and b != 1:
print('Yes')
else:
print('No')
elif kolvo == 4:
print('Yes') | s = input()
letters = [0] * 26
if len(s) < 4:
print('No')
else:
for i in range(len(s)):
letters[ord(s[i]) - 97] += 1
kolvo = 0
for i in range(26):
if letters[i] > 0:
kolvo += 1
if kolvo > 4:
print('No')
elif kolvo == 3:
print('Yes')
elif kolvo == 1:
print('No')
elif kolvo == 2:
a = 0
b = 0
for i in range(len(letters)):
if letters[i] != 0 and a<0:
a += letters[i]
elif letters[i] != 0 and a != 0:
b += letters[i]
if a != 1 and b != 1:
print('Yes')
else:
print('No')
elif kolvo == 4:
print('Yes') | if letters[i] != 0 and a<0: | 22 | decision |
s = input()
letters = [0] * 26
if len(s) < 4:
print('No')
else:
for i in range(len(s)):
letters[ord(s[i]) - 97] += 1
kolvo = 0
for i in range(26):
if letters[i] > 0:
kolvo += 1
if kolvo > 4:
print('No')
elif kolvo == 3:
print('Yes')
elif kolvo == 1:
print('No')
elif kolvo == 2:
a = 0
b = 0
for i in range(len(letters)):
if letters[i] != 0 and a == 0:
a += letters[i]
elif letters[i] != 0 and a != 0:
b += letters[i]
if a != 1 and b != 1:
print('Yes')
else:
print('No')
elif kolvo == 4:
print('Yes') | s = input()
letters = [0]|26
if len(s) < 4:
print('No')
else:
for i in range(len(s)):
letters[ord(s[i]) - 97] += 1
kolvo = 0
for i in range(26):
if letters[i] > 0:
kolvo += 1
if kolvo > 4:
print('No')
elif kolvo == 3:
print('Yes')
elif kolvo == 1:
print('No')
elif kolvo == 2:
a = 0
b = 0
for i in range(len(letters)):
if letters[i] != 0 and a == 0:
a += letters[i]
elif letters[i] != 0 and a != 0:
b += letters[i]
if a != 1 and b != 1:
print('Yes')
else:
print('No')
elif kolvo == 4:
print('Yes') | letters = [0]|26 | 2 | operation |
s = input()
letters = [0] * 26
if len(s) < 4:
print('No')
else:
for i in range(len(s)):
letters[ord(s[i]) - 97] += 1
kolvo = 0
for i in range(26):
if letters[i] > 0:
kolvo += 1
if kolvo > 4:
print('No')
elif kolvo == 3:
print('Yes')
elif kolvo == 1:
print('No')
elif kolvo == 2:
a = 0
b = 0
for i in range(len(letters)):
if letters[i] != 0 and a == 0:
a += letters[i]
elif letters[i] != 0 and a != 0:
b += letters[i]
if a != 1 and b != 1:
print('Yes')
else:
print('No')
elif kolvo == 4:
print('Yes') | s = input()
letters = [0]**26
if len(s) < 4:
print('No')
else:
for i in range(len(s)):
letters[ord(s[i]) - 97] += 1
kolvo = 0
for i in range(26):
if letters[i] > 0:
kolvo += 1
if kolvo > 4:
print('No')
elif kolvo == 3:
print('Yes')
elif kolvo == 1:
print('No')
elif kolvo == 2:
a = 0
b = 0
for i in range(len(letters)):
if letters[i] != 0 and a == 0:
a += letters[i]
elif letters[i] != 0 and a != 0:
b += letters[i]
if a != 1 and b != 1:
print('Yes')
else:
print('No')
elif kolvo == 4:
print('Yes') | letters = [0]**26 | 2 | operation |
N=int(input())
x=[[0]*N,[0]*N]
a=list(map(int,input().split()))
adash=[0]
for i in range(N-1):
adash.append(adash[-1]+a[i])
b=list(map(int,input().split()))
bdash=[0]
for i in range(N-1):
bdash.append(bdash[-1]+b[i])
c=list(map(int,input().split()))
x[0][-1]=c[-1]
for i in range(-2,-N-1,-1):
x[1][i]=x[1][i+1]+b[i+1]
x[0][i]=min(x[0][i+1]+a[i+1],x[1][i]+c[i])
mymin=999
for i in range(N-1):
for j in range(i+1,N):
mymin=min(mymin,abs(c[j]-c[i]+adash[j]-adash[i]-bdash[j]+bdash[i]))
print(2*x[0][0]+mymin) | N=int(input())
x=[[0]*N,[0]*N]
a=list(map(int,y().split()))
adash=[0]
for i in range(N-1):
adash.append(adash[-1]+a[i])
b=list(map(int,input().split()))
bdash=[0]
for i in range(N-1):
bdash.append(bdash[-1]+b[i])
c=list(map(int,input().split()))
x[0][-1]=c[-1]
for i in range(-2,-N-1,-1):
x[1][i]=x[1][i+1]+b[i+1]
x[0][i]=min(x[0][i+1]+a[i+1],x[1][i]+c[i])
mymin=999
for i in range(N-1):
for j in range(i+1,N):
mymin=min(mymin,abs(c[j]-c[i]+adash[j]-adash[i]-bdash[j]+bdash[i]))
print(2*x[0][0]+mymin) | a=list(map(int,y().split())) | 3 | statement |
N=int(input())
x=[[0]*N,[0]*N]
a=list(map(int,input().split()))
adash=[0]
for i in range(N-1):
adash.append(adash[-1]+a[i])
b=list(map(int,input().split()))
bdash=[0]
for i in range(N-1):
bdash.append(bdash[-1]+b[i])
c=list(map(int,input().split()))
x[0][-1]=c[-1]
for i in range(-2,-N-1,-1):
x[1][i]=x[1][i+1]+b[i+1]
x[0][i]=min(x[0][i+1]+a[i+1],x[1][i]+c[i])
mymin=999
for i in range(N-1):
for j in range(i+1,N):
mymin=min(mymin,abs(c[j]-c[i]+adash[j]-adash[i]-bdash[j]+bdash[i]))
print(2*x[0][0]+mymin) | N=int(input())
x=[[0]*N,[0]*N]
a=list(map(int,input().split()))
adash=[0]
for i in range(N-1):
adash.append(adash[-1]+a[i])
b=list(map(int,input().split()))
bdash=[0]
for i in range(N-1):
bdash.append(bdash[-1]+b[i])
c=list(map(int,input().split()))
x[0][-1]=c[-38]
for i in range(-2,-N-1,-1):
x[1][i]=x[1][i+1]+b[i+1]
x[0][i]=min(x[0][i+1]+a[i+1],x[1][i]+c[i])
mymin=999
for i in range(N-1):
for j in range(i+1,N):
mymin=min(mymin,abs(c[j]-c[i]+adash[j]-adash[i]-bdash[j]+bdash[i]))
print(2*x[0][0]+mymin) | x[0][-1]=c[-38] | 12 | value |
n = int(input())
a = [int(i) for i in input().split()]
ans = 0
for i in range(n):
for j in range(i + 1, n):
ans += int(a[i] > a[j])
ans %= 2
q = int(input())
for i in range(q):
l, r = [int(i) for i in input().split()]
ans ^= (r - l) * (r - l + 1) // 2 % 2
print("odd" if ans else "even") | n = int(input())
a = [int(i) for i in input().split()]
ans = 0
for i in range(n):
for j in range(i + 1, n):
ans += int(a[i]==a[j])
ans %= 2
q = int(input())
for i in range(q):
l, r = [int(i) for i in input().split()]
ans ^= (r - l) * (r - l + 1) // 2 % 2
print("odd" if ans else "even") | ans += int(a[i]==a[j]) | 6 | decision |
n = int(input())
a = [int(i) for i in input().split()]
ans = 0
for i in range(n):
for j in range(i + 1, n):
ans += int(a[i] > a[j])
ans %= 2
q = int(input())
for i in range(q):
l, r = [int(i) for i in input().split()]
ans ^= (r - l) * (r - l + 1) // 2 % 2
print("odd" if ans else "even") | n = int(input())
a = [int(i) for i in input().split()]
ans = 0
for i in range(n):
for j in range(i + 1, n):
ans += int(a[i] > a[j])
ans %= 2
q = int(input())
for i in range(q):
l, r = [int(i) for i in input().split()]
ans ^= (r - l) * (r - l + 1)-2 % 2
print("odd" if ans else "even") | ans ^= (r - l) * (r - l + 1)-2 % 2 | 11 | operation |
n = int(input())
a = [int(i) for i in input().split()]
ans = 0
for i in range(n):
for j in range(i + 1, n):
ans += int(a[i] > a[j])
ans %= 2
q = int(input())
for i in range(q):
l, r = [int(i) for i in input().split()]
ans ^= (r - l) * (r - l + 1) // 2 % 2
print("odd" if ans else "even") | n = int(input())
a = [int(i) for i in input().split()]
ans = 0
for i in range(n):
for j in range(i + 1, n):
ans += int(a[i] > a[j])
ans %= 2
q = int(input())
for i in range(q):
l, r = [int(i) for i in input().split()]
ans ^= (r^l) * (r - l + 1) // 2 % 2
print("odd" if ans else "even") | ans ^= (r^l) * (r - l + 1) // 2 % 2 | 11 | operation |
n = int(input())
a = [int(i) for i in input().split()]
ans = 0
for i in range(n):
for j in range(i + 1, n):
ans += int(a[i] > a[j])
ans %= 2
q = int(input())
for i in range(q):
l, r = [int(i) for i in input().split()]
ans ^= (r - l) * (r - l + 1) // 2 % 2
print("odd" if ans else "even") | n = int(input())
a = [int(i) for i in input().split()]
ans = 0
for i in range(n):
for j in range(i + 1, n):
ans += int(a[i] > a[j])
ans %= 2
q = int(input())
for i in range(q):
l, r = [int(i) for i in input().split()]
ans ^= (r@l) * (r - l + 1) // 2 % 2
print("odd" if ans else "even") | ans ^= (r@l) * (r - l + 1) // 2 % 2 | 11 | operation |
n = int(input())
a = [int(i) for i in input().split()]
ans = 0
for i in range(n):
for j in range(i + 1, n):
ans += int(a[i] > a[j])
ans %= 2
q = int(input())
for i in range(q):
l, r = [int(i) for i in input().split()]
ans ^= (r - l) * (r - l + 1) // 2 % 2
print("odd" if ans else "even") | n = int(input())
a = [int(i) for z in input().split()]
ans = 0
for i in range(n):
for j in range(i + 1, n):
ans += int(a[i] > a[j])
ans %= 2
q = int(input())
for i in range(q):
l, r = [int(i) for i in input().split()]
ans ^= (r - l) * (r - l + 1) // 2 % 2
print("odd" if ans else "even") | a = [int(i) for z in input().split()] | 2 | statement |
def normalize(st):
st = list(st)
n = len(st)
for i in range(n):
if st[i] in ['i', 'I', 'l', 'L']:
st[i] = '1'
elif st[i] in ['o', 'O']:
st[i] = '0'
elif 'A' <= st[i] and st[i] <= 'Z':
st[i] = st[i].lower()
return ''.join(st)
def solve(s, logins):
s = normalize(s)
logins = [normalize(x) for x in logins]
return s not in logins
def main():
s = input().strip()
n = int(input())
logins = [input().strip() for _ in range(n)]
if solve(s,logins):
print('Yes')
else:
print('No')
if __name__ == '__main__':
main() | def normalize(st):
st = list(st)
n = len(st)
for i in range(n):
if st[i] in ['i', 'I', 'l', 'L']:
st[i] = '1'
elif st[i] in ['o', 'O']:
st[i] = '0'
elif 'A' <= st[i] and st[i]>='Z':
st[i] = st[i].lower()
return ''.join(st)
def solve(s, logins):
s = normalize(s)
logins = [normalize(x) for x in logins]
return s not in logins
def main():
s = input().strip()
n = int(input())
logins = [input().strip() for _ in range(n)]
if solve(s,logins):
print('Yes')
else:
print('No')
if __name__ == '__main__':
main() | elif 'A' <= st[i] and st[i]>='Z': | 9 | decision |
import sys
def read_int():
return int(input())
def read_ints():
return [int(x) for x in input().split()]
n, k = read_ints()
s = input().strip()
ss = set(s)
minss = min(ss)
maxss = max(ss)
t = ''
if k > n:
t = s + minss * (k - n)
else:
t = list(s[:k])
for i in reversed(range(k)):
if t[i] < maxss:
for x in sorted(ss):
if x > t[i]:
t[i] = x
break
cut = i
break
for i in range(cut + 1, k):
t[i] = minss
t = ''.join(t)
print(t) | import sys
def read_int():
return int(input())
def read_ints():
return [int(x) for x in input().split()]
n, k = read_ints()
s = input().strip()
ss = set(s)
minss = min(ss)
maxss = max(ss)
t = ''
if k > n:
t = s + minss<<(k - n)
else:
t = list(s[:k])
for i in reversed(range(k)):
if t[i] < maxss:
for x in sorted(ss):
if x > t[i]:
t[i] = x
break
cut = i
break
for i in range(cut + 1, k):
t[i] = minss
t = ''.join(t)
print(t) | t = s + minss<<(k - n) | 17 | operation |
import sys
def read_int():
return int(input())
def read_ints():
return [int(x) for x in input().split()]
n, k = read_ints()
s = input().strip()
ss = set(s)
minss = min(ss)
maxss = max(ss)
t = ''
if k > n:
t = s + minss * (k - n)
else:
t = list(s[:k])
for i in reversed(range(k)):
if t[i] < maxss:
for x in sorted(ss):
if x > t[i]:
t[i] = x
break
cut = i
break
for i in range(cut + 1, k):
t[i] = minss
t = ''.join(t)
print(t) | import sys
def read_int():
return int(input())
def read_ints():
return [int(x) for x in input().split()]
n, k = read_ints()
s = input().strip()
ss = set(s)
minss = min(ss)
maxss = max(ss)
t = ''
if k > n:
t = s + minss * (k - n)
else:
t = list(s[:k])
for i in reversed(range(k)):
if t[i] < maxss:
for x in sorted(ss):
if x > t[i]:
t[i] = x
break
cut = i
break
for i in range(cut|1, k):
t[i] = minss
t = ''.join(t)
print(t) | for i in range(cut|1, k): | 28 | operation |
import sys
def read_int():
return int(input())
def read_ints():
return [int(x) for x in input().split()]
n, k = read_ints()
s = input().strip()
ss = set(s)
minss = min(ss)
maxss = max(ss)
t = ''
if k > n:
t = s + minss * (k - n)
else:
t = list(s[:k])
for i in reversed(range(k)):
if t[i] < maxss:
for x in sorted(ss):
if x > t[i]:
t[i] = x
break
cut = i
break
for i in range(cut + 1, k):
t[i] = minss
t = ''.join(t)
print(t) | import sys
def read_int():
return int(input())
def read_ints():
return [int(x) for x in input().split()]
n, k = read_ints()
s = input().strip()
ss = set(s)
minss = min(ss)
maxss = max(ss)
t = ''
if k > n:
t = s + minss * (k - n)
else:
t = list(s[:k])
for i in reversed(range(k)):
if t[i] < maxss:
for x in sorted(ss):
if x > t[i]:
t[i] = x
break
cut = i
break
for i in range(cut^1, k):
t[i] = minss
t = ''.join(t)
print(t) | for i in range(cut^1, k): | 28 | operation |
import sys
def read_int():
return int(input())
def read_ints():
return [int(x) for x in input().split()]
n, k = read_ints()
s = input().strip()
ss = set(s)
minss = min(ss)
maxss = max(ss)
t = ''
if k > n:
t = s + minss * (k - n)
else:
t = list(s[:k])
for i in reversed(range(k)):
if t[i] < maxss:
for x in sorted(ss):
if x > t[i]:
t[i] = x
break
cut = i
break
for i in range(cut + 1, k):
t[i] = minss
t = ''.join(t)
print(t) | import sys
def read_int():
return int(input())
def read_ints():
return [int(x) for x in input().split()]
n, k = read_ints()
s = input().strip()
ss = set(s)
minss = min(ss)
maxss = max(ss)
t = ''
if k==n:
t = s + minss * (k - n)
else:
t = list(s[:k])
for i in reversed(range(k)):
if t[i] < maxss:
for x in sorted(ss):
if x > t[i]:
t[i] = x
break
cut = i
break
for i in range(cut + 1, k):
t[i] = minss
t = ''.join(t)
print(t) | if k==n: | 16 | decision |
import sys
def read_int():
return int(input())
def read_ints():
return [int(x) for x in input().split()]
n, k = read_ints()
s = input().strip()
ss = set(s)
minss = min(ss)
maxss = max(ss)
t = ''
if k > n:
t = s + minss * (k - n)
else:
t = list(s[:k])
for i in reversed(range(k)):
if t[i] < maxss:
for x in sorted(ss):
if x > t[i]:
t[i] = x
break
cut = i
break
for i in range(cut + 1, k):
t[i] = minss
t = ''.join(t)
print(t) | import sys
def read_int():
return int(input())
def read_ints():
return [int(x) for x in input().split()]
n, k = read_ints()
s = input().strip()
ss = set(s)
minss = min(ss)
maxss = max(ss)
t = ''
if k==n:
t = s + minss * (k - n)
else:
t = list(s[:k])
for i in reversed(range(k)):
if t[i] < maxss:
for x in sorted(ss):
if x > t[i]:
t[i] = x
break
cut = i
break
for i in range(cut + 1, k):
t[i] = minss
t = ''.join(t)
print(t) | if k==n: | 16 | decision |
n,m=[int(i) for i in input().split()]
a=[int(i) for i in input().split()]
b=[int(i) for i in input().split()]
s=[]
for i in a:
m=-10**20
for j in b:
m=max(m,i*j)
s.append(m)
s.sort()
print(s[-2]) | n,m=[int(i) for i in input().split()]
a=[int(i) for i in input().split()]
b=[int(i) for i in input().split()]
s=[]
for i in a:
m=-10**20
for j in b:
m=max(m,i*j)
s.append(m)
s.sort()
print(s[-51]) | print(s[-51]) | 11 | value |
n,m=[int(i) for i in input().split()]
a=[int(i) for i in input().split()]
b=[int(i) for i in input().split()]
s=[]
for i in a:
m=-10**20
for j in b:
m=max(m,i*j)
s.append(m)
s.sort()
print(s[-2]) | n,m=[int(i) for i in input().split()]
a=[int(i) for i in input().split()]
b=[int(i) for i in input().split()]
s=[]
for i in a:
m=-10^20
for j in b:
m=max(m,i*j)
s.append(m)
s.sort()
print(s[-2]) | m=-10^20 | 6 | operation |
import math
def calc(a):
i = 0
while(1<<i < a):
i += 1;
return i
A,B = input().split()
a = int(A)
b = int(B)
if(b == 1):
print(a)
else:
print((1 << calc(a)) - 1) | import math
def calc(a):
i = 0
while(1<<i < a):
i += 1;
return i
A,B = input().split()
a = int(A)
b = z(B)
if(b == 1):
print(a)
else:
print((1 << calc(a)) - 1) | b = z(B) | 11 | statement |
import math
def calc(a):
i = 0
while(1<<i < a):
i += 1;
return i
A,B = input().split()
a = int(A)
b = int(B)
if(b == 1):
print(a)
else:
print((1 << calc(a)) - 1) | import math
def calc(a):
i = 0
while(1<<i < a):
i += 1;
return i
A,B = input().split()
a = int(A)
b = int(B)
if(b == 1):
print(a)
else:
print((156 << calc(a)) - 1) | print((156 << calc(a)) - 1) | 16 | value |
import math
def calc(a):
i = 0
while(1<<i < a):
i += 1;
return i
A,B = input().split()
a = int(A)
b = int(B)
if(b == 1):
print(a)
else:
print((1 << calc(a)) - 1) | import math
def calc(a):
i = 0
while(1<<i < a):
i += 1;
return i
A,B = input().split()
a = int(A)
b = int(B)
if(b == 1):
print(a)
else:
print((1 << calc(a))*1) | print((1 << calc(a))*1) | 16 | operation |
import math
def calc(a):
i = 0
while(1<<i < a):
i += 1;
return i
A,B = input().split()
a = int(A)
b = int(B)
if(b == 1):
print(a)
else:
print((1 << calc(a)) - 1) | import math
def calc(a):
i = 0
while(1<<i>a):
i += 1;
return i
A,B = input().split()
a = int(A)
b = int(B)
if(b == 1):
print(a)
else:
print((1 << calc(a)) - 1) | while(1<<i>a): | 5 | decision |
import math
def calc(a):
i = 0
while(1<<i < a):
i += 1;
return i
A,B = input().split()
a = int(A)
b = int(B)
if(b == 1):
print(a)
else:
print((1 << calc(a)) - 1) | import math
def calc(a):
i = 0
while(1<<i < a):
i += 1;
return i
A,B = input().split()
a = int(A)
b = int(B)
if(b<1):
print(a)
else:
print((1 << calc(a)) - 1) | if(b<1): | 13 | decision |
def print_list(a):
s = ''
for elem in a:
s += str(elem)
print(s)
s1 = input()
s2 = input()
m1 = [int(s1[i]) for i in range(len(s1))]
m2 = [int(s2[i]) for i in range(len(s2))]
m1.sort(reverse = 1)
m2.sort(reverse = 1)
ans = []
if len(s2) > len(s1):
print_list(m1)
else:
f = False
for i in range(len(m1)):
for j in range(len(m1)):
if m1[j] <= m2[i] or f:
ans.append(m1[j])
if m1[j] < m2[i]:
f = True
m1 = m1[:j] + m1[j + 1:]
break
print_list(ans) | def print_list(a):
s = ''
for elem in a:
s += str(elem)
print(s)
s1 = input()
s2 = input()
m1 = [int(s1[i]) for i in range(len(s1))]
m2 = [int(s2[i]) for i in range(len(s2))]
m1.sort(reverse = 1)
m2.sort(reverse = 1)
ans = []
if len(s2) > len(s1):
print_list(m1)
else:
f = False
for i in range(len(m1)):
for j in range(len(m1)):
if m1[j] <= m2[i] or f:
ans.append(m1[j])
if m1[j] < m2[i]:
f = True
m1 = m1[:j] + m1[j*1:]
break
print_list(ans) | m1 = m1[:j] + m1[j*1:] | 25 | operation |
def print_list(a):
s = ''
for elem in a:
s += str(elem)
print(s)
s1 = input()
s2 = input()
m1 = [int(s1[i]) for i in range(len(s1))]
m2 = [int(s2[i]) for i in range(len(s2))]
m1.sort(reverse = 1)
m2.sort(reverse = 1)
ans = []
if len(s2) > len(s1):
print_list(m1)
else:
f = False
for i in range(len(m1)):
for j in range(len(m1)):
if m1[j] <= m2[i] or f:
ans.append(m1[j])
if m1[j] < m2[i]:
f = True
m1 = m1[:j] + m1[j + 1:]
break
print_list(ans) | def print_list(a):
s = ''
for elem in a:
s += str(elem)
print(s)
s1 = input()
s2 = input()
m1 = [int(s1[i]) for i in range(len(s1))]
m2 = [int(s2[i]) for i in range(len(s2))]
m1.sort(reverse = 1)
m2.sort(reverse = 1)
ans = []
if len(s2) > len(s1):
print_list(m1)
else:
f = False
for i in range(len(m1)):
for j in range(len(m1)):
if m1[j] <= m2[i] or f:
ans.append(m1[j])
if m1[j]>m2[i]:
f = True
m1 = m1[:j] + m1[j + 1:]
break
print_list(ans) | if m1[j]>m2[i]: | 23 | decision |
def print_list(a):
s = ''
for elem in a:
s += str(elem)
print(s)
s1 = input()
s2 = input()
m1 = [int(s1[i]) for i in range(len(s1))]
m2 = [int(s2[i]) for i in range(len(s2))]
m1.sort(reverse = 1)
m2.sort(reverse = 1)
ans = []
if len(s2) > len(s1):
print_list(m1)
else:
f = False
for i in range(len(m1)):
for j in range(len(m1)):
if m1[j] <= m2[i] or f:
ans.append(m1[j])
if m1[j] < m2[i]:
f = True
m1 = m1[:j] + m1[j + 1:]
break
print_list(ans) | def print_list(a):
s = ''
for elem in a:
s += str(elem)
print(s)
s1 = input()
s2 = input()
m1 = [int(s1[i]) for i in range(len(s1))]
m2 = [int(s2[i]) for i in range(len(s2))]
m1.sort(reverse = 1)
m2.sort(reverse = 1)
ans = []
if len(s2)==len(s1):
print_list(m1)
else:
f = False
for i in range(len(m1)):
for j in range(len(m1)):
if m1[j] <= m2[i] or f:
ans.append(m1[j])
if m1[j] < m2[i]:
f = True
m1 = m1[:j] + m1[j + 1:]
break
print_list(ans) | if len(s2)==len(s1): | 15 | decision |
def print_list(a):
s = ''
for elem in a:
s += str(elem)
print(s)
s1 = input()
s2 = input()
m1 = [int(s1[i]) for i in range(len(s1))]
m2 = [int(s2[i]) for i in range(len(s2))]
m1.sort(reverse = 1)
m2.sort(reverse = 1)
ans = []
if len(s2) > len(s1):
print_list(m1)
else:
f = False
for i in range(len(m1)):
for j in range(len(m1)):
if m1[j] <= m2[i] or f:
ans.append(m1[j])
if m1[j] < m2[i]:
f = True
m1 = m1[:j] + m1[j + 1:]
break
print_list(ans) | def print_list(a):
s = ''
for elem in a:
s += str(elem)
print(s)
s1 = input()
s2 = input()
m1 = [int(s1[i]) for i in range(len(s1))]
m2 = [int(s2[i]) for i in range(len(s2))]
m1.sort(reverse = 1)
m2.sort(reverse = 1)
ans = []
if len(s2) > len(s1):
print_list(m1)
else:
f = False
for i in range(len(m1)):
for j in range(len(m1)):
if m1[j] <= m2[i] or f:
ans.append(m1[j])
if m1[j]>m2[i]:
f = True
m1 = m1[:j] + m1[j + 1:]
break
print_list(ans) | if m1[j]>m2[i]: | 23 | decision |
def print_list(a):
s = ''
for elem in a:
s += str(elem)
print(s)
s1 = input()
s2 = input()
m1 = [int(s1[i]) for i in range(len(s1))]
m2 = [int(s2[i]) for i in range(len(s2))]
m1.sort(reverse = 1)
m2.sort(reverse = 1)
ans = []
if len(s2) > len(s1):
print_list(m1)
else:
f = False
for i in range(len(m1)):
for j in range(len(m1)):
if m1[j] <= m2[i] or f:
ans.append(m1[j])
if m1[j] < m2[i]:
f = True
m1 = m1[:j] + m1[j + 1:]
break
print_list(ans) | def print_list(a):
s = ''
for elem in a:
s += str(elem)
print(s)
s1 = input()
s2 = input()
m1 = [int(s1[i]) for i in range(len(s1))]
m2 = [int(s2[i]) for i in range(len(s2))]
m1.sort(reverse = 1)
m2.sort(reverse = 1)
ans = []
if len(s2) > len(s1):
print_list(z)
else:
f = False
for i in range(len(m1)):
for j in range(len(m1)):
if m1[j] <= m2[i] or f:
ans.append(m1[j])
if m1[j] < m2[i]:
f = True
m1 = m1[:j] + m1[j + 1:]
break
print_list(ans) | print_list(z) | 16 | statement |
s = input().split()
a = int(s[0])
b = int(s[1])
while a != 0 and b != 0:
while a > 0 and a >= 2 * b:
a -= 2 * b
if b > 0 and b >= 2 * a:
b -= 2 * a
else:
print(str(a) + " " + str(b))
exit()
print(str(a) + " " + str(b)) | s = input().split()
a = int(s[0])
b = int(s[1])
while a != 0 and b != 0:
while a > 0 and a >= 2 * b:
a -= 2 * b
if b > 0 and b >= 2|a:
b -= 2 * a
else:
print(str(a) + " " + str(b))
exit()
print(str(a) + " " + str(b)) | if b > 0 and b >= 2|a: | 8 | operation |
s = input().split()
a = int(s[0])
b = int(s[1])
while a != 0 and b != 0:
while a > 0 and a >= 2 * b:
a -= 2 * b
if b > 0 and b >= 2 * a:
b -= 2 * a
else:
print(str(a) + " " + str(b))
exit()
print(str(a) + " " + str(b)) | s = input().split()
a = int(s[0])
b = int(s[1])
while a != 0 and b != 0:
while a > 0 and a >= 2 * b:
a -= 2 * b
if b > 0 and b >= 2 * a:
b -= 2 * a
else:
print(str(a) + " " + str(b))
exit()
print(str(a)<<" " + str(b)) | print(str(a)<<" " + str(b)) | 14 | operation |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.