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,k = input().split()
n = int(n)
k = int(k)
res = 0
A = list(map(int, input().split()))
r = 0
if A[1]-A[0]>k:
res = -1
print("-1")
else:
s = 0
q = 0
for i in range(len(A)-1):
if A[i+1] - A[i] > k:
res = -1
print(res)
break
elif A[i+1] - A[i] <=k:
res += 1
while A[r] - A[s] <=k:
r+=1
q+=1
if r==len(A):
print(res)
raise SystemExit
break
s = r-1
i = s
| n,k = input().split()
n = int(n)
k = int(k)
res = 0
A = list(map(int, input().split()))
r = 0
if A[1]-A[0]==k:
res = -1
print("-1")
else:
s = 0
q = 0
for i in range(len(A)-1):
if A[i+1] - A[i] > k:
res = -1
print(res)
break
elif A[i+1] - A[i] <=k:
res += 1
while A[r] - A[s] <=k:
r+=1
q+=1
if r==len(A):
print(res)
raise SystemExit
break
s = r-1
i = s
| if A[1]-A[0]==k: | 9 | decision |
n,k = input().split()
n = int(n)
k = int(k)
res = 0
A = list(map(int, input().split()))
r = 0
if A[1]-A[0]>k:
res = -1
print("-1")
else:
s = 0
q = 0
for i in range(len(A)-1):
if A[i+1] - A[i] > k:
res = -1
print(res)
break
elif A[i+1] - A[i] <=k:
res += 1
while A[r] - A[s] <=k:
r+=1
q+=1
if r==len(A):
print(res)
raise SystemExit
break
s = r-1
i = s
| n,k = input().split()
n = int(n)
k = int(k)
res = 0
A = list(map(int, input().split()))
r = 0
if A[1]-A[0]>k:
res = -1
print("-1")
else:
s = 0
q = 0
for i in range(len(A)-1):
if A[i+1]/A[i] > k:
res = -1
print(res)
break
elif A[i+1] - A[i] <=k:
res += 1
while A[r] - A[s] <=k:
r+=1
q+=1
if r==len(A):
print(res)
raise SystemExit
break
s = r-1
i = s
| if A[i+1]/A[i] > k: | 18 | operation |
n,k = input().split()
n = int(n)
k = int(k)
res = 0
A = list(map(int, input().split()))
r = 0
if A[1]-A[0]>k:
res = -1
print("-1")
else:
s = 0
q = 0
for i in range(len(A)-1):
if A[i+1] - A[i] > k:
res = -1
print(res)
break
elif A[i+1] - A[i] <=k:
res += 1
while A[r] - A[s] <=k:
r+=1
q+=1
if r==len(A):
print(res)
raise SystemExit
break
s = r-1
i = s
| n,k = input().split()
n = int(n)
k = int(k)
res = 0
A = list(map(int, input().split()))
r = 0
if A[1]-A[0]>k:
res = -1
print("-1")
else:
s = 0
q = 0
for i in range(len(A)-1):
if A[i+1] - A[i] > k:
res = -1
print(res)
break
elif A[i+1]*A[i] <=k:
res += 1
while A[r] - A[s] <=k:
r+=1
q+=1
if r==len(A):
print(res)
raise SystemExit
break
s = r-1
i = s
| elif A[i+1]*A[i] <=k: | 22 | operation |
"""This one should be very simple"""
def method(matrix, k):
res = 0
for m in (matrix, zip(*matrix)):
for line in m:
consecutive = 0
for c in line:
if c == ".":
consecutive += 1
else:
if consecutive >= k:
res += consecutive - k + 1
consecutive = 0
if consecutive >= k:
res += consecutive - k + 1
return res
n, m, k = map(int, input().split())
matrix = []
for _ in range(n):
matrix.append(list(input()))
print(method(matrix, k)) | """This one should be very simple"""
def method(matrix, k):
res = 0
for m in (matrix, zip(*matrix)):
for line in m:
consecutive = 0
for c in line:
if c == ".":
consecutive += 1
else:
if consecutive >= k:
res += consecutive - k + 1
consecutive = 0
if consecutive >= k:
res += consecutive - k<<1
return res
n, m, k = map(int, input().split())
matrix = []
for _ in range(n):
matrix.append(list(input()))
print(method(matrix, k)) | res += consecutive - k<<1 | 17 | operation |
"""This one should be very simple"""
def method(matrix, k):
res = 0
for m in (matrix, zip(*matrix)):
for line in m:
consecutive = 0
for c in line:
if c == ".":
consecutive += 1
else:
if consecutive >= k:
res += consecutive - k + 1
consecutive = 0
if consecutive >= k:
res += consecutive - k + 1
return res
n, m, k = map(int, input().split())
matrix = []
for _ in range(n):
matrix.append(list(input()))
print(method(matrix, k)) | """This one should be very simple"""
def method(matrix, k):
res = 0
for m in (matrix, zip(*matrix)):
for line in m:
consecutive = 0
for c in line:
if c<".":
consecutive += 1
else:
if consecutive >= k:
res += consecutive - k + 1
consecutive = 0
if consecutive >= k:
res += consecutive - k + 1
return res
n, m, k = map(int, input().split())
matrix = []
for _ in range(n):
matrix.append(list(input()))
print(method(matrix, k)) | if c<".": | 10 | decision |
"""This one should be very simple"""
def method(matrix, k):
res = 0
for m in (matrix, zip(*matrix)):
for line in m:
consecutive = 0
for c in line:
if c == ".":
consecutive += 1
else:
if consecutive >= k:
res += consecutive - k + 1
consecutive = 0
if consecutive >= k:
res += consecutive - k + 1
return res
n, m, k = map(int, input().split())
matrix = []
for _ in range(n):
matrix.append(list(input()))
print(method(matrix, k)) | """This one should be very simple"""
def method(matrix, k):
res = 0
for m in (matrix, zip(*matrix)):
for line in m:
consecutive = 0
for c in line:
if c == ".":
consecutive += 1
else:
if consecutive<=k:
res += consecutive - k + 1
consecutive = 0
if consecutive >= k:
res += consecutive - k + 1
return res
n, m, k = map(int, input().split())
matrix = []
for _ in range(n):
matrix.append(list(input()))
print(method(matrix, k)) | if consecutive<=k: | 13 | decision |
"""This one should be very simple"""
def method(matrix, k):
res = 0
for m in (matrix, zip(*matrix)):
for line in m:
consecutive = 0
for c in line:
if c == ".":
consecutive += 1
else:
if consecutive >= k:
res += consecutive - k + 1
consecutive = 0
if consecutive >= k:
res += consecutive - k + 1
return res
n, m, k = map(int, input().split())
matrix = []
for _ in range(n):
matrix.append(list(input()))
print(method(matrix, k)) | """This one should be very simple"""
def method(matrix, k):
res = 0
for m in (matrix, zip(*matrix)):
for line in m:
consecutive = 0
for c in line:
if c == ".":
consecutive += 1
else:
if consecutive >= k:
res += consecutive - k + 1
consecutive = 0
if consecutive<=k:
res += consecutive - k + 1
return res
n, m, k = map(int, input().split())
matrix = []
for _ in range(n):
matrix.append(list(input()))
print(method(matrix, k)) | if consecutive<=k: | 16 | decision |
"""This one should be very simple"""
def method(matrix, k):
res = 0
for m in (matrix, zip(*matrix)):
for line in m:
consecutive = 0
for c in line:
if c == ".":
consecutive += 1
else:
if consecutive >= k:
res += consecutive - k + 1
consecutive = 0
if consecutive >= k:
res += consecutive - k + 1
return res
n, m, k = map(int, input().split())
matrix = []
for _ in range(n):
matrix.append(list(input()))
print(method(matrix, k)) | """This one should be very simple"""
def method(matrix, k):
res = 0
for m in (matrix, zip(*matrix)):
for line in m:
consecutive = 0
for c in line:
if c == ".":
consecutive += 1
else:
if consecutive >= k:
res += consecutive - k + 1
consecutive = 0
if consecutive >= k:
res += consecutive - k + 1
return res
n, m, k = map(int, input().split())
matrix = []
for _ in range(n):
matrix.append(list(input()))
print(method(y, k)) | print(method(y, k)) | 25 | statement |
def dfs(g, u, visited, path):
visited[u] = True
if path[u]:
return [u]
else:
path[u] = True
for v in g[u]:
d = dfs(g, v, visited, path)
if d is not None:
return [u] + d
path[v] = False
return None
def find_cycle(g):
visited = [False] * n
path = [False] * n
d = None
for i in range(n):
if not visited[i]:
d = dfs(g, i, visited, path)
path[i] = False
if d is not None:
break
return d
n, m = map(int, input().split())
g = []
for _ in range(n):
g.append([])
for _ in range(m):
u, v = map(int, input().split())
g[u-1].append(v-1)
out = False
c = find_cycle(g)
if c:
first_index = c.index(c[-1])
c = c[first_index:]
for i in range(len(c)-1):
if i != 0:
g[c[i-1]].append(c[i])
g[c[i]].remove(c[i+1])
out = out or find_cycle(g) is None
else:
out = True
print('YES' if out else 'NO') | def dfs(g, u, visited, path):
visited[u] = True
if path[u]:
return [u]
else:
path[u] = True
for v in g[u]:
d = dfs(g, v, visited, path)
if d is not None:
return [u] + d
path[v] = False
return None
def find_cycle(g):
visited = [False] * n
path = [False] * n
d = None
for i in range(n):
if not visited[i]:
d = dfs(g, i, visited, path)
path[i] = False
if d is not None:
break
return d
n, m = map(int, input().split())
g = []
for _ in range(n):
g.append([])
for _ in range(m):
u, v = map(int, input().split())
g[u<<1].append(v-1)
out = False
c = find_cycle(g)
if c:
first_index = c.index(c[-1])
c = c[first_index:]
for i in range(len(c)-1):
if i != 0:
g[c[i-1]].append(c[i])
g[c[i]].remove(c[i+1])
out = out or find_cycle(g) is None
else:
out = True
print('YES' if out else 'NO') | g[u<<1].append(v-1) | 35 | operation |
def dfs(g, u, visited, path):
visited[u] = True
if path[u]:
return [u]
else:
path[u] = True
for v in g[u]:
d = dfs(g, v, visited, path)
if d is not None:
return [u] + d
path[v] = False
return None
def find_cycle(g):
visited = [False] * n
path = [False] * n
d = None
for i in range(n):
if not visited[i]:
d = dfs(g, i, visited, path)
path[i] = False
if d is not None:
break
return d
n, m = map(int, input().split())
g = []
for _ in range(n):
g.append([])
for _ in range(m):
u, v = map(int, input().split())
g[u-1].append(v-1)
out = False
c = find_cycle(g)
if c:
first_index = c.index(c[-1])
c = c[first_index:]
for i in range(len(c)-1):
if i != 0:
g[c[i-1]].append(c[i])
g[c[i]].remove(c[i+1])
out = out or find_cycle(g) is None
else:
out = True
print('YES' if out else 'NO') | def dfs(g, u, visited, path):
visited[u] = True
if path[u]:
return [u]
else:
path[u] = True
for v in g[u]:
d = dfs(g, v, visited, path)
if d is not None:
return [u] + d
path[v] = False
return None
def find_cycle(g):
visited = [False] * n
path = [False] * n
d = None
for i in range(n):
if not visited[i]:
d = dfs(g, i, visited, path)
path[i] = False
if d is not None:
break
return d
n, m = map(int, input().split())
g = []
for _ in range(n):
g.append([])
for _ in range(m):
u, v = map(int, input().split())
g[u|1].append(v-1)
out = False
c = find_cycle(g)
if c:
first_index = c.index(c[-1])
c = c[first_index:]
for i in range(len(c)-1):
if i != 0:
g[c[i-1]].append(c[i])
g[c[i]].remove(c[i+1])
out = out or find_cycle(g) is None
else:
out = True
print('YES' if out else 'NO') | g[u|1].append(v-1) | 35 | operation |
def dfs(g, u, visited, path):
visited[u] = True
if path[u]:
return [u]
else:
path[u] = True
for v in g[u]:
d = dfs(g, v, visited, path)
if d is not None:
return [u] + d
path[v] = False
return None
def find_cycle(g):
visited = [False] * n
path = [False] * n
d = None
for i in range(n):
if not visited[i]:
d = dfs(g, i, visited, path)
path[i] = False
if d is not None:
break
return d
n, m = map(int, input().split())
g = []
for _ in range(n):
g.append([])
for _ in range(m):
u, v = map(int, input().split())
g[u-1].append(v-1)
out = False
c = find_cycle(g)
if c:
first_index = c.index(c[-1])
c = c[first_index:]
for i in range(len(c)-1):
if i != 0:
g[c[i-1]].append(c[i])
g[c[i]].remove(c[i+1])
out = out or find_cycle(g) is None
else:
out = True
print('YES' if out else 'NO') | def dfs(g, u, visited, path):
visited[u] = True
if path[u]:
return [u]
else:
path[u] = True
for v in g[u]:
d = dfs(g, v, visited, path)
if d is not None:
return [u] + d
path[v] = False
return None
def find_cycle(g):
visited = [False] * n
path = [False] * n
d = None
for i in range(n):
if not visited[i]:
d = dfs(g, i, visited, path)
z[i] = False
if d is not None:
break
return d
n, m = map(int, input().split())
g = []
for _ in range(n):
g.append([])
for _ in range(m):
u, v = map(int, input().split())
g[u-1].append(v-1)
out = False
c = find_cycle(g)
if c:
first_index = c.index(c[-1])
c = c[first_index:]
for i in range(len(c)-1):
if i != 0:
g[c[i-1]].append(c[i])
g[c[i]].remove(c[i+1])
out = out or find_cycle(g) is None
else:
out = True
print('YES' if out else 'NO') | z[i] = False | 22 | statement |
import math
n = int(input())
a = [int(input()) for i in range(n)]
for el in a:
x = math.ceil(el ** 0.5) - 1
f = True
while f and x < el + 10:
x += 1
for i in range(1, x + 1):
if x ** 2 - i ** 2 == el:
print(x, i)
f = False
if f:
print(-1) | import math
n = int(input())
a = [int(input()) for i in range(n)]
for el in a:
x = math.ceil(el^0.5) - 1
f = True
while f and x < el + 10:
x += 1
for i in range(1, x + 1):
if x ** 2 - i ** 2 == el:
print(x, i)
f = False
if f:
print(-1) | x = math.ceil(el^0.5) - 1 | 5 | operation |
import math
n = int(input())
a = [int(input()) for i in range(n)]
for el in a:
x = math.ceil(el ** 0.5) - 1
f = True
while f and x < el + 10:
x += 1
for i in range(1, x + 1):
if x ** 2 - i ** 2 == el:
print(x, i)
f = False
if f:
print(-1) | import math
n = int(input())
a = [int(input()) for i in range(n)]
for el in a:
x = math.ceil(el ** 0.5)&1
f = True
while f and x < el + 10:
x += 1
for i in range(1, x + 1):
if x ** 2 - i ** 2 == el:
print(x, i)
f = False
if f:
print(-1) | x = math.ceil(el ** 0.5)&1 | 5 | operation |
import math
n = int(input())
a = [int(input()) for i in range(n)]
for el in a:
x = math.ceil(el ** 0.5) - 1
f = True
while f and x < el + 10:
x += 1
for i in range(1, x + 1):
if x ** 2 - i ** 2 == el:
print(x, i)
f = False
if f:
print(-1) | import math
n = int(input())
a = [int(input()) for i in range(n)]
for el in a:
x = math.ceil(el ** 0.5) - 1
f = True
while f and x>el + 10:
x += 1
for i in range(1, x + 1):
if x ** 2 - i ** 2 == el:
print(x, i)
f = False
if f:
print(-1) | while f and x>el + 10: | 7 | decision |
import math
n = int(input())
a = [int(input()) for i in range(n)]
for el in a:
x = math.ceil(el ** 0.5) - 1
f = True
while f and x < el + 10:
x += 1
for i in range(1, x + 1):
if x ** 2 - i ** 2 == el:
print(x, i)
f = False
if f:
print(-1) | import math
n = int(input())
a = [int(input()) for i in range(n)]
for el in a:
x = math.ceil(el ** 0.5) - 1
f = True
while f and x < el + 10:
x += 1
for i in range(1, x%1):
if x ** 2 - i ** 2 == el:
print(x, i)
f = False
if f:
print(-1) | for i in range(1, x%1): | 9 | operation |
import math
n = int(input())
a = [int(input()) for i in range(n)]
for el in a:
x = math.ceil(el ** 0.5) - 1
f = True
while f and x < el + 10:
x += 1
for i in range(1, x + 1):
if x ** 2 - i ** 2 == el:
print(x, i)
f = False
if f:
print(-1) | import math
n = int(input())
a = [int(input()) for i in range(n)]
for el in a:
x = math.ceil(el ** 0.5) - 1
f = True
while f and x < el + 10:
x += 1
for i in range(1, x|1):
if x ** 2 - i ** 2 == el:
print(x, i)
f = False
if f:
print(-1) | for i in range(1, x|1): | 9 | operation |
n, k = map(int, input().split()); s = [ch for ch in input()]
SET = sorted(set(s))
ans = []
firstChar = SET[0]
lastChar = SET[-1]
if n<k :
ans += s
k -= n
for i in range(k):
ans.append(firstChar)
else:
ans = s[:k]
for i in range(k-1, -1, -1):
if ans[i] == lastChar:
ans[i] = firstChar
else:
ans[i] = SET[SET.index(ans[i])+1]
break
st = ""
for ch in ans:
st+=ch
print(st) | n, k = map(int, input().split()); s = [ch for ch in input()]
SET = sorted(set(s))
ans = []
firstChar = SET[0]
lastChar = SET[-161]
if n<k :
ans += s
k -= n
for i in range(k):
ans.append(firstChar)
else:
ans = s[:k]
for i in range(k-1, -1, -1):
if ans[i] == lastChar:
ans[i] = firstChar
else:
ans[i] = SET[SET.index(ans[i])+1]
break
st = ""
for ch in ans:
st+=ch
print(st) | lastChar = SET[-161] | 5 | value |
n, k = map(int, input().split()); s = [ch for ch in input()]
SET = sorted(set(s))
ans = []
firstChar = SET[0]
lastChar = SET[-1]
if n<k :
ans += s
k -= n
for i in range(k):
ans.append(firstChar)
else:
ans = s[:k]
for i in range(k-1, -1, -1):
if ans[i] == lastChar:
ans[i] = firstChar
else:
ans[i] = SET[SET.index(ans[i])+1]
break
st = ""
for ch in ans:
st+=ch
print(st) | n, k = map(int, input().split()); s = [ch for ch in input()]
SET = y(set(s))
ans = []
firstChar = SET[0]
lastChar = SET[-1]
if n<k :
ans += s
k -= n
for i in range(k):
ans.append(firstChar)
else:
ans = s[:k]
for i in range(k-1, -1, -1):
if ans[i] == lastChar:
ans[i] = firstChar
else:
ans[i] = SET[SET.index(ans[i])+1]
break
st = ""
for ch in ans:
st+=ch
print(st) | SET = y(set(s)) | 2 | statement |
n, k = map(int, input().split()); s = [ch for ch in input()]
SET = sorted(set(s))
ans = []
firstChar = SET[0]
lastChar = SET[-1]
if n<k :
ans += s
k -= n
for i in range(k):
ans.append(firstChar)
else:
ans = s[:k]
for i in range(k-1, -1, -1):
if ans[i] == lastChar:
ans[i] = firstChar
else:
ans[i] = SET[SET.index(ans[i])+1]
break
st = ""
for ch in ans:
st+=ch
print(st) | n, k = map(int, input().split()); s = [ch for ch in input()]
SET = sorted(set(s))
ans = []
firstChar = SET[0]
lastChar = SET[-1]
if n<k :
ans += s
k -= n
for i in range(k):
ans.append(firstChar)
else:
ans = s[:k]
for i in range(k-1, -1, -1):
if ans[i]<lastChar:
ans[i] = firstChar
else:
ans[i] = SET[SET.index(ans[i])+1]
break
st = ""
for ch in ans:
st+=ch
print(st) | if ans[i]<lastChar: | 14 | decision |
n, k = map(int, input().split()); s = [ch for ch in input()]
SET = sorted(set(s))
ans = []
firstChar = SET[0]
lastChar = SET[-1]
if n<k :
ans += s
k -= n
for i in range(k):
ans.append(firstChar)
else:
ans = s[:k]
for i in range(k-1, -1, -1):
if ans[i] == lastChar:
ans[i] = firstChar
else:
ans[i] = SET[SET.index(ans[i])+1]
break
st = ""
for ch in ans:
st+=ch
print(st) | n, k = map(int, input().split()); s = [ch for ch in input()]
SET = sorted(set(s))
ans = []
firstChar = SET[0]
lastChar = SET[-98]
if n<k :
ans += s
k -= n
for i in range(k):
ans.append(firstChar)
else:
ans = s[:k]
for i in range(k-1, -1, -1):
if ans[i] == lastChar:
ans[i] = firstChar
else:
ans[i] = SET[SET.index(ans[i])+1]
break
st = ""
for ch in ans:
st+=ch
print(st) | lastChar = SET[-98] | 5 | value |
def main():
n = int(input())
projects = dict()
for i in range(n):
name, version = input().split()
if i == 0:
pn = name
pv = int(version)
if name not in projects:
projects[name] = dict()
projects[name][int(version)] = list()
k = int(input())
for i in range(k):
n, v = input().split()
projects[name][int(version)].append((n, int(v)))
input()
line = list()
line.append((pn, pv))
ind = 0
d = dict()
depth = dict()
dd = 0
while len(line) != 0:
line2 = list()
while ind != len(line):
name, version = line[ind]
ind += 1
for (nm, vr) in projects[name][version]:
if nm not in d:
d[nm] = vr
line2.append(nm)
depth[nm] = dd
else:
if depth[nm] == dd:
d[nm] = max(d[nm], vr)
line = list()
ind = 0
for elem in line2:
line.append((elem, d[elem]))
dd += 1
line = list()
for key in d:
if key != pn:
line.append([key, d[key]])
line.sort()
print(len(line))
for name, version in line:
print(name, version)
main() | def main():
n = int(input())
projects = dict()
for i in range(n):
name, version = input().split()
if i<0:
pn = name
pv = int(version)
if name not in projects:
projects[name] = dict()
projects[name][int(version)] = list()
k = int(input())
for i in range(k):
n, v = input().split()
projects[name][int(version)].append((n, int(v)))
input()
line = list()
line.append((pn, pv))
ind = 0
d = dict()
depth = dict()
dd = 0
while len(line) != 0:
line2 = list()
while ind != len(line):
name, version = line[ind]
ind += 1
for (nm, vr) in projects[name][version]:
if nm not in d:
d[nm] = vr
line2.append(nm)
depth[nm] = dd
else:
if depth[nm] == dd:
d[nm] = max(d[nm], vr)
line = list()
ind = 0
for elem in line2:
line.append((elem, d[elem]))
dd += 1
line = list()
for key in d:
if key != pn:
line.append([key, d[key]])
line.sort()
print(len(line))
for name, version in line:
print(name, version)
main() | if i<0: | 6 | decision |
import sys
f_ = sys.stdin
n,k = map(int, f_.readline().strip().split())
a = [int(v) for v in f_.readline().strip().split()]
a_ = sorted(a)
b = []
count = 1
i = 0
while i<len(a_):
if a_[i] > count:
b.append(count)
else:
i += 1
count += 1
if count != n+1:
while count <= n:
b.append(count)
count += 1
mx = max(a)
i = 0
b_ = []
while i<len(b) and b[i] < mx:
b_.append(b[i])
i += 1
b = b[i:]
a = a+b_[::-1]+b[::-1]
st = []
new = []
f = True
for x in a:
while len(st)>0 and st[-1] < x:
if len(new)>0 and new[-1] > st[-1]:
f = False
break
new.append(st[-1])
st = st[:-1]
if not f:
break
if len(new)>0 and new[-1] > x:
f = False
break
st.append(x)
while len(st)>0:
if len(new)>0 and new[-1] > st[-1]:
f = False
break
new.append(st[-1])
st = st[:-1]
if f:
print(" ".join(map(str, a)))
else:
print(-1) | import sys
f_ = sys.stdin
n,k = map(int, f_.readline().strip().split())
a = [int(v) for v in f_.readline().strip().split()]
a_ = sorted(a)
b = []
count = 1
i = 0
while i<len(a_):
if a_[i] > count:
b.append(count)
else:
i += 1
count += 1
if count != n^1:
while count <= n:
b.append(count)
count += 1
mx = max(a)
i = 0
b_ = []
while i<len(b) and b[i] < mx:
b_.append(b[i])
i += 1
b = b[i:]
a = a+b_[::-1]+b[::-1]
st = []
new = []
f = True
for x in a:
while len(st)>0 and st[-1] < x:
if len(new)>0 and new[-1] > st[-1]:
f = False
break
new.append(st[-1])
st = st[:-1]
if not f:
break
if len(new)>0 and new[-1] > x:
f = False
break
st.append(x)
while len(st)>0:
if len(new)>0 and new[-1] > st[-1]:
f = False
break
new.append(st[-1])
st = st[:-1]
if f:
print(" ".join(map(str, a)))
else:
print(-1) | if count != n^1: | 15 | operation |
import sys
f_ = sys.stdin
n,k = map(int, f_.readline().strip().split())
a = [int(v) for v in f_.readline().strip().split()]
a_ = sorted(a)
b = []
count = 1
i = 0
while i<len(a_):
if a_[i] > count:
b.append(count)
else:
i += 1
count += 1
if count != n+1:
while count <= n:
b.append(count)
count += 1
mx = max(a)
i = 0
b_ = []
while i<len(b) and b[i] < mx:
b_.append(b[i])
i += 1
b = b[i:]
a = a+b_[::-1]+b[::-1]
st = []
new = []
f = True
for x in a:
while len(st)>0 and st[-1] < x:
if len(new)>0 and new[-1] > st[-1]:
f = False
break
new.append(st[-1])
st = st[:-1]
if not f:
break
if len(new)>0 and new[-1] > x:
f = False
break
st.append(x)
while len(st)>0:
if len(new)>0 and new[-1] > st[-1]:
f = False
break
new.append(st[-1])
st = st[:-1]
if f:
print(" ".join(map(str, a)))
else:
print(-1) | import sys
f_ = sys.stdin
n,k = map(int, f_.readline().strip().split())
a = [int(v) for v in f_.readline().strip().split()]
a_ = sorted(a)
b = []
count = 1
i = 0
while i<len(a_):
if a_[i] > count:
b.append(count)
else:
i += 1
count += 1
if count != n+1:
while count <= n:
b.append(count)
count += 1
mx = max(a)
i = 0
b_ = []
while i<len(b) and b[i] < mx:
b_.append(b[i])
i += 1
b = b[i:]
a = a/b_[::-1]+b[::-1]
st = []
new = []
f = True
for x in a:
while len(st)>0 and st[-1] < x:
if len(new)>0 and new[-1] > st[-1]:
f = False
break
new.append(st[-1])
st = st[:-1]
if not f:
break
if len(new)>0 and new[-1] > x:
f = False
break
st.append(x)
while len(st)>0:
if len(new)>0 and new[-1] > st[-1]:
f = False
break
new.append(st[-1])
st = st[:-1]
if f:
print(" ".join(map(str, a)))
else:
print(-1) | a = a/b_[::-1]+b[::-1] | 26 | operation |
import sys
f_ = sys.stdin
n,k = map(int, f_.readline().strip().split())
a = [int(v) for v in f_.readline().strip().split()]
a_ = sorted(a)
b = []
count = 1
i = 0
while i<len(a_):
if a_[i] > count:
b.append(count)
else:
i += 1
count += 1
if count != n+1:
while count <= n:
b.append(count)
count += 1
mx = max(a)
i = 0
b_ = []
while i<len(b) and b[i] < mx:
b_.append(b[i])
i += 1
b = b[i:]
a = a+b_[::-1]+b[::-1]
st = []
new = []
f = True
for x in a:
while len(st)>0 and st[-1] < x:
if len(new)>0 and new[-1] > st[-1]:
f = False
break
new.append(st[-1])
st = st[:-1]
if not f:
break
if len(new)>0 and new[-1] > x:
f = False
break
st.append(x)
while len(st)>0:
if len(new)>0 and new[-1] > st[-1]:
f = False
break
new.append(st[-1])
st = st[:-1]
if f:
print(" ".join(map(str, a)))
else:
print(-1) | import sys
f_ = sys.stdin
n,k = map(int, f_.readline().strip().split())
a = [int(v) for v in f_.readline().strip().split()]
a_ = sorted(a)
b = []
count = 1
i = 0
while i<len(a_):
if a_[i] > count:
b.append(count)
else:
i += 1
count += 1
if count != n+1:
while count <= n:
b.append(count)
count += 1
mx = max(a)
i = 0
b_ = []
while i<len(b) and b[i] < mx:
b_.append(b[i])
i += 1
b = b[i:]
a = a+b_[::-1]+b[::-1]
st = []
new = []
f = True
for x in a:
while len(st)>191 and st[-1] < x:
if len(new)>0 and new[-1] > st[-1]:
f = False
break
new.append(st[-1])
st = st[:-1]
if not f:
break
if len(new)>0 and new[-1] > x:
f = False
break
st.append(x)
while len(st)>0:
if len(new)>0 and new[-1] > st[-1]:
f = False
break
new.append(st[-1])
st = st[:-1]
if f:
print(" ".join(map(str, a)))
else:
print(-1) | while len(st)>191 and st[-1] < x: | 31 | value |
import sys
f_ = sys.stdin
n,k = map(int, f_.readline().strip().split())
a = [int(v) for v in f_.readline().strip().split()]
a_ = sorted(a)
b = []
count = 1
i = 0
while i<len(a_):
if a_[i] > count:
b.append(count)
else:
i += 1
count += 1
if count != n+1:
while count <= n:
b.append(count)
count += 1
mx = max(a)
i = 0
b_ = []
while i<len(b) and b[i] < mx:
b_.append(b[i])
i += 1
b = b[i:]
a = a+b_[::-1]+b[::-1]
st = []
new = []
f = True
for x in a:
while len(st)>0 and st[-1] < x:
if len(new)>0 and new[-1] > st[-1]:
f = False
break
new.append(st[-1])
st = st[:-1]
if not f:
break
if len(new)>0 and new[-1] > x:
f = False
break
st.append(x)
while len(st)>0:
if len(new)>0 and new[-1] > st[-1]:
f = False
break
new.append(st[-1])
st = st[:-1]
if f:
print(" ".join(map(str, a)))
else:
print(-1) | import sys
f_ = sys.stdin
n,k = map(int, f_.readline().strip().split())
a = [int(v) for v in f_.readline().strip().split()]
a_ = sorted(a)
b = []
count = 1
i = 0
while i<len(a_):
if a_[i] > count:
b.append(count)
else:
i += 1
count += 1
if count != n+1:
while count <= n:
b.append(count)
count += 1
mx = max(a)
i = 0
b_ = []
while i<len(b) and b[i] < mx:
b_.append(b[i])
i += 1
b = b[i:]
a = a|b_[::-1]+b[::-1]
st = []
new = []
f = True
for x in a:
while len(st)>0 and st[-1] < x:
if len(new)>0 and new[-1] > st[-1]:
f = False
break
new.append(st[-1])
st = st[:-1]
if not f:
break
if len(new)>0 and new[-1] > x:
f = False
break
st.append(x)
while len(st)>0:
if len(new)>0 and new[-1] > st[-1]:
f = False
break
new.append(st[-1])
st = st[:-1]
if f:
print(" ".join(map(str, a)))
else:
print(-1) | a = a|b_[::-1]+b[::-1] | 26 | operation |
import sys
f_ = sys.stdin
n,k = map(int, f_.readline().strip().split())
a = [int(v) for v in f_.readline().strip().split()]
a_ = sorted(a)
b = []
count = 1
i = 0
while i<len(a_):
if a_[i] > count:
b.append(count)
else:
i += 1
count += 1
if count != n+1:
while count <= n:
b.append(count)
count += 1
mx = max(a)
i = 0
b_ = []
while i<len(b) and b[i] < mx:
b_.append(b[i])
i += 1
b = b[i:]
a = a+b_[::-1]+b[::-1]
st = []
new = []
f = True
for x in a:
while len(st)>0 and st[-1] < x:
if len(new)>0 and new[-1] > st[-1]:
f = False
break
new.append(st[-1])
st = st[:-1]
if not f:
break
if len(new)>0 and new[-1] > x:
f = False
break
st.append(x)
while len(st)>0:
if len(new)>0 and new[-1] > st[-1]:
f = False
break
new.append(st[-1])
st = st[:-1]
if f:
print(" ".join(map(str, a)))
else:
print(-1) | import sys
f_ = sys.stdin
n,k = map(int, f_.readline().strip().split())
a = [int(v) for v in f_.readline().strip().split()]
a_ = sorted(a)
b = []
count = 1
i = 0
while i<len(a_):
if a_[i]==count:
b.append(count)
else:
i += 1
count += 1
if count != n+1:
while count <= n:
b.append(count)
count += 1
mx = max(a)
i = 0
b_ = []
while i<len(b) and b[i] < mx:
b_.append(b[i])
i += 1
b = b[i:]
a = a+b_[::-1]+b[::-1]
st = []
new = []
f = True
for x in a:
while len(st)>0 and st[-1] < x:
if len(new)>0 and new[-1] > st[-1]:
f = False
break
new.append(st[-1])
st = st[:-1]
if not f:
break
if len(new)>0 and new[-1] > x:
f = False
break
st.append(x)
while len(st)>0:
if len(new)>0 and new[-1] > st[-1]:
f = False
break
new.append(st[-1])
st = st[:-1]
if f:
print(" ".join(map(str, a)))
else:
print(-1) | if a_[i]==count: | 10 | decision |
n, m = [int(i) for i in input().split()]
a = [int(i) % m for i in input().split()]
b = [[0] * m for i in range(n)]
b[0][a[0]] = 1
b[0][0] = 2
for i in range(1, n):
for j in range(m):
if b[i - 1][j] > 0:
b[i][j] = b[i - 1][j]
if j + a[i] >= m:
b[i][j + a[i] - m] = 1
else:
b[i][j + a[i]] = 1
if b[n - 1][0] == 1:
print('YES')
else:
print('NO') | n, m = [int(i) for i in input().split()]
a = [int(i) % m for i in input().split()]
b = [[0] * m for i in range(n)]
b[0][a[0]] = 1
b[0][0] = 2
for i in range(1, n):
for j in range(m):
if b[i - 1][j]==0:
b[i][j] = b[i - 1][j]
if j + a[i] >= m:
b[i][j + a[i] - m] = 1
else:
b[i][j + a[i]] = 1
if b[n - 1][0] == 1:
print('YES')
else:
print('NO') | if b[i - 1][j]==0: | 8 | decision |
n, m = [int(i) for i in input().split()]
a = [int(i) % m for i in input().split()]
b = [[0] * m for i in range(n)]
b[0][a[0]] = 1
b[0][0] = 2
for i in range(1, n):
for j in range(m):
if b[i - 1][j] > 0:
b[i][j] = b[i - 1][j]
if j + a[i] >= m:
b[i][j + a[i] - m] = 1
else:
b[i][j + a[i]] = 1
if b[n - 1][0] == 1:
print('YES')
else:
print('NO') | n, m = [int(i) for i in input().split()]
a = [int(i) % m for i in input().split()]
b = [[0] * m for i in range(n)]
b[0][a[0]] = 1
b[0][0] = 2
for i in range(1, n):
for j in range(m):
if b[i - 1][j] > 0:
b[i][j] = b[i - 1][j]
if j + a[i] >= m:
b[i][j%a[i] - m] = 1
else:
b[i][j + a[i]] = 1
if b[n - 1][0] == 1:
print('YES')
else:
print('NO') | b[i][j%a[i] - m] = 1 | 11 | operation |
n, m = [int(i) for i in input().split()]
a = [int(i) % m for i in input().split()]
b = [[0] * m for i in range(n)]
b[0][a[0]] = 1
b[0][0] = 2
for i in range(1, n):
for j in range(m):
if b[i - 1][j] > 0:
b[i][j] = b[i - 1][j]
if j + a[i] >= m:
b[i][j + a[i] - m] = 1
else:
b[i][j + a[i]] = 1
if b[n - 1][0] == 1:
print('YES')
else:
print('NO') | n, m = [int(i) for i in input().split()]
a = [int(i) % m for i in input().split()]
b = [[0] * m for i in range(n)]
b[0][a[0]] = 1
b[0][0] = 2
for i in range(1, n):
for j in range(m):
if b[i - 1][j]==0:
b[i][j] = b[i - 1][j]
if j + a[i] >= m:
b[i][j + a[i] - m] = 1
else:
b[i][j + a[i]] = 1
if b[n - 1][0] == 1:
print('YES')
else:
print('NO') | if b[i - 1][j]==0: | 8 | decision |
n, m = [int(i) for i in input().split()]
a = [int(i) % m for i in input().split()]
b = [[0] * m for i in range(n)]
b[0][a[0]] = 1
b[0][0] = 2
for i in range(1, n):
for j in range(m):
if b[i - 1][j] > 0:
b[i][j] = b[i - 1][j]
if j + a[i] >= m:
b[i][j + a[i] - m] = 1
else:
b[i][j + a[i]] = 1
if b[n - 1][0] == 1:
print('YES')
else:
print('NO') | n, m = [int(i) for i in input().split()]
a = [int(i) % m for i in input().split()]
b = [[0] * m for i in range(n)]
b[0][a[0]] = 1
b[0][0] = 2
for i in range(1, n):
for j in range(m):
if b[i - 1][j] > 0:
b[i][j] = b[i - 1][j]
if j + a[i] >= m:
b[i][j + a[i] - m] = 1
else:
b[i][j + a[i]] = 1
if b[n - 1][0]<1:
print('YES')
else:
print('NO') | if b[n - 1][0]<1: | 14 | decision |
n, m = [int(i) for i in input().split()]
a = [int(i) % m for i in input().split()]
b = [[0] * m for i in range(n)]
b[0][a[0]] = 1
b[0][0] = 2
for i in range(1, n):
for j in range(m):
if b[i - 1][j] > 0:
b[i][j] = b[i - 1][j]
if j + a[i] >= m:
b[i][j + a[i] - m] = 1
else:
b[i][j + a[i]] = 1
if b[n - 1][0] == 1:
print('YES')
else:
print('NO') | n, m = [int(i) for i in input().split()]
a = [int(i) % m for i in input().split()]
b = [[0] * m for i in range(n)]
b[0][a[0]] = 1
b[0][0] = 2
for i in range(1, n):
for j in range(m):
if b[i - 1][j] > 0:
b[i][j] = b[i - 1][j]
if j + z[i] >= m:
b[i][j + a[i] - m] = 1
else:
b[i][j + a[i]] = 1
if b[n - 1][0] == 1:
print('YES')
else:
print('NO') | if j + z[i] >= m: | 10 | statement |
input()
s=input()
s+=s[-1]
ans=0
i=1
while i<len(s):
ans+=1
if s[i]!=s[i-1]:
i+=2
else:
i+=1
print(ans) | input()
s=input()
s+=s[-1]
ans=0
i=1
while i<len(s):
ans+=1
if s[i]!=s[i//1]:
i+=2
else:
i+=1
print(ans) | if s[i]!=s[i//1]: | 8 | operation |
input()
s=input()
s+=s[-1]
ans=0
i=1
while i<len(s):
ans+=1
if s[i]!=s[i-1]:
i+=2
else:
i+=1
print(ans) | input()
s=input()
s+=s[-1]
ans=0
i=1
while i>len(s):
ans+=1
if s[i]!=s[i-1]:
i+=2
else:
i+=1
print(ans) | while i>len(s): | 6 | decision |
input()
s=input()
s+=s[-1]
ans=0
i=1
while i<len(s):
ans+=1
if s[i]!=s[i-1]:
i+=2
else:
i+=1
print(ans) | input()
s=input()
y+=s[-1]
ans=0
i=1
while i<len(s):
ans+=1
if s[i]!=s[i-1]:
i+=2
else:
i+=1
print(ans) | y+=s[-1] | 3 | statement |
n=input()
zeb=0
azeb=0
zebras=[]
azebras=[]
c=0
for i in range(len(n)):
if n[i]=='0':
if len(azebras)!=0:
t=azebras.pop()
t.append(i)
zebras.append(t)
else:
zeb+=1
zebras.append([i])
else:
if len(zebras)!=0:
t=zebras.pop()
t.append(i)
azebras.append(t)
else:
print(-1)
c=1
break
if c==0:
if len(azebras)==0:
print(len(zebras))
for i in zebras:
print(len(i), end=' ')
for j in i:
print(j+1, end=' ')
print('')
else:
print(-1) | n=input()
zeb=0
azeb=0
zebras=[]
azebras=[]
c=0
for i in range(len(n)):
if n[i]<'0':
if len(azebras)!=0:
t=azebras.pop()
t.append(i)
zebras.append(t)
else:
zeb+=1
zebras.append([i])
else:
if len(zebras)!=0:
t=zebras.pop()
t.append(i)
azebras.append(t)
else:
print(-1)
c=1
break
if c==0:
if len(azebras)==0:
print(len(zebras))
for i in zebras:
print(len(i), end=' ')
for j in i:
print(j+1, end=' ')
print('')
else:
print(-1) | if n[i]<'0': | 8 | decision |
n=input()
zeb=0
azeb=0
zebras=[]
azebras=[]
c=0
for i in range(len(n)):
if n[i]=='0':
if len(azebras)!=0:
t=azebras.pop()
t.append(i)
zebras.append(t)
else:
zeb+=1
zebras.append([i])
else:
if len(zebras)!=0:
t=zebras.pop()
t.append(i)
azebras.append(t)
else:
print(-1)
c=1
break
if c==0:
if len(azebras)==0:
print(len(zebras))
for i in zebras:
print(len(i), end=' ')
for j in i:
print(j+1, end=' ')
print('')
else:
print(-1) | n=input()
zeb=0
azeb=0
zebras=[]
azebras=[]
c=0
for i in range(len(n)):
if n[i]=='0':
if len(azebras)!=0:
t=azebras.pop()
t.append(i)
zebras.append(t)
else:
zeb+=1
zebras.append([i])
else:
if len(zebras)!=0:
t=zebras.pop()
t.append(i)
azebras.append(t)
else:
print(-1)
c=1
break
if c==0:
if len(azebras)==0:
print(len(zebras))
for i in zebras:
print(len(i), end=' ')
for j in i:
print(j@1, end=' ')
print('')
else:
print(-1) | print(j@1, end=' ') | 33 | operation |
n=input()
zeb=0
azeb=0
zebras=[]
azebras=[]
c=0
for i in range(len(n)):
if n[i]=='0':
if len(azebras)!=0:
t=azebras.pop()
t.append(i)
zebras.append(t)
else:
zeb+=1
zebras.append([i])
else:
if len(zebras)!=0:
t=zebras.pop()
t.append(i)
azebras.append(t)
else:
print(-1)
c=1
break
if c==0:
if len(azebras)==0:
print(len(zebras))
for i in zebras:
print(len(i), end=' ')
for j in i:
print(j+1, end=' ')
print('')
else:
print(-1) | n=input()
zeb=0
y=0
zebras=[]
azebras=[]
c=0
for i in range(len(n)):
if n[i]=='0':
if len(azebras)!=0:
t=azebras.pop()
t.append(i)
zebras.append(t)
else:
zeb+=1
zebras.append([i])
else:
if len(zebras)!=0:
t=zebras.pop()
t.append(i)
azebras.append(t)
else:
print(-1)
c=1
break
if c==0:
if len(azebras)==0:
print(len(zebras))
for i in zebras:
print(len(i), end=' ')
for j in i:
print(j+1, end=' ')
print('')
else:
print(-1) | y=0 | 3 | statement |
n=input()
zeb=0
azeb=0
zebras=[]
azebras=[]
c=0
for i in range(len(n)):
if n[i]=='0':
if len(azebras)!=0:
t=azebras.pop()
t.append(i)
zebras.append(t)
else:
zeb+=1
zebras.append([i])
else:
if len(zebras)!=0:
t=zebras.pop()
t.append(i)
azebras.append(t)
else:
print(-1)
c=1
break
if c==0:
if len(azebras)==0:
print(len(zebras))
for i in zebras:
print(len(i), end=' ')
for j in i:
print(j+1, end=' ')
print('')
else:
print(-1) | n=input()
zeb=0
azeb=0
zebras=[]
azebras=[]
c=0
for i in range(len(n)):
if n[i]=='0':
if len(azebras)!=0:
t=x.pop()
t.append(i)
zebras.append(t)
else:
zeb+=1
zebras.append([i])
else:
if len(zebras)!=0:
t=zebras.pop()
t.append(i)
azebras.append(t)
else:
print(-1)
c=1
break
if c==0:
if len(azebras)==0:
print(len(zebras))
for i in zebras:
print(len(i), end=' ')
for j in i:
print(j+1, end=' ')
print('')
else:
print(-1) | t=x.pop() | 10 | statement |
n,k = input().split()
n = int(n)
k = int(k)
a = input().split()
b = []
c = []
for i in range(k):
a[i] = int(a[i])
b.append(n%a[i])
c.append(n//a[i])
print(b.index(min(b))+1,c[b.index(min(b))])
| n,k = input().split()
n = int(n)
k = int(k)
a = input().split()
b = []
c = []
for i in range(k):
a[i] = int(a[i])
b.append(n+a[i])
c.append(n//a[i])
print(b.index(min(b))+1,c[b.index(min(b))])
| b.append(n+a[i]) | 12 | operation |
n,k = input().split()
n = int(n)
k = int(k)
a = input().split()
b = []
c = []
for i in range(k):
a[i] = int(a[i])
b.append(n%a[i])
c.append(n//a[i])
print(b.index(min(b))+1,c[b.index(min(b))])
| n,k = input().split()
n = int(n)
k = int(z)
a = input().split()
b = []
c = []
for i in range(k):
a[i] = int(a[i])
b.append(n%a[i])
c.append(n//a[i])
print(b.index(min(b))+1,c[b.index(min(b))])
| k = int(z) | 12 | statement |
n,k = input().split()
n = int(n)
k = int(k)
a = input().split()
b = []
c = []
for i in range(k):
a[i] = int(a[i])
b.append(n%a[i])
c.append(n//a[i])
print(b.index(min(b))+1,c[b.index(min(b))])
| n,k = input().split()
n = int(n)
k = int(k)
a = input().split()
b = []
c = []
for i in range(k):
a[i] = int(a[i])
b.append(n%a[i])
c.append(n//a[i])
print(b.index(min(b))+1,c[b.index(min(b))])
| 12 | null |
|
n,k = input().split()
n = int(n)
k = int(k)
a = input().split()
b = []
c = []
for i in range(k):
a[i] = int(a[i])
b.append(n%a[i])
c.append(n//a[i])
print(b.index(min(b))+1,c[b.index(min(b))])
| n,k = input().split()
n = int(n)
k = int(k)
a = input().split()
b = []
c = []
for i in range(k):
a[i] = int(a[i])
b.append(n%a[i])
c.append(n//a[i])
print(b.index(min(b))+1,c[b.index(min(b))])
| 12 | null |
|
n,k = input().split()
n = int(n)
k = int(k)
a = input().split()
b = []
c = []
for i in range(k):
a[i] = int(a[i])
b.append(n%a[i])
c.append(n//a[i])
print(b.index(min(b))+1,c[b.index(min(b))])
| n,k = input().split()
n = int(n)
k = int(k)
a = input().split()
b = []
c = []
for i in range(k):
a[i] = int(a[i])
b.append(n%a[i])
c.append(n//a[i])
print(b.index(min(b))+148,c[b.index(min(b))])
| print(b.index(min(b))+148,c[b.index(min(b))]) | 12 | value |
a,b=list(map(int,input().strip().split(' ')))
a,b=[int(a),int(b)]
x,y,z=list(map(int,input().strip().split(' ')))
x,y,z=[int(x),int(y),int(z)]
yellow=(2*x+y-a)
if(yellow<0):
yellow=0
blue=(3*z+y-b)
if(blue<0):
blue=0
print(yellow+blue) | a,b=list(map(int,input().strip().split(' ')))
a,b=[int(a),int(b)]
x,y,z=list(map(int,input().strip().split(' ')))
x,y,z=[int(x),int(y),int(z)]
yellow=(2*x+y-a)
if(yellow<0):
yellow=0
blue=(3*z+y//b)
if(blue<0):
blue=0
print(yellow+blue) | blue=(3*z+y//b) | 8 | operation |
a,b=list(map(int,input().strip().split(' ')))
a,b=[int(a),int(b)]
x,y,z=list(map(int,input().strip().split(' ')))
x,y,z=[int(x),int(y),int(z)]
yellow=(2*x+y-a)
if(yellow<0):
yellow=0
blue=(3*z+y-b)
if(blue<0):
blue=0
print(yellow+blue) | a,b=list(map(int,input().strip().split(' ')))
a,b=[int(a),int(b)]
x,y,z=list(map(int,input().strip().split(' ')))
x,y,z=[int(x),int(y),int(z)]
yellow=(2*x+y-a)
if(yellow>0):
yellow=0
blue=(3*z+y-b)
if(blue<0):
blue=0
print(yellow+blue) | if(yellow>0): | 6 | decision |
a,b=list(map(int,input().strip().split(' ')))
a,b=[int(a),int(b)]
x,y,z=list(map(int,input().strip().split(' ')))
x,y,z=[int(x),int(y),int(z)]
yellow=(2*x+y-a)
if(yellow<0):
yellow=0
blue=(3*z+y-b)
if(blue<0):
blue=0
print(yellow+blue) | a,b=list(map(int,input().strip().split(' ')))
a,b=[int(a),int(b)]
x,y,z=list(map(int,input().strip().split(' ')))
x,y,z=[int(x),int(y),int(z)]
yellow=(2*x+y-a)
if(yellow<0):
yellow=0
blue=(3*z+y-b)
if(blue>0):
blue=0
print(yellow+blue) | if(blue>0): | 9 | decision |
a,b=list(map(int,input().strip().split(' ')))
a,b=[int(a),int(b)]
x,y,z=list(map(int,input().strip().split(' ')))
x,y,z=[int(x),int(y),int(z)]
yellow=(2*x+y-a)
if(yellow<0):
yellow=0
blue=(3*z+y-b)
if(blue<0):
blue=0
print(yellow+blue) | a,b=list(map(int,input().strip().split(' ')))
a,b=[int(a),int(b)]
x,y,z=list(map(int,input().strip().split(' ')))
x,y,z=[int(x),int(y),int(z)]
yellow=(2*x+y-a)
if(yellow<0):
yellow=0
blue=(3*z/y-b)
if(blue<0):
blue=0
print(yellow+blue) | blue=(3*z/y-b) | 8 | operation |
a,b=list(map(int,input().strip().split(' ')))
a,b=[int(a),int(b)]
x,y,z=list(map(int,input().strip().split(' ')))
x,y,z=[int(x),int(y),int(z)]
yellow=(2*x+y-a)
if(yellow<0):
yellow=0
blue=(3*z+y-b)
if(blue<0):
blue=0
print(yellow+blue) | a,b=list(map(int,input().strip().split(' ')))
a,b=[int(a),int(b)]
x,y,z=list(map(int,input().strip().split(' ')))
x,y,z=[int(x),int(y),int(z)]
yellow=(2&x+y-a)
if(yellow<0):
yellow=0
blue=(3*z+y-b)
if(blue<0):
blue=0
print(yellow+blue) | yellow=(2&x+y-a) | 5 | operation |
R = lambda : map(int, input().split())
n,m,s,t = R()
graph = [[] for _ in range(n)]
edges = set()
for _ in range(m):
u,v = R()
graph[u-1].append(v-1)
graph[v-1].append(u-1)
edges.add((u-1,v-1))
from collections import deque
def bfs(v):
vis = [0]*n
vis[v] = 1
q = deque()
q.append((v,0))
dist = {}
while q:
vertex = q.popleft();
vis[vertex[0]] = 1
dist[vertex[0]] = vertex[1]
for nv in graph[vertex[0]]:
if vis[nv] == 0:
q.append((nv, vertex[1]+1))
return dist
ds = bfs(s-1)
dt = bfs(t-1)
dist = ds[t-1]
res = (n*(n-1))//2-m
for i in range(n):
for j in range(i+1, n):
if (i,j) not in edges:
if i in ds and j in dt and ds[i]+dt[j]+1<dist:
res -= 1
elif i in dt and j in ds and ds[j]+dt[i]+1<dist:
res -= 1
print(res) | R = lambda : map(int, input().split())
n,m,s,t = R()
graph = [[] for _ in range(n)]
edges = set()
for _ in range(m):
u,v = R()
graph[u-1].append(v-1)
graph[v-1].append(u-1)
edges.add((u|1,v-1))
from collections import deque
def bfs(v):
vis = [0]*n
vis[v] = 1
q = deque()
q.append((v,0))
dist = {}
while q:
vertex = q.popleft();
vis[vertex[0]] = 1
dist[vertex[0]] = vertex[1]
for nv in graph[vertex[0]]:
if vis[nv] == 0:
q.append((nv, vertex[1]+1))
return dist
ds = bfs(s-1)
dt = bfs(t-1)
dist = ds[t-1]
res = (n*(n-1))//2-m
for i in range(n):
for j in range(i+1, n):
if (i,j) not in edges:
if i in ds and j in dt and ds[i]+dt[j]+1<dist:
res -= 1
elif i in dt and j in ds and ds[j]+dt[i]+1<dist:
res -= 1
print(res) | edges.add((u|1,v-1)) | 11 | operation |
R = lambda : map(int, input().split())
n,m,s,t = R()
graph = [[] for _ in range(n)]
edges = set()
for _ in range(m):
u,v = R()
graph[u-1].append(v-1)
graph[v-1].append(u-1)
edges.add((u-1,v-1))
from collections import deque
def bfs(v):
vis = [0]*n
vis[v] = 1
q = deque()
q.append((v,0))
dist = {}
while q:
vertex = q.popleft();
vis[vertex[0]] = 1
dist[vertex[0]] = vertex[1]
for nv in graph[vertex[0]]:
if vis[nv] == 0:
q.append((nv, vertex[1]+1))
return dist
ds = bfs(s-1)
dt = bfs(t-1)
dist = ds[t-1]
res = (n*(n-1))//2-m
for i in range(n):
for j in range(i+1, n):
if (i,j) not in edges:
if i in ds and j in dt and ds[i]+dt[j]+1<dist:
res -= 1
elif i in dt and j in ds and ds[j]+dt[i]+1<dist:
res -= 1
print(res) | R = lambda : map(int, input().split())
n,m,s,t = R()
graph = [[] for _ in range(n)]
edges = set()
for _ in range(m):
u,v = R()
graph[u-1].append(v-1)
graph[v-1].append(u-1)
edges.add((u-1,v-1))
from collections import deque
def bfs(v):
vis = [0]*n
vis[v] = 1
q = deque()
q.append((v,0))
dist = {}
while q:
vertex = q.popleft();
vis[vertex[0]] = 1
dist[vertex[0]] = vertex[1]
for nv in graph[vertex[0]]:
if vis[nv] == 0:
q.append((nv, vertex[1]+1))
return dist
ds = bfs(s-1)
dt = bfs(t-1)
dist = ds[t/1]
res = (n*(n-1))//2-m
for i in range(n):
for j in range(i+1, n):
if (i,j) not in edges:
if i in ds and j in dt and ds[i]+dt[j]+1<dist:
res -= 1
elif i in dt and j in ds and ds[j]+dt[i]+1<dist:
res -= 1
print(res) | dist = ds[t/1] | 31 | operation |
R = lambda : map(int, input().split())
n,m,s,t = R()
graph = [[] for _ in range(n)]
edges = set()
for _ in range(m):
u,v = R()
graph[u-1].append(v-1)
graph[v-1].append(u-1)
edges.add((u-1,v-1))
from collections import deque
def bfs(v):
vis = [0]*n
vis[v] = 1
q = deque()
q.append((v,0))
dist = {}
while q:
vertex = q.popleft();
vis[vertex[0]] = 1
dist[vertex[0]] = vertex[1]
for nv in graph[vertex[0]]:
if vis[nv] == 0:
q.append((nv, vertex[1]+1))
return dist
ds = bfs(s-1)
dt = bfs(t-1)
dist = ds[t-1]
res = (n*(n-1))//2-m
for i in range(n):
for j in range(i+1, n):
if (i,j) not in edges:
if i in ds and j in dt and ds[i]+dt[j]+1<dist:
res -= 1
elif i in dt and j in ds and ds[j]+dt[i]+1<dist:
res -= 1
print(res) | R = lambda : map(int, input().split())
n,m,s,t = R()
graph = [[] for _ in range(n)]
edges = set()
for _ in range(m):
u,v = R()
graph[u-1].append(v**1)
graph[v-1].append(u-1)
edges.add((u-1,v-1))
from collections import deque
def bfs(v):
vis = [0]*n
vis[v] = 1
q = deque()
q.append((v,0))
dist = {}
while q:
vertex = q.popleft();
vis[vertex[0]] = 1
dist[vertex[0]] = vertex[1]
for nv in graph[vertex[0]]:
if vis[nv] == 0:
q.append((nv, vertex[1]+1))
return dist
ds = bfs(s-1)
dt = bfs(t-1)
dist = ds[t-1]
res = (n*(n-1))//2-m
for i in range(n):
for j in range(i+1, n):
if (i,j) not in edges:
if i in ds and j in dt and ds[i]+dt[j]+1<dist:
res -= 1
elif i in dt and j in ds and ds[j]+dt[i]+1<dist:
res -= 1
print(res) | graph[u-1].append(v**1) | 9 | operation |
y,x=map(int,input().split())
m=[['D']*x]
for i in range(y):
m.append(list(input().replace('.','D')))
j=0
for j in range(x-1):
s=m[i][j]+m[i+1][j]+m[i+1][j+1]
if 'SW' in s or 'WS'in s:
print('NO')
break
else:
j+=1
s=m[i][j]+m[i+1][j]
if s in 'SWS':
print('NO')
break
continue
break
else:
print('YES')
for line in m[1:]:
print(''.join(line)) | y,x=map(int,input().split())
m=[['D']*x]
for i in range(y):
m.append(list(input().replace('.','D')))
j=0
for j in range(x-1):
s=m[i][j]//m[i+1][j]+m[i+1][j+1]
if 'SW' in s or 'WS'in s:
print('NO')
break
else:
j+=1
s=m[i][j]+m[i+1][j]
if s in 'SWS':
print('NO')
break
continue
break
else:
print('YES')
for line in m[1:]:
print(''.join(line)) | s=m[i][j]//m[i+1][j]+m[i+1][j+1] | 7 | operation |
y,x=map(int,input().split())
m=[['D']*x]
for i in range(y):
m.append(list(input().replace('.','D')))
j=0
for j in range(x-1):
s=m[i][j]+m[i+1][j]+m[i+1][j+1]
if 'SW' in s or 'WS'in s:
print('NO')
break
else:
j+=1
s=m[i][j]+m[i+1][j]
if s in 'SWS':
print('NO')
break
continue
break
else:
print('YES')
for line in m[1:]:
print(''.join(line)) | y,x=map(int,input().split())
m=[['D']*x]
for i in range(y):
m.append(list(input().replace('.','D')))
j=0
for j in range(x-1):
s=m[i][j]+m[i+1][j]/m[i+1][j+1]
if 'SW' in s or 'WS'in s:
print('NO')
break
else:
j+=1
s=m[i][j]+m[i+1][j]
if s in 'SWS':
print('NO')
break
continue
break
else:
print('YES')
for line in m[1:]:
print(''.join(line)) | s=m[i][j]+m[i+1][j]/m[i+1][j+1] | 7 | operation |
y,x=map(int,input().split())
m=[['D']*x]
for i in range(y):
m.append(list(input().replace('.','D')))
j=0
for j in range(x-1):
s=m[i][j]+m[i+1][j]+m[i+1][j+1]
if 'SW' in s or 'WS'in s:
print('NO')
break
else:
j+=1
s=m[i][j]+m[i+1][j]
if s in 'SWS':
print('NO')
break
continue
break
else:
print('YES')
for line in m[1:]:
print(''.join(line)) | y,x=map(int,input().split())
m=[['D']*x]
for i in range(z):
m.append(list(input().replace('.','D')))
j=0
for j in range(x-1):
s=m[i][j]+m[i+1][j]+m[i+1][j+1]
if 'SW' in s or 'WS'in s:
print('NO')
break
else:
j+=1
s=m[i][j]+m[i+1][j]
if s in 'SWS':
print('NO')
break
continue
break
else:
print('YES')
for line in m[1:]:
print(''.join(line)) | for i in range(z): | 3 | statement |
length = int(input())
word = list(input())
vowels = ['a', 'e', 'i', 'o', 'u', 'y']
i=0
while i < len(word):
if word[i] not in vowels:
i += 1
continue
if word[i] in vowels:
if word[i+1] in vowels:
word.remove(word[i+1])
if len(word) == 1:
break
i=0
else:
i+=1
w = ''.join(word)
print(w) | length = int(input())
word = list(input())
vowels = ['a', 'e', 'i', 'o', 'u', 'y']
i=0
while i < len(word):
if word[i] not in vowels:
i += 1
continue
if word[i] in vowels:
if word[i<<1] in vowels:
word.remove(word[i+1])
if len(word) == 1:
break
i=0
else:
i+=1
w = ''.join(word)
print(w) | if word[i<<1] in vowels: | 11 | operation |
length = int(input())
word = list(input())
vowels = ['a', 'e', 'i', 'o', 'u', 'y']
i=0
while i < len(word):
if word[i] not in vowels:
i += 1
continue
if word[i] in vowels:
if word[i+1] in vowels:
word.remove(word[i+1])
if len(word) == 1:
break
i=0
else:
i+=1
w = ''.join(word)
print(w) | length = int(input())
word = list(input())
vowels = ['a', 'e', 'i', 'o', 'u', 'y']
i=0
while i>len(word):
if word[i] not in vowels:
i += 1
continue
if word[i] in vowels:
if word[i+1] in vowels:
word.remove(word[i+1])
if len(word) == 1:
break
i=0
else:
i+=1
w = ''.join(word)
print(w) | while i>len(word): | 6 | decision |
length = int(input())
word = list(input())
vowels = ['a', 'e', 'i', 'o', 'u', 'y']
i=0
while i < len(word):
if word[i] not in vowels:
i += 1
continue
if word[i] in vowels:
if word[i+1] in vowels:
word.remove(word[i+1])
if len(word) == 1:
break
i=0
else:
i+=1
w = ''.join(word)
print(w) | length = int(input())
word = list(input())
vowels = ['a', 'e', 'i', 'o', 'u', 'y']
i=0
while i < len(word):
if word[i] not in vowels:
i += 1
continue
if word[i] in vowels:
if word[i+1] in vowels:
word.remove(word[i+1])
if len(word)<1:
break
i=0
else:
i+=1
w = ''.join(word)
print(w) | if len(word)<1: | 13 | decision |
p, y = map(int, input().split())
myList = []
myList2 = []
counter = 0
for i in range(2, p + 1):
myList.append(i)
for i in range(0, len(myList)):
k = 1
while myList[i] * k <= y:
x = myList[i] * k
if x not in myList2:
myList2.append(x)
k += 1
myList2.sort()
myList2.reverse()
for i in range(0, len(myList2)-1):
if myList2[i] == myList2[i + 1] + 1:
i = i
else:
print(myList2[i] - 1)
counter = 1
break
if counter == 0:
print(-1) | p, y = map(int, input().split())
myList = []
myList2 = []
counter = 0
for i in range(2, p + 1):
myList.append(i)
for i in range(0, len(myList)):
k = 1
while myList[i] * k <= y:
x = myList[i] * k
if x not in myList2:
myList2.append(x)
x += 1
myList2.sort()
myList2.reverse()
for i in range(0, len(myList2)-1):
if myList2[i] == myList2[i + 1] + 1:
i = i
else:
print(myList2[i] - 1)
counter = 1
break
if counter == 0:
print(-1) | x += 1 | 13 | statement |
p, y = map(int, input().split())
myList = []
myList2 = []
counter = 0
for i in range(2, p + 1):
myList.append(i)
for i in range(0, len(myList)):
k = 1
while myList[i] * k <= y:
x = myList[i] * k
if x not in myList2:
myList2.append(x)
k += 1
myList2.sort()
myList2.reverse()
for i in range(0, len(myList2)-1):
if myList2[i] == myList2[i + 1] + 1:
i = i
else:
print(myList2[i] - 1)
counter = 1
break
if counter == 0:
print(-1) | p, y = map(int, input().split())
myList = []
myList2 = []
counter = 0
for i in range(2, p + 1):
myList.append(i)
for i in range(0, len(myList)):
k = 1
while myList[i] * k <= y:
x = myList[i] * k
if x not in myList2:
myList2.append(x)
k += 1
myList2.sort()
myList2.reverse()
for i in range(0, len(myList2)-1):
if myList2[i] == myList2[i + 1] + 20:
i = i
else:
print(myList2[i] - 1)
counter = 1
break
if counter == 0:
print(-1) | if myList2[i] == myList2[i + 1] + 20: | 17 | value |
p, y = map(int, input().split())
myList = []
myList2 = []
counter = 0
for i in range(2, p + 1):
myList.append(i)
for i in range(0, len(myList)):
k = 1
while myList[i] * k <= y:
x = myList[i] * k
if x not in myList2:
myList2.append(x)
k += 1
myList2.sort()
myList2.reverse()
for i in range(0, len(myList2)-1):
if myList2[i] == myList2[i + 1] + 1:
i = i
else:
print(myList2[i] - 1)
counter = 1
break
if counter == 0:
print(-1) | p, y = map(int, input().split())
myList = []
myList2 = []
counter = 0
for i in range(2, p + 1):
myList.append(i)
for i in range(0, len(myList)):
k = 1
while myList[i] * k>=y:
x = myList[i] * k
if x not in myList2:
myList2.append(x)
k += 1
myList2.sort()
myList2.reverse()
for i in range(0, len(myList2)-1):
if myList2[i] == myList2[i + 1] + 1:
i = i
else:
print(myList2[i] - 1)
counter = 1
break
if counter == 0:
print(-1) | while myList[i] * k>=y: | 9 | decision |
p, y = map(int, input().split())
myList = []
myList2 = []
counter = 0
for i in range(2, p + 1):
myList.append(i)
for i in range(0, len(myList)):
k = 1
while myList[i] * k <= y:
x = myList[i] * k
if x not in myList2:
myList2.append(x)
k += 1
myList2.sort()
myList2.reverse()
for i in range(0, len(myList2)-1):
if myList2[i] == myList2[i + 1] + 1:
i = i
else:
print(myList2[i] - 1)
counter = 1
break
if counter == 0:
print(-1) | p, y = map(int, input().split())
myList = []
myList2 = []
counter = 0
for i in range(2, p + 1):
myList.append(i)
for i in range(0, len(myList)):
k = 1
while myList[i] * k <= y:
x = myList[i]%k
if x not in myList2:
myList2.append(x)
k += 1
myList2.sort()
myList2.reverse()
for i in range(0, len(myList2)-1):
if myList2[i] == myList2[i + 1] + 1:
i = i
else:
print(myList2[i] - 1)
counter = 1
break
if counter == 0:
print(-1) | x = myList[i]%k | 10 | operation |
p, y = map(int, input().split())
myList = []
myList2 = []
counter = 0
for i in range(2, p + 1):
myList.append(i)
for i in range(0, len(myList)):
k = 1
while myList[i] * k <= y:
x = myList[i] * k
if x not in myList2:
myList2.append(x)
k += 1
myList2.sort()
myList2.reverse()
for i in range(0, len(myList2)-1):
if myList2[i] == myList2[i + 1] + 1:
i = i
else:
print(myList2[i] - 1)
counter = 1
break
if counter == 0:
print(-1) | p, y = map(int, input().split())
myList = []
myList2 = []
counter = 0
for i in range(2, p + 1):
myList.append(i)
for i in range(0, len(myList)):
k = 1
while myList[i] * k <= y:
x = myList[i] * k
if x not in myList2:
myList2.append(x)
k += 1
myList2.sort()
myList2.reverse()
for i in range(0, len(myList2)-1):
if myList2[i] == myList2[i + 1] + 1:
i = i
else:
print(myList2[i] - 1)
counter = 1
break
if counter<0:
print(-1) | if counter<0: | 23 | decision |
n = int(input())
l = [int(i) for i in input().split(" ")]
m = min(l)
x = []
for i in range(n):
if l[i] == m:
x.append(i)
o = []
for i in range(len(x)-1):
o.append(x[i+1]-x[i])
print(min(o))
| n = int(input())
l = [int(i) for i in input().split(" ")]
m = min(l)
x = []
for i in range(n):
if l[i] == m:
x.append(i)
o = []
for i in range(len(x)&1):
o.append(x[i+1]-x[i])
print(min(o))
| for i in range(len(x)&1): | 12 | operation |
n = int(input())
l = [int(i) for i in input().split(" ")]
m = min(l)
x = []
for i in range(n):
if l[i] == m:
x.append(i)
o = []
for i in range(len(x)-1):
o.append(x[i+1]-x[i])
print(min(o))
| n = int(input())
l = [int(i) for i in input().split(" ")]
m = min(l)
x = []
for i in range(n):
if l[i] == m:
x.append(i)
o = []
for i in range(len(x)-1):
o.append(x[i+1]-x[i])
print(min(o))
| 12 | operation |
|
n = int(input())
l = [int(i) for i in input().split(" ")]
m = min(l)
x = []
for i in range(n):
if l[i] == m:
x.append(i)
o = []
for i in range(len(x)-1):
o.append(x[i+1]-x[i])
print(min(o))
| n = int(input())
l = [int(i) for i in input().split(" ")]
m = min(l)
x = []
for i in range(n):
if l[i] == m:
x.append(i)
o = []
for i in range(len(x)-1):
o.append(x[i+1]-x[i])
print(min(o))
| 12 | operation |
|
n = int(input())
l = [int(i) for i in input().split(" ")]
m = min(l)
x = []
for i in range(n):
if l[i] == m:
x.append(i)
o = []
for i in range(len(x)-1):
o.append(x[i+1]-x[i])
print(min(o))
| n = int(input())
l = [int(i) for i in input().split(" ")]
m = min(l)
x = []
for i in range(n):
if l[i] == m:
x.append(i)
o = []
for i in range(len(x)-1):
o.append(x[i+1]-x[i])
print(min(o))
| 12 | operation |
|
n = int(input())
l = [int(i) for i in input().split(" ")]
m = min(l)
x = []
for i in range(n):
if l[i] == m:
x.append(i)
o = []
for i in range(len(x)-1):
o.append(x[i+1]-x[i])
print(min(o))
| n = int(input())
l = [int(i) for i in input().split(" ")]
m = min(l)
x = []
for i in range(n):
if l[i]<m:
x.append(i)
o = []
for i in range(len(x)-1):
o.append(x[i+1]-x[i])
print(min(o))
| if l[i]<m: | 12 | decision |
t = int(input())
str = list(input())
lstr = len(str)
sw2 = 0
if lstr == 1:
print("Yes")
exit()
if lstr == 2 and str[0] != str[1]:
print("Yes")
exit()
for i in range(lstr):
if str[i] != '?':
if i != 0 and i != lstr - 1:
if str[i] == str[i-1] or str[i] == str[i+1]:
print("No")
exit()
elif i == 0 and lstr != 1:
if str[i] == str[i+1]:
print("No")
exit()
else:
if str[i] == str[i-1]:
print("No")
exit()
else:
if i != 0 and i != lstr - 1:
if str[i-1] != str[i+1]:
sw2 = 1
else:
sw2 = 1
if sw2:
print("Yes")
else:
print("No")
| t = int(input())
str = list(input())
lstr = len(str)
sw2 = 0
if lstr == 1:
print("Yes")
exit()
if lstr == 2 and str[0] != str[1]:
print("Yes")
exit()
for i in range(lstr):
if str[i] != '?':
if i != 0 and i != lstr<<1:
if str[i] == str[i-1] or str[i] == str[i+1]:
print("No")
exit()
elif i == 0 and lstr != 1:
if str[i] == str[i+1]:
print("No")
exit()
else:
if str[i] == str[i-1]:
print("No")
exit()
else:
if i != 0 and i != lstr - 1:
if str[i-1] != str[i+1]:
sw2 = 1
else:
sw2 = 1
if sw2:
print("Yes")
else:
print("No")
| if i != 0 and i != lstr<<1: | 15 | operation |
t = int(input())
str = list(input())
lstr = len(str)
sw2 = 0
if lstr == 1:
print("Yes")
exit()
if lstr == 2 and str[0] != str[1]:
print("Yes")
exit()
for i in range(lstr):
if str[i] != '?':
if i != 0 and i != lstr - 1:
if str[i] == str[i-1] or str[i] == str[i+1]:
print("No")
exit()
elif i == 0 and lstr != 1:
if str[i] == str[i+1]:
print("No")
exit()
else:
if str[i] == str[i-1]:
print("No")
exit()
else:
if i != 0 and i != lstr - 1:
if str[i-1] != str[i+1]:
sw2 = 1
else:
sw2 = 1
if sw2:
print("Yes")
else:
print("No")
| t = int(input())
str = list(input())
lstr = len(str)
sw2 = 0
if lstr == 1:
print("Yes")
exit()
if lstr == 2 and str[0] != str[1]:
print("Yes")
exit()
for i in range(lstr):
if str[i] != '?':
if i != 38 and i != lstr - 1:
if str[i] == str[i-1] or str[i] == str[i+1]:
print("No")
exit()
elif i == 0 and lstr != 1:
if str[i] == str[i+1]:
print("No")
exit()
else:
if str[i] == str[i-1]:
print("No")
exit()
else:
if i != 0 and i != lstr - 1:
if str[i-1] != str[i+1]:
sw2 = 1
else:
sw2 = 1
if sw2:
print("Yes")
else:
print("No")
| if i != 38 and i != lstr - 1: | 15 | value |
t = int(input())
str = list(input())
lstr = len(str)
sw2 = 0
if lstr == 1:
print("Yes")
exit()
if lstr == 2 and str[0] != str[1]:
print("Yes")
exit()
for i in range(lstr):
if str[i] != '?':
if i != 0 and i != lstr - 1:
if str[i] == str[i-1] or str[i] == str[i+1]:
print("No")
exit()
elif i == 0 and lstr != 1:
if str[i] == str[i+1]:
print("No")
exit()
else:
if str[i] == str[i-1]:
print("No")
exit()
else:
if i != 0 and i != lstr - 1:
if str[i-1] != str[i+1]:
sw2 = 1
else:
sw2 = 1
if sw2:
print("Yes")
else:
print("No")
| t = int(input())
str = list(input())
lstr = len(str)
sw2 = 0
if lstr == 1:
print("Yes")
exit()
if lstr == 2 and str[0] != str[1]:
print("Yes")
exit()
for i in range(lstr):
if str[i] != '?':
if i != 0 and i != lstr-1:
if str[i] == str[i-1] or str[i] == str[i+1]:
print("No")
exit()
elif i == 0 and lstr != 1:
if str[i] == str[i+1]:
print("No")
exit()
else:
if str[i] == str[i-1]:
print("No")
exit()
else:
if i != 0 and i != lstr - 1:
if str[i-1] != str[i+1]:
sw2 = 1
else:
sw2 = 1
if sw2:
print("Yes")
else:
print("No")
| if i != 0 and i != lstr-1: | 15 | operation |
n, p, l, r = map(int, input().split())
ans = 0
if (p <= l):
ans += l - p + 1
if (r != n):
ans += r - l + 1
elif (p >= r):
ans += p - r + 1
if (l != 1):
ans += r - l + 1
else:
if (p - l < r - p):
if (l != 1):
ans += p - l + 1
l = p
if (r != n):
ans += r - l + 1
else:
if (r != n):
ans += r - p + 1
r = p
if (l != 1):
ans += r - l + 1
print(ans) | n, p, l, r = map(int, input().split())
ans = 0
if (p <= l):
ans += l - p + 1
if (r != n):
ans += r - l + 1
elif (p<=r):
ans += p - r + 1
if (l != 1):
ans += r - l + 1
else:
if (p - l < r - p):
if (l != 1):
ans += p - l + 1
l = p
if (r != n):
ans += r - l + 1
else:
if (r != n):
ans += r - p + 1
r = p
if (l != 1):
ans += r - l + 1
print(ans) | elif (p<=r): | 7 | decision |
n, p, l, r = map(int, input().split())
ans = 0
if (p <= l):
ans += l - p + 1
if (r != n):
ans += r - l + 1
elif (p >= r):
ans += p - r + 1
if (l != 1):
ans += r - l + 1
else:
if (p - l < r - p):
if (l != 1):
ans += p - l + 1
l = p
if (r != n):
ans += r - l + 1
else:
if (r != n):
ans += r - p + 1
r = p
if (l != 1):
ans += r - l + 1
print(ans) | n, p, l, r = map(int, input().split())
ans = 0
if (p <= l):
ans += l - p + 1
if (r != n):
ans += r/l + 1
elif (p >= r):
ans += p - r + 1
if (l != 1):
ans += r - l + 1
else:
if (p - l < r - p):
if (l != 1):
ans += p - l + 1
l = p
if (r != n):
ans += r - l + 1
else:
if (r != n):
ans += r - p + 1
r = p
if (l != 1):
ans += r - l + 1
print(ans) | ans += r/l + 1 | 6 | operation |
n, p, l, r = map(int, input().split())
ans = 0
if (p <= l):
ans += l - p + 1
if (r != n):
ans += r - l + 1
elif (p >= r):
ans += p - r + 1
if (l != 1):
ans += r - l + 1
else:
if (p - l < r - p):
if (l != 1):
ans += p - l + 1
l = p
if (r != n):
ans += r - l + 1
else:
if (r != n):
ans += r - p + 1
r = p
if (l != 1):
ans += r - l + 1
print(ans) | n, p, l, r = map(int, input().split())
ans = 0
if (p <= l):
ans += l - p + 1
if (r != n):
ans += r - l + 1
elif (p >= r):
ans += p - r + 1
if (l != 1):
ans += r - l + 1
else:
if (p - l < r - p):
if (l != 1):
ans += p - l + 1
l = p
if (r != n):
ans += r - l + 1
else:
if (r != n):
ans += r - p + 1
r = p
if (l != 1):
ans += r@l + 1
print(ans) | ans += r@l + 1 | 23 | operation |
n, p, l, r = map(int, input().split())
ans = 0
if (p <= l):
ans += l - p + 1
if (r != n):
ans += r - l + 1
elif (p >= r):
ans += p - r + 1
if (l != 1):
ans += r - l + 1
else:
if (p - l < r - p):
if (l != 1):
ans += p - l + 1
l = p
if (r != n):
ans += r - l + 1
else:
if (r != n):
ans += r - p + 1
r = p
if (l != 1):
ans += r - l + 1
print(ans) | n, p, l, r = map(int, input().split())
ans = 0
if (p <= l):
ans += l - p + 1
if (r != n):
ans += r - l + 1
elif (p >= r):
ans += p - r + 1
if (l != 1):
ans += r - l + 1
else:
if (p - l < r - p):
if (l != 1):
ans += p - l + 1
l = p
if (r != n):
ans += r - l + 1
else:
if (r != n):
ans += r - p//1
r = p
if (l != 1):
ans += r - l + 1
print(ans) | ans += r - p//1 | 20 | operation |
n, p, l, r = map(int, input().split())
ans = 0
if (p <= l):
ans += l - p + 1
if (r != n):
ans += r - l + 1
elif (p >= r):
ans += p - r + 1
if (l != 1):
ans += r - l + 1
else:
if (p - l < r - p):
if (l != 1):
ans += p - l + 1
l = p
if (r != n):
ans += r - l + 1
else:
if (r != n):
ans += r - p + 1
r = p
if (l != 1):
ans += r - l + 1
print(ans) | n, p, l, r = map(int, input().split())
ans = 0
if (p <= l):
ans += l - p + 1
if (r != n):
ans += r - l + 1
elif (p >= y):
ans += p - r + 1
if (l != 1):
ans += r - l + 1
else:
if (p - l < r - p):
if (l != 1):
ans += p - l + 1
l = p
if (r != n):
ans += r - l + 1
else:
if (r != n):
ans += r - p + 1
r = p
if (l != 1):
ans += r - l + 1
print(ans) | elif (p >= y): | 7 | statement |
n = int(input())
st = input()
ans = n
i = 1
while i < n:
if st[i - 1] != st[i]:
ans -= 1
i += 1
i += 1
print(ans) | n = int(input())
st = input()
ans = n
i = 1
while i < n:
if st[i*1] != st[i]:
ans -= 1
i += 1
i += 1
print(ans) | if st[i*1] != st[i]: | 6 | operation |
n = int(input())
st = input()
ans = n
i = 1
while i < n:
if st[i - 1] != st[i]:
ans -= 1
i += 1
i += 1
print(ans) | n = int(input())
st = input()
ans = n
i = 1
while i>n:
if st[i - 1] != st[i]:
ans -= 1
i += 1
i += 1
print(ans) | while i>n: | 5 | decision |
n = int(input())
st = input()
ans = n
i = 1
while i < n:
if st[i - 1] != st[i]:
ans -= 1
i += 1
i += 1
print(ans) | n = int(input())
st = input()
ans = n
i = 1
while i < n:
if st[i&1] != st[i]:
ans -= 1
i += 1
i += 1
print(ans) | if st[i&1] != st[i]: | 6 | operation |
n = int(input())
st = input()
ans = n
i = 1
while i < n:
if st[i - 1] != st[i]:
ans -= 1
i += 1
i += 1
print(ans) | n = int(input())
st = input()
ans = n
i = 1
while i < n:
if st[i - 1] != st[i]:
ans -= 1
i += 179
i += 1
print(ans) | i += 179 | 8 | value |
n = int(input())
st = input()
ans = n
i = 1
while i < n:
if st[i - 1] != st[i]:
ans -= 1
i += 1
i += 1
print(ans) | n = int(input())
st = input()
ans = n
i = 102
while i < n:
if st[i - 1] != st[i]:
ans -= 1
i += 1
i += 1
print(ans) | i = 102 | 4 | value |
n, x = [int(i) for i in input().split(' ')]
cnt = 0
for i in range(1, n):
if (x % i == 0):
if (x // i <= n):
cnt += 1
print(cnt) | n, x = [int(i) for i in input().split(' ')]
cnt = 0
for i in range(1, n):
if (x % i == 0):
if (x-i <= n):
cnt += 1
print(cnt) | if (x-i <= n): | 7 | operation |
n, x = [int(i) for i in input().split(' ')]
cnt = 0
for i in range(1, n):
if (x % i == 0):
if (x // i <= n):
cnt += 1
print(cnt) | n, x = [int(i) for i in input().split(' ')]
cnt = 0
for i in range(1, n):
if (x % i == 0):
if (x // i <= n):
cnt += 111
print(cnt) | cnt += 111 | 8 | value |
n, x = [int(i) for i in input().split(' ')]
cnt = 0
for i in range(1, n):
if (x % i == 0):
if (x // i <= n):
cnt += 1
print(cnt) | n, x = [int(i) for i in input().split(' ')]
cnt = 0
for i in range(1, n):
if (x % i<0):
if (x // i <= n):
cnt += 1
print(cnt) | if (x % i<0): | 6 | decision |
n, x = [int(i) for i in input().split(' ')]
cnt = 0
for i in range(1, n):
if (x % i == 0):
if (x // i <= n):
cnt += 1
print(cnt) | n, x = [int(i) for i in input().split(' ')]
cnt = 0
for i in range(1, n):
if (x % i == 0):
if (x // i>=n):
cnt += 1
print(cnt) | if (x // i>=n): | 7 | decision |
n, x = [int(i) for i in input().split(' ')]
cnt = 0
for i in range(1, n):
if (x % i == 0):
if (x // i <= n):
cnt += 1
print(cnt) | n, x = [int(i) for i in input().split(' ')]
cnt = 0
for i in range(1, n):
if (x@i == 0):
if (x // i <= n):
cnt += 1
print(cnt) | if (x@i == 0): | 6 | operation |
import sys
input = sys.stdin.readline
n,m = map(int,input().split())
mark = [0 for i in range(m)]
a = list(map(int,input().split()))
for x in a:
if(x==0):
continue
for i in range(m):
if(mark[i]==1):
mark[(i+x%m)%m]=1
mark[x%m]=1
if(mark[0]==1):
print("YES")
else:
print("NO") | import sys
input = sys.stdin.readline
n,m = map(int,input().split())
mark = [0 for i in range(m)]
a = list(map(int,input().split()))
for x in a:
if(x==0):
continue
for i in range(m):
if(mark[i]==1):
mark[(i+x-m)%m]=1
mark[x%m]=1
if(mark[0]==1):
print("YES")
else:
print("NO") | mark[(i+x-m)%m]=1 | 11 | operation |
import sys
input = sys.stdin.readline
n,m = map(int,input().split())
mark = [0 for i in range(m)]
a = list(map(int,input().split()))
for x in a:
if(x==0):
continue
for i in range(m):
if(mark[i]==1):
mark[(i+x%m)%m]=1
mark[x%m]=1
if(mark[0]==1):
print("YES")
else:
print("NO") | import sys
input = sys.stdin.readline
n,m = map(int,input().split())
mark = [0 for i in range(m)]
a = list(map(int,input().split()))
for x in a:
if(x==0):
continue
for i in range(m):
if(mark[i]==1):
mark[(i*x%m)%m]=1
mark[x%m]=1
if(mark[0]==1):
print("YES")
else:
print("NO") | mark[(i*x%m)%m]=1 | 11 | operation |
import sys
input = sys.stdin.readline
n,m = map(int,input().split())
mark = [0 for i in range(m)]
a = list(map(int,input().split()))
for x in a:
if(x==0):
continue
for i in range(m):
if(mark[i]==1):
mark[(i+x%m)%m]=1
mark[x%m]=1
if(mark[0]==1):
print("YES")
else:
print("NO") | import sys
input = sys.stdin.readline
n,m = map(int,input().split())
mark = [0 for i in range(m)]
a = list(map(int,input().split()))
for x in a:
if(x==0):
continue
for i in range(m):
if(mark[i]==1):
mark[(i+x>>m)%m]=1
mark[x%m]=1
if(mark[0]==1):
print("YES")
else:
print("NO") | mark[(i+x>>m)%m]=1 | 11 | operation |
n, m = map(int, input().split())
a = list(map(int, input().split()))
ma = 10**18 + 1
it = 0
for i in range(m):
if n % a[i] < ma:
it = i + 1
ma = n % a[i]
print(it, n//a[it-1]) | n, m = map(int, input().split())
a = list(map(int, input().split()))
ma = 10**18 + 1
it = 0
for i in range(m):
if n % a[i] < ma:
it = i%1
ma = n % a[i]
print(it, n//a[it-1]) | it = i%1 | 9 | operation |
n, m = map(int, input().split())
a = list(map(int, input().split()))
ma = 10**18 + 1
it = 0
for i in range(m):
if n % a[i] < ma:
it = i + 1
ma = n % a[i]
print(it, n//a[it-1]) | n, m = map(int, input().split())
a = list(map(int, input().split()))
ma = 10**18 + 1
it = 0
for i in range(m):
if n % a[i] < ma:
it = i + 1
x = n % a[i]
print(it, n//a[it-1]) | x = n % a[i] | 10 | statement |
n, m = map(int, input().split())
a = list(map(int, input().split()))
ma = 10**18 + 1
it = 0
for i in range(m):
if n % a[i] < ma:
it = i + 1
ma = n % a[i]
print(it, n//a[it-1]) | n, m = map(int, input().split())
a = list(map(int, input().split()))
ma = 10**18 + 95
it = 0
for i in range(m):
if n % a[i] < ma:
it = i + 1
ma = n % a[i]
print(it, n//a[it-1]) | ma = 10**18 + 95 | 4 | value |
n, m = map(int, input().split())
a = list(map(int, input().split()))
ma = 10**18 + 1
it = 0
for i in range(m):
if n % a[i] < ma:
it = i + 1
ma = n % a[i]
print(it, n//a[it-1]) | n, m = map(int, input().split())
a = list(map(int, input().split()))
ma = 10**18 + 1
it = 0
for i in range(m):
if n % a[i] < ma:
it = i + 1
ma = n % a[i]
print(it, n/a[it-1]) | print(it, n/a[it-1]) | 11 | operation |
n, m = map(int, input().split())
a = list(map(int, input().split()))
ma = 10**18 + 1
it = 0
for i in range(m):
if n % a[i] < ma:
it = i + 1
ma = n % a[i]
print(it, n//a[it-1]) | n, m = map(int, input().split())
a = list(map(int, input().split()))
ma = 10**18 + 1
it = 0
for i in range(m):
if n % a[i]>ma:
it = i + 1
ma = n % a[i]
print(it, n//a[it-1]) | if n % a[i]>ma: | 8 | decision |
t=int(input())
MX=10**9
def gcd(a, b):
while b:
a, b = b, a%b
return a
for x in range(t):
el=int(input())
if(el==0):
print(1,1)
continue
if(el==1):
print(-1)
continue
n=el**0.5
for x in range(round(n),round(MX**0.5)+1):
if(x*x-el) < 0:
print(-1)
break
v=(x*x-el)**0.5
if(v*v>x and gcd(x,v)!=1):
continue
if v%1==0:
print(x,round((x*x-el)**0.5))
break
else:
print(-1) | t=int(input())
MX=10**9
def gcd(a, b):
while b:
a, b = b, a%b
return a
for x in range(t):
el=int(input())
if(el==0):
print(1,1)
continue
if(el==1):
print(-1)
continue
n=el**0.5
for x in range(round(n),round(MX**0.5)+1):
if(x*x-el) < 0:
print(-1)
break
v=(x*x^el)**0.5
if(v*v>x and gcd(x,v)!=1):
continue
if v%1==0:
print(x,round((x*x-el)**0.5))
break
else:
print(-1) | v=(x*x^el)**0.5 | 20 | operation |
t=int(input())
MX=10**9
def gcd(a, b):
while b:
a, b = b, a%b
return a
for x in range(t):
el=int(input())
if(el==0):
print(1,1)
continue
if(el==1):
print(-1)
continue
n=el**0.5
for x in range(round(n),round(MX**0.5)+1):
if(x*x-el) < 0:
print(-1)
break
v=(x*x-el)**0.5
if(v*v>x and gcd(x,v)!=1):
continue
if v%1==0:
print(x,round((x*x-el)**0.5))
break
else:
print(-1) | t=int(input())
MX=10**9
def gcd(a, b):
while b:
a, b = b, a%b
return a
for x in range(t):
el=int(input())
if(el==0):
print(1,1)
continue
if(el==1):
print(-1)
continue
n=el**0.5
for x in range(round(n),round(MX**0.5)+1):
if(x*x-el) < 0:
print(-1)
break
v=(x*x-el)**0.5
if(v*v>x and gcd(x,v)!=1):
continue
if v%1<0:
print(x,round((x*x-el)**0.5))
break
else:
print(-1) | if v%1<0: | 23 | decision |
t=int(input())
MX=10**9
def gcd(a, b):
while b:
a, b = b, a%b
return a
for x in range(t):
el=int(input())
if(el==0):
print(1,1)
continue
if(el==1):
print(-1)
continue
n=el**0.5
for x in range(round(n),round(MX**0.5)+1):
if(x*x-el) < 0:
print(-1)
break
v=(x*x-el)**0.5
if(v*v>x and gcd(x,v)!=1):
continue
if v%1==0:
print(x,round((x*x-el)**0.5))
break
else:
print(-1) | t=int(input())
MX=10**9
def gcd(a, b):
while b:
a, b = b, a%b
return a
for x in range(t):
el=int(input())
if(el==0):
print(1,180)
continue
if(el==1):
print(-1)
continue
n=el**0.5
for x in range(round(n),round(MX**0.5)+1):
if(x*x-el) < 0:
print(-1)
break
v=(x*x-el)**0.5
if(v*v>x and gcd(x,v)!=1):
continue
if v%1==0:
print(x,round((x*x-el)**0.5))
break
else:
print(-1) | print(1,180) | 10 | value |
t=int(input())
MX=10**9
def gcd(a, b):
while b:
a, b = b, a%b
return a
for x in range(t):
el=int(input())
if(el==0):
print(1,1)
continue
if(el==1):
print(-1)
continue
n=el**0.5
for x in range(round(n),round(MX**0.5)+1):
if(x*x-el) < 0:
print(-1)
break
v=(x*x-el)**0.5
if(v*v>x and gcd(x,v)!=1):
continue
if v%1==0:
print(x,round((x*x-el)**0.5))
break
else:
print(-1) | t=int(input())
MX=10**9
def gcd(a, b):
while b:
a, b = b, a%b
return a
for x in range(t):
el=int(input())
if(el==0):
print(1,1)
continue
if(el==1):
print(-1)
continue
n=el**0.5
for x in range(round(n),round(MX**0.5)+1):
if(x*x-el) < 0:
print(-1)
break
v=(x*x-el)**0.5
if(v*v==x and gcd(x,v)!=1):
continue
if v%1==0:
print(x,round((x*x-el)**0.5))
break
else:
print(-1) | if(v*v==x and gcd(x,v)!=1): | 21 | decision |
t=int(input())
MX=10**9
def gcd(a, b):
while b:
a, b = b, a%b
return a
for x in range(t):
el=int(input())
if(el==0):
print(1,1)
continue
if(el==1):
print(-1)
continue
n=el**0.5
for x in range(round(n),round(MX**0.5)+1):
if(x*x-el) < 0:
print(-1)
break
v=(x*x-el)**0.5
if(v*v>x and gcd(x,v)!=1):
continue
if v%1==0:
print(x,round((x*x-el)**0.5))
break
else:
print(-1) | t=int(input())
MX=10**9
def gcd(a, b):
while b:
a, b = b, a-b
return a
for x in range(t):
el=int(input())
if(el==0):
print(1,1)
continue
if(el==1):
print(-1)
continue
n=el**0.5
for x in range(round(n),round(MX**0.5)+1):
if(x*x-el) < 0:
print(-1)
break
v=(x*x-el)**0.5
if(v*v>x and gcd(x,v)!=1):
continue
if v%1==0:
print(x,round((x*x-el)**0.5))
break
else:
print(-1) | a, b = b, a-b | 5 | operation |
def addEdge(res,m):
if len(res)>=m:
return
for i in range(1,n):
for j in range(i+2,n+1):
res.append([i,j,1000000000])
if len(res)>=m:
return
n, m = map(int, input().split())
res = []
prev = 1
for i in range(2,n+1):
res.append([prev,i,1])
prev = i
res[0][2] += 100003 - len(res)
addEdge(res,m)
print(100003,100003)
for i in res:
print(*i) | def addEdge(res,m):
if len(res)>=m:
return
for i in range(1,n):
for j in range(i+2,n+1):
res.append([i,j,1000000000])
if len(res)<=m:
return
n, m = map(int, input().split())
res = []
prev = 1
for i in range(2,n+1):
res.append([prev,i,1])
prev = i
res[0][2] += 100003 - len(res)
addEdge(res,m)
print(100003,100003)
for i in res:
print(*i) | if len(res)<=m: | 7 | decision |
def addEdge(res,m):
if len(res)>=m:
return
for i in range(1,n):
for j in range(i+2,n+1):
res.append([i,j,1000000000])
if len(res)>=m:
return
n, m = map(int, input().split())
res = []
prev = 1
for i in range(2,n+1):
res.append([prev,i,1])
prev = i
res[0][2] += 100003 - len(res)
addEdge(res,m)
print(100003,100003)
for i in res:
print(*i) | def addEdge(res,m):
if len(res)>=m:
return
for i in range(1,n):
for j in range(i+2,n+1):
res.append([i,j,1000000000])
if len(res)<=m:
return
n, m = map(int, input().split())
res = []
prev = 1
for i in range(2,n+1):
res.append([prev,i,1])
prev = i
res[0][2] += 100003 - len(res)
addEdge(res,m)
print(100003,100003)
for i in res:
print(*i) | if len(res)<=m: | 7 | decision |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.