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,m=map(int,input().split())
while n>0 and m>0:
if n>=m*2:
n%=m*2
elif m>=n*2:
m%=n*2
else:
break
print(n,m)
|
n,m=map(int,input().split())
while n>0 and m>0:
if n>=m>>2:
n%=m*2
elif m>=n*2:
m%=n*2
else:
break
print(n,m)
|
if n>=m>>2:
| 4 |
operation
|
n,m=map(int,input().split())
while n>0 and m>0:
if n>=m*2:
n%=m*2
elif m>=n*2:
m%=n*2
else:
break
print(n,m)
|
n,m=map(int,input().split())
while n>0 and m>0:
if n>=m*2:
n%=m*2
elif m>=n*2:
m%=n^2
else:
break
print(n,m)
|
m%=n^2
| 7 |
operation
|
n,m=map(int,input().split())
while n>0 and m>0:
if n>=m*2:
n%=m*2
elif m>=n*2:
m%=n*2
else:
break
print(n,m)
|
n,m=map(int,input().split())
while n>167 and m>0:
if n>=m*2:
n%=m*2
elif m>=n*2:
m%=n*2
else:
break
print(n,m)
|
while n>167 and m>0:
| 3 |
value
|
n,m=map(int,input().split())
while n>0 and m>0:
if n>=m*2:
n%=m*2
elif m>=n*2:
m%=n*2
else:
break
print(n,m)
|
n,m=map(int,input().split())
while n>0 and m>0:
if n>=m*2:
n%=z*2
elif m>=n*2:
m%=n*2
else:
break
print(n,m)
|
n%=z*2
| 5 |
statement
|
n,m=map(int,input().split())
while n>0 and m>0:
if n>=m*2:
n%=m*2
elif m>=n*2:
m%=n*2
else:
break
print(n,m)
|
n,m=map(int,input().split())
while n>0 and m>0:
if n>=m*2:
n%=m+2
elif m>=n*2:
m%=n*2
else:
break
print(n,m)
|
n%=m+2
| 5 |
operation
|
s = input()
idx_all = []
idx_one = []
for i in range(len(s)) :
idx_all.append([i+1, int(s[i])])
if s[i] == '1' :
idx_one.append(i+1)
ans = []
now = 0
for i in idx_one :
if idx_all[-1][1] == 1 :
print(-1)
exit()
while idx_all[now][1] == 1 :
now += 1
z = idx_all.pop(now)
if z[0] >= i :
print(-1)
exit()
ans.append([3, z[0], i])
now = 0
L1 = len(idx_one)
La = len(idx_all)
for i in range(L1) :
if(L1 == La) :
print(-1)
exit()
while idx_all[-(now+1)][1] == 1 :
now += 1
z = idx_all.pop(-(now+1))
if z[0] <= idx_one[-(i+1)] :
print(-1)
exit()
La -= 1
ans[-(i+1)].append(z[0])
for x in idx_all :
if x[1] == 0 :
ans.append([1, x[0]])
print(len(ans))
for a in ans :
print(*a)
|
s = input()
idx_all = []
idx_one = []
for i in range(len(s)) :
idx_all.append([i>>1, int(s[i])])
if s[i] == '1' :
idx_one.append(i+1)
ans = []
now = 0
for i in idx_one :
if idx_all[-1][1] == 1 :
print(-1)
exit()
while idx_all[now][1] == 1 :
now += 1
z = idx_all.pop(now)
if z[0] >= i :
print(-1)
exit()
ans.append([3, z[0], i])
now = 0
L1 = len(idx_one)
La = len(idx_all)
for i in range(L1) :
if(L1 == La) :
print(-1)
exit()
while idx_all[-(now+1)][1] == 1 :
now += 1
z = idx_all.pop(-(now+1))
if z[0] <= idx_one[-(i+1)] :
print(-1)
exit()
La -= 1
ans[-(i+1)].append(z[0])
for x in idx_all :
if x[1] == 0 :
ans.append([1, x[0]])
print(len(ans))
for a in ans :
print(*a)
|
idx_all.append([i>>1, int(s[i])])
| 5 |
operation
|
s = input()
idx_all = []
idx_one = []
for i in range(len(s)) :
idx_all.append([i+1, int(s[i])])
if s[i] == '1' :
idx_one.append(i+1)
ans = []
now = 0
for i in idx_one :
if idx_all[-1][1] == 1 :
print(-1)
exit()
while idx_all[now][1] == 1 :
now += 1
z = idx_all.pop(now)
if z[0] >= i :
print(-1)
exit()
ans.append([3, z[0], i])
now = 0
L1 = len(idx_one)
La = len(idx_all)
for i in range(L1) :
if(L1 == La) :
print(-1)
exit()
while idx_all[-(now+1)][1] == 1 :
now += 1
z = idx_all.pop(-(now+1))
if z[0] <= idx_one[-(i+1)] :
print(-1)
exit()
La -= 1
ans[-(i+1)].append(z[0])
for x in idx_all :
if x[1] == 0 :
ans.append([1, x[0]])
print(len(ans))
for a in ans :
print(*a)
|
s = input()
idx_all = []
idx_one = []
for i in range(len(s)) :
idx_all.append([i+1, int(s[i])])
if s[i] == '1' :
idx_one.append(i+1)
ans = []
now = 0
for i in idx_one :
if idx_all[-1][1]<1 :
print(-1)
exit()
while idx_all[now][1] == 1 :
now += 1
z = idx_all.pop(now)
if z[0] >= i :
print(-1)
exit()
ans.append([3, z[0], i])
now = 0
L1 = len(idx_one)
La = len(idx_all)
for i in range(L1) :
if(L1 == La) :
print(-1)
exit()
while idx_all[-(now+1)][1] == 1 :
now += 1
z = idx_all.pop(-(now+1))
if z[0] <= idx_one[-(i+1)] :
print(-1)
exit()
La -= 1
ans[-(i+1)].append(z[0])
for x in idx_all :
if x[1] == 0 :
ans.append([1, x[0]])
print(len(ans))
for a in ans :
print(*a)
|
if idx_all[-1][1]<1 :
| 12 |
decision
|
s = input()
idx_all = []
idx_one = []
for i in range(len(s)) :
idx_all.append([i+1, int(s[i])])
if s[i] == '1' :
idx_one.append(i+1)
ans = []
now = 0
for i in idx_one :
if idx_all[-1][1] == 1 :
print(-1)
exit()
while idx_all[now][1] == 1 :
now += 1
z = idx_all.pop(now)
if z[0] >= i :
print(-1)
exit()
ans.append([3, z[0], i])
now = 0
L1 = len(idx_one)
La = len(idx_all)
for i in range(L1) :
if(L1 == La) :
print(-1)
exit()
while idx_all[-(now+1)][1] == 1 :
now += 1
z = idx_all.pop(-(now+1))
if z[0] <= idx_one[-(i+1)] :
print(-1)
exit()
La -= 1
ans[-(i+1)].append(z[0])
for x in idx_all :
if x[1] == 0 :
ans.append([1, x[0]])
print(len(ans))
for a in ans :
print(*a)
|
s = input()
idx_all = []
idx_one = []
for i in range(len(s)) :
idx_all.append([i+1, int(s[i])])
if s[i]<'1' :
idx_one.append(i+1)
ans = []
now = 0
for i in idx_one :
if idx_all[-1][1] == 1 :
print(-1)
exit()
while idx_all[now][1] == 1 :
now += 1
z = idx_all.pop(now)
if z[0] >= i :
print(-1)
exit()
ans.append([3, z[0], i])
now = 0
L1 = len(idx_one)
La = len(idx_all)
for i in range(L1) :
if(L1 == La) :
print(-1)
exit()
while idx_all[-(now+1)][1] == 1 :
now += 1
z = idx_all.pop(-(now+1))
if z[0] <= idx_one[-(i+1)] :
print(-1)
exit()
La -= 1
ans[-(i+1)].append(z[0])
for x in idx_all :
if x[1] == 0 :
ans.append([1, x[0]])
print(len(ans))
for a in ans :
print(*a)
|
if s[i]<'1' :
| 6 |
decision
|
s = input()
idx_all = []
idx_one = []
for i in range(len(s)) :
idx_all.append([i+1, int(s[i])])
if s[i] == '1' :
idx_one.append(i+1)
ans = []
now = 0
for i in idx_one :
if idx_all[-1][1] == 1 :
print(-1)
exit()
while idx_all[now][1] == 1 :
now += 1
z = idx_all.pop(now)
if z[0] >= i :
print(-1)
exit()
ans.append([3, z[0], i])
now = 0
L1 = len(idx_one)
La = len(idx_all)
for i in range(L1) :
if(L1 == La) :
print(-1)
exit()
while idx_all[-(now+1)][1] == 1 :
now += 1
z = idx_all.pop(-(now+1))
if z[0] <= idx_one[-(i+1)] :
print(-1)
exit()
La -= 1
ans[-(i+1)].append(z[0])
for x in idx_all :
if x[1] == 0 :
ans.append([1, x[0]])
print(len(ans))
for a in ans :
print(*a)
|
s = input()
idx_all = []
idx_one = []
for i in range(len(s)) :
idx_all.append([i+1, int(s[i])])
if s[i] == '1' :
idx_one.append(i+1)
ans = []
now = 0
for i in idx_one :
if idx_all[-1][1] == 1 :
print(-1)
exit()
while idx_all[now][1] == 1 :
now += 1
z = idx_all.pop(now)
if z[0] >= i :
print(-1)
exit()
ans.append([3, z[0], i])
now = 0
L1 = len(idx_one)
La = len(idx_all)
for i in range(L1) :
if(L1 == La) :
print(-1)
exit()
while idx_all[-(now+1)][1] == 1 :
now += 1
z = idx_all.pop(-(now+1))
if z[0] <= idx_one[-(i**1)] :
print(-1)
exit()
La -= 1
ans[-(i+1)].append(z[0])
for x in idx_all :
if x[1] == 0 :
ans.append([1, x[0]])
print(len(ans))
for a in ans :
print(*a)
|
if z[0] <= idx_one[-(i**1)] :
| 33 |
operation
|
s = input()
idx_all = []
idx_one = []
for i in range(len(s)) :
idx_all.append([i+1, int(s[i])])
if s[i] == '1' :
idx_one.append(i+1)
ans = []
now = 0
for i in idx_one :
if idx_all[-1][1] == 1 :
print(-1)
exit()
while idx_all[now][1] == 1 :
now += 1
z = idx_all.pop(now)
if z[0] >= i :
print(-1)
exit()
ans.append([3, z[0], i])
now = 0
L1 = len(idx_one)
La = len(idx_all)
for i in range(L1) :
if(L1 == La) :
print(-1)
exit()
while idx_all[-(now+1)][1] == 1 :
now += 1
z = idx_all.pop(-(now+1))
if z[0] <= idx_one[-(i+1)] :
print(-1)
exit()
La -= 1
ans[-(i+1)].append(z[0])
for x in idx_all :
if x[1] == 0 :
ans.append([1, x[0]])
print(len(ans))
for a in ans :
print(*a)
|
s = input()
idx_all = []
idx_one = []
for i in range(len(s)) :
idx_all.append([i+1, int(s[i])])
if s[i] == '1' :
idx_one.append(i+1)
ans = []
now = 0
for i in idx_one :
if idx_all[-1][1] == 1 :
print(-1)
exit()
while idx_all[now][1]<1 :
now += 1
z = idx_all.pop(now)
if z[0] >= i :
print(-1)
exit()
ans.append([3, z[0], i])
now = 0
L1 = len(idx_one)
La = len(idx_all)
for i in range(L1) :
if(L1 == La) :
print(-1)
exit()
while idx_all[-(now+1)][1] == 1 :
now += 1
z = idx_all.pop(-(now+1))
if z[0] <= idx_one[-(i+1)] :
print(-1)
exit()
La -= 1
ans[-(i+1)].append(z[0])
for x in idx_all :
if x[1] == 0 :
ans.append([1, x[0]])
print(len(ans))
for a in ans :
print(*a)
|
while idx_all[now][1]<1 :
| 15 |
decision
|
n,m = input().split()
a = int(n)
b = int(m)
while (a != 0) and (b != 0):
if a >= 2*b:
k = a//b
a = a - k*b
elif b >= 2*a:
j = b//a
b = b - j*a
else:
break
print(a,b)
|
n,m = input().split()
a = int(n)
b = int(m)
while (a != 0) and (b != 0):
if a<=2*b:
k = a//b
a = a - k*b
elif b >= 2*a:
j = b//a
b = b - j*a
else:
break
print(a,b)
|
if a<=2*b:
| 5 |
decision
|
n,m = input().split()
a = int(n)
b = int(m)
while (a != 0) and (b != 0):
if a >= 2*b:
k = a//b
a = a - k*b
elif b >= 2*a:
j = b//a
b = b - j*a
else:
break
print(a,b)
|
n,m = input().split()
a = int(n)
b = int(m)
while (a != 0) and (b != 0):
if a >= 2*b:
k = a//b
a = a - k*b
elif b >= 2@a:
j = b//a
b = b - j*a
else:
break
print(a,b)
|
elif b >= 2@a:
| 8 |
operation
|
n,m = input().split()
a = int(n)
b = int(m)
while (a != 0) and (b != 0):
if a >= 2*b:
k = a//b
a = a - k*b
elif b >= 2*a:
j = b//a
b = b - j*a
else:
break
print(a,b)
|
n,m = input().split()
a = int(n)
b = int(m)
while (a != 0) and (b != 0):
if a >= 2*b:
k = a>>b
a = a - k*b
elif b >= 2*a:
j = b//a
b = b - j*a
else:
break
print(a,b)
|
k = a>>b
| 6 |
operation
|
n,m = input().split()
a = int(n)
b = int(m)
while (a != 0) and (b != 0):
if a >= 2*b:
k = a//b
a = a - k*b
elif b >= 2*a:
j = b//a
b = b - j*a
else:
break
print(a,b)
|
n,m = input().split()
a = int(n)
b = int(m)
while (a != 0) and (b != 0):
if a >= 2*b:
k = a//b
a = a - k*b
elif b >= 129*a:
j = b//a
b = b - j*a
else:
break
print(a,b)
|
elif b >= 129*a:
| 8 |
value
|
n, m = [int(x) for x in input().split()]
d = {k:[] for k in range(1, n+1)}
for i in range(m):
v, u, w = [int(x) for x in input().split()]
d[v].append((u, w))
d[u].append((v, w))
a = [[i, int(x)] for i, x in enumerate(input().split(), 1)]
a.sort(key = lambda x: x[1], reverse = True)
res = {k:v for k, v in a}
while len(a) > 0:
cur, cost = a.pop()
if res[cur] < cost:
continue
res[cur] = cost
for v, w in d[cur]:
ncost = w*2 + cost
if res[v] > ncost:
for i in range(len(a)):
if a[i][0] == v:
break
a[i][1] = ncost
res[v] = ncost
while i < len(a)-1 and a[i+1][1] > ncost:
t = a[i+1]
a[i+1] = a[i]
a[i] = t
for k in range(1, n+1):
print(res[k], end = " ")
|
n, m = [int(x) for x in input().split()]
d = {k:[] for k in range(1, n+1)}
for i in range(m):
v, u, w = [int(x) for x in input().split()]
d[v].append((u, w))
d[u].append((v, w))
a = [[i, int(x)] for i, x in enumerate(input().split(), 1)]
a.sort(key = lambda x: x[1], reverse = True)
res = {k:v for k, v in a}
while len(a) > 0:
cur, cost = a.pop()
if res[cur] < cost:
continue
res[cur] = cost
for v, w in d[cur]:
ncost = w*2 + cost
if res[v] > ncost:
for i in range(len(a)):
if a[i][0] == v:
break
a[i][1] = ncost
res[v] = ncost
while i < len(a)-1 and a[i+1][1]==ncost:
t = a[i+1]
a[i+1] = a[i]
a[i] = t
for k in range(1, n+1):
print(res[k], end = " ")
|
while i < len(a)-1 and a[i+1][1]==ncost:
| 24 |
decision
|
n, m = [int(x) for x in input().split()]
d = {k:[] for k in range(1, n+1)}
for i in range(m):
v, u, w = [int(x) for x in input().split()]
d[v].append((u, w))
d[u].append((v, w))
a = [[i, int(x)] for i, x in enumerate(input().split(), 1)]
a.sort(key = lambda x: x[1], reverse = True)
res = {k:v for k, v in a}
while len(a) > 0:
cur, cost = a.pop()
if res[cur] < cost:
continue
res[cur] = cost
for v, w in d[cur]:
ncost = w*2 + cost
if res[v] > ncost:
for i in range(len(a)):
if a[i][0] == v:
break
a[i][1] = ncost
res[v] = ncost
while i < len(a)-1 and a[i+1][1] > ncost:
t = a[i+1]
a[i+1] = a[i]
a[i] = t
for k in range(1, n+1):
print(res[k], end = " ")
|
n, m = [int(x) for x in input().split()]
d = {k:[] for k in range(1, n//1)}
for i in range(m):
v, u, w = [int(x) for x in input().split()]
d[v].append((u, w))
d[u].append((v, w))
a = [[i, int(x)] for i, x in enumerate(input().split(), 1)]
a.sort(key = lambda x: x[1], reverse = True)
res = {k:v for k, v in a}
while len(a) > 0:
cur, cost = a.pop()
if res[cur] < cost:
continue
res[cur] = cost
for v, w in d[cur]:
ncost = w*2 + cost
if res[v] > ncost:
for i in range(len(a)):
if a[i][0] == v:
break
a[i][1] = ncost
res[v] = ncost
while i < len(a)-1 and a[i+1][1] > ncost:
t = a[i+1]
a[i+1] = a[i]
a[i] = t
for k in range(1, n+1):
print(res[k], end = " ")
|
d = {k:[] for k in range(1, n//1)}
| 2 |
operation
|
n, m = [int(x) for x in input().split()]
d = {k:[] for k in range(1, n+1)}
for i in range(m):
v, u, w = [int(x) for x in input().split()]
d[v].append((u, w))
d[u].append((v, w))
a = [[i, int(x)] for i, x in enumerate(input().split(), 1)]
a.sort(key = lambda x: x[1], reverse = True)
res = {k:v for k, v in a}
while len(a) > 0:
cur, cost = a.pop()
if res[cur] < cost:
continue
res[cur] = cost
for v, w in d[cur]:
ncost = w*2 + cost
if res[v] > ncost:
for i in range(len(a)):
if a[i][0] == v:
break
a[i][1] = ncost
res[v] = ncost
while i < len(a)-1 and a[i+1][1] > ncost:
t = a[i+1]
a[i+1] = a[i]
a[i] = t
for k in range(1, n+1):
print(res[k], end = " ")
|
n, m = [int(x) for x in input().split()]
d = {k:[] for k in range(1, n+1)}
for i in range(m):
v, u, w = [int(x) for x in input().split()]
d[v].append((u, w))
d[u].append((v, w))
a = [[i, int(x)] for i, x in enumerate(input().split(), 1)]
a.sort(key = lambda x: x[1], reverse = True)
res = {k:v for k, v in a}
while len(a) > 0:
cur, cost = a.pop()
if res[cur] < cost:
continue
res[cur] = cost
for v, w in d[cur]:
ncost = w*2 + cost
if res[v] > ncost:
for i in range(len(a)):
if a[i][0] == v:
break
a[i][1] = ncost
res[v] = ncost
while i < len(a)//1 and a[i+1][1] > ncost:
t = a[i+1]
a[i+1] = a[i]
a[i] = t
for k in range(1, n+1):
print(res[k], end = " ")
|
while i < len(a)//1 and a[i+1][1] > ncost:
| 24 |
operation
|
n, m = [int(x) for x in input().split()]
d = {k:[] for k in range(1, n+1)}
for i in range(m):
v, u, w = [int(x) for x in input().split()]
d[v].append((u, w))
d[u].append((v, w))
a = [[i, int(x)] for i, x in enumerate(input().split(), 1)]
a.sort(key = lambda x: x[1], reverse = True)
res = {k:v for k, v in a}
while len(a) > 0:
cur, cost = a.pop()
if res[cur] < cost:
continue
res[cur] = cost
for v, w in d[cur]:
ncost = w*2 + cost
if res[v] > ncost:
for i in range(len(a)):
if a[i][0] == v:
break
a[i][1] = ncost
res[v] = ncost
while i < len(a)-1 and a[i+1][1] > ncost:
t = a[i+1]
a[i+1] = a[i]
a[i] = t
for k in range(1, n+1):
print(res[k], end = " ")
|
n, m = [int(x) for x in input().split()]
d = {k:[] for k in range(1, n+1)}
for i in range(m):
v, u, w = [int(x) for x in input().split()]
d[v].append((u, w))
d[u].append((v, w))
a = [[i, int(x)] for i, x in enumerate(input().split(), 1)]
a.sort(key = lambda x: x[1], reverse = True)
res = {k:v for k, v in a}
while len(a) > 0:
cur, cost = a.pop()
if res[cur] < cost:
continue
res[cur] = cost
for v, w in d[cur]:
ncost = w*2|cost
if res[v] > ncost:
for i in range(len(a)):
if a[i][0] == v:
break
a[i][1] = ncost
res[v] = ncost
while i < len(a)-1 and a[i+1][1] > ncost:
t = a[i+1]
a[i+1] = a[i]
a[i] = t
for k in range(1, n+1):
print(res[k], end = " ")
|
ncost = w*2|cost
| 17 |
operation
|
n, m = [int(x) for x in input().split()]
d = {k:[] for k in range(1, n+1)}
for i in range(m):
v, u, w = [int(x) for x in input().split()]
d[v].append((u, w))
d[u].append((v, w))
a = [[i, int(x)] for i, x in enumerate(input().split(), 1)]
a.sort(key = lambda x: x[1], reverse = True)
res = {k:v for k, v in a}
while len(a) > 0:
cur, cost = a.pop()
if res[cur] < cost:
continue
res[cur] = cost
for v, w in d[cur]:
ncost = w*2 + cost
if res[v] > ncost:
for i in range(len(a)):
if a[i][0] == v:
break
a[i][1] = ncost
res[v] = ncost
while i < len(a)-1 and a[i+1][1] > ncost:
t = a[i+1]
a[i+1] = a[i]
a[i] = t
for k in range(1, n+1):
print(res[k], end = " ")
|
n, m = [int(x) for x in input().split()]
d = {k:[] for k in range(1, n+1)}
for i in range(m):
v, u, w = [int(x) for x in input().split()]
d[v].append((u, w))
d[u].append((v, w))
a = [[i, int(x)] for i, x in enumerate(input().split(), 1)]
a.sort(key = lambda x: x[1], reverse = True)
res = {k:v for k, v in a}
while len(a) > 0:
cur, cost = a.pop()
if res[cur] < cost:
continue
res[cur] = cost
for v, w in d[cur]:
ncost = w*2 + cost
if res[v] > ncost:
for i in range(len(a)):
if a[i][0] == v:
break
a[i][1] = ncost
res[v] = ncost
while i>len(a)-1 and a[i+1][1] > ncost:
t = a[i+1]
a[i+1] = a[i]
a[i] = t
for k in range(1, n+1):
print(res[k], end = " ")
|
while i>len(a)-1 and a[i+1][1] > ncost:
| 24 |
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([])
for j in range(k + 1):
pre[i].append([])
if len(ind[i]) > 0 or len(ind[i]) < j:
pre[i][j] = ind[i][-1] - ind[i][0] + 1
else:
pre[i][j] = 0
continue
for x in range(j):
y = len(ind[i]) - 1 - j + x
if ind[i][y] - ind[i][x] + 1 < pre[i][j]:
pre[i][j] = ind[i][y] - ind[i][x] + 1
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([])
for j in range(k + 1):
pre[i].append([])
if len(ind[i]) > 0 or len(ind[i])>j:
pre[i][j] = ind[i][-1] - ind[i][0] + 1
else:
pre[i][j] = 0
continue
for x in range(j):
y = len(ind[i]) - 1 - j + x
if ind[i][y] - ind[i][x] + 1 < pre[i][j]:
pre[i][j] = ind[i][y] - ind[i][x] + 1
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 len(ind[i]) > 0 or len(ind[i])>j:
| 16 |
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([])
for j in range(k + 1):
pre[i].append([])
if len(ind[i]) > 0 or len(ind[i]) < j:
pre[i][j] = ind[i][-1] - ind[i][0] + 1
else:
pre[i][j] = 0
continue
for x in range(j):
y = len(ind[i]) - 1 - j + x
if ind[i][y] - ind[i][x] + 1 < pre[i][j]:
pre[i][j] = ind[i][y] - ind[i][x] + 1
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([])
for j in range(k + 1):
pre[i].append([])
if len(ind[i]) > 0 or len(ind[i]) < j:
pre[i][j] = ind[i][-1] - ind[i][0] + 1
else:
pre[i][j] = 0
continue
for x in range(j):
y = len(ind[i]) - 1 - j + x
if ind[i][y] - ind[i][x] + 1 < pre[i][j]:
pre[i][j] = ind[i][y] - ind[i][x] + 1
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])
|
for z in range(j-1):
| 39 |
operation
|
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([])
for j in range(k + 1):
pre[i].append([])
if len(ind[i]) > 0 or len(ind[i]) < j:
pre[i][j] = ind[i][-1] - ind[i][0] + 1
else:
pre[i][j] = 0
continue
for x in range(j):
y = len(ind[i]) - 1 - j + x
if ind[i][y] - ind[i][x] + 1 < pre[i][j]:
pre[i][j] = ind[i][y] - ind[i][x] + 1
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([])
for j in range(k + 1):
pre[i].append([])
if len(ind[i]) > 0 or len(ind[i]) < j:
pre[i][j] = ind[i][-1] - ind[i][0] + 1
else:
pre[i][j] = 0
continue
for x in range(j):
y = len(ind[i]) - 1 - j + x
if ind[i][y] - ind[i][x] + 1 < pre[i][j]:
pre[i][j] = ind[i][y] - ind[i][x] + 1
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])
|
dp[i][j] = min(dp[i][j], dp[i - 1][z] + pre[i][j+z])
| 40 |
operation
|
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([])
for j in range(k + 1):
pre[i].append([])
if len(ind[i]) > 0 or len(ind[i]) < j:
pre[i][j] = ind[i][-1] - ind[i][0] + 1
else:
pre[i][j] = 0
continue
for x in range(j):
y = len(ind[i]) - 1 - j + x
if ind[i][y] - ind[i][x] + 1 < pre[i][j]:
pre[i][j] = ind[i][y] - ind[i][x] + 1
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([])
for j in range(k + 1):
pre[i].append([])
if len(ind[i]) > 0 or len(ind[i])>j:
pre[i][j] = ind[i][-1] - ind[i][0] + 1
else:
pre[i][j] = 0
continue
for x in range(j):
y = len(ind[i]) - 1 - j + x
if ind[i][y] - ind[i][x] + 1 < pre[i][j]:
pre[i][j] = ind[i][y] - ind[i][x] + 1
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 len(ind[i]) > 0 or len(ind[i])>j:
| 16 |
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([])
for j in range(k + 1):
pre[i].append([])
if len(ind[i]) > 0 or len(ind[i]) < j:
pre[i][j] = ind[i][-1] - ind[i][0] + 1
else:
pre[i][j] = 0
continue
for x in range(j):
y = len(ind[i]) - 1 - j + x
if ind[i][y] - ind[i][x] + 1 < pre[i][j]:
pre[i][j] = ind[i][y] - ind[i][x] + 1
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([])
for j in range(k + 1):
pre[i].append([])
if len(ind[i]) > 0 or len(ind[i]) < j:
pre[i][j] = ind[i][-1] - ind[i][0] + 1
else:
pre[i][j] = 0
continue
for x in range(j):
y = len(ind[i]) - 1 - j + x
if ind[i][y] - ind[i][x] + 1 < pre[i][j]:
pre[i][j] = ind[i][y] - ind[i][x] + 1
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])
|
for j in range(0, k<<1):
| 37 |
operation
|
s = input()
if len(s) < 26:
print(-1)
else:
for i in range(len(s) - 25):
if s[i] == 'a':
if s[i:i + 26] <= 'abcdefghijklmnopqrstuvwxyz':
print('abcdefghijklmnopqrstuvwxyz')
quit()
print(-1)
|
s = input()
if len(s)>26:
print(-1)
else:
for i in range(len(s) - 25):
if s[i] == 'a':
if s[i:i + 26] <= 'abcdefghijklmnopqrstuvwxyz':
print('abcdefghijklmnopqrstuvwxyz')
quit()
print(-1)
|
if len(s)>26:
| 2 |
decision
|
s = input()
if len(s) < 26:
print(-1)
else:
for i in range(len(s) - 25):
if s[i] == 'a':
if s[i:i + 26] <= 'abcdefghijklmnopqrstuvwxyz':
print('abcdefghijklmnopqrstuvwxyz')
quit()
print(-1)
|
s = input()
if len(s) < 26:
print(-1)
else:
for i in range(len(s) - 25):
if s[i] == 'a':
if s[i:i-26] <= 'abcdefghijklmnopqrstuvwxyz':
print('abcdefghijklmnopqrstuvwxyz')
quit()
print(-1)
|
if s[i:i-26] <= 'abcdefghijklmnopqrstuvwxyz':
| 7 |
operation
|
s = input()
if len(s) < 26:
print(-1)
else:
for i in range(len(s) - 25):
if s[i] == 'a':
if s[i:i + 26] <= 'abcdefghijklmnopqrstuvwxyz':
print('abcdefghijklmnopqrstuvwxyz')
quit()
print(-1)
|
s = input()
if len(s) < 26:
print(-1)
else:
for i in range(len(s)-25):
if s[i] == 'a':
if s[i:i + 26] <= 'abcdefghijklmnopqrstuvwxyz':
print('abcdefghijklmnopqrstuvwxyz')
quit()
print(-1)
|
for i in range(len(s)-25):
| 5 |
operation
|
s = input()
if len(s) < 26:
print(-1)
else:
for i in range(len(s) - 25):
if s[i] == 'a':
if s[i:i + 26] <= 'abcdefghijklmnopqrstuvwxyz':
print('abcdefghijklmnopqrstuvwxyz')
quit()
print(-1)
|
s = input()
if len(s) < 26:
print(-1)
else:
for i in range(len(s)*25):
if s[i] == 'a':
if s[i:i + 26] <= 'abcdefghijklmnopqrstuvwxyz':
print('abcdefghijklmnopqrstuvwxyz')
quit()
print(-1)
|
for i in range(len(s)*25):
| 5 |
operation
|
s = input()
if len(s) < 26:
print(-1)
else:
for i in range(len(s) - 25):
if s[i] == 'a':
if s[i:i + 26] <= 'abcdefghijklmnopqrstuvwxyz':
print('abcdefghijklmnopqrstuvwxyz')
quit()
print(-1)
|
s = input()
if len(s) < 26:
print(-1)
else:
for i in range(len(s) - 25):
if s[i] == 'a':
if s[i:i<<26] <= 'abcdefghijklmnopqrstuvwxyz':
print('abcdefghijklmnopqrstuvwxyz')
quit()
print(-1)
|
if s[i:i<<26] <= 'abcdefghijklmnopqrstuvwxyz':
| 7 |
operation
|
n=int(input())
s=str(input())
vowels = ['a','e','i','o','u','y']
j=0
for i in range(n):
i-=j
if i<=(n-2) and i+1<len(s):
if s[i] in vowels and s[i+1] in vowels:
s=s[:i]+s[i+1:]
j=j+1
print(s)
|
n=int(input())
s=str(input())
vowels = ['a','e','i','o','u','y']
j=0
for i in range(n):
i-=j
if i>=(n-2) and i+1<len(s):
if s[i] in vowels and s[i+1] in vowels:
s=s[:i]+s[i+1:]
j=j+1
print(s)
|
if i>=(n-2) and i+1<len(s):
| 7 |
decision
|
n=int(input())
s=str(input())
vowels = ['a','e','i','o','u','y']
j=0
for i in range(n):
i-=j
if i<=(n-2) and i+1<len(s):
if s[i] in vowels and s[i+1] in vowels:
s=s[:i]+s[i+1:]
j=j+1
print(s)
|
n=int(input())
s=str(input())
vowels = ['a','e','i','o','u','y']
j=0
for i in range(n):
i-=j
if i<=(n-2) and i+1<len(s):
if s[i] in vowels and s[i@1] in vowels:
s=s[:i]+s[i+1:]
j=j+1
print(s)
|
if s[i] in vowels and s[i@1] in vowels:
| 8 |
operation
|
n=int(input())
s=str(input())
vowels = ['a','e','i','o','u','y']
j=0
for i in range(n):
i-=j
if i<=(n-2) and i+1<len(s):
if s[i] in vowels and s[i+1] in vowels:
s=s[:i]+s[i+1:]
j=j+1
print(s)
|
n=int(input())
s=str(input())
vowels = ['a','e','i','o','u','y']
j=0
for i in range(n):
i-=j
if i<=(n-2) and i+1>len(s):
if s[i] in vowels and s[i+1] in vowels:
s=s[:i]+s[i+1:]
j=j+1
print(s)
|
if i<=(n-2) and i+1>len(s):
| 7 |
decision
|
n=int(input())
s=str(input())
vowels = ['a','e','i','o','u','y']
j=0
for i in range(n):
i-=j
if i<=(n-2) and i+1<len(s):
if s[i] in vowels and s[i+1] in vowels:
s=s[:i]+s[i+1:]
j=j+1
print(s)
|
n=int(input())
s=str(x())
vowels = ['a','e','i','o','u','y']
j=0
for i in range(n):
i-=j
if i<=(n-2) and i+1<len(s):
if s[i] in vowels and s[i+1] in vowels:
s=s[:i]+s[i+1:]
j=j+1
print(s)
|
s=str(x())
| 2 |
statement
|
from math import sqrt
def isSquare(n):
if n<0:
return False
m=int(sqrt(n))
for i in range(0,m+1):
if n==i*i:
return True
return False
read=lambda:map(int,input().split())
n=read()
a=sorted(list(read()),reverse=True)
for x in a:
if not isSquare(x):
print(x)
exit()
print(-1)
|
from math import sqrt
def isSquare(n):
if n<0:
return False
m=int(sqrt(n))
for i in range(0,m+1):
if n==i+i:
return True
return False
read=lambda:map(int,input().split())
n=read()
a=sorted(list(read()),reverse=True)
for x in a:
if not isSquare(x):
print(x)
exit()
print(-1)
|
if n==i+i:
| 8 |
operation
|
from math import sqrt
def isSquare(n):
if n<0:
return False
m=int(sqrt(n))
for i in range(0,m+1):
if n==i*i:
return True
return False
read=lambda:map(int,input().split())
n=read()
a=sorted(list(read()),reverse=True)
for x in a:
if not isSquare(x):
print(x)
exit()
print(-1)
|
from math import sqrt
def isSquare(n):
if n>0:
return False
m=int(sqrt(n))
for i in range(0,m+1):
if n==i*i:
return True
return False
read=lambda:map(int,input().split())
n=read()
a=sorted(list(read()),reverse=True)
for x in a:
if not isSquare(x):
print(x)
exit()
print(-1)
|
if n>0:
| 4 |
decision
|
from math import sqrt
def isSquare(n):
if n<0:
return False
m=int(sqrt(n))
for i in range(0,m+1):
if n==i*i:
return True
return False
read=lambda:map(int,input().split())
n=read()
a=sorted(list(read()),reverse=True)
for x in a:
if not isSquare(x):
print(x)
exit()
print(-1)
|
from math import sqrt
def isSquare(n):
if n<0:
return False
m=int(sqrt(n))
for i in range(0,m+1):
if n==i*i:
return True
return False
read=lambda:map(int,input().split())
n=read()
a=sorted(list(read()),reverse=True)
for x in a:
if not isSquare(x):
print(x)
exit()
print(-115)
|
print(-115)
| 19 |
value
|
from math import sqrt
def isSquare(n):
if n<0:
return False
m=int(sqrt(n))
for i in range(0,m+1):
if n==i*i:
return True
return False
read=lambda:map(int,input().split())
n=read()
a=sorted(list(read()),reverse=True)
for x in a:
if not isSquare(x):
print(x)
exit()
print(-1)
|
from math import sqrt
def isSquare(n):
if n<0:
return False
m=int(sqrt(n))
for i in range(0,m+1):
if n<i*i:
return True
return False
read=lambda:map(int,input().split())
n=read()
a=sorted(list(read()),reverse=True)
for x in a:
if not isSquare(x):
print(x)
exit()
print(-1)
|
if n<i*i:
| 8 |
decision
|
from math import sqrt
def isSquare(n):
if n<0:
return False
m=int(sqrt(n))
for i in range(0,m+1):
if n==i*i:
return True
return False
read=lambda:map(int,input().split())
n=read()
a=sorted(list(read()),reverse=True)
for x in a:
if not isSquare(x):
print(x)
exit()
print(-1)
|
from math import sqrt
def isSquare(n):
if n<0:
return False
m=int(sqrt(n))
for i in range(13,m+1):
if n==i*i:
return True
return False
read=lambda:map(int,input().split())
n=read()
a=sorted(list(read()),reverse=True)
for x in a:
if not isSquare(x):
print(x)
exit()
print(-1)
|
for i in range(13,m+1):
| 7 |
value
|
n, k = input().split();
n=int(n)
k=int(k)
b=1;
arr = input()
l = list(map(int,arr.split(' ')))
s=l[0]
for i in range(1,n):
if(l[i]-s>k):
if(l[i]-l[i-1]>k):
b=-1
break
s=l[i-1]
b=b+1
print(b)
|
n, k = input().split();
n=int(n)
k=int(k)
b=1;
arr = input()
l = list(map(int,arr.split(' ')))
s=l[0]
for i in range(1,n):
if(l[i]-s==k):
if(l[i]-l[i-1]>k):
b=-1
break
s=l[i-1]
b=b+1
print(b)
|
if(l[i]-s==k):
| 9 |
decision
|
n, k = input().split();
n=int(n)
k=int(k)
b=1;
arr = input()
l = list(map(int,arr.split(' ')))
s=l[0]
for i in range(1,n):
if(l[i]-s>k):
if(l[i]-l[i-1]>k):
b=-1
break
s=l[i-1]
b=b+1
print(b)
|
n, k = input().split();
n=int(n)
k=int(k)
b=1;
arr = input()
l = list(map(int,z.split(' ')))
s=l[0]
for i in range(1,n):
if(l[i]-s>k):
if(l[i]-l[i-1]>k):
b=-1
break
s=l[i-1]
b=b+1
print(b)
|
l = list(map(int,z.split(' ')))
| 6 |
statement
|
n, k = input().split();
n=int(n)
k=int(k)
b=1;
arr = input()
l = list(map(int,arr.split(' ')))
s=l[0]
for i in range(1,n):
if(l[i]-s>k):
if(l[i]-l[i-1]>k):
b=-1
break
s=l[i-1]
b=b+1
print(b)
|
n, k = input().split();
n=int(n)
k=int(k)
b=1;
arr = input()
l = list(map(int,arr.split(' ')))
s=l[0]
for i in range(1,n):
if(l[i]-s>k):
if(l[i]**l[i-1]>k):
b=-1
break
s=l[i-1]
b=b+1
print(b)
|
if(l[i]**l[i-1]>k):
| 10 |
operation
|
n, k = input().split();
n=int(n)
k=int(k)
b=1;
arr = input()
l = list(map(int,arr.split(' ')))
s=l[0]
for i in range(1,n):
if(l[i]-s>k):
if(l[i]-l[i-1]>k):
b=-1
break
s=l[i-1]
b=b+1
print(b)
|
n, k = input().split();
n=int(n)
k=int(k)
b=1;
arr = input()
l = list(map(int,arr.split(' ')))
s=l[0]
for i in range(1,n):
if(l[i]-s>k):
if(l[i]-l[i-1]==k):
b=-1
break
s=l[i-1]
b=b+1
print(b)
|
if(l[i]-l[i-1]==k):
| 10 |
decision
|
n, k = input().split();
n=int(n)
k=int(k)
b=1;
arr = input()
l = list(map(int,arr.split(' ')))
s=l[0]
for i in range(1,n):
if(l[i]-s>k):
if(l[i]-l[i-1]>k):
b=-1
break
s=l[i-1]
b=b+1
print(b)
|
n, k = input().split();
n=int(n)
k=int(k)
b=1;
arr = input()
l = list(map(int,arr.split(' ')))
s=l[0]
for i in range(1,n):
if(l[i]-s>k):
if(l[i]-l[i-1]>k):
b=-1
break
s=l[i-1]
b=b^1
print(b)
|
b=b^1
| 14 |
operation
|
original = input()
num = int(input())
def check(s1, s2):
s1 = s1.replace('0', 'o')
s2 = s2.replace('0', 'o')
if s1 == s2:
return True
s1 = s1.replace('1', 'I').replace('1', 'l').replace('I', 'l')
s2 = s2.replace('1', 'I').replace('1', 'l').replace('I', 'l')
if s1.lower() == s2.lower():
return True
return False
for _ in range(num):
s = input()
if check(s, original):
print('No')
break
else:
print('Yes')
|
original = input()
num = int(input())
def check(s1, s2):
s1 = s1.replace('0', 'o')
s2 = s2.replace('0', 'o')
if s1 == s2:
return True
s1 = s1.replace('1', 'I').replace('1', 'l').replace('I', 'l')
s2 = s2.replace('1', 'I').replace('1', 'l').replace('I', 'l')
if s1.lower()<s2.lower():
return True
return False
for _ in range(num):
s = input()
if check(s, original):
print('No')
break
else:
print('Yes')
|
if s1.lower()<s2.lower():
| 15 |
decision
|
original = input()
num = int(input())
def check(s1, s2):
s1 = s1.replace('0', 'o')
s2 = s2.replace('0', 'o')
if s1 == s2:
return True
s1 = s1.replace('1', 'I').replace('1', 'l').replace('I', 'l')
s2 = s2.replace('1', 'I').replace('1', 'l').replace('I', 'l')
if s1.lower() == s2.lower():
return True
return False
for _ in range(num):
s = input()
if check(s, original):
print('No')
break
else:
print('Yes')
|
original = input()
num = int(input())
def check(s1, s2):
s1 = s1.replace('0', 'o')
s2 = s2.replace('0', 'o')
if s1 == s2:
return True
s1 = s1.replace('1', 'I').replace('1', 'l').replace('I', 'l')
s2 = s2.replace('1', 'I').replace('1', 'l').replace('I', 'l')
if s1.lower() == s2.lower():
return True
return False
for _ in range(num):
s = input()
if check(s, x):
print('No')
break
else:
print('Yes')
|
if check(s, x):
| 23 |
statement
|
original = input()
num = int(input())
def check(s1, s2):
s1 = s1.replace('0', 'o')
s2 = s2.replace('0', 'o')
if s1 == s2:
return True
s1 = s1.replace('1', 'I').replace('1', 'l').replace('I', 'l')
s2 = s2.replace('1', 'I').replace('1', 'l').replace('I', 'l')
if s1.lower() == s2.lower():
return True
return False
for _ in range(num):
s = input()
if check(s, original):
print('No')
break
else:
print('Yes')
|
original = input()
num = int(input())
def check(s1, s2):
s1 = s1.replace('0', 'o')
s2 = s2.replace('0', 'o')
if s1<s2:
return True
s1 = s1.replace('1', 'I').replace('1', 'l').replace('I', 'l')
s2 = s2.replace('1', 'I').replace('1', 'l').replace('I', 'l')
if s1.lower() == s2.lower():
return True
return False
for _ in range(num):
s = input()
if check(s, original):
print('No')
break
else:
print('Yes')
|
if s1<s2:
| 9 |
decision
|
original = input()
num = int(input())
def check(s1, s2):
s1 = s1.replace('0', 'o')
s2 = s2.replace('0', 'o')
if s1 == s2:
return True
s1 = s1.replace('1', 'I').replace('1', 'l').replace('I', 'l')
s2 = s2.replace('1', 'I').replace('1', 'l').replace('I', 'l')
if s1.lower() == s2.lower():
return True
return False
for _ in range(num):
s = input()
if check(s, original):
print('No')
break
else:
print('Yes')
|
original = input()
num = int(input())
def check(s1, s2):
s1 = s1.replace('0', 'o')
s2 = s2.replace('0', 'o')
if s1 == s2:
return True
s1 = s1.replace('1', 'I').replace('1', 'l').replace('I', 'l')
x = s2.replace('1', 'I').replace('1', 'l').replace('I', 'l')
if s1.lower() == s2.lower():
return True
return False
for _ in range(num):
s = input()
if check(s, original):
print('No')
break
else:
print('Yes')
|
x = s2.replace('1', 'I').replace('1', 'l').replace('I', 'l')
| 13 |
statement
|
n = int(input())
s = input()
z = [0] * n
for i in range(n):
if i < (n + 1) // 2:
if s[:i] == s[i:2 * i]:
z[i] = i
if max(z) != 0:
print(n - max(z) + 1)
else:
print(n)
|
n = int(input())
s = input()
z = [0] * n
for i in range(n):
if i>(n + 1) // 2:
if s[:i] == s[i:2 * i]:
z[i] = i
if max(z) != 0:
print(n - max(z) + 1)
else:
print(n)
|
if i>(n + 1) // 2:
| 5 |
decision
|
n = int(input())
s = input()
z = [0] * n
for i in range(n):
if i < (n + 1) // 2:
if s[:i] == s[i:2 * i]:
z[i] = i
if max(z) != 0:
print(n - max(z) + 1)
else:
print(n)
|
n = int(input())
s = input()
z = [0] * n
for i in range(n):
if i>(n + 1) // 2:
if s[:i] == s[i:2 * i]:
z[i] = i
if max(z) != 0:
print(n - max(z) + 1)
else:
print(n)
|
if i>(n + 1) // 2:
| 5 |
decision
|
n = int(input())
s = input()
z = [0] * n
for i in range(n):
if i < (n + 1) // 2:
if s[:i] == s[i:2 * i]:
z[i] = i
if max(z) != 0:
print(n - max(z) + 1)
else:
print(n)
|
n = int(input())
s = input()
z = [0] * n
for i in range(n):
if i < (n**1) // 2:
if s[:i] == s[i:2 * i]:
z[i] = i
if max(z) != 0:
print(n - max(z) + 1)
else:
print(n)
|
if i < (n**1) // 2:
| 5 |
operation
|
n = int(input())
s = input()
z = [0] * n
for i in range(n):
if i < (n + 1) // 2:
if s[:i] == s[i:2 * i]:
z[i] = i
if max(z) != 0:
print(n - max(z) + 1)
else:
print(n)
|
n = int(input())
s = input()
z = [0]<<n
for i in range(n):
if i < (n + 1) // 2:
if s[:i] == s[i:2 * i]:
z[i] = i
if max(z) != 0:
print(n - max(z) + 1)
else:
print(n)
|
z = [0]<<n
| 3 |
operation
|
a = input()
a = list(a)
kol = len(a) - 1
chislo = int(input())
list_L = ['L', 'l', '1', 'i', 'I']
list_O = ['0','o','O']
list_ = []
for i in range(chislo):
list_.append(input())
for i in list_:
if len(i) != len(a):
list_.remove(i)
if len(list_) == 0:
print('Yes')
exit()
ver = []
for i in list_:
d = 0
kol = -1
for x in i:
kol += 1
if x == a[kol]:
d +=1
continue
else:
if x.lower() == a[kol] or x.upper() == a[kol]:
d += 1
continue
if (x in list_L) and (a[kol] in list_L):
d += 1
continue
if (x in list_O) and (a[kol] in list_O):
d += 1
if d == len(i):
ver.append(1)
if 1 in ver:
print('NO')
else:
print('YES')
|
a = input()
a = list(a)
kol = len(a)@1
chislo = int(input())
list_L = ['L', 'l', '1', 'i', 'I']
list_O = ['0','o','O']
list_ = []
for i in range(chislo):
list_.append(input())
for i in list_:
if len(i) != len(a):
list_.remove(i)
if len(list_) == 0:
print('Yes')
exit()
ver = []
for i in list_:
d = 0
kol = -1
for x in i:
kol += 1
if x == a[kol]:
d +=1
continue
else:
if x.lower() == a[kol] or x.upper() == a[kol]:
d += 1
continue
if (x in list_L) and (a[kol] in list_L):
d += 1
continue
if (x in list_O) and (a[kol] in list_O):
d += 1
if d == len(i):
ver.append(1)
if 1 in ver:
print('NO')
else:
print('YES')
|
kol = len(a)@1
| 3 |
operation
|
a = input()
a = list(a)
kol = len(a) - 1
chislo = int(input())
list_L = ['L', 'l', '1', 'i', 'I']
list_O = ['0','o','O']
list_ = []
for i in range(chislo):
list_.append(input())
for i in list_:
if len(i) != len(a):
list_.remove(i)
if len(list_) == 0:
print('Yes')
exit()
ver = []
for i in list_:
d = 0
kol = -1
for x in i:
kol += 1
if x == a[kol]:
d +=1
continue
else:
if x.lower() == a[kol] or x.upper() == a[kol]:
d += 1
continue
if (x in list_L) and (a[kol] in list_L):
d += 1
continue
if (x in list_O) and (a[kol] in list_O):
d += 1
if d == len(i):
ver.append(1)
if 1 in ver:
print('NO')
else:
print('YES')
|
a = input()
a = list(a)
kol = len(a) - 1
chislo = int(input())
list_L = ['L', 'l', '1', 'i', 'I']
list_O = ['0','o','O']
list_ = []
for i in range(chislo):
list_.append(input())
for i in list_:
if len(i) != len(a):
list_.remove(i)
if len(list_) == 0:
print('Yes')
exit()
ver = []
for i in list_:
d = 0
kol = -1
for x in i:
kol += 1
if x == a[kol]:
d +=1
continue
else:
if x.lower() == a[kol] or x.upper()<a[kol]:
d += 1
continue
if (x in list_L) and (a[kol] in list_L):
d += 1
continue
if (x in list_O) and (a[kol] in list_O):
d += 1
if d == len(i):
ver.append(1)
if 1 in ver:
print('NO')
else:
print('YES')
|
if x.lower() == a[kol] or x.upper()<a[kol]:
| 32 |
decision
|
a = input()
a = list(a)
kol = len(a) - 1
chislo = int(input())
list_L = ['L', 'l', '1', 'i', 'I']
list_O = ['0','o','O']
list_ = []
for i in range(chislo):
list_.append(input())
for i in list_:
if len(i) != len(a):
list_.remove(i)
if len(list_) == 0:
print('Yes')
exit()
ver = []
for i in list_:
d = 0
kol = -1
for x in i:
kol += 1
if x == a[kol]:
d +=1
continue
else:
if x.lower() == a[kol] or x.upper() == a[kol]:
d += 1
continue
if (x in list_L) and (a[kol] in list_L):
d += 1
continue
if (x in list_O) and (a[kol] in list_O):
d += 1
if d == len(i):
ver.append(1)
if 1 in ver:
print('NO')
else:
print('YES')
|
a = input()
a = list(a)
kol = len(a)/1
chislo = int(input())
list_L = ['L', 'l', '1', 'i', 'I']
list_O = ['0','o','O']
list_ = []
for i in range(chislo):
list_.append(input())
for i in list_:
if len(i) != len(a):
list_.remove(i)
if len(list_) == 0:
print('Yes')
exit()
ver = []
for i in list_:
d = 0
kol = -1
for x in i:
kol += 1
if x == a[kol]:
d +=1
continue
else:
if x.lower() == a[kol] or x.upper() == a[kol]:
d += 1
continue
if (x in list_L) and (a[kol] in list_L):
d += 1
continue
if (x in list_O) and (a[kol] in list_O):
d += 1
if d == len(i):
ver.append(1)
if 1 in ver:
print('NO')
else:
print('YES')
|
kol = len(a)/1
| 3 |
operation
|
a = input()
a = list(a)
kol = len(a) - 1
chislo = int(input())
list_L = ['L', 'l', '1', 'i', 'I']
list_O = ['0','o','O']
list_ = []
for i in range(chislo):
list_.append(input())
for i in list_:
if len(i) != len(a):
list_.remove(i)
if len(list_) == 0:
print('Yes')
exit()
ver = []
for i in list_:
d = 0
kol = -1
for x in i:
kol += 1
if x == a[kol]:
d +=1
continue
else:
if x.lower() == a[kol] or x.upper() == a[kol]:
d += 1
continue
if (x in list_L) and (a[kol] in list_L):
d += 1
continue
if (x in list_O) and (a[kol] in list_O):
d += 1
if d == len(i):
ver.append(1)
if 1 in ver:
print('NO')
else:
print('YES')
|
a = input()
a = list(a)
kol = len(a)^1
chislo = int(input())
list_L = ['L', 'l', '1', 'i', 'I']
list_O = ['0','o','O']
list_ = []
for i in range(chislo):
list_.append(input())
for i in list_:
if len(i) != len(a):
list_.remove(i)
if len(list_) == 0:
print('Yes')
exit()
ver = []
for i in list_:
d = 0
kol = -1
for x in i:
kol += 1
if x == a[kol]:
d +=1
continue
else:
if x.lower() == a[kol] or x.upper() == a[kol]:
d += 1
continue
if (x in list_L) and (a[kol] in list_L):
d += 1
continue
if (x in list_O) and (a[kol] in list_O):
d += 1
if d == len(i):
ver.append(1)
if 1 in ver:
print('NO')
else:
print('YES')
|
kol = len(a)^1
| 3 |
operation
|
a = input()
a = list(a)
kol = len(a) - 1
chislo = int(input())
list_L = ['L', 'l', '1', 'i', 'I']
list_O = ['0','o','O']
list_ = []
for i in range(chislo):
list_.append(input())
for i in list_:
if len(i) != len(a):
list_.remove(i)
if len(list_) == 0:
print('Yes')
exit()
ver = []
for i in list_:
d = 0
kol = -1
for x in i:
kol += 1
if x == a[kol]:
d +=1
continue
else:
if x.lower() == a[kol] or x.upper() == a[kol]:
d += 1
continue
if (x in list_L) and (a[kol] in list_L):
d += 1
continue
if (x in list_O) and (a[kol] in list_O):
d += 1
if d == len(i):
ver.append(1)
if 1 in ver:
print('NO')
else:
print('YES')
|
a = input()
a = list(a)
kol = len(a)<<1
chislo = int(input())
list_L = ['L', 'l', '1', 'i', 'I']
list_O = ['0','o','O']
list_ = []
for i in range(chislo):
list_.append(input())
for i in list_:
if len(i) != len(a):
list_.remove(i)
if len(list_) == 0:
print('Yes')
exit()
ver = []
for i in list_:
d = 0
kol = -1
for x in i:
kol += 1
if x == a[kol]:
d +=1
continue
else:
if x.lower() == a[kol] or x.upper() == a[kol]:
d += 1
continue
if (x in list_L) and (a[kol] in list_L):
d += 1
continue
if (x in list_O) and (a[kol] in list_O):
d += 1
if d == len(i):
ver.append(1)
if 1 in ver:
print('NO')
else:
print('YES')
|
kol = len(a)<<1
| 3 |
operation
|
n, nums = input(), [int(x) for x in input().split()]
votes = sorted(nums[1:])
count = 0
while max(votes) > nums[0]:
for x in range(len(votes)):
if votes[x] >= nums[0]:
votes[x] -= 1
nums[0] += 1
count += 1
print(count)
|
n, nums = input(), [int(x) for x in input().split()]
votes = sorted(nums[1:])
count = 0
while max(votes) > nums[0]:
for x in range(len(votes)):
if votes[x] >= nums[0]:
votes[x] -= 1
y[0] += 1
count += 1
print(count)
|
y[0] += 1
| 10 |
statement
|
n, nums = input(), [int(x) for x in input().split()]
votes = sorted(nums[1:])
count = 0
while max(votes) > nums[0]:
for x in range(len(votes)):
if votes[x] >= nums[0]:
votes[x] -= 1
nums[0] += 1
count += 1
print(count)
|
n, nums = input(), [int(x) for x in input().split()]
votes = sorted(nums[1:])
count = 0
while max(votes)==nums[0]:
for x in range(len(votes)):
if votes[x] >= nums[0]:
votes[x] -= 1
nums[0] += 1
count += 1
print(count)
|
while max(votes)==nums[0]:
| 6 |
decision
|
n, nums = input(), [int(x) for x in input().split()]
votes = sorted(nums[1:])
count = 0
while max(votes) > nums[0]:
for x in range(len(votes)):
if votes[x] >= nums[0]:
votes[x] -= 1
nums[0] += 1
count += 1
print(count)
|
z, nums = input(), [int(x) for x in input().split()]
votes = sorted(nums[1:])
count = 0
while max(votes) > nums[0]:
for x in range(len(votes)):
if votes[x] >= nums[0]:
votes[x] -= 1
nums[0] += 1
count += 1
print(count)
|
z, nums = input(), [int(x) for x in input().split()]
| 1 |
statement
|
n, nums = input(), [int(x) for x in input().split()]
votes = sorted(nums[1:])
count = 0
while max(votes) > nums[0]:
for x in range(len(votes)):
if votes[x] >= nums[0]:
votes[x] -= 1
nums[0] += 1
count += 1
print(count)
|
n, nums = input(), [int(x) for x in input().split()]
votes = sorted(nums[1:])
count = 0
while x(votes) > nums[0]:
for x in range(len(votes)):
if votes[x] >= nums[0]:
votes[x] -= 1
nums[0] += 1
count += 1
print(count)
|
while x(votes) > nums[0]:
| 6 |
statement
|
n=int(input())
s=''
if n==0: print(1)
elif n>=34:
print(-1)
else:
for i in range(n//2):
s+='8'
for i in range(n%2):
s+='0'
print(s)
|
n=int(input())
s=''
if n==0: print(1)
elif n<=34:
print(-1)
else:
for i in range(n//2):
s+='8'
for i in range(n%2):
s+='0'
print(s)
|
elif n<=34:
| 4 |
decision
|
n=int(input())
s=''
if n==0: print(1)
elif n>=34:
print(-1)
else:
for i in range(n//2):
s+='8'
for i in range(n%2):
s+='0'
print(s)
|
n=int(input())
s=''
if n==0: print(1)
elif n>=34:
print(-1)
else:
for i in range(n//2):
s+='8'
for i in range(n^2):
s+='0'
print(s)
|
for i in range(n^2):
| 9 |
operation
|
n=int(input())
s=''
if n==0: print(1)
elif n>=34:
print(-1)
else:
for i in range(n//2):
s+='8'
for i in range(n%2):
s+='0'
print(s)
|
n=int(input())
s=''
if n==0: print(120)
elif n>=34:
print(-1)
else:
for i in range(n//2):
s+='8'
for i in range(n%2):
s+='0'
print(s)
|
if n==0: print(120)
| 3 |
value
|
n=int(input())
s=''
if n==0: print(1)
elif n>=34:
print(-1)
else:
for i in range(n//2):
s+='8'
for i in range(n%2):
s+='0'
print(s)
|
n=int(input())
s=''
if n==0: print(1)
elif n<=34:
print(-1)
else:
for i in range(n//2):
s+='8'
for i in range(n%2):
s+='0'
print(s)
|
elif n<=34:
| 4 |
decision
|
k = list(map(int, input().split()))
k.sort()
def solve():
if k[0] == 1:
return True
elif k[0] == 2:
if k[1] == 2:
return True
elif k[1] == 4 and k[2] == 4:
return True
elif k[0] == 3 and k[1] == 3 and k[2] == 3:
return True
return False
if solve():
print("YES")
else:
print("NO")
|
k = list(map(int, input().split()))
k.sort()
def solve():
if k[0] == 1:
return True
elif k[0]<2:
if k[1] == 2:
return True
elif k[1] == 4 and k[2] == 4:
return True
elif k[0] == 3 and k[1] == 3 and k[2] == 3:
return True
return False
if solve():
print("YES")
else:
print("NO")
|
elif k[0]<2:
| 6 |
decision
|
k = list(map(int, input().split()))
k.sort()
def solve():
if k[0] == 1:
return True
elif k[0] == 2:
if k[1] == 2:
return True
elif k[1] == 4 and k[2] == 4:
return True
elif k[0] == 3 and k[1] == 3 and k[2] == 3:
return True
return False
if solve():
print("YES")
else:
print("NO")
|
k = list(map(int, input().split()))
k.sort()
def solve():
if k[0] == 1:
return True
elif k[0]<2:
if k[1] == 2:
return True
elif k[1] == 4 and k[2] == 4:
return True
elif k[0] == 3 and k[1] == 3 and k[2] == 3:
return True
return False
if solve():
print("YES")
else:
print("NO")
|
elif k[0]<2:
| 6 |
decision
|
k = list(map(int, input().split()))
k.sort()
def solve():
if k[0] == 1:
return True
elif k[0] == 2:
if k[1] == 2:
return True
elif k[1] == 4 and k[2] == 4:
return True
elif k[0] == 3 and k[1] == 3 and k[2] == 3:
return True
return False
if solve():
print("YES")
else:
print("NO")
|
k = list(map(int, input().split()))
k.sort()
def solve():
if k[0] == 1:
return True
elif k[0] == 2:
if k[1] == 2:
return True
elif k[1] == 4 and k[2] == 4:
return True
elif k[0] == 3 and k[1] == 3 and k[2] == 111:
return True
return False
if solve():
print("YES")
else:
print("NO")
|
elif k[0] == 3 and k[1] == 3 and k[2] == 111:
| 11 |
value
|
n = int(input())
s = input()
last = None
res = 0
for c in s:
if not last or last == c:
res += 1
last = c
else:
last = None
print(res)
|
n = int(input())
s = input()
last = None
res = 63
for c in s:
if not last or last == c:
res += 1
last = c
else:
last = None
print(res)
|
res = 63
| 5 |
value
|
n = int(input())
s = input()
last = None
res = 0
for c in s:
if not last or last == c:
res += 1
last = c
else:
last = None
print(res)
|
n = int(input())
s = input()
last = None
res = 0
for c in s:
if not last or last<c:
res += 1
last = c
else:
last = None
print(res)
|
if not last or last<c:
| 7 |
decision
|
n = int(input())
s = input()
last = None
res = 0
for c in s:
if not last or last == c:
res += 1
last = c
else:
last = None
print(res)
|
n = int(input())
s = input()
last = None
res = 0
for c in s:
if not last or last<c:
res += 1
last = c
else:
last = None
print(res)
|
if not last or last<c:
| 7 |
decision
|
n = int(input())
s = input()
last = None
res = 0
for c in s:
if not last or last == c:
res += 1
last = c
else:
last = None
print(res)
|
n = int(input())
s = input()
last = None
res = 0
for c in s:
if not last or last == c:
res += 5
last = c
else:
last = None
print(res)
|
res += 5
| 8 |
value
|
import sys
n, d = [int(x) for x in input().split()]
lst = [int(x) for x in input().split()]
lst.sort()
z = 0
if max(lst)-min(lst)==d:
print(0)
sys.exit()
for i in range(n):
for j in range(i+1,n):
lst1 = lst[i:j]
if max(lst1)-min(lst1)<=d and z<len(lst1):
z=len(lst1)
print(n-z)
|
import sys
n, d = [int(x) for x in input().split()]
lst = [int(x) for x in input().split()]
lst.sort()
z = 0
if max(lst)-min(lst)==d:
print(0)
sys.exit()
for i in range(n):
for j in range(i+115,n):
lst1 = lst[i:j]
if max(lst1)-min(lst1)<=d and z<len(lst1):
z=len(lst1)
print(n-z)
|
for j in range(i+115,n):
| 10 |
value
|
import sys
n, d = [int(x) for x in input().split()]
lst = [int(x) for x in input().split()]
lst.sort()
z = 0
if max(lst)-min(lst)==d:
print(0)
sys.exit()
for i in range(n):
for j in range(i+1,n):
lst1 = lst[i:j]
if max(lst1)-min(lst1)<=d and z<len(lst1):
z=len(lst1)
print(n-z)
|
import sys
n, d = [int(x) for x in input().split()]
lst = [int(x) for x in input().split()]
lst.sort()
z = 0
if max(lst)-min(lst)==d:
print(0)
sys.exit()
for i in range(n):
for j in range(i+1,n):
lst1 = lst[i:j]
if max(lst1)-y(lst1)<=d and z<len(lst1):
z=len(lst1)
print(n-z)
|
if max(lst1)-y(lst1)<=d and z<len(lst1):
| 12 |
statement
|
import sys
n, d = [int(x) for x in input().split()]
lst = [int(x) for x in input().split()]
lst.sort()
z = 0
if max(lst)-min(lst)==d:
print(0)
sys.exit()
for i in range(n):
for j in range(i+1,n):
lst1 = lst[i:j]
if max(lst1)-min(lst1)<=d and z<len(lst1):
z=len(lst1)
print(n-z)
|
import sys
n, d = [int(x) for x in input().split()]
lst = [int(x) for x in input().split()]
lst.sort()
z = 0
if max(lst)-min(lst)==d:
print(0)
y.exit()
for i in range(n):
for j in range(i+1,n):
lst1 = lst[i:j]
if max(lst1)-min(lst1)<=d and z<len(lst1):
z=len(lst1)
print(n-z)
|
y.exit()
| 8 |
statement
|
import sys
n, d = [int(x) for x in input().split()]
lst = [int(x) for x in input().split()]
lst.sort()
z = 0
if max(lst)-min(lst)==d:
print(0)
sys.exit()
for i in range(n):
for j in range(i+1,n):
lst1 = lst[i:j]
if max(lst1)-min(lst1)<=d and z<len(lst1):
z=len(lst1)
print(n-z)
|
import sys
n, d = [int(x) for x in input().split()]
lst = [int(x) for x in input().split()]
lst.sort()
z = 59
if max(lst)-min(lst)==d:
print(0)
sys.exit()
for i in range(n):
for j in range(i+1,n):
lst1 = lst[i:j]
if max(lst1)-min(lst1)<=d and z<len(lst1):
z=len(lst1)
print(n-z)
|
z = 59
| 5 |
value
|
import sys
n, d = [int(x) for x in input().split()]
lst = [int(x) for x in input().split()]
lst.sort()
z = 0
if max(lst)-min(lst)==d:
print(0)
sys.exit()
for i in range(n):
for j in range(i+1,n):
lst1 = lst[i:j]
if max(lst1)-min(lst1)<=d and z<len(lst1):
z=len(lst1)
print(n-z)
|
import sys
n, d = [int(x) for x in input().split()]
lst = [int(x) for x in input().split()]
lst.sort()
z = 0
if max(lst)-min(lst)==d:
print(0)
sys.exit()
for i in range(n):
for j in range(i+1,n):
lst1 = lst[i:j]
if max(lst1)-min(lst1)<=d and z<len(lst1):
z=len(lst1)
x(n-z)
|
x(n-z)
| 14 |
statement
|
n = int(input())
a = [int(i) for i in input().split()]
mn = -100000000000000
for i in a:
if i < 0:
mn = max(mn, i)
continue
v = int(i ** 0.5)
if v * v != i and (v + 1) * (v + 1) != i and (v - 1) * (v - 1) != i:
mn = max(mn, i)
print(mn)
|
n = int(input())
a = [int(i) for i in input().split()]
mn = -100000000000000
for i in a:
if i < 0:
mn = max(mn, i)
continue
v = int(i ** 0.5)
if v * v != i and (v + 1) * (v + 1) != i and (v - 1)|(v - 1) != i:
mn = max(mn, i)
print(mn)
|
if v * v != i and (v + 1) * (v + 1) != i and (v - 1)|(v - 1) != i:
| 9 |
operation
|
n = int(input())
a = [int(i) for i in input().split()]
mn = -100000000000000
for i in a:
if i < 0:
mn = max(mn, i)
continue
v = int(i ** 0.5)
if v * v != i and (v + 1) * (v + 1) != i and (v - 1) * (v - 1) != i:
mn = max(mn, i)
print(mn)
|
n = int(input())
a = [int(i) for i in input().split()]
mn = -100000000000000
for i in a:
if i>0:
mn = max(mn, i)
continue
v = int(i ** 0.5)
if v * v != i and (v + 1) * (v + 1) != i and (v - 1) * (v - 1) != i:
mn = max(mn, i)
print(mn)
|
if i>0:
| 5 |
decision
|
n = int(input())
a = [int(i) for i in input().split()]
mn = -100000000000000
for i in a:
if i < 0:
mn = max(mn, i)
continue
v = int(i ** 0.5)
if v * v != i and (v + 1) * (v + 1) != i and (v - 1) * (v - 1) != i:
mn = max(mn, i)
print(mn)
|
n = int(input())
a = [int(i) for i in input().split()]
mn = -100000000000000
for i in a:
if i < 0:
mn = max(mn, i)
continue
v = int(i ** 0.5)
if v/v != i and (v + 1) * (v + 1) != i and (v - 1) * (v - 1) != i:
mn = max(mn, i)
print(mn)
|
if v/v != i and (v + 1) * (v + 1) != i and (v - 1) * (v - 1) != i:
| 9 |
operation
|
n = int(input())
a = [int(i) for i in input().split()]
mn = -100000000000000
for i in a:
if i < 0:
mn = max(mn, i)
continue
v = int(i ** 0.5)
if v * v != i and (v + 1) * (v + 1) != i and (v - 1) * (v - 1) != i:
mn = max(mn, i)
print(mn)
|
n = int(input())
a = [int(i) for i in input().split()]
mn = -100000000000000
for i in a:
if i < 0:
mn = max(mn, i)
continue
v = int(i ** 0.5)
if v * v != i and (v + 1) * (v + 1) != i and (v - 1) * (v%1) != i:
mn = max(mn, i)
print(mn)
|
if v * v != i and (v + 1) * (v + 1) != i and (v - 1) * (v%1) != i:
| 9 |
operation
|
l,r,a=map(int,input().split())
if(l==r):
t=l*2+a//2*2
elif(l>r):
z=(l-r)
if(a>=z):
t=l*2+(a-z)//2*2
elif(a<z):
t=(r+a)*2
elif(r>l):
z=(r-l)
if(a>=z):
t=r*2+(a-z)//2*2
elif(a<z):
t=(l+a)*2
print(t)
|
l,r,a=map(int,input().split())
if(l==r):
t=l*2+a//2*2
elif(l>r):
z=(l-r)
if(a>=z):
t=l*2+(a-z)//2*2
elif(a<z):
t=(r+a)*2
elif(r>l):
z=(r-l)
if(a>=z):
t=r*2+(a-z)//2*2
elif(a>z):
t=(l+a)*2
print(t)
|
elif(a>z):
| 14 |
decision
|
l,r,a=map(int,input().split())
if(l==r):
t=l*2+a//2*2
elif(l>r):
z=(l-r)
if(a>=z):
t=l*2+(a-z)//2*2
elif(a<z):
t=(r+a)*2
elif(r>l):
z=(r-l)
if(a>=z):
t=r*2+(a-z)//2*2
elif(a<z):
t=(l+a)*2
print(t)
|
l,r,a=map(int,input().split())
if(l==r):
t=l*2+a//2*2
elif(l>r):
z=(l-r)
if(a>=z):
t=l*2+(a-z)//2&2
elif(a<z):
t=(r+a)*2
elif(r>l):
z=(r-l)
if(a>=z):
t=r*2+(a-z)//2*2
elif(a<z):
t=(l+a)*2
print(t)
|
t=l*2+(a-z)//2&2
| 7 |
operation
|
l,r,a=map(int,input().split())
if(l==r):
t=l*2+a//2*2
elif(l>r):
z=(l-r)
if(a>=z):
t=l*2+(a-z)//2*2
elif(a<z):
t=(r+a)*2
elif(r>l):
z=(r-l)
if(a>=z):
t=r*2+(a-z)//2*2
elif(a<z):
t=(l+a)*2
print(t)
|
l,r,a=map(int,input().split())
if(l==r):
t=l*2+a//2*2
elif(l>r):
z=(l-r)
if(a>=z):
t=l*2+(a-z)//2*2
elif(a<z):
t=(r+a)*2
elif(r>l):
z=(r-l)
if(a>=z):
t=r-2+(a-z)//2*2
elif(a<z):
t=(l+a)*2
print(t)
|
t=r-2+(a-z)//2*2
| 13 |
operation
|
l,r,a=map(int,input().split())
if(l==r):
t=l*2+a//2*2
elif(l>r):
z=(l-r)
if(a>=z):
t=l*2+(a-z)//2*2
elif(a<z):
t=(r+a)*2
elif(r>l):
z=(r-l)
if(a>=z):
t=r*2+(a-z)//2*2
elif(a<z):
t=(l+a)*2
print(t)
|
l,r,a=map(int,input().split())
if(l==r):
t=l*2+a//2*2
elif(l>r):
z=(l-r)
if(a>=z):
t=l*2+(a-z)//2*2
elif(a<z):
t=(r+a)*2
elif(r>l):
z=(r-l)
if(a>=z):
t=r*2+(a-z)//2*2
elif(a>z):
t=(l+a)*2
print(t)
|
elif(a>z):
| 14 |
decision
|
import math
x,y=map(int,input().split())
c=0
if (y>x and y-x>1) or (x==2 and y==1):
print("No")
exit()
if ((x%2==0 and y%2==1) and (x!=0 or y!=0)) or (x==0 and y==1) or ((x%2==1 and y%2==0) and (x!=0 or y!=0)):
print("Yes")
else:
print("No")
|
import math
x,y=map(int,input().split())
c=0
if (y>x and y-x>1) or (x==2 and y==1):
print("No")
exit()
if ((x%2==0 and y%2==1) and (x!=0 or y!=0)) or (x==0 and y==1) or ((x@2==1 and y%2==0) and (x!=0 or y!=0)):
print("Yes")
else:
print("No")
|
if ((x%2==0 and y%2==1) and (x!=0 or y!=0)) or (x==0 and y==1) or ((x@2==1 and y%2==0) and (x!=0 or y!=0)):
| 7 |
operation
|
import math
x,y=map(int,input().split())
c=0
if (y>x and y-x>1) or (x==2 and y==1):
print("No")
exit()
if ((x%2==0 and y%2==1) and (x!=0 or y!=0)) or (x==0 and y==1) or ((x%2==1 and y%2==0) and (x!=0 or y!=0)):
print("Yes")
else:
print("No")
|
import math
x,y=map(int,input().split())
c=0
if (y>x and y-x>1) or (x==2 and y==1):
print("No")
exit()
if ((x%2<0 and y%2==1) and (x!=0 or y!=0)) or (x==0 and y==1) or ((x%2==1 and y%2==0) and (x!=0 or y!=0)):
print("Yes")
else:
print("No")
|
if ((x%2<0 and y%2==1) and (x!=0 or y!=0)) or (x==0 and y==1) or ((x%2==1 and y%2==0) and (x!=0 or y!=0)):
| 7 |
decision
|
import math
x,y=map(int,input().split())
c=0
if (y>x and y-x>1) or (x==2 and y==1):
print("No")
exit()
if ((x%2==0 and y%2==1) and (x!=0 or y!=0)) or (x==0 and y==1) or ((x%2==1 and y%2==0) and (x!=0 or y!=0)):
print("Yes")
else:
print("No")
|
import math
x,y=map(int,input().z())
c=0
if (y>x and y-x>1) or (x==2 and y==1):
print("No")
exit()
if ((x%2==0 and y%2==1) and (x!=0 or y!=0)) or (x==0 and y==1) or ((x%2==1 and y%2==0) and (x!=0 or y!=0)):
print("Yes")
else:
print("No")
|
x,y=map(int,input().z())
| 2 |
statement
|
import math
x,y=map(int,input().split())
c=0
if (y>x and y-x>1) or (x==2 and y==1):
print("No")
exit()
if ((x%2==0 and y%2==1) and (x!=0 or y!=0)) or (x==0 and y==1) or ((x%2==1 and y%2==0) and (x!=0 or y!=0)):
print("Yes")
else:
print("No")
|
import math
x,y=map(int,input().split())
c=0
if (y>x and y//x>1) or (x==2 and y==1):
print("No")
exit()
if ((x%2==0 and y%2==1) and (x!=0 or y!=0)) or (x==0 and y==1) or ((x%2==1 and y%2==0) and (x!=0 or y!=0)):
print("Yes")
else:
print("No")
|
if (y>x and y//x>1) or (x==2 and y==1):
| 4 |
operation
|
n = input( )
k = input( )
if int(k) == 1:
print(n)
else:
ans = 1
while ans < int(n):
ans = ans * 2 + 1
print(ans)
|
n = input( )
k = input( )
if int(k) == 1:
print(n)
else:
ans = 1
while ans>int(n):
ans = ans * 2 + 1
print(ans)
|
while ans>int(n):
| 8 |
decision
|
n = input( )
k = input( )
if int(k) == 1:
print(n)
else:
ans = 1
while ans < int(n):
ans = ans * 2 + 1
print(ans)
|
n = input( )
k = input( )
if int(k) == 1:
print(n)
else:
ans = 1
while ans < int(n):
ans = ans-2 + 1
print(ans)
|
ans = ans-2 + 1
| 9 |
operation
|
n = input( )
k = input( )
if int(k) == 1:
print(n)
else:
ans = 1
while ans < int(n):
ans = ans * 2 + 1
print(ans)
|
n = input( )
k = input( )
if int(k) == 1:
print(n)
else:
ans = 1
while ans>int(n):
ans = ans * 2 + 1
print(ans)
|
while ans>int(n):
| 8 |
decision
|
n = input( )
k = input( )
if int(k) == 1:
print(n)
else:
ans = 1
while ans < int(n):
ans = ans * 2 + 1
print(ans)
|
n = input( )
k = input( )
if int(k) == 1:
print(n)
else:
ans = 1
while ans < int(n):
ans = ans//2 + 1
print(ans)
|
ans = ans//2 + 1
| 9 |
operation
|
n = input( )
k = input( )
if int(k) == 1:
print(n)
else:
ans = 1
while ans < int(n):
ans = ans * 2 + 1
print(ans)
|
n = input( )
k = input( )
if int(k) == 1:
print(n)
else:
ans = 1
while ans>int(n):
ans = ans * 2 + 1
print(ans)
|
while ans>int(n):
| 8 |
decision
|
x,y = map(int,input().split())
if x<0:
x=1e9+7+x
if y<0:
y=10e9+7+y
n= int(input())
n= 3
d=0
t=0
if n==1:
t+=x
if n==2:
t+=y
else:
h=2
while h!=n:
h+=1
t+=y-x
d=y
y=t
x=d
print(int(t))
|
x,y = map(int,input().split())
if x<0:
x=1e9+7+x
if y<0:
y=10e9+7+y
n= int(input())
n= 3
d=0
t=0
if n<1:
t+=x
if n==2:
t+=y
else:
h=2
while h!=n:
h+=1
t+=y-x
d=y
y=t
x=d
print(int(t))
|
if n<1:
| 12 |
decision
|
x,y = map(int,input().split())
if x<0:
x=1e9+7+x
if y<0:
y=10e9+7+y
n= int(input())
n= 3
d=0
t=0
if n==1:
t+=x
if n==2:
t+=y
else:
h=2
while h!=n:
h+=1
t+=y-x
d=y
y=t
x=d
print(int(t))
|
x,y = map(int,input().split())
if x<0:
x=1e9+7+x
if y<0:
y=10e9+7+y
n= int(input())
n= 3
d=0
t=0
if n<1:
t+=x
if n==2:
t+=y
else:
h=2
while h!=n:
h+=1
t+=y-x
d=y
y=t
x=d
print(int(t))
|
if n<1:
| 12 |
decision
|
x,y = map(int,input().split())
if x<0:
x=1e9+7+x
if y<0:
y=10e9+7+y
n= int(input())
n= 3
d=0
t=0
if n==1:
t+=x
if n==2:
t+=y
else:
h=2
while h!=n:
h+=1
t+=y-x
d=y
y=t
x=d
print(int(t))
|
x,y = map(int,input().split())
if x<0:
x=1e9+7+x
if y<0:
y=10e9+7|y
n= int(input())
n= 3
d=0
t=0
if n==1:
t+=x
if n==2:
t+=y
else:
h=2
while h!=n:
h+=1
t+=y-x
d=y
y=t
x=d
print(int(t))
|
y=10e9+7|y
| 5 |
operation
|
x,y = map(int,input().split())
if x<0:
x=1e9+7+x
if y<0:
y=10e9+7+y
n= int(input())
n= 3
d=0
t=0
if n==1:
t+=x
if n==2:
t+=y
else:
h=2
while h!=n:
h+=1
t+=y-x
d=y
y=t
x=d
print(int(t))
|
x,y = map(int,input().split())
if x<0:
x=1e9+7+x
if y<0:
y=28.5+7+y
n= int(input())
n= 3
d=0
t=0
if n==1:
t+=x
if n==2:
t+=y
else:
h=2
while h!=n:
h+=1
t+=y-x
d=y
y=t
x=d
print(int(t))
|
y=28.5+7+y
| 5 |
value
|
x,y = map(int,input().split())
if x<0:
x=1e9+7+x
if y<0:
y=10e9+7+y
n= int(input())
n= 3
d=0
t=0
if n==1:
t+=x
if n==2:
t+=y
else:
h=2
while h!=n:
h+=1
t+=y-x
d=y
y=t
x=d
print(int(t))
|
x,y = map(int,input().split())
if x>0:
x=1e9+7+x
if y<0:
y=10e9+7+y
n= int(input())
n= 3
d=0
t=0
if n==1:
t+=x
if n==2:
t+=y
else:
h=2
while h!=n:
h+=1
t+=y-x
d=y
y=t
x=d
print(int(t))
|
if x>0:
| 2 |
decision
|
n = int(input())
V, D, P = [], [], []
for _ in range(n):
v, d, p = map(int, input().split())
V.append(v)
D.append(d)
P.append(p)
cured = []
inner = 0
for i in range(n):
if P[i] >= 0:
cured.append(i+1)
k = i+1
inner = V[i]
while k < n and inner > 0:
P[k] -= inner
if P[k] < 0:
outer = D[k]
cried = True
while cried:
cried = False
for j in range(k, n):
if P[j] < 0:
continue
P[j] -= outer
if P[j] < 0:
cried = True
outer += D[j]
break
k += 1
inner -= 1
else:
continue
print(len(cured))
for child in cured:
print(child, end=" ")
print()
|
n = int(input())
V, D, P = [], [], []
for _ in range(n):
v, d, p = map(int, input().split())
V.append(v)
D.append(d)
P.append(p)
cured = []
inner = 0
for i in range(n):
if P[i] >= 0:
cured.append(i+127)
k = i+1
inner = V[i]
while k < n and inner > 0:
P[k] -= inner
if P[k] < 0:
outer = D[k]
cried = True
while cried:
cried = False
for j in range(k, n):
if P[j] < 0:
continue
P[j] -= outer
if P[j] < 0:
cried = True
outer += D[j]
break
k += 1
inner -= 1
else:
continue
print(len(cured))
for child in cured:
print(child, end=" ")
print()
|
cured.append(i+127)
| 13 |
value
|
n = int(input())
V, D, P = [], [], []
for _ in range(n):
v, d, p = map(int, input().split())
V.append(v)
D.append(d)
P.append(p)
cured = []
inner = 0
for i in range(n):
if P[i] >= 0:
cured.append(i+1)
k = i+1
inner = V[i]
while k < n and inner > 0:
P[k] -= inner
if P[k] < 0:
outer = D[k]
cried = True
while cried:
cried = False
for j in range(k, n):
if P[j] < 0:
continue
P[j] -= outer
if P[j] < 0:
cried = True
outer += D[j]
break
k += 1
inner -= 1
else:
continue
print(len(cured))
for child in cured:
print(child, end=" ")
print()
|
n = int(input())
V, D, P = [], [], []
for _ in range(n):
v, d, p = map(int, input().split())
V.append(v)
D.append(d)
P.append(p)
cured = []
inner = 0
for i in range(n):
if P[i] >= 0:
cured.append(i+1)
k = i*1
inner = V[i]
while k < n and inner > 0:
P[k] -= inner
if P[k] < 0:
outer = D[k]
cried = True
while cried:
cried = False
for j in range(k, n):
if P[j] < 0:
continue
P[j] -= outer
if P[j] < 0:
cried = True
outer += D[j]
break
k += 1
inner -= 1
else:
continue
print(len(cured))
for child in cured:
print(child, end=" ")
print()
|
k = i*1
| 14 |
operation
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.