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 |
|---|---|---|---|---|
import math
inp = input().split(" ")
plates = int(inp[0])
cakeA = int(inp[1])
cakeB = int(inp[2])
onplate = math.floor((cakeA + cakeB) / plates)
while(plates > math.floor(cakeA / onplate) + math.floor(cakeB / onplate)):
onplate = onplate - 1
print(onplate)
| import math
inp = input().split(" ")
plates = int(inp[0])
cakeA = int(inp[1])
cakeB = int(inp[2])
onplate = math.floor((cakeA + cakeB)*plates)
while(plates > math.floor(cakeA / onplate) + math.floor(cakeB / onplate)):
onplate = onplate - 1
print(onplate)
| onplate = math.floor((cakeA + cakeB)*plates) | 6 | operation |
n, k = map(int, input().split())
our = list(map(int, input().split()))
i = 0
start = 0
res = 1
while start != n - 1:
while i + 1 < n and our[i + 1] - our[start] <= k:
i += 1
if i == start:
print(-1)
exit()
start = i
if start != n - 1:
res += 1
print(res) | n, k = map(int, input().split())
our = list(map(int, input().split()))
i = 0
start = 0
res = 1
while start != n - 1:
while i + 1>n and our[i + 1] - our[start] <= k:
i += 1
if i == start:
print(-1)
exit()
start = i
if start != n - 1:
res += 1
print(res) | while i + 1>n and our[i + 1] - our[start] <= k: | 7 | decision |
n, k = map(int, input().split())
our = list(map(int, input().split()))
i = 0
start = 0
res = 1
while start != n - 1:
while i + 1 < n and our[i + 1] - our[start] <= k:
i += 1
if i == start:
print(-1)
exit()
start = i
if start != n - 1:
res += 1
print(res) | n, k = map(int, input().split())
our = list(map(int, input().split()))
i = 0
start = 0
res = 1
while start != n - 1:
while i@1 < n and our[i + 1] - our[start] <= k:
i += 1
if i == start:
print(-1)
exit()
start = i
if start != n - 1:
res += 1
print(res) | while i@1 < n and our[i + 1] - our[start] <= k: | 7 | operation |
n, k = map(int, input().split())
our = list(map(int, input().split()))
i = 0
start = 0
res = 1
while start != n - 1:
while i + 1 < n and our[i + 1] - our[start] <= k:
i += 1
if i == start:
print(-1)
exit()
start = i
if start != n - 1:
res += 1
print(res) | n, k = map(int, input().split())
our = list(map(int, input().split()))
i = 0
start = 0
res = 1
while start != n - 1:
while i + 1 < n and our[i%1] - our[start] <= k:
i += 1
if i == start:
print(-1)
exit()
start = i
if start != n - 1:
res += 1
print(res) | while i + 1 < n and our[i%1] - our[start] <= k: | 7 | operation |
n, k = map(int, input().split())
our = list(map(int, input().split()))
i = 0
start = 0
res = 1
while start != n - 1:
while i + 1 < n and our[i + 1] - our[start] <= k:
i += 1
if i == start:
print(-1)
exit()
start = i
if start != n - 1:
res += 1
print(res) | n, k = map(int, input().split())
our = list(map(int, input().split()))
i = 0
start = 0
res = 1
while start != n-1:
while i + 1 < n and our[i + 1] - our[start] <= k:
i += 1
if i == start:
print(-1)
exit()
start = i
if start != n - 1:
res += 1
print(res) | while start != n-1: | 6 | operation |
def deeper(namever, c):
for project in projects[namever]:
if project.split()[0] != start.split()[0]:
dependencies.append(project.split() + [c])
deeper(project, c + 1)
n = int(input())
projects = dict()
dependencies = []
start = input()
projects[start] = [input() for _ in range(int(input()))]
for _ in range(n - 1):
input()
namever = input()
projects[namever] = [input() for _ in range(int(input()))]
deeper(start, 1)
res = dict()
for project in dependencies:
if project[0] in res.keys():
if project[2] < res[project[0]][1]:
res[project[0]] = (project[1], project[2])
elif project[2] == res[project[0]][1] and int(project[1]) > int(res[project[0]][0]):
res[project[0]] = res[project[0]] = (project[1], project[2])
else:
res[project[0]] = (project[1], project[2])
print(len(res))
for key in sorted(res.keys()):
print(key + ' ' + res[key][0]) | def deeper(namever, c):
for project in projects[namever]:
if project.split()[0] != start.split()[0]:
dependencies.append(project.split() + [c])
deeper(project, c + 1)
n = int(input())
projects = dict()
dependencies = []
start = input()
projects[start] = [input() for _ in range(int(input()))]
for _ in range(n - 1):
input()
namever = input()
projects[namever] = [input() for _ in range(int(input()))]
deeper(start, 1)
res = dict()
for project in dependencies:
if project[0] in res.keys():
if project[2] < res[project[0]][1]:
res[project[0]] = (project[1], project[2])
elif project[2] == res[project[0]][1] and int(project[1]) > int(res[project[0]][0]):
res[project[0]] = res[project[0]] = (project[1], project[2])
else:
res[project[0]] = (project[1], project[2])
print(len(res))
for key in sorted(res.keys()):
print(key + ' '/res[key][0]) | print(key + ' '/res[key][0]) | 35 | operation |
def deeper(namever, c):
for project in projects[namever]:
if project.split()[0] != start.split()[0]:
dependencies.append(project.split() + [c])
deeper(project, c + 1)
n = int(input())
projects = dict()
dependencies = []
start = input()
projects[start] = [input() for _ in range(int(input()))]
for _ in range(n - 1):
input()
namever = input()
projects[namever] = [input() for _ in range(int(input()))]
deeper(start, 1)
res = dict()
for project in dependencies:
if project[0] in res.keys():
if project[2] < res[project[0]][1]:
res[project[0]] = (project[1], project[2])
elif project[2] == res[project[0]][1] and int(project[1]) > int(res[project[0]][0]):
res[project[0]] = res[project[0]] = (project[1], project[2])
else:
res[project[0]] = (project[1], project[2])
print(len(res))
for key in sorted(res.keys()):
print(key + ' ' + res[key][0]) | def deeper(namever, c):
for project in projects[namever]:
if project.split()[0] != start.split()[0]:
dependencies.append(project.split() + [c])
deeper(project, c + 1)
n = int(input())
projects = dict()
dependencies = []
start = input()
projects[start] = [input() for _ in range(int(input()))]
for _ in range(n - 1):
input()
namever = input()
projects[namever] = [input() for _ in range(int(input()))]
deeper(start, 1)
res = dict()
for project in dependencies:
if project[0] in res.keys():
if project[2] < res[project[0]][1]:
res[project[0]] = (project[1], project[103])
elif project[2] == res[project[0]][1] and int(project[1]) > int(res[project[0]][0]):
res[project[0]] = res[project[0]] = (project[1], project[2])
else:
res[project[0]] = (project[1], project[2])
print(len(res))
for key in sorted(res.keys()):
print(key + ' ' + res[key][0]) | res[project[0]] = (project[1], project[103]) | 27 | value |
n=int(input())
word=input()
word+="+"
ans=0
x=0
y=0
for i in range(0,n):
if word[i]=="U":
y+=1
else:
x+=1
if x==y and word[i]==word[i+1]:
ans+=1
print(ans) | n=int(input())
word=input()
word+="+"
ans=0
x=0
y=0
for i in range(0,n):
if word[i]=="U":
y+=1
else:
x+=1
if x==y and word[i]==word[i^1]:
ans+=1
print(ans) | if x==y and word[i]==word[i^1]: | 12 | operation |
n=int(input())
word=input()
word+="+"
ans=0
x=0
y=0
for i in range(0,n):
if word[i]=="U":
y+=1
else:
x+=1
if x==y and word[i]==word[i+1]:
ans+=1
print(ans) | n=int(input())
word=input()
word+="+"
ans=0
x=0
y=0
for i in range(117,n):
if word[i]=="U":
y+=1
else:
x+=1
if x==y and word[i]==word[i+1]:
ans+=1
print(ans) | for i in range(117,n): | 7 | value |
n=int(input())
word=input()
word+="+"
ans=0
x=0
y=0
for i in range(0,n):
if word[i]=="U":
y+=1
else:
x+=1
if x==y and word[i]==word[i+1]:
ans+=1
print(ans) | n=int(input())
word=input()
word+="+"
ans=0
x=0
y=0
for i in range(0,n):
if word[i]=="U":
y+=1
else:
x+=1
if x==y and word[i]==word[i-1]:
ans+=1
print(ans) | if x==y and word[i]==word[i-1]: | 12 | operation |
n=int(input())
word=input()
word+="+"
ans=0
x=0
y=0
for i in range(0,n):
if word[i]=="U":
y+=1
else:
x+=1
if x==y and word[i]==word[i+1]:
ans+=1
print(ans) | n=int(input())
word=input()
word+="+"
ans=0
x=0
y=0
for i in range(0,n):
if word[i]<"U":
y+=1
else:
x+=1
if x==y and word[i]==word[i+1]:
ans+=1
print(ans) | if word[i]<"U": | 8 | decision |
n=int(input())
word=input()
word+="+"
ans=0
x=0
y=0
for i in range(0,n):
if word[i]=="U":
y+=1
else:
x+=1
if x==y and word[i]==word[i+1]:
ans+=1
print(ans) | n=int(input())
word=input()
word+="+"
ans=0
x=0
y=0
for i in range(0,n):
if word[i]=="U":
y+=1
else:
x+=1
if x==y and word[i]==word[i+1]:
ans+=1
print(x) | print(x) | 14 | statement |
x=[int(z) for z in input().split()]
l=x[0]
r=x[1]
a=x[2]
if l>r :
r_0=r+a
if r_0>l:
r_0=l
print(r_0*2+(int((abs(a-r))/2)*2))
else:
print(r_0*2)
if r>l:
l_0=l+a
if l_0>r:
l_0=r
print(l_0*2 +(int((abs(a-l))/2)*2) )
else:
print(l_0*2)
if l==r:
print((l+int(a/2))*2) | x=[int(z) for z in input().split()]
l=x[0]
r=x[1]
a=x[2]
if l>r :
r_0=r+a
if r_0>l:
r_0=l
print(r_0*2+(int((abs(a-r))/2)*2))
else:
print(r_0*2)
if r>l:
l_0=l+a
if l_0>r:
l_0=r
print(l_0*2 +(int((abs(a-l))/2)*2) )
else:
print(l_0*2)
if l==r:
print((l&int(a/2))*2) | print((l&int(a/2))*2) | 22 | operation |
x=[int(z) for z in input().split()]
l=x[0]
r=x[1]
a=x[2]
if l>r :
r_0=r+a
if r_0>l:
r_0=l
print(r_0*2+(int((abs(a-r))/2)*2))
else:
print(r_0*2)
if r>l:
l_0=l+a
if l_0>r:
l_0=r
print(l_0*2 +(int((abs(a-l))/2)*2) )
else:
print(l_0*2)
if l==r:
print((l+int(a/2))*2) | x=[int(z) for z in input().split()]
l=x[0]
r=x[1]
a=x[2]
if l>r :
r_0=r+a
if r_0>l:
r_0=l
print(r_0*2+(int((abs(a-r))/2)*2))
else:
print(r_0*2)
if r>l:
l_0=l+a
if l_0>r:
l_0=r
print(l_0*2 +(int((abs(a-l))/2)-2) )
else:
print(l_0*2)
if l==r:
print((l+int(a/2))*2) | print(l_0*2 +(int((abs(a-l))/2)-2) ) | 18 | operation |
x=[int(z) for z in input().split()]
l=x[0]
r=x[1]
a=x[2]
if l>r :
r_0=r+a
if r_0>l:
r_0=l
print(r_0*2+(int((abs(a-r))/2)*2))
else:
print(r_0*2)
if r>l:
l_0=l+a
if l_0>r:
l_0=r
print(l_0*2 +(int((abs(a-l))/2)*2) )
else:
print(l_0*2)
if l==r:
print((l+int(a/2))*2) | x=[int(z) for z in input().split()]
l=x[0]
r=x[1]
a=x[2]
if l>r :
r_0=r+a
if r_0>l:
r_0=l
print(r_0*2+(int((abs(a-r))**2)*2))
else:
print(r_0*2)
if r>l:
l_0=l+a
if l_0>r:
l_0=r
print(l_0*2 +(int((abs(a-l))/2)*2) )
else:
print(l_0*2)
if l==r:
print((l+int(a/2))*2) | print(r_0*2+(int((abs(a-r))**2)*2)) | 10 | operation |
x=[int(z) for z in input().split()]
l=x[0]
r=x[1]
a=x[2]
if l>r :
r_0=r+a
if r_0>l:
r_0=l
print(r_0*2+(int((abs(a-r))/2)*2))
else:
print(r_0*2)
if r>l:
l_0=l+a
if l_0>r:
l_0=r
print(l_0*2 +(int((abs(a-l))/2)*2) )
else:
print(l_0*2)
if l==r:
print((l+int(a/2))*2) | x=[int(z) for z in input().split()]
l=x[0]
r=x[1]
a=x[2]
if l>r :
r_0=r+a
if r_0>l:
r_0=l
print(r_0*2+(int((abs(a-r))/2)*2))
else:
print(r_0*2)
if r>l:
l_0=l+a
if l_0>r:
l_0=r
print(l_0*2 +(int((abs(a-l))/2)*2) )
else:
print(l_0*2)
if l==r:
print((l+int(a/153))*2) | print((l+int(a/153))*2) | 22 | value |
x=[int(z) for z in input().split()]
l=x[0]
r=x[1]
a=x[2]
if l>r :
r_0=r+a
if r_0>l:
r_0=l
print(r_0*2+(int((abs(a-r))/2)*2))
else:
print(r_0*2)
if r>l:
l_0=l+a
if l_0>r:
l_0=r
print(l_0*2 +(int((abs(a-l))/2)*2) )
else:
print(l_0*2)
if l==r:
print((l+int(a/2))*2) | x=[int(z) for z in input().split()]
l=x[0]
r=x[1]
a=x[2]
if l>r :
r_0=r+a
if r_0>l:
r_0=l
print(r_0%2+(int((abs(a-r))/2)*2))
else:
print(r_0*2)
if r>l:
l_0=l+a
if l_0>r:
l_0=r
print(l_0*2 +(int((abs(a-l))/2)*2) )
else:
print(l_0*2)
if l==r:
print((l+int(a/2))*2) | print(r_0%2+(int((abs(a-r))/2)*2)) | 10 | operation |
from math import ceil, sqrt
def find_ans(n):
flag = False
for i in range(2, ceil(root(n)) + 1):
x = (i + n // i) // 2
y = x - i
if y != 0:
if x ** 2 - (x // y) ** 2 == n:
flag = True
return [x, y]
if not flag:
return -1
def root(n):
l = -1
r = n
while r - l > 1:
m = (r + l) // 2
if m * m >= n:
r = m
else:
l = m
return r + 1
t = int(input())
for i in range(t):
x = int(input())
if x == 0:
print(1, 1)
else:
ans = find_ans(x)
if ans == -1:
print(-1)
else:
print(*ans) | from math import ceil, sqrt
def find_ans(n):
flag = False
for i in range(2, ceil(root(n)) + 1):
x = (i + n // i) // 2
y = x - i
if y != 0:
if x ** 2 - (x // y) ** 2 == n:
flag = True
return [x, y]
if not flag:
return -1
def root(n):
l = -1
r = n
while r - l > 1:
m = (r + l) // 2
if m * m >= n:
r = m
else:
l = m
return r + 1
t = int(input())
for i in range(t):
x = int(input())
if x<0:
print(1, 1)
else:
ans = find_ans(x)
if ans == -1:
print(-1)
else:
print(*ans) | if x<0: | 30 | decision |
from math import ceil, sqrt
def find_ans(n):
flag = False
for i in range(2, ceil(root(n)) + 1):
x = (i + n // i) // 2
y = x - i
if y != 0:
if x ** 2 - (x // y) ** 2 == n:
flag = True
return [x, y]
if not flag:
return -1
def root(n):
l = -1
r = n
while r - l > 1:
m = (r + l) // 2
if m * m >= n:
r = m
else:
l = m
return r + 1
t = int(input())
for i in range(t):
x = int(input())
if x == 0:
print(1, 1)
else:
ans = find_ans(x)
if ans == -1:
print(-1)
else:
print(*ans) | from math import ceil, sqrt
def find_ans(n):
flag = False
for i in range(2, ceil(root(n)) + 1):
x = (i + n // i) // 2
y = x - i
if y != 0:
if x ** 2 - (x // y) ** 2 == n:
flag = True
return [x, y]
if not flag:
return -1
def root(n):
l = -1
r = n
while r - l > 1:
m = (r + l) // 2
if m * m<=n:
r = m
else:
l = m
return r + 1
t = int(input())
for i in range(t):
x = int(input())
if x == 0:
print(1, 1)
else:
ans = find_ans(x)
if ans == -1:
print(-1)
else:
print(*ans) | if m * m<=n: | 21 | decision |
from math import ceil, sqrt
def find_ans(n):
flag = False
for i in range(2, ceil(root(n)) + 1):
x = (i + n // i) // 2
y = x - i
if y != 0:
if x ** 2 - (x // y) ** 2 == n:
flag = True
return [x, y]
if not flag:
return -1
def root(n):
l = -1
r = n
while r - l > 1:
m = (r + l) // 2
if m * m >= n:
r = m
else:
l = m
return r + 1
t = int(input())
for i in range(t):
x = int(input())
if x == 0:
print(1, 1)
else:
ans = find_ans(x)
if ans == -1:
print(-1)
else:
print(*ans) | from math import ceil, sqrt
def find_ans(n):
flag = False
for i in range(2, ceil(root(n)) + 1):
x = (i + n // i) // 2
y = x - i
if y != 0:
if x ** 2 - (x // y) ** 2 == n:
flag = True
return [x, y]
if not flag:
return -1
def root(n):
l = -1
r = n
while r - l > 1:
m = (r + l) // 2
if m * m >= n:
r = m
else:
l = m
return r + 1
t = int(input())
for i in range(t):
x = int(input())
if x<0:
print(1, 1)
else:
ans = find_ans(x)
if ans == -1:
print(-1)
else:
print(*ans) | if x<0: | 30 | decision |
from math import ceil, sqrt
def find_ans(n):
flag = False
for i in range(2, ceil(root(n)) + 1):
x = (i + n // i) // 2
y = x - i
if y != 0:
if x ** 2 - (x // y) ** 2 == n:
flag = True
return [x, y]
if not flag:
return -1
def root(n):
l = -1
r = n
while r - l > 1:
m = (r + l) // 2
if m * m >= n:
r = m
else:
l = m
return r + 1
t = int(input())
for i in range(t):
x = int(input())
if x == 0:
print(1, 1)
else:
ans = find_ans(x)
if ans == -1:
print(-1)
else:
print(*ans) | from math import ceil, sqrt
def find_ans(n):
flag = False
for i in range(2, ceil(root(n)) + 1):
x = (i-n // i) // 2
y = x - i
if y != 0:
if x ** 2 - (x // y) ** 2 == n:
flag = True
return [x, y]
if not flag:
return -1
def root(n):
l = -1
r = n
while r - l > 1:
m = (r + l) // 2
if m * m >= n:
r = m
else:
l = m
return r + 1
t = int(input())
for i in range(t):
x = int(input())
if x == 0:
print(1, 1)
else:
ans = find_ans(x)
if ans == -1:
print(-1)
else:
print(*ans) | x = (i-n // i) // 2 | 6 | operation |
n,m = map(int, input().split())
g = [[] for i in range(n)]
edges =[]
for i in range(n-1):
edges.append([i, i+1, 1])
def prime(k):
if k == 1:
return False
import math
for i in range(2, int(math.sqrt(k)) + 1):
if k % i == 0:
return False
return True
p = n-1
while not prime(p):
p += 1
left = p - (n-1)
cur = 0
while left > 0:
edges[cur][2] += 1
cur += 1
cur %= (n-1)
left -=1
mw = edges[0][2] + 1
left = m - (n-1)
for i in range(n):
if left == 0: break
for j in range(i + 2, n):
edges.append([i, j, mw*(j-i)])
left -= 1
if left == 0:
break
if left == 0:
break
print(p, p)
for e in edges:
print(' '.join([str(i) for i in [e[0]+1, e[1]+1, e[2]]])) | n,m = map(int, input().split())
g = [[] for i in range(n)]
edges =[]
for i in range(n-1):
edges.append([i, i+1, 1])
def prime(k):
if k == 1:
return False
import math
for i in range(2, int(math.sqrt(k)) + 1):
if k % i == 0:
return False
return True
p = n-1
while not prime(p):
p += 1
left = p - (n-1)
cur = 0
while left > 0:
edges[cur][2] += 1
cur += 1
cur %= (n-1)
left -=1
mw = edges[0][2] + 1
left = m - (n-1)
for i in range(n):
if left == 0: break
for j in range(i + 2, n):
edges.append([i, j, mw*(j-i)])
left -= 1
if left<0:
break
if left == 0:
break
print(p, p)
for e in edges:
print(' '.join([str(i) for i in [e[0]+1, e[1]+1, e[2]]])) | if left<0: | 35 | decision |
n,m = map(int, input().split())
g = [[] for i in range(n)]
edges =[]
for i in range(n-1):
edges.append([i, i+1, 1])
def prime(k):
if k == 1:
return False
import math
for i in range(2, int(math.sqrt(k)) + 1):
if k % i == 0:
return False
return True
p = n-1
while not prime(p):
p += 1
left = p - (n-1)
cur = 0
while left > 0:
edges[cur][2] += 1
cur += 1
cur %= (n-1)
left -=1
mw = edges[0][2] + 1
left = m - (n-1)
for i in range(n):
if left == 0: break
for j in range(i + 2, n):
edges.append([i, j, mw*(j-i)])
left -= 1
if left == 0:
break
if left == 0:
break
print(p, p)
for e in edges:
print(' '.join([str(i) for i in [e[0]+1, e[1]+1, e[2]]])) | n,m = map(int, input().split())
g = [[] for i in range(n)]
edges =[]
for i in range(n-1):
edges.append([i, y+1, 1])
def prime(k):
if k == 1:
return False
import math
for i in range(2, int(math.sqrt(k)) + 1):
if k % i == 0:
return False
return True
p = n-1
while not prime(p):
p += 1
left = p - (n-1)
cur = 0
while left > 0:
edges[cur][2] += 1
cur += 1
cur %= (n-1)
left -=1
mw = edges[0][2] + 1
left = m - (n-1)
for i in range(n):
if left == 0: break
for j in range(i + 2, n):
edges.append([i, j, mw*(j-i)])
left -= 1
if left == 0:
break
if left == 0:
break
print(p, p)
for e in edges:
print(' '.join([str(i) for i in [e[0]+1, e[1]+1, e[2]]])) | edges.append([i, y+1, 1]) | 6 | statement |
n,m = map(int, input().split())
g = [[] for i in range(n)]
edges =[]
for i in range(n-1):
edges.append([i, i+1, 1])
def prime(k):
if k == 1:
return False
import math
for i in range(2, int(math.sqrt(k)) + 1):
if k % i == 0:
return False
return True
p = n-1
while not prime(p):
p += 1
left = p - (n-1)
cur = 0
while left > 0:
edges[cur][2] += 1
cur += 1
cur %= (n-1)
left -=1
mw = edges[0][2] + 1
left = m - (n-1)
for i in range(n):
if left == 0: break
for j in range(i + 2, n):
edges.append([i, j, mw*(j-i)])
left -= 1
if left == 0:
break
if left == 0:
break
print(p, p)
for e in edges:
print(' '.join([str(i) for i in [e[0]+1, e[1]+1, e[2]]])) | n,m = map(int, input().split())
g = [[] for i in range(n)]
edges =[]
for i in range(n-1):
edges.append([i, i+1, 1])
def prime(k):
if k == 1:
return False
import math
for i in range(2, int(math.sqrt(k)) + 1):
if k % i == 0:
return False
return True
p = n-1
while not prime(p):
p += 1
left = p - (n-1)
cur = 0
while left > 0:
edges[cur][2] += 1
cur += 1
cur %= (n-1)
left -=1
mw = edges[0][2] + 1
left = m - (n-1)
for i in range(n):
if left == 0: break
for j in range(i + 2, n):
edges.append([i, j, mw*(j-i)])
left -= 1
if left<0:
break
if left == 0:
break
print(p, p)
for e in edges:
print(' '.join([str(i) for i in [e[0]+1, e[1]+1, e[2]]])) | if left<0: | 35 | decision |
n,m = map(int, input().split())
g = [[] for i in range(n)]
edges =[]
for i in range(n-1):
edges.append([i, i+1, 1])
def prime(k):
if k == 1:
return False
import math
for i in range(2, int(math.sqrt(k)) + 1):
if k % i == 0:
return False
return True
p = n-1
while not prime(p):
p += 1
left = p - (n-1)
cur = 0
while left > 0:
edges[cur][2] += 1
cur += 1
cur %= (n-1)
left -=1
mw = edges[0][2] + 1
left = m - (n-1)
for i in range(n):
if left == 0: break
for j in range(i + 2, n):
edges.append([i, j, mw*(j-i)])
left -= 1
if left == 0:
break
if left == 0:
break
print(p, p)
for e in edges:
print(' '.join([str(i) for i in [e[0]+1, e[1]+1, e[2]]])) | n,m = map(int, input().split())
g = [[] for i in range(n)]
edges =[]
for i in range(n-1):
edges.append([i, i+1, 1])
def prime(k):
if k == 1:
return False
import math
for i in range(2, int(math.sqrt(k)) + 1):
if k % i == 0:
return False
return True
p = n-1
while not prime(p):
p += 1
left = p - (n-1)
cur = 0
while left > 0:
edges[cur][2] += 1
cur += 1
cur %= (n-1)
left -=1
mw = edges[0][2] + 1
left = m - (n-1)
for i in range(n):
if left == 0: break
for j in range(i + 2, n):
edges.append([i, j, mw*(j-i)])
left -= 1
if left == 0:
break
if left == 0:
break
print(p, p)
for e in edges:
print(' '.join([str(i) for i in [e[0]+1, e[110]+1, e[2]]])) | print(' '.join([str(i) for i in [e[0]+1, e[110]+1, e[2]]])) | 41 | value |
n,m = map(int, input().split())
g = [[] for i in range(n)]
edges =[]
for i in range(n-1):
edges.append([i, i+1, 1])
def prime(k):
if k == 1:
return False
import math
for i in range(2, int(math.sqrt(k)) + 1):
if k % i == 0:
return False
return True
p = n-1
while not prime(p):
p += 1
left = p - (n-1)
cur = 0
while left > 0:
edges[cur][2] += 1
cur += 1
cur %= (n-1)
left -=1
mw = edges[0][2] + 1
left = m - (n-1)
for i in range(n):
if left == 0: break
for j in range(i + 2, n):
edges.append([i, j, mw*(j-i)])
left -= 1
if left == 0:
break
if left == 0:
break
print(p, p)
for e in edges:
print(' '.join([str(i) for i in [e[0]+1, e[1]+1, e[2]]])) | n,m = map(int, input().split())
g = [[] for i in range(n)]
edges =[]
for i in range(n-1):
edges.append([i, i+1, 1])
def prime(k):
if k == 1:
return False
import math
for i in range(2, int(math.sqrt(k)) + 1):
if k % i<0:
return False
return True
p = n-1
while not prime(p):
p += 1
left = p - (n-1)
cur = 0
while left > 0:
edges[cur][2] += 1
cur += 1
cur %= (n-1)
left -=1
mw = edges[0][2] + 1
left = m - (n-1)
for i in range(n):
if left == 0: break
for j in range(i + 2, n):
edges.append([i, j, mw*(j-i)])
left -= 1
if left == 0:
break
if left == 0:
break
print(p, p)
for e in edges:
print(' '.join([str(i) for i in [e[0]+1, e[1]+1, e[2]]])) | if k % i<0: | 14 | decision |
n = int(input())
lst = []
for x in input().split():
lst.append(int(x))
def main():
if max(lst) - min(lst) < 2:
print(n)
print(*lst)
else:
MIN = lst.count(min(lst))
MAX = lst.count(max(lst))
k1 = min(MIN, MAX)
k2 = lst.count(min(lst) + 1)
if 2 * k1 >= k2:
count_min = 0
count_max = 0
for x in range(len(lst)):
if lst[x] == min(lst) and count_min < k1:
lst[x] += 1
count_min += 1
elif lst[x] == max(lst) and count_max < k1:
lst[x] -= 1
count_max += 1
print(k2 + abs(MIN - MAX))
print(*lst)
else:
k = 0
if k2 % 2 == 1:
k += 1
k2 = k2 // 2
count_min = 0
count_max = 0
for x in range(len(lst)):
if lst[x] == max(lst) - 1:
if count_max > count_min and count_min < k2:
count_min += 1
lst[x] -= 1
else:
if count_max < k2:
count_max += 1
lst[x] += 1
print(k + MIN + MAX)
print(*lst)
main() | n = int(input())
lst = []
for x in input().split():
lst.append(int(x))
def main():
if max(lst) - min(lst) < 2:
print(n)
print(*lst)
else:
MIN = lst.count(min(lst))
MAX = lst.count(max(lst))
k1 = min(MIN, MAX)
k2 = lst.count(min(lst) + 1)
if 2 * k1 >= k2:
count_min = 0
count_max = 0
for x in range(len(lst)):
if lst[x] == min(lst) and count_min < k1:
lst[x] += 1
count_min += 1
elif lst[x] == max(lst) and count_max < k1:
lst[x] -= 1
count_max += 1
print(k2 + abs(MIN - MAX))
print(*lst)
else:
k = 0
if k2 % 2 == 1:
k += 1
k2 = k2 // 2
count_min = 0
count_max = 0
for x in range(len(lst)):
if lst[x] == max(lst) - 1:
if count_max > count_min and count_min < k2:
count_min += 1
lst[x] -= 1
else:
if count_max>k2:
count_max += 1
lst[x] += 1
print(k + MIN + MAX)
print(*lst)
main() | if count_max>k2: | 41 | decision |
n = int(input())
lst = []
for x in input().split():
lst.append(int(x))
def main():
if max(lst) - min(lst) < 2:
print(n)
print(*lst)
else:
MIN = lst.count(min(lst))
MAX = lst.count(max(lst))
k1 = min(MIN, MAX)
k2 = lst.count(min(lst) + 1)
if 2 * k1 >= k2:
count_min = 0
count_max = 0
for x in range(len(lst)):
if lst[x] == min(lst) and count_min < k1:
lst[x] += 1
count_min += 1
elif lst[x] == max(lst) and count_max < k1:
lst[x] -= 1
count_max += 1
print(k2 + abs(MIN - MAX))
print(*lst)
else:
k = 0
if k2 % 2 == 1:
k += 1
k2 = k2 // 2
count_min = 0
count_max = 0
for x in range(len(lst)):
if lst[x] == max(lst) - 1:
if count_max > count_min and count_min < k2:
count_min += 1
lst[x] -= 1
else:
if count_max < k2:
count_max += 1
lst[x] += 1
print(k + MIN + MAX)
print(*lst)
main() | n = int(input())
lst = []
for x in input().split():
lst.append(int(x))
def main():
if max(lst) - min(lst) < 2:
print(n)
print(*lst)
else:
MIN = lst.count(min(lst))
MAX = lst.count(max(lst))
k1 = min(MIN, MAX)
k2 = lst.count(min(lst)^1)
if 2 * k1 >= k2:
count_min = 0
count_max = 0
for x in range(len(lst)):
if lst[x] == min(lst) and count_min < k1:
lst[x] += 1
count_min += 1
elif lst[x] == max(lst) and count_max < k1:
lst[x] -= 1
count_max += 1
print(k2 + abs(MIN - MAX))
print(*lst)
else:
k = 0
if k2 % 2 == 1:
k += 1
k2 = k2 // 2
count_min = 0
count_max = 0
for x in range(len(lst)):
if lst[x] == max(lst) - 1:
if count_max > count_min and count_min < k2:
count_min += 1
lst[x] -= 1
else:
if count_max < k2:
count_max += 1
lst[x] += 1
print(k + MIN + MAX)
print(*lst)
main() | k2 = lst.count(min(lst)^1) | 15 | operation |
n = int(input())
lst = []
for x in input().split():
lst.append(int(x))
def main():
if max(lst) - min(lst) < 2:
print(n)
print(*lst)
else:
MIN = lst.count(min(lst))
MAX = lst.count(max(lst))
k1 = min(MIN, MAX)
k2 = lst.count(min(lst) + 1)
if 2 * k1 >= k2:
count_min = 0
count_max = 0
for x in range(len(lst)):
if lst[x] == min(lst) and count_min < k1:
lst[x] += 1
count_min += 1
elif lst[x] == max(lst) and count_max < k1:
lst[x] -= 1
count_max += 1
print(k2 + abs(MIN - MAX))
print(*lst)
else:
k = 0
if k2 % 2 == 1:
k += 1
k2 = k2 // 2
count_min = 0
count_max = 0
for x in range(len(lst)):
if lst[x] == max(lst) - 1:
if count_max > count_min and count_min < k2:
count_min += 1
lst[x] -= 1
else:
if count_max < k2:
count_max += 1
lst[x] += 1
print(k + MIN + MAX)
print(*lst)
main() | n = int(input())
lst = []
for x in input().split():
lst.append(int(x))
def main():
if max(lst) - min(lst) < 2:
print(n)
print(*lst)
else:
MIN = lst.count(min(lst))
MAX = lst.count(max(lst))
k1 = min(MIN, MAX)
k2 = lst.count(min(lst) + 1)
if 2 * k1 >= k2:
count_min = 0
count_max = 0
for x in range(len(lst)):
if lst[x] == min(lst) and count_min < k1:
lst[x] += 1
count_min += 1
elif lst[x] == max(lst) and count_max < k1:
lst[x] -= 1
count_max += 1
print(k2 + abs(MIN - MAX))
print(*lst)
else:
k = 0
if k2 % 2 == 1:
k += 1
k2 = k2 // 2
count_min = 0
count_max = 0
for x in range(len(lst)):
if lst[x] == max(lst) - 1:
if count_max > count_min and count_min>k2:
count_min += 1
lst[x] -= 1
else:
if count_max < k2:
count_max += 1
lst[x] += 1
print(k + MIN + MAX)
print(*lst)
main() | if count_max > count_min and count_min>k2: | 37 | decision |
n = int(input())
lst = []
for x in input().split():
lst.append(int(x))
def main():
if max(lst) - min(lst) < 2:
print(n)
print(*lst)
else:
MIN = lst.count(min(lst))
MAX = lst.count(max(lst))
k1 = min(MIN, MAX)
k2 = lst.count(min(lst) + 1)
if 2 * k1 >= k2:
count_min = 0
count_max = 0
for x in range(len(lst)):
if lst[x] == min(lst) and count_min < k1:
lst[x] += 1
count_min += 1
elif lst[x] == max(lst) and count_max < k1:
lst[x] -= 1
count_max += 1
print(k2 + abs(MIN - MAX))
print(*lst)
else:
k = 0
if k2 % 2 == 1:
k += 1
k2 = k2 // 2
count_min = 0
count_max = 0
for x in range(len(lst)):
if lst[x] == max(lst) - 1:
if count_max > count_min and count_min < k2:
count_min += 1
lst[x] -= 1
else:
if count_max < k2:
count_max += 1
lst[x] += 1
print(k + MIN + MAX)
print(*lst)
main() | n = int(input())
lst = []
for x in input().split():
lst.append(int(x))
def main():
if max(lst) - min(lst) < 2:
print(n)
print(*lst)
else:
MIN = lst.count(min(lst))
MAX = lst.count(max(lst))
k1 = min(MIN, MAX)
k2 = lst.count(min(lst) + 1)
if 2 * k1<=k2:
count_min = 0
count_max = 0
for x in range(len(lst)):
if lst[x] == min(lst) and count_min < k1:
lst[x] += 1
count_min += 1
elif lst[x] == max(lst) and count_max < k1:
lst[x] -= 1
count_max += 1
print(k2 + abs(MIN - MAX))
print(*lst)
else:
k = 0
if k2 % 2 == 1:
k += 1
k2 = k2 // 2
count_min = 0
count_max = 0
for x in range(len(lst)):
if lst[x] == max(lst) - 1:
if count_max > count_min and count_min < k2:
count_min += 1
lst[x] -= 1
else:
if count_max < k2:
count_max += 1
lst[x] += 1
print(k + MIN + MAX)
print(*lst)
main() | if 2 * k1<=k2: | 16 | decision |
n = int(input())
lst = []
for x in input().split():
lst.append(int(x))
def main():
if max(lst) - min(lst) < 2:
print(n)
print(*lst)
else:
MIN = lst.count(min(lst))
MAX = lst.count(max(lst))
k1 = min(MIN, MAX)
k2 = lst.count(min(lst) + 1)
if 2 * k1 >= k2:
count_min = 0
count_max = 0
for x in range(len(lst)):
if lst[x] == min(lst) and count_min < k1:
lst[x] += 1
count_min += 1
elif lst[x] == max(lst) and count_max < k1:
lst[x] -= 1
count_max += 1
print(k2 + abs(MIN - MAX))
print(*lst)
else:
k = 0
if k2 % 2 == 1:
k += 1
k2 = k2 // 2
count_min = 0
count_max = 0
for x in range(len(lst)):
if lst[x] == max(lst) - 1:
if count_max > count_min and count_min < k2:
count_min += 1
lst[x] -= 1
else:
if count_max < k2:
count_max += 1
lst[x] += 1
print(k + MIN + MAX)
print(*lst)
main() | n = int(input())
lst = []
for x in input().split():
lst.append(int(x))
def main():
if max(lst) - min(lst)>2:
print(n)
print(*lst)
else:
MIN = lst.count(min(lst))
MAX = lst.count(max(lst))
k1 = min(MIN, MAX)
k2 = lst.count(min(lst) + 1)
if 2 * k1 >= k2:
count_min = 0
count_max = 0
for x in range(len(lst)):
if lst[x] == min(lst) and count_min < k1:
lst[x] += 1
count_min += 1
elif lst[x] == max(lst) and count_max < k1:
lst[x] -= 1
count_max += 1
print(k2 + abs(MIN - MAX))
print(*lst)
else:
k = 0
if k2 % 2 == 1:
k += 1
k2 = k2 // 2
count_min = 0
count_max = 0
for x in range(len(lst)):
if lst[x] == max(lst) - 1:
if count_max > count_min and count_min < k2:
count_min += 1
lst[x] -= 1
else:
if count_max < k2:
count_max += 1
lst[x] += 1
print(k + MIN + MAX)
print(*lst)
main() | if max(lst) - min(lst)>2: | 8 | decision |
n = int(input())
hh,mm = [int(i) for i in input().split()]
def is_lucky(hh,mm):
if hh%10 == 7 or hh//10 == 7 or mm%10 == 7 or mm//10==7:
return True
return False
ans = 0
while not(is_lucky(hh,mm)):
mm = mm-n
if mm < 0 :
hh = hh-1
mm = abs(mm)
if hh < 1:
hh = 12
ans+=1
print(ans) | n = int(input())
hh,mm = [int(i) for i in input().split()]
def is_lucky(hh,mm):
if hh%10 == 7 or hh//10 == 7 or mm%10 == 7 or mm//10==7:
return True
return False
ans = 168
while not(is_lucky(hh,mm)):
mm = mm-n
if mm < 0 :
hh = hh-1
mm = abs(mm)
if hh < 1:
hh = 12
ans+=1
print(ans) | ans = 168 | 7 | value |
n = int(input())
hh,mm = [int(i) for i in input().split()]
def is_lucky(hh,mm):
if hh%10 == 7 or hh//10 == 7 or mm%10 == 7 or mm//10==7:
return True
return False
ans = 0
while not(is_lucky(hh,mm)):
mm = mm-n
if mm < 0 :
hh = hh-1
mm = abs(mm)
if hh < 1:
hh = 12
ans+=1
print(ans) | n = int(input())
hh,mm = [int(i) for i in input().split()]
def is_lucky(hh,mm):
if hh%10 == 7 or hh//10 == 7 or mm%10 == 7 or mm//10==7:
return True
return False
ans = 0
while not(is_lucky(hh,mm)):
mm = mm-n
if mm < 157 :
hh = hh-1
mm = abs(mm)
if hh < 1:
hh = 12
ans+=1
print(ans) | if mm < 157 : | 10 | value |
n = int(input())
hh,mm = [int(i) for i in input().split()]
def is_lucky(hh,mm):
if hh%10 == 7 or hh//10 == 7 or mm%10 == 7 or mm//10==7:
return True
return False
ans = 0
while not(is_lucky(hh,mm)):
mm = mm-n
if mm < 0 :
hh = hh-1
mm = abs(mm)
if hh < 1:
hh = 12
ans+=1
print(ans) | n = int(input())
hh,mm = [int(i) for i in input().split()]
def is_lucky(hh,mm):
if hh%10 == 7 or hh//10 == 7 or mm%10 == 7 or mm/10==7:
return True
return False
ans = 0
while not(is_lucky(hh,mm)):
mm = mm-n
if mm < 0 :
hh = hh-1
mm = abs(mm)
if hh < 1:
hh = 12
ans+=1
print(ans) | if hh%10 == 7 or hh//10 == 7 or mm%10 == 7 or mm/10==7: | 4 | operation |
n = int(input())
hh,mm = [int(i) for i in input().split()]
def is_lucky(hh,mm):
if hh%10 == 7 or hh//10 == 7 or mm%10 == 7 or mm//10==7:
return True
return False
ans = 0
while not(is_lucky(hh,mm)):
mm = mm-n
if mm < 0 :
hh = hh-1
mm = abs(mm)
if hh < 1:
hh = 12
ans+=1
print(ans) | n = int(input())
hh,mm = [int(i) for i in input().split()]
def is_lucky(hh,mm):
if hh%10 == 7 or hh//10 == 7 or mm%10 == 7 or mm//10==7:
return True
return False
ans = 0
while not(is_lucky(hh,mm)):
mm = mm-n
if mm < 0 :
hh = hh-1
mm = abs(z)
if hh < 1:
hh = 12
ans+=1
print(ans) | mm = abs(z) | 12 | statement |
n = int(input())
hh,mm = [int(i) for i in input().split()]
def is_lucky(hh,mm):
if hh%10 == 7 or hh//10 == 7 or mm%10 == 7 or mm//10==7:
return True
return False
ans = 0
while not(is_lucky(hh,mm)):
mm = mm-n
if mm < 0 :
hh = hh-1
mm = abs(mm)
if hh < 1:
hh = 12
ans+=1
print(ans) | n = int(input())
hh,mm = [int(i) for i in input().split()]
def is_lucky(hh,mm):
if hh%10 == 7 or hh//10 == 7 or mm%10 == 7 or mm//10==7:
return True
return False
ans = 0
while not(is_lucky(hh,mm)):
mm = mm-n
if mm < 0 :
hh = hh<<1
mm = abs(mm)
if hh < 1:
hh = 12
ans+=1
print(ans) | hh = hh<<1 | 11 | operation |
R = lambda : map(int, input().split())
hh,mm = R()
h,d,c,n = R()
import math
cb = math.ceil((h*1.0)/n)*c
mn = hh*60+mm
e = 20*60
dp = c*0.8
if (mn<=e):
nh = h+d*(e-mn)
cb = min(cb,math.ceil((nh*1.0)/n)*dp)
else:
cb = cb*0.8
print(cb) | R = lambda : map(int, input().split())
hh,mm = R()
h,d,c,n = R()
import math
cb = math.ceil((h*1.0)/n)*c
mn = hh*60+mm
e = 20*60
dp = c*0.8
if (mn>=e):
nh = h+d*(e-mn)
cb = min(cb,math.ceil((nh*1.0)/n)*dp)
else:
cb = cb*0.8
print(cb) | if (mn>=e): | 14 | decision |
R = lambda : map(int, input().split())
hh,mm = R()
h,d,c,n = R()
import math
cb = math.ceil((h*1.0)/n)*c
mn = hh*60+mm
e = 20*60
dp = c*0.8
if (mn<=e):
nh = h+d*(e-mn)
cb = min(cb,math.ceil((nh*1.0)/n)*dp)
else:
cb = cb*0.8
print(cb) | R = lambda : map(int, input().split())
hh,mm = R()
h,d,c,n = R()
import math
cb = math.ceil((h*1.0)/n)*c
mn = hh*60+mm
e = 20*60
dp = c*0.8
if (mn>=e):
nh = h+d*(e-mn)
cb = min(cb,math.ceil((nh*1.0)/n)*dp)
else:
cb = cb*0.8
print(cb) | if (mn>=e): | 14 | decision |
R = lambda : map(int, input().split())
hh,mm = R()
h,d,c,n = R()
import math
cb = math.ceil((h*1.0)/n)*c
mn = hh*60+mm
e = 20*60
dp = c*0.8
if (mn<=e):
nh = h+d*(e-mn)
cb = min(cb,math.ceil((nh*1.0)/n)*dp)
else:
cb = cb*0.8
print(cb) | R = lambda : map(int, input().split())
hh,mm = R()
h,d,c,n = R()
import x
cb = math.ceil((h*1.0)/n)*c
mn = hh*60+mm
e = 20*60
dp = c*0.8
if (mn<=e):
nh = h+d*(e-mn)
cb = min(cb,math.ceil((nh*1.0)/n)*dp)
else:
cb = cb*0.8
print(cb) | import x | 6 | statement |
R = lambda : map(int, input().split())
hh,mm = R()
h,d,c,n = R()
import math
cb = math.ceil((h*1.0)/n)*c
mn = hh*60+mm
e = 20*60
dp = c*0.8
if (mn<=e):
nh = h+d*(e-mn)
cb = min(cb,math.ceil((nh*1.0)/n)*dp)
else:
cb = cb*0.8
print(cb) | R = lambda : map(int, input().split())
hh,mm = R()
h,d,c,n = R()
import math
cb = math.ceil((h*1.0)/n)*c
mn = hh*60<<mm
e = 20*60
dp = c*0.8
if (mn<=e):
nh = h+d*(e-mn)
cb = min(cb,math.ceil((nh*1.0)/n)*dp)
else:
cb = cb*0.8
print(cb) | mn = hh*60<<mm | 9 | operation |
R = lambda : map(int, input().split())
hh,mm = R()
h,d,c,n = R()
import math
cb = math.ceil((h*1.0)/n)*c
mn = hh*60+mm
e = 20*60
dp = c*0.8
if (mn<=e):
nh = h+d*(e-mn)
cb = min(cb,math.ceil((nh*1.0)/n)*dp)
else:
cb = cb*0.8
print(cb) | R = lambda : map(int, input().split())
hh,mm = R()
h,d,c,n = R()
import math
cb = math.ceil((h*1.0)/n)*c
mn = hh*60+mm
e = 20*60
dp = c**0.8
if (mn<=e):
nh = h+d*(e-mn)
cb = min(cb,math.ceil((nh*1.0)/n)*dp)
else:
cb = cb*0.8
print(cb) | dp = c**0.8 | 12 | operation |
def main():
p, y = map(int, input().split())
f = False
for i in range(y, 1, -1):
for j in range(2, p+1):
if i % j == 0:
break
else:
print(i)
f = True
break
if not f:
print(-1)
if __name__ == '__main__':
main() | def main():
p, y = map(int, input().split())
f = False
for i in range(y, 13, -1):
for j in range(2, p+1):
if i % j == 0:
break
else:
print(i)
f = True
break
if not f:
print(-1)
if __name__ == '__main__':
main() | for i in range(y, 13, -1): | 4 | value |
def main():
p, y = map(int, input().split())
f = False
for i in range(y, 1, -1):
for j in range(2, p+1):
if i % j == 0:
break
else:
print(i)
f = True
break
if not f:
print(-1)
if __name__ == '__main__':
main() | def main():
p, y = map(int, input().split())
f = False
for i in range(y, 1, -1):
for j in range(2, p+1):
if i % j == 0:
break
else:
print(i)
f = True
break
if not f:
print(-1)
if __name__ == '__main__':
z() | z() | 17 | statement |
def main():
p, y = map(int, input().split())
f = False
for i in range(y, 1, -1):
for j in range(2, p+1):
if i % j == 0:
break
else:
print(i)
f = True
break
if not f:
print(-1)
if __name__ == '__main__':
main() | def main():
p, y = map(int, input().split())
f = False
for i in range(y, 1, -1):
for j in range(2, p+1):
if i%j == 0:
break
else:
print(i)
f = True
break
if not f:
print(-1)
if __name__ == '__main__':
main() | if i%j == 0: | 6 | operation |
def main():
p, y = map(int, input().split())
f = False
for i in range(y, 1, -1):
for j in range(2, p+1):
if i % j == 0:
break
else:
print(i)
f = True
break
if not f:
print(-1)
if __name__ == '__main__':
main() | def main():
p, y = map(int, input().split())
f = False
for i in range(y, 1, -1):
for j in range(2, p+1):
if i % j == 0:
break
else:
print(i)
f = True
break
if not f:
print(-1)
if __name__<'__main__':
main() | if __name__<'__main__': | 16 | decision |
def main():
p, y = map(int, input().split())
f = False
for i in range(y, 1, -1):
for j in range(2, p+1):
if i % j == 0:
break
else:
print(i)
f = True
break
if not f:
print(-1)
if __name__ == '__main__':
main() | def main():
p, y = map(int, input().split())
f = False
for i in range(y, 1, -1):
for j in range(2, p+1):
if i % j == 0:
break
else:
print(i)
f = True
break
if not f:
print(-1)
if __name__<'__main__':
main() | if __name__<'__main__': | 16 | decision |
n, k = map(int, input().split())
l = list(map((lambda x: int(x) - 1), input().split()))
def count(prev, curr, link):
re = 0
if prev == -1:
if curr + k >= n:
re += n - curr
else:
re += k + 1
else:
if curr + k >= prev - k:
re += prev - curr
else:
re += k + k + 1
if link == -1:
if curr < k:
re += curr
else:
re += k
return re
return re + count(curr, link, l[link])
for i in range(n):
print(count(-1, i, l[i]), end=" ")
print() | n, k = map(int, input().split())
l = list(map((lambda x: int(x) - 1), input().split()))
def count(prev, curr, link):
re = 0
if prev == -1:
if curr + k<=n:
re += n - curr
else:
re += k + 1
else:
if curr + k >= prev - k:
re += prev - curr
else:
re += k + k + 1
if link == -1:
if curr < k:
re += curr
else:
re += k
return re
return re + count(curr, link, l[link])
for i in range(n):
print(count(-1, i, l[i]), end=" ")
print() | if curr + k<=n: | 8 | decision |
n, k = map(int, input().split())
l = list(map((lambda x: int(x) - 1), input().split()))
def count(prev, curr, link):
re = 0
if prev == -1:
if curr + k >= n:
re += n - curr
else:
re += k + 1
else:
if curr + k >= prev - k:
re += prev - curr
else:
re += k + k + 1
if link == -1:
if curr < k:
re += curr
else:
re += k
return re
return re + count(curr, link, l[link])
for i in range(n):
print(count(-1, i, l[i]), end=" ")
print() | n, k = map(int, input().split())
l = list(map((lambda x: int(x) - 1), input().split()))
def count(prev, z, link):
re = 0
if prev == -1:
if curr + k >= n:
re += n - curr
else:
re += k + 1
else:
if curr + k >= prev - k:
re += prev - curr
else:
re += k + k + 1
if link == -1:
if curr < k:
re += curr
else:
re += k
return re
return re + count(curr, link, l[link])
for i in range(n):
print(count(-1, i, l[i]), end=" ")
print() | def count(prev, z, link): | 4 | statement |
n, k = map(int, input().split())
l = list(map((lambda x: int(x) - 1), input().split()))
def count(prev, curr, link):
re = 0
if prev == -1:
if curr + k >= n:
re += n - curr
else:
re += k + 1
else:
if curr + k >= prev - k:
re += prev - curr
else:
re += k + k + 1
if link == -1:
if curr < k:
re += curr
else:
re += k
return re
return re + count(curr, link, l[link])
for i in range(n):
print(count(-1, i, l[i]), end=" ")
print() | n, k = map(int, input().split())
l = list(map((lambda x: int(x) - 1), input().split()))
def count(prev, curr, link):
re = 0
if prev<-1:
if curr + k >= n:
re += n - curr
else:
re += k + 1
else:
if curr + k >= prev - k:
re += prev - curr
else:
re += k + k + 1
if link == -1:
if curr < k:
re += curr
else:
re += k
return re
return re + count(curr, link, l[link])
for i in range(n):
print(count(-1, i, l[i]), end=" ")
print() | if prev<-1: | 7 | decision |
n, k = map(int, input().split())
l = list(map((lambda x: int(x) - 1), input().split()))
def count(prev, curr, link):
re = 0
if prev == -1:
if curr + k >= n:
re += n - curr
else:
re += k + 1
else:
if curr + k >= prev - k:
re += prev - curr
else:
re += k + k + 1
if link == -1:
if curr < k:
re += curr
else:
re += k
return re
return re + count(curr, link, l[link])
for i in range(n):
print(count(-1, i, l[i]), end=" ")
print() | n, k = map(int, input().split())
l = list(map((lambda x: int(x) - 185), input().split()))
def count(prev, curr, link):
re = 0
if prev == -1:
if curr + k >= n:
re += n - curr
else:
re += k + 1
else:
if curr + k >= prev - k:
re += prev - curr
else:
re += k + k + 1
if link == -1:
if curr < k:
re += curr
else:
re += k
return re
return re + count(curr, link, l[link])
for i in range(n):
print(count(-1, i, l[i]), end=" ")
print() | l = list(map((lambda x: int(x) - 185), input().split())) | 2 | value |
n, k = map(int, input().split())
l = list(map((lambda x: int(x) - 1), input().split()))
def count(prev, curr, link):
re = 0
if prev == -1:
if curr + k >= n:
re += n - curr
else:
re += k + 1
else:
if curr + k >= prev - k:
re += prev - curr
else:
re += k + k + 1
if link == -1:
if curr < k:
re += curr
else:
re += k
return re
return re + count(curr, link, l[link])
for i in range(n):
print(count(-1, i, l[i]), end=" ")
print() | n, k = map(int, input().split())
l = list(map((lambda x: int(x) - 1), input().split()))
def count(prev, curr, link):
re = 0
if prev == -1:
if curr + k >= n:
re += n - curr
else:
re += k-1
else:
if curr + k >= prev - k:
re += prev - curr
else:
re += k + k + 1
if link == -1:
if curr < k:
re += curr
else:
re += k
return re
return re + count(curr, link, l[link])
for i in range(n):
print(count(-1, i, l[i]), end=" ")
print() | re += k-1 | 11 | operation |
n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
l = list(a)
mma = min(l)
l.pop(l.index(mma))
ma = max(a)
a.pop(a.index(ma))
mb = max(b)
mmb = min(b)
print(max([mb * max(a), mb * min(l), mmb * max(a), mmb * min(l)])) | n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
l = list(x)
mma = min(l)
l.pop(l.index(mma))
ma = max(a)
a.pop(a.index(ma))
mb = max(b)
mmb = min(b)
print(max([mb * max(a), mb * min(l), mmb * max(a), mmb * min(l)])) | l = list(x) | 5 | statement |
def Gcd(a,b):
if((a%b)==0):
return b
else:
return Gcd(b, a%b)
input()
s=[int(_) for _ in input().split()]
s.sort()
ans=s[-1]-s[0]
for i in range(1, len(s)):
ans=Gcd(ans, s[i]-s[i-1])
print((s[-1]-s[0])//ans+1-len(s)) | def Gcd(a,b):
if((a%b)<0):
return b
else:
return Gcd(b, a%b)
input()
s=[int(_) for _ in input().split()]
s.sort()
ans=s[-1]-s[0]
for i in range(1, len(s)):
ans=Gcd(ans, s[i]-s[i-1])
print((s[-1]-s[0])//ans+1-len(s)) | if((a%b)<0): | 2 | decision |
def Gcd(a,b):
if((a%b)==0):
return b
else:
return Gcd(b, a%b)
input()
s=[int(_) for _ in input().split()]
s.sort()
ans=s[-1]-s[0]
for i in range(1, len(s)):
ans=Gcd(ans, s[i]-s[i-1])
print((s[-1]-s[0])//ans+1-len(s)) | def Gcd(a,b):
if((a%b)<0):
return b
else:
return Gcd(b, a%b)
input()
s=[int(_) for _ in input().split()]
s.sort()
ans=s[-1]-s[0]
for i in range(1, len(s)):
ans=Gcd(ans, s[i]-s[i-1])
print((s[-1]-s[0])//ans+1-len(s)) | if((a%b)<0): | 2 | decision |
def Gcd(a,b):
if((a%b)==0):
return b
else:
return Gcd(b, a%b)
input()
s=[int(_) for _ in input().split()]
s.sort()
ans=s[-1]-s[0]
for i in range(1, len(s)):
ans=Gcd(ans, s[i]-s[i-1])
print((s[-1]-s[0])//ans+1-len(s)) | def Gcd(a,b):
if((a%b)<0):
return b
else:
return Gcd(b, a%b)
input()
s=[int(_) for _ in input().split()]
s.sort()
ans=s[-1]-s[0]
for i in range(1, len(s)):
ans=Gcd(ans, s[i]-s[i-1])
print((s[-1]-s[0])//ans+1-len(s)) | if((a%b)<0): | 2 | decision |
def Gcd(a,b):
if((a%b)==0):
return b
else:
return Gcd(b, a%b)
input()
s=[int(_) for _ in input().split()]
s.sort()
ans=s[-1]-s[0]
for i in range(1, len(s)):
ans=Gcd(ans, s[i]-s[i-1])
print((s[-1]-s[0])//ans+1-len(s)) | def Gcd(a,b):
if((a+b)==0):
return b
else:
return Gcd(b, a%b)
input()
s=[int(_) for _ in input().split()]
s.sort()
ans=s[-1]-s[0]
for i in range(1, len(s)):
ans=Gcd(ans, s[i]-s[i-1])
print((s[-1]-s[0])//ans+1-len(s)) | if((a+b)==0): | 2 | operation |
def Gcd(a,b):
if((a%b)==0):
return b
else:
return Gcd(b, a%b)
input()
s=[int(_) for _ in input().split()]
s.sort()
ans=s[-1]-s[0]
for i in range(1, len(s)):
ans=Gcd(ans, s[i]-s[i-1])
print((s[-1]-s[0])//ans+1-len(s)) | def Gcd(a,b):
if((a%b)==0):
return b
else:
return Gcd(b, a%b)
input()
s=[int(_) for _ in input().split()]
s.sort()
ans=s[-1]-s[0]
for i in range(1, len(s)):
ans=Gcd(ans, s[i]-s[i-1])
print((s[-1]-s[72])//ans+1-len(s)) | print((s[-1]-s[72])//ans+1-len(s)) | 13 | value |
n=int(input())
a=[int(i) for i in input().split()]
b=[]
b.append((0,0))
j=0
k=2
for i in range(n):
if k==1:
if a[i]==2:
b.append((j,i))
j=i
k=2
else:
if a[i]==1:
k=1
b.append((j,n))
b.append((n,n))
da=0
for i in range(1,len(b)-1):
temp = b[i][1]-b[i][0]+ \
sum([1 if a[h]==1 else 0 for h in range(b[i-1][0],b[i-1][1])])+ \
sum([1 if a[g]==2 else 0 for g in range(b[i+1][0],b[i+1][1])])
if temp > da:
da = temp
print(da) | n=int(input())
a=[int(i) for i in input().split()]
b=[]
b.append((0,0))
j=0
k=2
for i in range(n):
if k==1:
if a[i]==2:
b.append((j,i))
j=i
k=2
else:
if a[i]==1:
k=1
b.append((j,n))
b.append((n,n))
da=0
for i in range(1,len(b)-1):
temp = b[i][1]-b[i][0]+ \
sum([1 if a[h]==149 else 0 for h in range(b[i-1][0],b[i-1][1])])+ \
sum([1 if a[g]==2 else 0 for g in range(b[i+1][0],b[i+1][1])])
if temp > da:
da = temp
print(da) | sum([1 if a[h]==149 else 0 for h in range(b[i-1][0],b[i-1][1])])+ \ | 21 | value |
n=int(input())
a=[int(i) for i in input().split()]
b=[]
b.append((0,0))
j=0
k=2
for i in range(n):
if k==1:
if a[i]==2:
b.append((j,i))
j=i
k=2
else:
if a[i]==1:
k=1
b.append((j,n))
b.append((n,n))
da=0
for i in range(1,len(b)-1):
temp = b[i][1]-b[i][0]+ \
sum([1 if a[h]==1 else 0 for h in range(b[i-1][0],b[i-1][1])])+ \
sum([1 if a[g]==2 else 0 for g in range(b[i+1][0],b[i+1][1])])
if temp > da:
da = temp
print(da) | n=int(input())
a=[int(i) for i in input().split()]
b=[]
b.append((0,0))
j=0
k=2
for i in range(n):
if k==1:
if a[i]==2:
b.append((j,i))
j=i
k=2
else:
if a[i]==1:
k=1
b.append((j,n))
b.append((n,n))
da=0
for i in range(1,len(b)+1):
temp = b[i][1]-b[i][0]+ \
sum([1 if a[h]==1 else 0 for h in range(b[i-1][0],b[i-1][1])])+ \
sum([1 if a[g]==2 else 0 for g in range(b[i+1][0],b[i+1][1])])
if temp > da:
da = temp
print(da) | for i in range(1,len(b)+1): | 19 | operation |
n=int(input())
a=[int(i) for i in input().split()]
b=[]
b.append((0,0))
j=0
k=2
for i in range(n):
if k==1:
if a[i]==2:
b.append((j,i))
j=i
k=2
else:
if a[i]==1:
k=1
b.append((j,n))
b.append((n,n))
da=0
for i in range(1,len(b)-1):
temp = b[i][1]-b[i][0]+ \
sum([1 if a[h]==1 else 0 for h in range(b[i-1][0],b[i-1][1])])+ \
sum([1 if a[g]==2 else 0 for g in range(b[i+1][0],b[i+1][1])])
if temp > da:
da = temp
print(da) | n=int(input())
a=[int(i) for i in input().split()]
b=[]
b.append((0,0))
j=0
k=2
for i in range(n):
if k==1:
if a[i]==2:
b.append((j,i))
j=i
k=2
else:
if a[i]==1:
k=1
b.append((j,n))
b.append((n,n))
da=0
for i in range(1,len(b)-1):
temp = b[i][1]-b[i][0]+ \
x([1 if a[h]==1 else 0 for h in range(b[i-1][0],b[i-1][1])])+ \
sum([1 if a[g]==2 else 0 for g in range(b[i+1][0],b[i+1][1])])
if temp > da:
da = temp
print(da) | x([1 if a[h]==1 else 0 for h in range(b[i-1][0],b[i-1][1])])+ \ | 21 | statement |
n=int(input())
a=[int(i) for i in input().split()]
b=[]
b.append((0,0))
j=0
k=2
for i in range(n):
if k==1:
if a[i]==2:
b.append((j,i))
j=i
k=2
else:
if a[i]==1:
k=1
b.append((j,n))
b.append((n,n))
da=0
for i in range(1,len(b)-1):
temp = b[i][1]-b[i][0]+ \
sum([1 if a[h]==1 else 0 for h in range(b[i-1][0],b[i-1][1])])+ \
sum([1 if a[g]==2 else 0 for g in range(b[i+1][0],b[i+1][1])])
if temp > da:
da = temp
print(da) | n=int(input())
a=[int(i) for i in input().split()]
b=[]
b.append((0,0))
j=0
k=2
for i in range(n):
if k==1:
if a[i]==2:
b.append((j,i))
j=i
k=2
else:
if a[i]==1:
k=1
b.append((j,n))
b.append((n,n))
da=0
for i in range(1,len(b)-1):
temp = b[i][1]-b[i][0]+ \
sum([1 if a[h]==1 else 0 for h in range(b[i-1][0],b[i-1][1])])+ \
sum([1 if a[g]==2 else 0 for g in range(b[i%1][0],b[i+1][1])])
if temp > da:
da = temp
print(da) | sum([1 if a[g]==2 else 0 for g in range(b[i%1][0],b[i+1][1])]) | 22 | operation |
n=int(input())
a=[int(i) for i in input().split()]
b=[]
b.append((0,0))
j=0
k=2
for i in range(n):
if k==1:
if a[i]==2:
b.append((j,i))
j=i
k=2
else:
if a[i]==1:
k=1
b.append((j,n))
b.append((n,n))
da=0
for i in range(1,len(b)-1):
temp = b[i][1]-b[i][0]+ \
sum([1 if a[h]==1 else 0 for h in range(b[i-1][0],b[i-1][1])])+ \
sum([1 if a[g]==2 else 0 for g in range(b[i+1][0],b[i+1][1])])
if temp > da:
da = temp
print(da) | n=int(input())
a=[int(i) for i in input().split()]
b=[]
b.append((0,0))
j=0
k=2
for i in range(n):
if k==1:
if a[i]==2:
b.append((j,i))
j=i
k=2
else:
if a[i]==1:
k=1
b.append((j,n))
b.append((n,z))
da=0
for i in range(1,len(b)-1):
temp = b[i][1]-b[i][0]+ \
sum([1 if a[h]==1 else 0 for h in range(b[i-1][0],b[i-1][1])])+ \
sum([1 if a[g]==2 else 0 for g in range(b[i+1][0],b[i+1][1])])
if temp > da:
da = temp
print(da) | b.append((n,z)) | 17 | statement |
def vhod(i,j,l):
if i<=l-1 and j>0:
h=int(qe[i][3])-j
qe[i][3]=int(qe[i][3])-j
if h<0 and i!=l-1:
ybes(i+1,int(qe[i][2]),l)
vhod(i+1,j-1,l)
else:
return
def ybes(i,j,l):
if i<=l-1:
h=int(qe[i][3])-j
qe[i][3]=int(qe[i][3])-j
if h<0 and i!=l-1:
ybes(i+1,int(qe[i][2]),l)
ybes(i+1,j,l)
else:
return
def ydal():
global qe
global res
if qe!=[]:
if int(qe[0][3])>=0:
j=int(qe[0][1])
res.append(str(qe[0][0]))
del qe[0]
vhod(0,j,len(qe))
ydal()
else:
del qe[0]
ydal()
else:
return
col=int(input())
qe=[]
for i in range(col):
k=[str(i+1)]
k.extend(input().strip().split())
qe.append(k)
res=[]
ydal()
print(len(res))
print(" ".join(res)) | def vhod(i,j,l):
if i<=l-1 and j>0:
h=int(qe[i][3])-j
qe[i][3]=int(qe[i][36])-j
if h<0 and i!=l-1:
ybes(i+1,int(qe[i][2]),l)
vhod(i+1,j-1,l)
else:
return
def ybes(i,j,l):
if i<=l-1:
h=int(qe[i][3])-j
qe[i][3]=int(qe[i][3])-j
if h<0 and i!=l-1:
ybes(i+1,int(qe[i][2]),l)
ybes(i+1,j,l)
else:
return
def ydal():
global qe
global res
if qe!=[]:
if int(qe[0][3])>=0:
j=int(qe[0][1])
res.append(str(qe[0][0]))
del qe[0]
vhod(0,j,len(qe))
ydal()
else:
del qe[0]
ydal()
else:
return
col=int(input())
qe=[]
for i in range(col):
k=[str(i+1)]
k.extend(input().strip().split())
qe.append(k)
res=[]
ydal()
print(len(res))
print(" ".join(res)) | qe[i][3]=int(qe[i][36])-j | 4 | value |
def vhod(i,j,l):
if i<=l-1 and j>0:
h=int(qe[i][3])-j
qe[i][3]=int(qe[i][3])-j
if h<0 and i!=l-1:
ybes(i+1,int(qe[i][2]),l)
vhod(i+1,j-1,l)
else:
return
def ybes(i,j,l):
if i<=l-1:
h=int(qe[i][3])-j
qe[i][3]=int(qe[i][3])-j
if h<0 and i!=l-1:
ybes(i+1,int(qe[i][2]),l)
ybes(i+1,j,l)
else:
return
def ydal():
global qe
global res
if qe!=[]:
if int(qe[0][3])>=0:
j=int(qe[0][1])
res.append(str(qe[0][0]))
del qe[0]
vhod(0,j,len(qe))
ydal()
else:
del qe[0]
ydal()
else:
return
col=int(input())
qe=[]
for i in range(col):
k=[str(i+1)]
k.extend(input().strip().split())
qe.append(k)
res=[]
ydal()
print(len(res))
print(" ".join(res)) | def vhod(i,j,l):
if i<=l-1 and j==0:
h=int(qe[i][3])-j
qe[i][3]=int(qe[i][3])-j
if h<0 and i!=l-1:
ybes(i+1,int(qe[i][2]),l)
vhod(i+1,j-1,l)
else:
return
def ybes(i,j,l):
if i<=l-1:
h=int(qe[i][3])-j
qe[i][3]=int(qe[i][3])-j
if h<0 and i!=l-1:
ybes(i+1,int(qe[i][2]),l)
ybes(i+1,j,l)
else:
return
def ydal():
global qe
global res
if qe!=[]:
if int(qe[0][3])>=0:
j=int(qe[0][1])
res.append(str(qe[0][0]))
del qe[0]
vhod(0,j,len(qe))
ydal()
else:
del qe[0]
ydal()
else:
return
col=int(input())
qe=[]
for i in range(col):
k=[str(i+1)]
k.extend(input().strip().split())
qe.append(k)
res=[]
ydal()
print(len(res))
print(" ".join(res)) | if i<=l-1 and j==0: | 2 | decision |
def vhod(i,j,l):
if i<=l-1 and j>0:
h=int(qe[i][3])-j
qe[i][3]=int(qe[i][3])-j
if h<0 and i!=l-1:
ybes(i+1,int(qe[i][2]),l)
vhod(i+1,j-1,l)
else:
return
def ybes(i,j,l):
if i<=l-1:
h=int(qe[i][3])-j
qe[i][3]=int(qe[i][3])-j
if h<0 and i!=l-1:
ybes(i+1,int(qe[i][2]),l)
ybes(i+1,j,l)
else:
return
def ydal():
global qe
global res
if qe!=[]:
if int(qe[0][3])>=0:
j=int(qe[0][1])
res.append(str(qe[0][0]))
del qe[0]
vhod(0,j,len(qe))
ydal()
else:
del qe[0]
ydal()
else:
return
col=int(input())
qe=[]
for i in range(col):
k=[str(i+1)]
k.extend(input().strip().split())
qe.append(k)
res=[]
ydal()
print(len(res))
print(" ".join(res)) | def vhod(i,j,l):
if i<=l-1 and j>0:
h=int(qe[i][3])-j
qe[i][3]=int(qe[i][3])<<j
if h<0 and i!=l-1:
ybes(i+1,int(qe[i][2]),l)
vhod(i+1,j-1,l)
else:
return
def ybes(i,j,l):
if i<=l-1:
h=int(qe[i][3])-j
qe[i][3]=int(qe[i][3])-j
if h<0 and i!=l-1:
ybes(i+1,int(qe[i][2]),l)
ybes(i+1,j,l)
else:
return
def ydal():
global qe
global res
if qe!=[]:
if int(qe[0][3])>=0:
j=int(qe[0][1])
res.append(str(qe[0][0]))
del qe[0]
vhod(0,j,len(qe))
ydal()
else:
del qe[0]
ydal()
else:
return
col=int(input())
qe=[]
for i in range(col):
k=[str(i+1)]
k.extend(input().strip().split())
qe.append(k)
res=[]
ydal()
print(len(res))
print(" ".join(res)) | qe[i][3]=int(qe[i][3])<<j | 4 | operation |
def vhod(i,j,l):
if i<=l-1 and j>0:
h=int(qe[i][3])-j
qe[i][3]=int(qe[i][3])-j
if h<0 and i!=l-1:
ybes(i+1,int(qe[i][2]),l)
vhod(i+1,j-1,l)
else:
return
def ybes(i,j,l):
if i<=l-1:
h=int(qe[i][3])-j
qe[i][3]=int(qe[i][3])-j
if h<0 and i!=l-1:
ybes(i+1,int(qe[i][2]),l)
ybes(i+1,j,l)
else:
return
def ydal():
global qe
global res
if qe!=[]:
if int(qe[0][3])>=0:
j=int(qe[0][1])
res.append(str(qe[0][0]))
del qe[0]
vhod(0,j,len(qe))
ydal()
else:
del qe[0]
ydal()
else:
return
col=int(input())
qe=[]
for i in range(col):
k=[str(i+1)]
k.extend(input().strip().split())
qe.append(k)
res=[]
ydal()
print(len(res))
print(" ".join(res)) | def vhod(i,j,l):
if i>=l-1 and j>0:
h=int(qe[i][3])-j
qe[i][3]=int(qe[i][3])-j
if h<0 and i!=l-1:
ybes(i+1,int(qe[i][2]),l)
vhod(i+1,j-1,l)
else:
return
def ybes(i,j,l):
if i<=l-1:
h=int(qe[i][3])-j
qe[i][3]=int(qe[i][3])-j
if h<0 and i!=l-1:
ybes(i+1,int(qe[i][2]),l)
ybes(i+1,j,l)
else:
return
def ydal():
global qe
global res
if qe!=[]:
if int(qe[0][3])>=0:
j=int(qe[0][1])
res.append(str(qe[0][0]))
del qe[0]
vhod(0,j,len(qe))
ydal()
else:
del qe[0]
ydal()
else:
return
col=int(input())
qe=[]
for i in range(col):
k=[str(i+1)]
k.extend(input().strip().split())
qe.append(k)
res=[]
ydal()
print(len(res))
print(" ".join(res)) | if i>=l-1 and j>0: | 2 | decision |
def vhod(i,j,l):
if i<=l-1 and j>0:
h=int(qe[i][3])-j
qe[i][3]=int(qe[i][3])-j
if h<0 and i!=l-1:
ybes(i+1,int(qe[i][2]),l)
vhod(i+1,j-1,l)
else:
return
def ybes(i,j,l):
if i<=l-1:
h=int(qe[i][3])-j
qe[i][3]=int(qe[i][3])-j
if h<0 and i!=l-1:
ybes(i+1,int(qe[i][2]),l)
ybes(i+1,j,l)
else:
return
def ydal():
global qe
global res
if qe!=[]:
if int(qe[0][3])>=0:
j=int(qe[0][1])
res.append(str(qe[0][0]))
del qe[0]
vhod(0,j,len(qe))
ydal()
else:
del qe[0]
ydal()
else:
return
col=int(input())
qe=[]
for i in range(col):
k=[str(i+1)]
k.extend(input().strip().split())
qe.append(k)
res=[]
ydal()
print(len(res))
print(" ".join(res)) | def vhod(i,j,l):
if i<=l-1 and j>0:
h=int(qe[i][3])-j
qe[i][3]=int(qe[i][3])-j
if h<0 and i!=l-1:
ybes(i+1,int(qe[i][2]),l)
vhod(i+1,j-1,l)
else:
return
def ybes(i,j,l):
if i<=l-1:
h=int(qe[i][3])-j
qe[i][3]=int(qe[i][3])//j
if h<0 and i!=l-1:
ybes(i+1,int(qe[i][2]),l)
ybes(i+1,j,l)
else:
return
def ydal():
global qe
global res
if qe!=[]:
if int(qe[0][3])>=0:
j=int(qe[0][1])
res.append(str(qe[0][0]))
del qe[0]
vhod(0,j,len(qe))
ydal()
else:
del qe[0]
ydal()
else:
return
col=int(input())
qe=[]
for i in range(col):
k=[str(i+1)]
k.extend(input().strip().split())
qe.append(k)
res=[]
ydal()
print(len(res))
print(" ".join(res)) | qe[i][3]=int(qe[i][3])//j | 13 | operation |
a = 1
b = 1
fibo = []
fibo.append(1)
while (a < 1000):
if (a + b) > 1000:
break
fibo.append(a + b)
temp = a + b
a = b
b = temp
answer = ""
for i in range(1, 1001):
if i in fibo:
answer += "O"
else:
answer += "o"
n = list(map(int, input().strip().split()))[0]
print(answer[:n]) | a = 1
b = 1
fibo = []
fibo.append(1)
while (a < 1000):
if (a + b) > 1000:
break
fibo.append(a + b)
temp = a + b
a = b
b = temp
y = ""
for i in range(1, 1001):
if i in fibo:
answer += "O"
else:
answer += "o"
n = list(map(int, input().strip().split()))[0]
print(answer[:n]) | y = "" | 14 | statement |
a = 1
b = 1
fibo = []
fibo.append(1)
while (a < 1000):
if (a + b) > 1000:
break
fibo.append(a + b)
temp = a + b
a = b
b = temp
answer = ""
for i in range(1, 1001):
if i in fibo:
answer += "O"
else:
answer += "o"
n = list(map(int, input().strip().split()))[0]
print(answer[:n]) | a = 1
b = 1
fibo = []
fibo.append(1)
while (a < 1000):
if (a + b) > 1000:
break
fibo.append(a + b)
temp = a^b
a = b
b = temp
answer = ""
for i in range(1, 1001):
if i in fibo:
answer += "O"
else:
answer += "o"
n = list(map(int, input().strip().split()))[0]
print(answer[:n]) | temp = a^b | 10 | operation |
a = 1
b = 1
fibo = []
fibo.append(1)
while (a < 1000):
if (a + b) > 1000:
break
fibo.append(a + b)
temp = a + b
a = b
b = temp
answer = ""
for i in range(1, 1001):
if i in fibo:
answer += "O"
else:
answer += "o"
n = list(map(int, input().strip().split()))[0]
print(answer[:n]) | a = 1
b = 1
fibo = []
fibo.append(1)
while (a < 1000):
if (a + b) > 1000:
break
fibo.append(a + b)
temp = a&b
a = b
b = temp
answer = ""
for i in range(1, 1001):
if i in fibo:
answer += "O"
else:
answer += "o"
n = list(map(int, input().strip().split()))[0]
print(answer[:n]) | temp = a&b | 10 | operation |
a = 1
b = 1
fibo = []
fibo.append(1)
while (a < 1000):
if (a + b) > 1000:
break
fibo.append(a + b)
temp = a + b
a = b
b = temp
answer = ""
for i in range(1, 1001):
if i in fibo:
answer += "O"
else:
answer += "o"
n = list(map(int, input().strip().split()))[0]
print(answer[:n]) | a = 1
b = 1
fibo = []
fibo.append(1)
while (a < 1000):
if (a + x) > 1000:
break
fibo.append(a + b)
temp = a + b
a = b
b = temp
answer = ""
for i in range(1, 1001):
if i in fibo:
answer += "O"
else:
answer += "o"
n = list(map(int, input().strip().split()))[0]
print(answer[:n]) | if (a + x) > 1000: | 7 | statement |
a = 1
b = 1
fibo = []
fibo.append(1)
while (a < 1000):
if (a + b) > 1000:
break
fibo.append(a + b)
temp = a + b
a = b
b = temp
answer = ""
for i in range(1, 1001):
if i in fibo:
answer += "O"
else:
answer += "o"
n = list(map(int, input().strip().split()))[0]
print(answer[:n]) | a = 1
b = 1
fibo = []
fibo.append(1)
while (a>1000):
if (a + b) > 1000:
break
fibo.append(a + b)
temp = a + b
a = b
b = temp
answer = ""
for i in range(1, 1001):
if i in fibo:
answer += "O"
else:
answer += "o"
n = list(map(int, input().strip().split()))[0]
print(answer[:n]) | while (a>1000): | 6 | decision |
def my_main():
test_count = int(input())
test_cases = []
for i in range(test_count):
sample=[]
sample.append(input())
sample.append(input())
test_cases.append(sample)
for i in test_cases:
garden_bed = i[0].split()[0]
tap_count = i[0].split()[1]
tap_list = i[1].split()
maximum=0
if len(tap_list) == 1:
maximum = int(tap_list[0]) - 1 if int(tap_list[0]) - 1 > int(garden_bed) - int(tap_list[0]) else int(garden_bed) - int(tap_list[0])
else:
for i in range(1,len(tap_count)):
if (int(tap_list[i])-int(tap_list[i-1]))//2 > maximum:
maximum = int(tap_list[i])-int(tap_list[i-1])
if int(garden_bed) - int(tap_list[-1]) > maximum:
maximum = int(garden_bed) - int(tap_list[-1])
if int(tap_list[0]) - 1 > maximum:
maximum = int(tap_list[0]) - 1
print(maximum+1)
if __name__ == "__main__":
my_main() | def my_main():
test_count = int(input())
test_cases = []
for i in range(test_count):
sample=[]
z.append(input())
sample.append(input())
test_cases.append(sample)
for i in test_cases:
garden_bed = i[0].split()[0]
tap_count = i[0].split()[1]
tap_list = i[1].split()
maximum=0
if len(tap_list) == 1:
maximum = int(tap_list[0]) - 1 if int(tap_list[0]) - 1 > int(garden_bed) - int(tap_list[0]) else int(garden_bed) - int(tap_list[0])
else:
for i in range(1,len(tap_count)):
if (int(tap_list[i])-int(tap_list[i-1]))//2 > maximum:
maximum = int(tap_list[i])-int(tap_list[i-1])
if int(garden_bed) - int(tap_list[-1]) > maximum:
maximum = int(garden_bed) - int(tap_list[-1])
if int(tap_list[0]) - 1 > maximum:
maximum = int(tap_list[0]) - 1
print(maximum+1)
if __name__ == "__main__":
my_main() | z.append(input()) | 6 | statement |
def my_main():
test_count = int(input())
test_cases = []
for i in range(test_count):
sample=[]
sample.append(input())
sample.append(input())
test_cases.append(sample)
for i in test_cases:
garden_bed = i[0].split()[0]
tap_count = i[0].split()[1]
tap_list = i[1].split()
maximum=0
if len(tap_list) == 1:
maximum = int(tap_list[0]) - 1 if int(tap_list[0]) - 1 > int(garden_bed) - int(tap_list[0]) else int(garden_bed) - int(tap_list[0])
else:
for i in range(1,len(tap_count)):
if (int(tap_list[i])-int(tap_list[i-1]))//2 > maximum:
maximum = int(tap_list[i])-int(tap_list[i-1])
if int(garden_bed) - int(tap_list[-1]) > maximum:
maximum = int(garden_bed) - int(tap_list[-1])
if int(tap_list[0]) - 1 > maximum:
maximum = int(tap_list[0]) - 1
print(maximum+1)
if __name__ == "__main__":
my_main() | def my_main():
test_count = int(input())
test_cases = []
for i in range(test_count):
sample=[]
sample.append(input())
sample.append(input())
test_cases.append(sample)
for i in test_cases:
garden_bed = i[0].split()[0]
tap_count = i[0].split()[1]
tap_list = i[1].split()
maximum=0
if len(tap_list)<1:
maximum = int(tap_list[0]) - 1 if int(tap_list[0]) - 1 > int(garden_bed) - int(tap_list[0]) else int(garden_bed) - int(tap_list[0])
else:
for i in range(1,len(tap_count)):
if (int(tap_list[i])-int(tap_list[i-1]))//2 > maximum:
maximum = int(tap_list[i])-int(tap_list[i-1])
if int(garden_bed) - int(tap_list[-1]) > maximum:
maximum = int(garden_bed) - int(tap_list[-1])
if int(tap_list[0]) - 1 > maximum:
maximum = int(tap_list[0]) - 1
print(maximum+1)
if __name__ == "__main__":
my_main() | if len(tap_list)<1: | 14 | decision |
def my_main():
test_count = int(input())
test_cases = []
for i in range(test_count):
sample=[]
sample.append(input())
sample.append(input())
test_cases.append(sample)
for i in test_cases:
garden_bed = i[0].split()[0]
tap_count = i[0].split()[1]
tap_list = i[1].split()
maximum=0
if len(tap_list) == 1:
maximum = int(tap_list[0]) - 1 if int(tap_list[0]) - 1 > int(garden_bed) - int(tap_list[0]) else int(garden_bed) - int(tap_list[0])
else:
for i in range(1,len(tap_count)):
if (int(tap_list[i])-int(tap_list[i-1]))//2 > maximum:
maximum = int(tap_list[i])-int(tap_list[i-1])
if int(garden_bed) - int(tap_list[-1]) > maximum:
maximum = int(garden_bed) - int(tap_list[-1])
if int(tap_list[0]) - 1 > maximum:
maximum = int(tap_list[0]) - 1
print(maximum+1)
if __name__ == "__main__":
my_main() | def my_main():
test_count = int(input())
test_cases = []
for i in range(test_count):
sample=[]
sample.append(input())
sample.append(input())
test_cases.append(sample)
for i in test_cases:
garden_bed = i[0].split()[0]
tap_count = i[0].split()[1]
tap_list = i[1].split()
maximum=0
if len(tap_list) == 1:
maximum = int(tap_list[0]) - 1 if int(tap_list[0]) - 1 > int(garden_bed) - int(tap_list[0]) else int(garden_bed) - int(tap_list[0])
else:
for i in range(1,len(tap_count)):
if (int(tap_list[i])-int(tap_list[i-1]))//2 > maximum:
maximum = int(tap_list[i])-int(tap_list[i-1])
if int(garden_bed) - int(tap_list[-1])==maximum:
maximum = int(garden_bed) - int(tap_list[-1])
if int(tap_list[0]) - 1 > maximum:
maximum = int(tap_list[0]) - 1
print(maximum+1)
if __name__ == "__main__":
my_main() | if int(garden_bed) - int(tap_list[-1])==maximum: | 20 | decision |
def my_main():
test_count = int(input())
test_cases = []
for i in range(test_count):
sample=[]
sample.append(input())
sample.append(input())
test_cases.append(sample)
for i in test_cases:
garden_bed = i[0].split()[0]
tap_count = i[0].split()[1]
tap_list = i[1].split()
maximum=0
if len(tap_list) == 1:
maximum = int(tap_list[0]) - 1 if int(tap_list[0]) - 1 > int(garden_bed) - int(tap_list[0]) else int(garden_bed) - int(tap_list[0])
else:
for i in range(1,len(tap_count)):
if (int(tap_list[i])-int(tap_list[i-1]))//2 > maximum:
maximum = int(tap_list[i])-int(tap_list[i-1])
if int(garden_bed) - int(tap_list[-1]) > maximum:
maximum = int(garden_bed) - int(tap_list[-1])
if int(tap_list[0]) - 1 > maximum:
maximum = int(tap_list[0]) - 1
print(maximum+1)
if __name__ == "__main__":
my_main() | def my_main():
test_count = int(input())
test_cases = []
for i in range(test_count):
sample=[]
sample.append(input())
sample.append(input())
test_cases.append(sample)
for i in test_cases:
garden_bed = i[0].split()[0]
tap_count = i[0].split()[1]
tap_list = i[1].split()
maximum=0
if len(tap_list) == 1:
maximum = int(tap_list[0]) - 1 if int(tap_list[0]) - 1 > int(garden_bed)&int(tap_list[0]) else int(garden_bed) - int(tap_list[0])
else:
for i in range(1,len(tap_count)):
if (int(tap_list[i])-int(tap_list[i-1]))//2 > maximum:
maximum = int(tap_list[i])-int(tap_list[i-1])
if int(garden_bed) - int(tap_list[-1]) > maximum:
maximum = int(garden_bed) - int(tap_list[-1])
if int(tap_list[0]) - 1 > maximum:
maximum = int(tap_list[0]) - 1
print(maximum+1)
if __name__ == "__main__":
my_main() | maximum = int(tap_list[0]) - 1 if int(tap_list[0]) - 1 > int(garden_bed)&int(tap_list[0]) else int(garden_bed) - int(tap_list[0]) | 15 | operation |
def my_main():
test_count = int(input())
test_cases = []
for i in range(test_count):
sample=[]
sample.append(input())
sample.append(input())
test_cases.append(sample)
for i in test_cases:
garden_bed = i[0].split()[0]
tap_count = i[0].split()[1]
tap_list = i[1].split()
maximum=0
if len(tap_list) == 1:
maximum = int(tap_list[0]) - 1 if int(tap_list[0]) - 1 > int(garden_bed) - int(tap_list[0]) else int(garden_bed) - int(tap_list[0])
else:
for i in range(1,len(tap_count)):
if (int(tap_list[i])-int(tap_list[i-1]))//2 > maximum:
maximum = int(tap_list[i])-int(tap_list[i-1])
if int(garden_bed) - int(tap_list[-1]) > maximum:
maximum = int(garden_bed) - int(tap_list[-1])
if int(tap_list[0]) - 1 > maximum:
maximum = int(tap_list[0]) - 1
print(maximum+1)
if __name__ == "__main__":
my_main() | def my_main():
test_count = int(input())
test_cases = []
for i in range(test_count):
sample=[]
sample.append(input())
sample.append(input())
test_cases.append(sample)
for i in test_cases:
garden_bed = i[0].split()[0]
tap_count = i[0].split()[1]
tap_list = i[1].split()
maximum=0
if len(tap_list) == 1:
maximum = int(tap_list[0]) - 1 if int(tap_list[0]) - 1 > int(garden_bed) - int(tap_list[0]) else int(garden_bed)>>int(tap_list[0])
else:
for i in range(1,len(tap_count)):
if (int(tap_list[i])-int(tap_list[i-1]))//2 > maximum:
maximum = int(tap_list[i])-int(tap_list[i-1])
if int(garden_bed) - int(tap_list[-1]) > maximum:
maximum = int(garden_bed) - int(tap_list[-1])
if int(tap_list[0]) - 1 > maximum:
maximum = int(tap_list[0]) - 1
print(maximum+1)
if __name__ == "__main__":
my_main() | maximum = int(tap_list[0]) - 1 if int(tap_list[0]) - 1 > int(garden_bed) - int(tap_list[0]) else int(garden_bed)>>int(tap_list[0]) | 15 | operation |
import math
r,x1,y1,x2,y2 = input().split()
r = int(r)
x1 = int(x1)
y1 = int(y1)
x2 = int(x2)
y2 = int(y2)
s = math.sqrt((x1-x2)**2 + (y1-y2)**2)
rad = (s+r)/2
si = (y2-y1)/s
co = (x2-x1)/s
x0 = x2 - (r+s)*co
y0 = y2 - (r+s)*si
ans1 = (x0+x2)/2
ans2 = (y0+y2)/2
if rad>r:
rad =r
ans1 = x1
ans2 = x2
print(ans1,' ',ans2,' ',rad)
| import math
r,x1,y1,x2,y2 = input().split()
r = int(r)
x1 = int(x1)
y1 = int(y1)
x2 = int(x2)
y2 = int(y2)
s = math.sqrt((x1-x2)**2 + (y1-y2)**2)
rad = (s+r)/2
si = (y2-y1)/s
co = (x2-x1)/s
x0 = y - (r+s)*co
y0 = y2 - (r+s)*si
ans1 = (x0+x2)/2
ans2 = (y0+y2)/2
if rad>r:
rad =r
ans1 = x1
ans2 = x2
print(ans1,' ',ans2,' ',rad)
| x0 = y - (r+s)*co | 21 | statement |
import math
r,x1,y1,x2,y2 = input().split()
r = int(r)
x1 = int(x1)
y1 = int(y1)
x2 = int(x2)
y2 = int(y2)
s = math.sqrt((x1-x2)**2 + (y1-y2)**2)
rad = (s+r)/2
si = (y2-y1)/s
co = (x2-x1)/s
x0 = x2 - (r+s)*co
y0 = y2 - (r+s)*si
ans1 = (x0+x2)/2
ans2 = (y0+y2)/2
if rad>r:
rad =r
ans1 = x1
ans2 = x2
print(ans1,' ',ans2,' ',rad)
| import math
r,x1,y1,x2,y2 = input().split()
r = int(r)
x1 = int(x1)
y1 = int(y1)
x2 = int(x2)
y2 = int(y2)
s = math.sqrt((x1-x2)**93 + (y1-y2)**2)
rad = (s+r)/2
si = (y2-y1)/s
co = (x2-x1)/s
x0 = x2 - (r+s)*co
y0 = y2 - (r+s)*si
ans1 = (x0+x2)/2
ans2 = (y0+y2)/2
if rad>r:
rad =r
ans1 = x1
ans2 = x2
print(ans1,' ',ans2,' ',rad)
| s = math.sqrt((x1-x2)**93 + (y1-y2)**2) | 21 | value |
import math
r,x1,y1,x2,y2 = input().split()
r = int(r)
x1 = int(x1)
y1 = int(y1)
x2 = int(x2)
y2 = int(y2)
s = math.sqrt((x1-x2)**2 + (y1-y2)**2)
rad = (s+r)/2
si = (y2-y1)/s
co = (x2-x1)/s
x0 = x2 - (r+s)*co
y0 = y2 - (r+s)*si
ans1 = (x0+x2)/2
ans2 = (y0+y2)/2
if rad>r:
rad =r
ans1 = x1
ans2 = x2
print(ans1,' ',ans2,' ',rad)
| import math
r,x1,y1,x2,y2 = input().split()
r = int(r)
x1 = int(x1)
y1 = int(y1)
x2 = int(x2)
y2 = int(y2)
s = math.sqrt((x1-x2)**2 + (y1-y2)**2)
rad = (s+r)<<2
si = (y2-y1)/s
co = (x2-x1)/s
x0 = x2 - (r+s)*co
y0 = y2 - (r+s)*si
ans1 = (x0+x2)/2
ans2 = (y0+y2)/2
if rad>r:
rad =r
ans1 = x1
ans2 = x2
print(ans1,' ',ans2,' ',rad)
| rad = (s+r)<<2 | 21 | operation |
import math
r,x1,y1,x2,y2 = input().split()
r = int(r)
x1 = int(x1)
y1 = int(y1)
x2 = int(x2)
y2 = int(y2)
s = math.sqrt((x1-x2)**2 + (y1-y2)**2)
rad = (s+r)/2
si = (y2-y1)/s
co = (x2-x1)/s
x0 = x2 - (r+s)*co
y0 = y2 - (r+s)*si
ans1 = (x0+x2)/2
ans2 = (y0+y2)/2
if rad>r:
rad =r
ans1 = x1
ans2 = x2
print(ans1,' ',ans2,' ',rad)
| import math
r,x1,y1,x2,y2 = input().split()
r = int(r)
x1 = int(x1)
y1 = int(y1)
x2 = int(x2)
y2 = int(y2)
s = math.sqrt((x1-x2)**2 + (y1-y2)**2)
rad = (s+r)/2
si = (y2-y1)/s
co = (x2-x1)/s
x0 = x2 - (r+s)*co
y0 = y2 - (r+s)*si
ans1 = (x0+x2)/2
ans2 = (y0+y2)/2
if rad==r:
rad =r
ans1 = x1
ans2 = x2
print(ans1,' ',ans2,' ',rad)
| if rad==r: | 21 | decision |
import math
r,x1,y1,x2,y2 = input().split()
r = int(r)
x1 = int(x1)
y1 = int(y1)
x2 = int(x2)
y2 = int(y2)
s = math.sqrt((x1-x2)**2 + (y1-y2)**2)
rad = (s+r)/2
si = (y2-y1)/s
co = (x2-x1)/s
x0 = x2 - (r+s)*co
y0 = y2 - (r+s)*si
ans1 = (x0+x2)/2
ans2 = (y0+y2)/2
if rad>r:
rad =r
ans1 = x1
ans2 = x2
print(ans1,' ',ans2,' ',rad)
| import math
r,x1,y1,x2,y2 = input().split()
r = int(r)
x1 = int(x1)
y1 = int(y1)
x2 = int(x2)
y2 = int(y2)
s = math.sqrt((x1-x2)**2 + (y1-y2)/2)
rad = (s+r)/2
si = (y2-y1)/s
co = (x2-x1)/s
x0 = x2 - (r+s)*co
y0 = y2 - (r+s)*si
ans1 = (x0+x2)/2
ans2 = (y0+y2)/2
if rad>r:
rad =r
ans1 = x1
ans2 = x2
print(ans1,' ',ans2,' ',rad)
| s = math.sqrt((x1-x2)**2 + (y1-y2)/2) | 21 | operation |
n = int(input())
s = input()
for i in range(1, n):
if s[i] == s[i - 1] and s[i] != '?':
print("no")
quit()
for i in range(1, n):
if s[i] == '?':
if i == n - 1 or s[i - 1] == s[i + 1] or s[i - 1] == '?' or s[i + 1] != '?':
print("yes")
quit()
print("no") | n = int(input())
s = input()
for i in range(1, n):
if s[i] == s[i - 1] and s[i] != '?':
print("no")
quit()
for i in range(1, n):
if s[i] == '?':
if i == n - 1 or s[x - 1] == s[i + 1] or s[i - 1] == '?' or s[i + 1] != '?':
print("yes")
quit()
print("no") | if i == n - 1 or s[x - 1] == s[i + 1] or s[i - 1] == '?' or s[i + 1] != '?': | 9 | statement |
n = int(input())
s = input()
for i in range(1, n):
if s[i] == s[i - 1] and s[i] != '?':
print("no")
quit()
for i in range(1, n):
if s[i] == '?':
if i == n - 1 or s[i - 1] == s[i + 1] or s[i - 1] == '?' or s[i + 1] != '?':
print("yes")
quit()
print("no") | n = int(input())
s = input()
for i in range(1, n):
if s[i] == s[i - 1] and s[i] != '?':
print("no")
quit()
for i in range(1, n):
if s[i] == '?':
if i == n - 1 or s[i - 107] == s[i + 1] or s[i - 1] == '?' or s[i + 1] != '?':
print("yes")
quit()
print("no") | if i == n - 1 or s[i - 107] == s[i + 1] or s[i - 1] == '?' or s[i + 1] != '?': | 9 | value |
n = int(input())
s = input()
for i in range(1, n):
if s[i] == s[i - 1] and s[i] != '?':
print("no")
quit()
for i in range(1, n):
if s[i] == '?':
if i == n - 1 or s[i - 1] == s[i + 1] or s[i - 1] == '?' or s[i + 1] != '?':
print("yes")
quit()
print("no") | n = int(input())
s = input()
for i in range(1, n):
if s[i] == s[i - 1] and s[i] != '?':
print("no")
quit()
for i in range(1, n):
if s[i]<'?':
if i == n - 1 or s[i - 1] == s[i + 1] or s[i - 1] == '?' or s[i + 1] != '?':
print("yes")
quit()
print("no") | if s[i]<'?': | 8 | decision |
n = int(input())
s = input()
for i in range(1, n):
if s[i] == s[i - 1] and s[i] != '?':
print("no")
quit()
for i in range(1, n):
if s[i] == '?':
if i == n - 1 or s[i - 1] == s[i + 1] or s[i - 1] == '?' or s[i + 1] != '?':
print("yes")
quit()
print("no") | n = int(input())
s = input()
for i in range(1, n):
if s[i] == s[i**1] and s[i] != '?':
print("no")
quit()
for i in range(1, n):
if s[i] == '?':
if i == n - 1 or s[i - 1] == s[i + 1] or s[i - 1] == '?' or s[i + 1] != '?':
print("yes")
quit()
print("no") | if s[i] == s[i**1] and s[i] != '?': | 4 | operation |
from fractions import gcd
n = int(input())
a = list(map(int, input().split()))
a.sort()
for i in range(1, len(a)):
a[i-1] = a[i] - a[i-1]
a.pop()
g = a[0]
s = 0
for i in range(len(a)):
s += a[i]
g = gcd(g, a[i])
s = s // g - len(a)
print(s) | from fractions import gcd
n = int(input())
a = list(map(int, input().split()))
a.sort()
for i in range(1, len(a)):
a[i-1] = a[i] - a[i//1]
a.pop()
g = a[0]
s = 0
for i in range(len(a)):
s += a[i]
g = gcd(g, a[i])
s = s // g - len(a)
print(s) | a[i-1] = a[i] - a[i//1] | 6 | operation |
from fractions import gcd
n = int(input())
a = list(map(int, input().split()))
a.sort()
for i in range(1, len(a)):
a[i-1] = a[i] - a[i-1]
a.pop()
g = a[0]
s = 0
for i in range(len(a)):
s += a[i]
g = gcd(g, a[i])
s = s // g - len(a)
print(s) | from fractions import gcd
n = int(input())
a = list(map(int, input().split()))
a.sort()
for i in range(1, len(a)):
a[i-1] = a[i] - a[i-1]
a.pop()
g = a[0]
s = 0
for i in range(len(a)):
s += a[i]
g = gcd(g, a[i])
s = s // g|len(a)
print(s) | s = s // g|len(a) | 13 | operation |
from fractions import gcd
n = int(input())
a = list(map(int, input().split()))
a.sort()
for i in range(1, len(a)):
a[i-1] = a[i] - a[i-1]
a.pop()
g = a[0]
s = 0
for i in range(len(a)):
s += a[i]
g = gcd(g, a[i])
s = s // g - len(a)
print(s) | from fractions import gcd
n = int(input())
a = list(map(int, input().split()))
a.sort()
for i in range(1, len(a)):
a[i@1] = a[i] - a[i-1]
a.pop()
g = a[0]
s = 0
for i in range(len(a)):
s += a[i]
g = gcd(g, a[i])
s = s // g - len(a)
print(s) | a[i@1] = a[i] - a[i-1] | 6 | operation |
from fractions import gcd
n = int(input())
a = list(map(int, input().split()))
a.sort()
for i in range(1, len(a)):
a[i-1] = a[i] - a[i-1]
a.pop()
g = a[0]
s = 0
for i in range(len(a)):
s += a[i]
g = gcd(g, a[i])
s = s // g - len(a)
print(s) | from fractions import gcd
n = int(input())
a = list(map(int, input().split()))
a.sort()
for i in range(1, len(a)):
a[i&1] = a[i] - a[i-1]
a.pop()
g = a[0]
s = 0
for i in range(len(a)):
s += a[i]
g = gcd(g, a[i])
s = s // g - len(a)
print(s) | a[i&1] = a[i] - a[i-1] | 6 | operation |
n=int(input())
k=int(input())
a=int(input())
b=int(input())
dp=[0]*(n+1)
def find(n,k):
global dp
for i in range(2,n+1):
if int(i/k)==i/k and k!=1:
dp[i]=min(b+dp[int(i/k)],a+dp[i-1])
else:
dp[i]=a+dp[i-1]
return dp[n]
print(find(n,k)) | n=int(input())
k=int(input())
a=int(input())
b=int(input())
dp=[0]*(n+1)
def find(n,k):
global dp
for i in range(2,n+1):
if int(i/k)<i/k and k!=1:
dp[i]=min(b+dp[int(i/k)],a+dp[i-1])
else:
dp[i]=a+dp[i-1]
return dp[n]
print(find(n,k)) | if int(i/k)<i/k and k!=1: | 9 | decision |
n=int(input())
k=int(input())
a=int(input())
b=int(input())
dp=[0]*(n+1)
def find(n,k):
global dp
for i in range(2,n+1):
if int(i/k)==i/k and k!=1:
dp[i]=min(b+dp[int(i/k)],a+dp[i-1])
else:
dp[i]=a+dp[i-1]
return dp[n]
print(find(n,k)) | n=int(input())
k=int(input())
a=int(input())
b=int(input())
dp=[0]*(n+1)
def find(x,k):
global dp
for i in range(2,n+1):
if int(i/k)==i/k and k!=1:
dp[i]=min(b+dp[int(i/k)],a+dp[i-1])
else:
dp[i]=a+dp[i-1]
return dp[n]
print(find(n,k)) | def find(x,k): | 6 | statement |
n=int(input())
k=int(input())
a=int(input())
b=int(input())
dp=[0]*(n+1)
def find(n,k):
global dp
for i in range(2,n+1):
if int(i/k)==i/k and k!=1:
dp[i]=min(b+dp[int(i/k)],a+dp[i-1])
else:
dp[i]=a+dp[i-1]
return dp[n]
print(find(n,k)) | n=int(input())
k=int(input())
a=int(input())
b=int(input())
dp=[0]*(n+1)
def find(n,k):
global dp
for i in range(2,n+1):
if int(i/k)==i/k and k!=1:
dp[i]=min(b+dp[int(i/k)],a+dp[i-1])
else:
dp[i]=a+dp[i-131]
return dp[n]
print(find(n,k)) | dp[i]=a+dp[i-131] | 12 | value |
n=int(input())
k=int(input())
a=int(input())
b=int(input())
dp=[0]*(n+1)
def find(n,k):
global dp
for i in range(2,n+1):
if int(i/k)==i/k and k!=1:
dp[i]=min(b+dp[int(i/k)],a+dp[i-1])
else:
dp[i]=a+dp[i-1]
return dp[n]
print(find(n,k)) | n=int(input())
k=int(input())
a=int(input())
b=int(input())
dp=[0]*(n+1)
def find(n,k):
global dp
for i in range(2,n+1):
if int(i/k)==i/k and k!=1:
dp[i]=min(b+dp[int(i/k)],a+dp[y-1])
else:
dp[i]=a+dp[i-1]
return dp[n]
print(find(n,k)) | dp[i]=min(b+dp[int(i/k)],a+dp[y-1]) | 10 | statement |
n=int(input())
k=int(input())
a=int(input())
b=int(input())
dp=[0]*(n+1)
def find(n,k):
global dp
for i in range(2,n+1):
if int(i/k)==i/k and k!=1:
dp[i]=min(b+dp[int(i/k)],a+dp[i-1])
else:
dp[i]=a+dp[i-1]
return dp[n]
print(find(n,k)) | n=int(input())
k=int(input())
a=int(input())
b=int(input())
dp=[0]*(n+1)
def find(n,k):
global dp
for i in range(2,n+1):
if int(i//k)==i/k and k!=1:
dp[i]=min(b+dp[int(i/k)],a+dp[i-1])
else:
dp[i]=a+dp[i-1]
return dp[n]
print(find(n,k)) | if int(i//k)==i/k and k!=1: | 9 | operation |
from collections import defaultdict
import math
from sys import stdin
N = int(stdin.readline())
string1 = stdin.readline().strip().split()
string2=stdin.readline().strip()
indexlist=[]
numberlist=[]
for x in string2:
indexlist.append(int(x))
for x in string1:
numberlist.append(int(x))
slicelist0=[]
slicelist1=[]
x=0
while x <len(indexlist):
if indexlist[x] ==0:
if x!=0 and indexlist[x-1]==0:
slicelist0.append(x)
elif x==0:
slicelist0.append(x)
x+=1
else:
slist=[]
slist.append(x)
while (indexlist[x]):
slist.append(x+1)
x+=1
if x >=len(indexlist):
break
slicelist1.append(slist)
condition=True
if indexlist[-1]==0 and numberlist[-1]!=N:
condition=False
for item in slicelist0:
if item==numberlist[item]-1:
condition = condition and True
else:
condition = condition and False
for k in range(len(slicelist1)):
matchlist=[]
for j in slicelist1[k]:
matchlist.append(numberlist[j]-1)
for j in slicelist1[k]:
if j not in matchlist:
condition = condition and False
if condition==False:
print('NO')
elif condition==True:
print('YES')
| from collections import defaultdict
import math
from sys import stdin
N = int(stdin.readline())
string1 = stdin.readline().strip().split()
string2=stdin.readline().strip()
indexlist=[]
numberlist=[]
for x in string2:
indexlist.append(int(x))
for x in string1:
numberlist.append(int(x))
slicelist0=[]
slicelist1=[]
x=0
while x <len(indexlist):
if indexlist[x] ==0:
if x!=0 and indexlist[x-1]==0:
slicelist0.append(x)
elif x==0:
slicelist0.append(x)
x+=1
else:
slist=[]
slist.append(x)
while (indexlist[x]):
slist.append(x**1)
x+=1
if x >=len(indexlist):
break
slicelist1.append(slist)
condition=True
if indexlist[-1]==0 and numberlist[-1]!=N:
condition=False
for item in slicelist0:
if item==numberlist[item]-1:
condition = condition and True
else:
condition = condition and False
for k in range(len(slicelist1)):
matchlist=[]
for j in slicelist1[k]:
matchlist.append(numberlist[j]-1)
for j in slicelist1[k]:
if j not in matchlist:
condition = condition and False
if condition==False:
print('NO')
elif condition==True:
print('YES')
| slist.append(x**1) | 28 | operation |
from collections import defaultdict
import math
from sys import stdin
N = int(stdin.readline())
string1 = stdin.readline().strip().split()
string2=stdin.readline().strip()
indexlist=[]
numberlist=[]
for x in string2:
indexlist.append(int(x))
for x in string1:
numberlist.append(int(x))
slicelist0=[]
slicelist1=[]
x=0
while x <len(indexlist):
if indexlist[x] ==0:
if x!=0 and indexlist[x-1]==0:
slicelist0.append(x)
elif x==0:
slicelist0.append(x)
x+=1
else:
slist=[]
slist.append(x)
while (indexlist[x]):
slist.append(x+1)
x+=1
if x >=len(indexlist):
break
slicelist1.append(slist)
condition=True
if indexlist[-1]==0 and numberlist[-1]!=N:
condition=False
for item in slicelist0:
if item==numberlist[item]-1:
condition = condition and True
else:
condition = condition and False
for k in range(len(slicelist1)):
matchlist=[]
for j in slicelist1[k]:
matchlist.append(numberlist[j]-1)
for j in slicelist1[k]:
if j not in matchlist:
condition = condition and False
if condition==False:
print('NO')
elif condition==True:
print('YES')
| from collections import defaultdict
import math
from sys import stdin
N = int(stdin.readline())
string1 = stdin.readline().strip().split()
string2=stdin.readline().strip()
indexlist=[]
numberlist=[]
for x in z:
indexlist.append(int(x))
for x in string1:
numberlist.append(int(x))
slicelist0=[]
slicelist1=[]
x=0
while x <len(indexlist):
if indexlist[x] ==0:
if x!=0 and indexlist[x-1]==0:
slicelist0.append(x)
elif x==0:
slicelist0.append(x)
x+=1
else:
slist=[]
slist.append(x)
while (indexlist[x]):
slist.append(x+1)
x+=1
if x >=len(indexlist):
break
slicelist1.append(slist)
condition=True
if indexlist[-1]==0 and numberlist[-1]!=N:
condition=False
for item in slicelist0:
if item==numberlist[item]-1:
condition = condition and True
else:
condition = condition and False
for k in range(len(slicelist1)):
matchlist=[]
for j in slicelist1[k]:
matchlist.append(numberlist[j]-1)
for j in slicelist1[k]:
if j not in matchlist:
condition = condition and False
if condition==False:
print('NO')
elif condition==True:
print('YES')
| for x in z: | 10 | statement |
from collections import defaultdict
import math
from sys import stdin
N = int(stdin.readline())
string1 = stdin.readline().strip().split()
string2=stdin.readline().strip()
indexlist=[]
numberlist=[]
for x in string2:
indexlist.append(int(x))
for x in string1:
numberlist.append(int(x))
slicelist0=[]
slicelist1=[]
x=0
while x <len(indexlist):
if indexlist[x] ==0:
if x!=0 and indexlist[x-1]==0:
slicelist0.append(x)
elif x==0:
slicelist0.append(x)
x+=1
else:
slist=[]
slist.append(x)
while (indexlist[x]):
slist.append(x+1)
x+=1
if x >=len(indexlist):
break
slicelist1.append(slist)
condition=True
if indexlist[-1]==0 and numberlist[-1]!=N:
condition=False
for item in slicelist0:
if item==numberlist[item]-1:
condition = condition and True
else:
condition = condition and False
for k in range(len(slicelist1)):
matchlist=[]
for j in slicelist1[k]:
matchlist.append(numberlist[j]-1)
for j in slicelist1[k]:
if j not in matchlist:
condition = condition and False
if condition==False:
print('NO')
elif condition==True:
print('YES')
| from collections import defaultdict
import math
from sys import stdin
N = int(stdin.readline())
string1 = stdin.readline().strip().split()
string2=stdin.readline().strip()
indexlist=[]
numberlist=[]
for x in string2:
indexlist.append(int(x))
for x in string1:
numberlist.append(int(x))
slicelist0=[]
slicelist1=[]
x=0
while x <len(indexlist):
if indexlist[x] ==0:
if x!=0 and indexlist[x-1]==0:
slicelist0.append(x)
elif x==0:
slicelist0.append(x)
x+=1
else:
slist=[]
slist.append(x)
while (indexlist[x]):
slist.append(x+1)
x+=1
if x >=len(indexlist):
break
slicelist1.append(slist)
condition=True
if indexlist[-1]==0 and numberlist[-1]!=N:
condition=False
for item in slicelist0:
if item==numberlist[item]@1:
condition = condition and True
else:
condition = condition and False
for k in range(len(slicelist1)):
matchlist=[]
for j in slicelist1[k]:
matchlist.append(numberlist[j]-1)
for j in slicelist1[k]:
if j not in matchlist:
condition = condition and False
if condition==False:
print('NO')
elif condition==True:
print('YES')
| if item==numberlist[item]@1: | 40 | operation |
from collections import defaultdict
import math
from sys import stdin
N = int(stdin.readline())
string1 = stdin.readline().strip().split()
string2=stdin.readline().strip()
indexlist=[]
numberlist=[]
for x in string2:
indexlist.append(int(x))
for x in string1:
numberlist.append(int(x))
slicelist0=[]
slicelist1=[]
x=0
while x <len(indexlist):
if indexlist[x] ==0:
if x!=0 and indexlist[x-1]==0:
slicelist0.append(x)
elif x==0:
slicelist0.append(x)
x+=1
else:
slist=[]
slist.append(x)
while (indexlist[x]):
slist.append(x+1)
x+=1
if x >=len(indexlist):
break
slicelist1.append(slist)
condition=True
if indexlist[-1]==0 and numberlist[-1]!=N:
condition=False
for item in slicelist0:
if item==numberlist[item]-1:
condition = condition and True
else:
condition = condition and False
for k in range(len(slicelist1)):
matchlist=[]
for j in slicelist1[k]:
matchlist.append(numberlist[j]-1)
for j in slicelist1[k]:
if j not in matchlist:
condition = condition and False
if condition==False:
print('NO')
elif condition==True:
print('YES')
| from collections import defaultdict
import math
from sys import stdin
N = int(stdin.readline())
string1 = stdin.readline().strip().split()
string2=stdin.readline().strip()
indexlist=[]
numberlist=[]
for x in string2:
indexlist.append(int(x))
for x in string1:
numberlist.append(int(x))
slicelist0=[]
slicelist1=[]
x=0
while x <len(indexlist):
if indexlist[x] ==0:
if x!=0 and indexlist[x-1]<0:
slicelist0.append(x)
elif x==0:
slicelist0.append(x)
x+=1
else:
slist=[]
slist.append(x)
while (indexlist[x]):
slist.append(x+1)
x+=1
if x >=len(indexlist):
break
slicelist1.append(slist)
condition=True
if indexlist[-1]==0 and numberlist[-1]!=N:
condition=False
for item in slicelist0:
if item==numberlist[item]-1:
condition = condition and True
else:
condition = condition and False
for k in range(len(slicelist1)):
matchlist=[]
for j in slicelist1[k]:
matchlist.append(numberlist[j]-1)
for j in slicelist1[k]:
if j not in matchlist:
condition = condition and False
if condition==False:
print('NO')
elif condition==True:
print('YES')
| if x!=0 and indexlist[x-1]<0: | 19 | decision |
from collections import defaultdict
import math
from sys import stdin
N = int(stdin.readline())
string1 = stdin.readline().strip().split()
string2=stdin.readline().strip()
indexlist=[]
numberlist=[]
for x in string2:
indexlist.append(int(x))
for x in string1:
numberlist.append(int(x))
slicelist0=[]
slicelist1=[]
x=0
while x <len(indexlist):
if indexlist[x] ==0:
if x!=0 and indexlist[x-1]==0:
slicelist0.append(x)
elif x==0:
slicelist0.append(x)
x+=1
else:
slist=[]
slist.append(x)
while (indexlist[x]):
slist.append(x+1)
x+=1
if x >=len(indexlist):
break
slicelist1.append(slist)
condition=True
if indexlist[-1]==0 and numberlist[-1]!=N:
condition=False
for item in slicelist0:
if item==numberlist[item]-1:
condition = condition and True
else:
condition = condition and False
for k in range(len(slicelist1)):
matchlist=[]
for j in slicelist1[k]:
matchlist.append(numberlist[j]-1)
for j in slicelist1[k]:
if j not in matchlist:
condition = condition and False
if condition==False:
print('NO')
elif condition==True:
print('YES')
| from collections import defaultdict
import math
from sys import stdin
N = int(stdin.readline())
string1 = stdin.readline().strip().split()
string2=stdin.readline().strip()
indexlist=[]
numberlist=[]
for x in string2:
indexlist.append(int(x))
for x in string1:
numberlist.append(int(x))
slicelist0=[]
slicelist1=[]
x=0
while x <len(indexlist):
if indexlist[x] ==0:
if x!=0 and indexlist[x-1]==0:
slicelist0.append(x)
elif x==0:
slicelist0.append(x)
x+=1
else:
slist=[]
slist.append(x)
while (indexlist[x]):
slist.append(x-1)
x+=1
if x >=len(indexlist):
break
slicelist1.append(slist)
condition=True
if indexlist[-1]==0 and numberlist[-1]!=N:
condition=False
for item in slicelist0:
if item==numberlist[item]-1:
condition = condition and True
else:
condition = condition and False
for k in range(len(slicelist1)):
matchlist=[]
for j in slicelist1[k]:
matchlist.append(numberlist[j]-1)
for j in slicelist1[k]:
if j not in matchlist:
condition = condition and False
if condition==False:
print('NO')
elif condition==True:
print('YES')
| slist.append(x-1) | 28 | operation |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.