problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k | fixed_code stringlengths 12 526k | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M | fixed_submission_id int64 2 1.54M | user_id stringlengths 10 10 | language stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p02726 | n, x, y = map(int, input().split())
ans = {}
for i in range(n-1):
ans[i+1] = 0
for i in range(n):
for j in range(i+1,n):
if i <= x-i:
if j <= x-1:
t=j-i
ans[t] += 1
elif j <= y-1:
t = min(j-i, (x-1)-i + 1 + (y-1) -j)
ans[t] += 1
else: #j > y-1
t = (x-1)-i... | n, x, y = map(int, input().split())
ans = {}
for i in range(n-1):
ans[i+1] = 0
for i in range(n):
for j in range(i+1,n):
if i <= x-1:
if j <= x-1:
t=j-i
ans[t] += 1
elif j <= y-1:
t = min(j-i, (x-1)-i + 1 + (y-1) -j)
ans[t] += 1
else: #j > y-1
t = (x-1)-i... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.branch.if.condition.change"
] | 501,892 | 501,891 | u197457087 | python |
p02726 | import collections
n,x,y=map(int,input().split())
lit=[]
for i in range(1,N+1):
for j in range(i+1,N+1):
lit.append(min(abs(i-j),abs(x-j)+abs(y-i)+1,abs(y-j)+abs(x-i)+1))
a=lit.collections.Counter
for i in range(1,N):
print(a[i]) | import collections
N,x,y=map(int,input().split())
lit=[]
for i in range(1,N+1):
for j in range(i+1,N+1):
lit.append(min(abs(i-j),abs(x-j)+abs(y-i)+1,abs(y-j)+abs(x-i)+1))
a=collections.Counter(lit)
for i in range(1,N):
print(a[i]) | [
"assignment.variable.change",
"identifier.change",
"call.arguments.add"
] | 501,910 | 501,911 | u257265865 | python |
p02726 | import sys
from collections import defaultdict
# from collections import Counter
# from queue import PriorityQueue
# sys.setrecursionlimit(2000000)
def distance(X, Y, start, goal):
ans = float('inf')
tmp = goal - start
if tmp < ans:
ans = tmp
# start ~ X ~ Y ~ goal,
tmp = abs(X - start) +... | import sys
from collections import defaultdict
# from collections import Counter
# from queue import PriorityQueue
# sys.setrecursionlimit(2000000)
def distance(X, Y, start, goal):
ans = float('inf')
tmp = goal - start
if tmp < ans:
ans = tmp
# start ~ X ~ Y ~ goal,
tmp = abs(X - start) +... | [
"call.remove",
"call.arguments.change"
] | 501,912 | 501,913 | u558528117 | python |
p02726 | N,X,Y=map(int,input().split())
if X > Y:
exc=X
X=Y
Y=exc
L=[0]*N
for i in range(N-1):
for j in range(i+1,N):
if i >= Y-1 or j <= X-1 or j-1 ==1:
L[j-i]+=1
elif i <= X-1 and j >= Y-1:
L[1+abs(X-1-i)+abs(Y-1-j)]+=1
elif i >= X-1 and i-(X-1) > (Y-1)-i:
... | N,X,Y=map(int,input().split())
if X > Y:
exc=X
X=Y
Y=exc
L=[0]*N
for i in range(N-1):
for j in range(i+1,N):
if i >= Y-1 or j <= X-1 or j-i ==1:
L[j-i]+=1
elif i <= X-1 and j >= Y-1:
L[1+abs(X-1-i)+abs(Y-1-j)]+=1
elif i >= X-1 and i-(X-1) > (Y-1)-i:
... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 501,918 | 501,919 | u472534477 | python |
p02726 | N, X, Y = map(int, input().split())
c = [0 for i in range(N)]
print(c)
for i in range(1,N):
for j in range(i+1,N+1):
x = abs(X-i)
y = abs(Y-j)
a = min(x+y+1,j-i)
c[a]+=1
for i in range(1,N):
ans = c[i]
print(ans)
| N, X, Y = map(int, input().split())
c = [0 for i in range(N)]
for i in range(1,N):
for j in range(i+1,N+1):
x = abs(X-i)
y = abs(Y-j)
a = min(x+y+1,j-i)
c[a]+=1
for i in range(1,N):
ans = c[i]
print(ans)
| [
"call.remove"
] | 501,927 | 501,928 | u630511239 | python |
p02726 | N, X, Y = map(int, input().split())
c = [0 for i in range(N)]
print(c)
for i in range(1,N):
for j in range(i+1,N+1):
x = abs(X-i)
y = abs(Y-j)
a = min(x+y+1,j-i)
c[a]+=1
for i in range(1,N+1):
ans = c[i]
print(ans)
| N, X, Y = map(int, input().split())
c = [0 for i in range(N)]
for i in range(1,N):
for j in range(i+1,N+1):
x = abs(X-i)
y = abs(Y-j)
a = min(x+y+1,j-i)
c[a]+=1
for i in range(1,N):
ans = c[i]
print(ans)
| [
"call.remove",
"expression.operation.binary.remove"
] | 501,929 | 501,928 | u630511239 | python |
p02726 | n, x, y = map(int, input().split())
cnt = [0] * n
# 漸化式が建てられそうでめんどくさい場合は、片方を固定する
# 端点を固定する 1..n-2 から順に大きい頂点に向かって伸びていく
for i in range(n - 1):
for j in range(i + 1, n):
if i <= x - 1:
if j <= x - 1: # 1 idx
cnt[j - i] += 1
elif j <= y - 1:
cnt[min(j - i... | n, x, y = map(int, input().split())
cnt = [0] * n
# 漸化式が建てられそうでめんどくさい場合は、片方を固定する
# 端点を固定する 1..n-2 から順に大きい頂点に向かって伸びていく
for i in range(n - 1):
for j in range(i + 1, n):
if i <= x - 1:
if j <= x - 1: # 1 idx
cnt[j - i] += 1
elif j <= y - 1:
cnt[min(j - i... | [
"call.add",
"call.arguments.change"
] | 501,930 | 501,931 | u462329577 | python |
p02726 | from itertools import combinations
n, x, y = map(int, input().split())
cnt = [0] * n
for i, j in combinations(range(n), 2):
dist = min(abs(j - i), abs(i - x) + abs(j - y) + 1,
abs(i - y) + abs(j - x) + 1)
cnt[dist] += 1
for i in range(1, n):
print(cnt[i])
| from itertools import combinations
n, x, y = map(int, input().split())
cnt = [0] * n
for i, j in combinations(range(1, n + 1), 2):
dist = min(abs(j - i), abs(i - x) + abs(j - y) + 1,
abs(i - y) + abs(j - x) + 1)
cnt[dist] += 1
for i in range(1, n):
print(cnt[i])
| [
"call.arguments.add"
] | 501,946 | 501,947 | u222668979 | python |
p02726 | N, X, Y = list(map(int,input().split()))
Num = [0] * N
for j in range(1, N):
for i in range(1, j):
D = min(j - i, abs(j - Y) + 1 + abs(i - X))
Num[D] += 1
for k in range(1, N):
print(Num[k])
| N, X, Y = list(map(int,input().split()))
Num = [0] * N
for j in range(1, N + 1):
for i in range(1, j):
D = min(j - i, abs(j - Y) + 1 + abs(i - X))
Num[D] += 1
for k in range(1, N):
print(Num[k]) | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 501,948 | 501,949 | u621225737 | python |
p02726 | n, x, y = map(int, input().split())
ans = [0]*n
x = x-1
y = y-1
def search(i, j):
if j <= x or y <= i:
ans[j-i] += 1
elif i <= x and x <= j and j <= y:
d = min(j-i, x-i+y-j+1)
ans[d] += 1
elif x <= i and j <= y:
d = min(j-i, i-x+y-j+1)
ans[d] += 1
elif x <= i a... | n, x, y = map(int, input().split())
ans = [0]*n
x = x-1
y = y-1
def search(i, j):
if j <= x or y <= i:
ans[j-i] += 1
elif i <= x and x <= j and j <= y:
d = min(j-i, x-i+y-j+1)
ans[d] += 1
elif x <= i and j <= y:
d = min(j-i, i-x+y-j+1)
ans[d] += 1
elif x <= i a... | [
"call.remove"
] | 501,985 | 501,986 | u431573188 | python |
p02726 | import sys
sys.setrecursionlimit(10**6)
readline = sys.stdin.readline
n,x,y = [int(i) for i in readline().split()]
ans = [0] * n
for a in range(1, n+1):
for b in range(a+1, n+1):
d = b - a
d2 = abs(X-a) + abs(Y-b) + 1
d = d if d < d2 else d2
ans[d] += 1
for i in range(1, n):
p... | import sys
sys.setrecursionlimit(10**6)
readline = sys.stdin.readline
n,x,y = [int(i) for i in readline().split()]
ans = [0] * n
for a in range(1, n+1):
for b in range(a+1, n+1):
d = b - a
d2 = abs(x-a) + abs(y-b) + 1
d = d if d < d2 else d2
ans[d] += 1
for i in range(1, n):
p... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 501,987 | 501,988 | u307516601 | python |
p02726 | N, X, Y = map(int, input().split())
counts = [0] * N
for i in range(1, N):
for j in range(i+1, N+1):
# i -> x 直接
d1 = abs(j-i)
# i -> X -> Y -> j
d2 = abs(i-X) + abs(Y-j) + 1
d = min(d1, d2, d3)
counts[d] += 1
for i in range(1, N):
print(counts[i]) | N, X, Y = map(int, input().split())
counts = [0] * N
for i in range(1, N):
for j in range(i+1, N+1):
# i -> x 直接
d1 = abs(j-i)
# i -> X -> Y -> j
d2 = abs(i-X) + abs(Y-j) + 1
d = min(d1, d2)
counts[d] += 1
for i in range(1, N):
print(counts[i]) | [
"call.arguments.change"
] | 501,999 | 502,000 | u586639900 | python |
p02726 | n,x,y=map(int,input().split())
ans=[0]*(n-1)
for i in range(1,n):
for j in range(i+1,n+1):
ans[min(j-i,abs(x-i)+1+abs(j-y)),abs(y-i)+1+abs(j-x)-1]+=1
for i in range(n-1):
print(ans[i])
| n,x,y=map(int,input().split())
ans=[0]*(n-1)
for i in range(1,n):
for j in range(i+1,n+1):
ans[min(j-i,abs(x-i)+1+abs(j-y),abs(y-i)+1+abs(j-x))-1]+=1
for i in range(n-1):
print(ans[i]) | [
"call.arguments.change"
] | 502,001 | 502,002 | u116233709 | python |
p02726 | n,x,y = map(int,input().split())
u = []
for i in range(1,n):
for j in range(i+1,n+1):
u.append(min(j-i,abs(x-i)+abs(y-j)+1))
import collections
u2 = collections.Counter(u)
u2 = list(u2.items())
for k in range(n):
u2.append((0,0))
for i in range(n):
if u2[i][0] == i+1:
print(u2[i][1])
... | n,x,y = map(int,input().split())
u = []
for i in range(1,n):
for j in range(i+1,n+1):
u.append(min(j-i,abs(x-i)+abs(y-j)+1))
import collections
u2 = collections.Counter(u)
u2 = list(u2.items())
for k in range(n):
u2.append((0,0))
for i in range(n-1):
if u2[i][0] == i+1:
print(u2[i][1])
... | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 502,012 | 502,013 | u182178426 | python |
p02726 | # import sys
# import numpy as np
# S = input()
# N, M = map(int, input().split())
# As = [int(input()) for _ in range(N)]
# nums = list(map(int, input().split()))
# nums_2d = [list(map(int, input().split())) for _ in range(N)]
def main():
solve()
def solve():
N, X, Y = map(int, input().split())
ans_l... | # import sys
# import numpy as np
# S = input()
# N, M = map(int, input().split())
# As = [int(input()) for _ in range(N)]
# nums = list(map(int, input().split()))
# nums_2d = [list(map(int, input().split())) for _ in range(N)]
def main():
solve()
def solve():
N, X, Y = map(int, input().split())
ans_l... | [] | 502,020 | 502,021 | u764956288 | python |
p02726 | N,X,Y=map(int,input().split())
N=[0]*(N+1)
for i in range(1,N):
for j in range(i+1,N+1):
m=min(j-i,abs(Y-j)+abs(X-i)+1)
N[m]+=1
for k in range(1,N):
print(A[k])
| N,X,Y=map(int,input().split())
A=[0]*(N+1)
for i in range(1,N):
for j in range(i+1,N+1):
m=min(j-i,abs(Y-j)+abs(X-i)+1)
A[m]+=1
for k in range(1,N):
print(A[k]) | [
"assignment.variable.change",
"identifier.change"
] | 502,022 | 502,023 | u109617108 | python |
p02726 | N ,X, Y = map(int, input().split())
X -= 1
Y -= 1
k = [0]*N
for i in range(N-1):
for j in range(i+1, N):
a = j-i
b = abs(i-x)+1+abs(y-j)
c = abs(j-x)+1+abs(y-i)
m = min(a, b, c)
k[m] += 1
for i in range(1, N):
print(k[i]) | N ,X, Y = map(int, input().split())
X -= 1
Y -= 1
k = [0]*N
for i in range(N-1):
for j in range(i+1, N):
a = j-i
b = abs(i-X)+1+abs(Y-j)
c = abs(j-X)+1+abs(Y-i)
m = min(a, b, c)
k[m] += 1
for i in range(1, N):
print(k[i]) | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 502,026 | 502,027 | u601575292 | python |
p02726 | N ,X, Y = map(int, input().split())
X -= 1
Y -= 1
k = [0]*n
for i in range(N-1):
for j in range(i+1, N):
a = j-i
b = abs(i-x)+1+abs(y-j)
c = abs(j-x)+1+abs(y-i)
m = min(a, b, c)
k[m] += 1
for i in range(1, N):
print(k[i]) | N ,X, Y = map(int, input().split())
X -= 1
Y -= 1
k = [0]*N
for i in range(N-1):
for j in range(i+1, N):
a = j-i
b = abs(i-X)+1+abs(Y-j)
c = abs(j-X)+1+abs(Y-i)
m = min(a, b, c)
k[m] += 1
for i in range(1, N):
print(k[i]) | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 502,028 | 502,027 | u601575292 | python |
p02726 | n, x, y = map(int, input().split())
li = [0]*(n-1)
print(li)
for i in range(1, n+1):
for j in range(i+1, n+1):
num = min(j-i, abs(i-x)+abs(j-y)+1)
li[num-1] += 1
for i in li:
print(i) | n, x, y = map(int, input().split())
li = [0]*(n-1)
# print(li)
for i in range(1, n+1):
for j in range(i+1, n+1):
num = min(j-i, abs(i-x)+abs(j-y)+1)
li[num-1] += 1
for i in li:
print(i) | [
"call.remove"
] | 502,043 | 502,044 | u737758066 | python |
p02726 | N, X, Y = map(int, input().split())
ans = [0]*N
for i in range(1, N+1):
for j in range(i+1, N+1):
# 使わない場合
a = abs(j - i)
# 使う場合
b = abs(i - X) + abs(j - Y) + 1
ans[(min(a, b))] += 1
for i in ans:
print(i)
| N, X, Y = map(int, input().split())
ans = [0]*(N-1)
for i in range(1, N+1):
for j in range(i+1, N+1):
# 使わない場合
a = abs(j - i)
# 使う場合
b = abs(i - X) + abs(j - Y) + 1
ans[(min(a, b))-1] += 1
for i in ans:
print(i)
| [
"expression.operation.binary.add"
] | 502,050 | 502,051 | u245870380 | python |
p02726 | n,x,y = list(map(int,input().split()))
ans = [0]*(n-1)
for i in range(n-1):
for j in range(i+1,n):
ans[min(j-i,1+abs(x-1-i)+abs(y-1-j))]+=1
for num in ans:
print(num) | n,x,y = list(map(int,input().split()))
ans = [0]*(n-1)
for i in range(n-1):
for j in range(i+1,n):
ans[min(j-i,1+abs(x-1-i)+abs(y-1-j))-1]+=1
for num in ans:
print(num) | [
"expression.operation.binary.add"
] | 502,052 | 502,053 | u264564865 | python |
p02726 | n, x, y = map(int, input().split())
ans = [0] * n
for i in range(n - 1):
for j in range(i + 1, n):
d = min(j - i, abs(i - x+1) + abs(j - y+1) + 1)
ans[d] += 1
for a in ans:
print(a)
| n, x, y = map(int, input().split())
ans = [0] * (n-1)
for i in range(n-1):
for j in range(i+1, n):
d = min(j-i, abs(i-x+1)+abs(j-y+1)+1)
ans[d-1] += 1
for a in ans:
print(a)
| [
"expression.operation.binary.add"
] | 502,056 | 502,057 | u449473917 | python |
p02726 | n,x,y = map(int, input().split())
k = [0]*(n+1)
for i in range(1,n):
for j in range(i+1,n+1):
length = min(j-i, abs(x-i)+abs(j-y)+1, abs(y-i)+abs(j-x)+1)
k[length] = k[length]+1
for i in range(1,n+1):
print(k[i]) | n,x,y = map(int, input().split())
k = [0]*(n+1)
for i in range(1,n):
for j in range(i+1,n+1):
length = min(j-i, abs(x-i)+abs(j-y)+1, abs(y-i)+abs(j-x)+1)
k[length] = k[length]+1
for i in range(1,n):
print(k[i])
| [
"expression.operation.binary.remove"
] | 502,072 | 502,073 | u755989869 | python |
p02726 | n, x, y = map(int, input().split())
ans = [0] * n
for i in range(1, n+1):
for j in range(i+1, n+1):
ans[min(abs(j - i), abs(x - i) + 1 + abs(y - j), abs(x - j) + 1 + abs(y - i))] += 1
for e in ans:
print(e)
| n, x, y = map(int, input().split())
ans = [0] * n
for i in range(1, n+1):
for j in range(i+1, n+1):
ans[min(abs(j - i), abs(x - i) + 1 + abs(y - j), abs(x - j) + 1 + abs(y - i))] += 1
for e in ans[1:]:
print(e)
| [] | 502,076 | 502,077 | u602715823 | python |
p02726 | n,x,y = map(int,input().split())
x-=1
y-=1
ans = [0]*(n)
tmp = 10000000000000000
for i in range(n-1):
for j in range(i+1,n):
if i == j:continue
tmp = min((j-i),abs(j-y)+abs(i-x)+1)
# print(tmp)
ans[tmp] +=1
for i in ans:
print(i)
| n,x,y = map(int,input().split())
x-=1
y-=1
ans = [0]*(n)
tmp = 10000000000000000
for i in range(n-1):
for j in range(i+1,n):
if i == j:continue
tmp = min((j-i),abs(j-y)+abs(i-x)+1)
# print(tmp)
ans[tmp] +=1
for i in ans[1:]:
print(i)
| [] | 502,101 | 502,102 | u846226907 | python |
p02726 | from collections import deque
N,X,Y=map(int,input().split())
count=[0]*N
def bfs(start):
dist=[-1]*(N+1)#indexと頂点の番号を合わせる
q=deque()
q.append([start,0])
dist[start]=0
while not q.empty():
j,kyori=q.popleft()
if j-1>=1:
if dist[j-1]==-1:
q.append([j-1,kyo... | from collections import deque
N,X,Y=map(int,input().split())
count=[0]*N
def bfs(start):
dist=[-1]*(N+1)#indexと頂点の番号を合わせる
q=deque()
q.append([start,0])
dist[start]=0
while q:
j,kyori=q.popleft()
if j-1>=1:
if dist[j-1]==-1:
q.append([j-1,kyori+1])
... | [
"control_flow.loop.condition.change",
"call.remove"
] | 502,112 | 502,113 | u842964692 | python |
p02726 | N, X, Y = map(int, input().split())
ans = [0] * (N-1)
for i in range(1,N+1):
for j in range(i+1, N+1):
k = min(j-i, abs(X-i) + abs(Y-j) + 1)
ans[k-1] += 1
print(ans)
for i in range(N-1):
print(ans[i])
| N, X, Y = map(int, input().split())
ans = [0] * (N-1)
for i in range(1,N+1):
for j in range(i+1, N+1):
k = min(j-i, abs(X-i) + abs(Y-j) + 1)
ans[k-1] += 1
for i in range(N-1):
print(ans[i])
| [
"call.remove"
] | 502,114 | 502,115 | u713914478 | python |
p02726 | N, X, Y = map(int, input().split())
ans = [0] * (N-1)
for i in range(1,N+1):
for j in range(i, N+1):
k = min(j-i, abs(X-i) + abs(Y-j) + 1)
ans[k-1] += 1
for i in range(N):
print(ans[i])
| N, X, Y = map(int, input().split())
ans = [0] * (N-1)
for i in range(1,N+1):
for j in range(i+1, N+1):
k = min(j-i, abs(X-i) + abs(Y-j) + 1)
ans[k-1] += 1
for i in range(N-1):
print(ans[i])
| [
"control_flow.loop.range.bounds.lower.change",
"expression.operation.binary.add",
"control_flow.loop.range.bounds.upper.change"
] | 502,116 | 502,115 | u713914478 | python |
p02726 | n,x,y = map(int,input().split())
ans = [0 for i in range(n)]
for i in range(1,n+1):
for j in range(i+1,n+1):
print(i,j)
p1 = j-i
p2 = abs(i-x)+abs(j-y)+1
ans[min(p1,p2)] += 1
for i in range(1,n):
print(ans[i])
| n,x,y = map(int,input().split())
ans = [0 for i in range(n)]
for i in range(1,n+1):
for j in range(i+1,n+1):
p1 = j-i
p2 = abs(i-x)+abs(j-y)+1
ans[min(p1,p2)] += 1
for i in range(1,n):
print(ans[i])
| [
"call.remove"
] | 502,128 | 502,129 | u747602774 | python |
p02726 | n, x, y = map(int, input().split())
ans = [0]*(n+1)
for i in range(1,n+1):
for j in range(i+1, n+1):
d = min(abs(i-j), abs(y-j)+abs(x-i)+1, abs(y-i)+abs(x-j)+1)
ans[d] += 1
for a in ans[1:]:
print(a) | n, x, y = map(int, input().split())
ans = [0]*(n+1)
for i in range(1,n+1):
for j in range(i+1, n+1):
d = min(abs(i-j), abs(y-j)+abs(x-i)+1, abs(y-i)+abs(x-j)+1)
ans[d] += 1
for a in ans[1:-1]:
print(a) | [] | 502,133 | 502,134 | u959340534 | python |
p02726 | n, x, y = map(int, input().split())
ans = [0]*(n+1)
for i in range(1,n+1):
for j in range(i+1, n+1):
d = min(abs(i-j), abs(y-j)+abs(x-i)+1, abs(y-i)+abs(x-j)+1)
ans[d] += 1
for a in ans[1:]:
print(a) | n, x, y = map(int, input().split())
ans = [0]*(n+1)
for i in range(1,n+1):
for j in range(i+1, n+1):
d = min(abs(i-j), abs(y-j)+abs(x-i)+1, abs(y-i)+abs(x-j)+1)
ans[d] += 1
for a in ans[1:-1]:
print(a) | [] | 502,133 | 502,135 | u959340534 | python |
p02726 | N, X, Y = map(int, input().split())
lists = [0] * (N - 1)
for i in range(N - 1):
for j in range(i + 1, N):
min_length = min(abs(j-i),abs(X-i)+1+abs(j-Y),abs(Y-i)+1+abs(j-X))
lists[min_length - 1] += 1
for k in lists:
print(k)
| N, X, Y = map(int, input().split())
lists = [0] * (N - 1)
for i in range(1, N):
for j in range(i + 1, N + 1):
min_length = min(abs(j-i),abs(X-i)+1+abs(j-Y),abs(Y-i)+1+abs(j-X))
lists[min_length - 1] += 1
for k in lists:
print(k)
| [
"expression.operation.binary.remove",
"call.arguments.add"
] | 502,136 | 502,137 | u392172834 | python |
p02726 | mod = 10**9 + 7
def iip(listed = False):
ret = [int(i) for i in input().split()]
if len(ret) == 1 and not listed:
return ret[0]
return ret
def soinsuu_bunkai(n):
ret = []
for i in range(2, int(n**0.5)+1):
while n % i == 0:
n //= i
ret.append(i)
if i ... | mod = 10**9 + 7
def iip(listed = False):
ret = [int(i) for i in input().split()]
if len(ret) == 1 and not listed:
return ret[0]
return ret
def soinsuu_bunkai(n):
ret = []
for i in range(2, int(n**0.5)+1):
while n % i == 0:
n //= i
ret.append(i)
if i ... | [
"call.remove"
] | 502,143 | 502,144 | u946996108 | python |
p02726 | n, x, y = input().split()
n, x, y = int(n), int(x)-1, int(y)-1
d = [[abs(i-j) for i in range(n)] for j in range(n)]
for i in range(x+1):
for j in range(y, n):
d[i][j] -= y-x-1
for j in range(y-1, x+(y-x)//2, -1):
d[i][j] = d[i][j+1]+1
for i in range(x+1, x+(y-x)//2):
d[i][y] = d[i][x] + 1
... | n, x, y = input().split()
n, x, y = int(n), int(x)-1, int(y)-1
d = [[abs(i-j) for i in range(n)] for j in range(n)]
for i in range(x+1):
for j in range(y, n):
d[i][j] -= y-x-1
for j in range(y-1, x+(y-x)//2, -1):
d[i][j] = d[i][j+1]+1
for i in range(x+1, x+(y-x)//2):
d[i][y] = d[i][x] + 1
... | [
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.step.change"
] | 502,145 | 502,146 | u317528406 | python |
p02726 | n,x,y = map(int, input().split())
max_dis = 0
ans = [0]*n
for i in range(1, n):
for j in range(i+1,n+1):
ans[min(abs(i-j), (abs(x-i)+1 +abs(y-j)))] +=1
print(*ans, sep="\n") | n,x,y = map(int, input().split())
max_dis = 0
ans = [0]*n
for i in range(1, n):
for j in range(i+1,n+1):
ans[min(abs(i-j), (abs(x-i)+1 +abs(y-j)))] +=1
print(*ans[1:], sep="\n") | [] | 502,151 | 502,152 | u136843617 | python |
p02726 | # -*- coding: utf-8 -*-
n, x, y = map(int, input().split())
x -= 1
y -= 1
ans = [0]*n
for i in range(n):
for j in range(i + 1, n):
dist1 = j - i
dist2 = abs(X - i) + abs(Y - j) + 1
ans[min(dis1, dist2)] += 1
print(*ans[1:], sep='\n')
| # -*- coding: utf-8 -*-
n, x, y = map(int, input().split())
x -= 1
y -= 1
ans = [0]*n
for i in range(n):
for j in range(i + 1, n):
dist1 = j - i
dist2 = abs(x - i) + abs(y - j) + 1
ans[min(dist1, dist2)] += 1
print(*ans[1:], sep='\n')
| [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"variable_access.subscript.index.change"
] | 502,155 | 502,156 | u646412443 | python |
p02726 | N,X,Y = map(int,input().split())
length = [0]*(N+1)
for i in range(1,N+1):
for j in range(i,N+1):
ans = min(abs(j-i),abs(X-i)+1+abs(Y-j),abs(X-j)+1+abs(Y-i))
length[ans] += 1
for i in range(1,N+1):
print(length[i]) | N,X,Y = map(int,input().split())
length = [0]*(N+1)
for i in range(1,N+1):
for j in range(i,N+1):
ans = min(abs(j-i),abs(X-i)+1+abs(Y-j),abs(X-j)+1+abs(Y-i))
length[ans] += 1
for i in range(1,N):
print(length[i]) | [
"expression.operation.binary.remove"
] | 502,161 | 502,162 | u078816252 | python |
p02726 | N,X,Y = map(int, input().split())
answer= [0]*(N-1)
for i in range(1,N+1):
for j in range(1,N+1):
if i==j:
break
ans=i-j
if j<=X and i<=Y and i>=X and Y-i+1+X-j<ans:
ans=Y-i+1+X-j
if j<=X and i>=Y and i-Y+1+X-j<ans:
ans=i-Y+1+X-j
if j>=X an... | N,X,Y = map(int, input().split())
answer= [0]*(N-1)
for i in range(1,N+1):
for j in range(1,N+1):
if i==j:
break
ans=i-j
if j<=X and i<=Y and i>=X and Y-i+1+X-j<ans:
ans=Y-i+1+X-j
if j<=X and i>=Y and i-Y+1+X-j<ans:
ans=i-Y+1+X-j
if j>=X an... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 502,198 | 502,199 | u046158516 | python |
p02726 | N, X, Y = map(int, input().split())
dist_list = [0]*N
for i in range(N-1):
for j in range(i+1, N):
a = j - i
b = abs(i+1 - X) + abs(j+1 -Y) + 1
dist_list[min(a,b)] += 1
for k in range(N-1):
print(dist_list.count(k+1))
| N, X, Y = map(int, input().split())
dist_list = [0]*N
for i in range(N-1):
for j in range(i+1, N):
a = j - i
b = abs(i+1 - X) + abs(j+1 -Y) + 1
dist_list[min(a,b)] += 1
for k in range(N-1):
print(dist_list[k+1])
| [
"call.arguments.change",
"io.output.change",
"call.remove"
] | 502,212 | 502,213 | u323531048 | python |
p02726 | N,X,Y = map(int,input().split())
li = [0]*(N-1)
for i in range(0,N-1):
for j in range(i+1,N):
dis = min(j-i,abs(j-(X-1))+1+abs(i-(Y-1)))
li[dis-1] += 1
for ans in li:
print(ans) | N,X,Y = map(int,input().split())
li = [0]*(N-1)
for i in range(0,N-1):
for j in range(i+1,N):
dis = min(j-i,abs(i-(X-1))+1+abs(j-(Y-1)))
li[dis-1] += 1
for ans in li:
print(ans) | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 502,214 | 502,215 | u334703235 | python |
p02726 | n, x, y = map(int, input().split())
lis = [0]*(n-1)
print(lis)
for i in range(1, n):
for j in range(i+1, n+1):
lis[min([j-i, abs(x-i)+1+abs(y-j), abs(y-i)+1+abs(x-j)])-1] += 1
for i in range(n-1):
print(lis[i]) | n, x, y = map(int, input().split())
lis = [0]*(n-1)
for i in range(1, n):
for j in range(i+1, n+1):
lis[min([j-i, abs(x-i)+1+abs(y-j), abs(y-i)+1+abs(x-j)])-1] += 1
for i in range(n-1):
print(lis[i]) | [
"call.remove"
] | 502,228 | 502,229 | u070201429 | python |
p02726 | n, x, y = map(int, input().split())
ans = [0] * (n-1)
for i in range(1, n):
for j in range(i+1, n+1):
d = min(j-1, abs(x-i)+abs(j-y)+1)
ans[d-1] += 1
print(*ans, sep='/n') | n, x, y = map(int, input().split())
ans = [0] * (n-1)
for i in range(1, n):
for j in range(i+1, n+1):
d = min(j-i, abs(x-i)+abs(j-y)+1)
ans[d-1] += 1
print(*ans, sep='\n') | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"expression.operation.binary.change",
"literal.string.change",
"io.output.change",
"io.output.newline.add"
] | 502,238 | 502,239 | u686377179 | python |
p02726 | N, X, Y = list(map(int,input().split()))
X -= 1
Y -= 1
out = [0]*N
for i in range(N-1):
for j in range(i+1,N):
out[min(j-i, abs(i-X)+1+abs(j-Y))] += 1
for i in range(N-1):
print(out[i]) | N, X, Y = list(map(int,input().split()))
X -= 1
Y -= 1
out = [0]*N #最低距離が1からNまでの個数を表示するリストを作る
for i in range(N-1):
for j in range(i+1,N):
out[min(j-i, abs(i-X)+1+abs(j-Y))] += 1 #各最低距離の個数カウント
for i in range(1,N):
print(out[i]) | [
"expression.operation.binary.remove",
"call.arguments.add"
] | 502,246 | 502,247 | u699944218 | python |
p02726 | N, X, Y = list(map(int,input().split()))
X -= 1
Y -= 1
out = [0]*N
for i in range(N-1):
for j in range(i+1,N):
out[min(j-i, abs(i-X)+1+abs(j-Y))] += 1
for i in range(N-1):
print(out[i]) | N, X, Y = list(map(int,input().split()))
X -= 1
Y -= 1
out = [0]*N
for i in range(N-1):
for j in range(i+1,N):
out[min(j-i, abs(i-X)+1+abs(j-Y))] += 1
for i in range(1,N):
print(out[i]) | [
"expression.operation.binary.remove",
"call.arguments.add"
] | 502,246 | 502,248 | u699944218 | python |
p02726 |
N, X, Y = list(map(int, input().split()))
# N = 2000
# X = 100
# Y = 1900
X -= 1
Y -= 1
# @profile
def main(N, X, Y):
ans = [0]*N
for i in range(N):
for j in range(i+1, N):
d = min(j-i, abs(X-i)+abs(Y-j)+1)
ans[d] += 1
for a in ans[1:]:
print(a//2)
main(N, X... |
N, X, Y = list(map(int, input().split()))
# N = 2000
# X = 100
# Y = 1900
X -= 1
Y -= 1
# @profile
def main(N, X, Y):
ans = [0]*N
for i in range(N):
for j in range(i+1, N):
d = min(j-i, abs(X-i)+abs(Y-j)+1)
ans[d] += 1
for a in ans[1:]:
print(a)
main(N, X, Y... | [
"expression.operation.binary.remove"
] | 502,249 | 502,250 | u479719434 | python |
p02726 |
N, X, Y = input().split()
N = int(N)
X = int(X)
x = X - 1
Y = int(Y)
y = Y -1
ans = [0] * (N-1)
A = [[] * N for _ in range(N)]
for i in range(N):
for j in range(N-i):
path = min(abs(x- i) +1 +abs(y-i-j),j)
ans[path] += 1
for _ in range(len(ans)):
if _ == 0:
continue
print(ans[_])
|
N, X, Y = input().split()
N = int(N)
X = int(X)
x = X - 1
Y = int(Y)
y = Y -1
ans = [0] * (N)
A = [[] * N for _ in range(N)]
for i in range(N):
for j in range(N-i):
path = min(abs(x- i) +1 +abs(y-i-j),j)
ans[path] += 1
for _ in range(len(ans)):
if _ == 0:
continue
print(ans[_])
| [
"expression.operation.binary.remove"
] | 502,265 | 502,266 | u559250296 | python |
p02726 | n, x, y = map(int, input().split())
x -= 1 #グラフを0からn-1までの数に対応させる
y -= 1 #
ans = [0]*n
for i in range(n):
for j in range(i+1, n):#各頂点の距離を一組ずつ調べる
a = min(j-i, abs(x-i) + abs(y-j) + 1)
'''
j-i :1～nまでの普通のルートでの距離
abs(x-i) + abs(y-j) + 1 :ショートカットルートを使ったときの距離
'''
ans[a-1] += 1 #... | n, x, y = map(int, input().split())
x -= 1 #グラフを0からn-1までの数に対応させる
y -= 1 #
ans = [0]*(n-1)
for i in range(n):
for j in range(i+1, n):#各頂点の距離を一組ずつ調べる
a = min(j-i, abs(x-i) + abs(y-j) + 1)
'''
j-i :1～nまでの普通のルートでの距離
abs(x-i) + abs(y-j) + 1 :ショートカットルートを使ったときの距離
'''
ans[a-1] +=... | [] | 502,270 | 502,271 | u323045245 | python |
p02726 | n,x,y = map(int,input().split())
x -= 1
y -= 1
a = [0] * n
for i in range(n-1):
for j in range(i+1,n):
m = min(j-i,abs(i-x)+1+abs(j-y))
a[m] += 1
for i in range(n):
print(a[i])
| n,x,y = map(int,input().split())
x -= 1
y -= 1
a = [0] * n
for i in range(n-1):
for j in range(i+1,n):
m = min(j-i,abs(i-x)+1+abs(j-y))
a[m] += 1
for i in range(1,n):
print(a[i])
| [
"call.arguments.add"
] | 502,282 | 502,283 | u728473456 | python |
p02726 | n,x,y=map(int,input().split())
#a<b
def dis(a,b):
return min (b-a,abs(a-x)+1+abs(b-y))
# for k in range(1,n):
# count=0
# #i<j
# for i in range(1,n):
# for j in range(i+1,n+1):
# if dis(i,j)==k:
# count+=1
# print(count)
ans=[0]*(n-1)
#i<j
for i in range(1,n):
for j in range(i+1,n+1):
... | n,x,y=map(int,input().split())
#a<b
def dis(a,b):
return min (b-a,abs(a-x)+1+abs(b-y))
# for k in range(1,n):
# count=0
# #i<j
# for i in range(1,n):
# for j in range(i+1,n+1):
# if dis(i,j)==k:
# count+=1
# print(count)
ans=[0]*(n-1)
#i<j
for i in range(1,n):
for j in range(i+1,n+1):
... | [
"call.arguments.change"
] | 502,284 | 502,285 | u314837274 | python |
p02726 | n,x,y=map(int,input().split())
x-=1
y-=1
d=[[0]*n for i in range(n)]
for i in range(n):
for j in range(i+1,n):
d[i][j]=min(j-i,abs(x-i)+abs(y-j)+1)
# for i in d:
# print(i)
ans=[0]*(n+1)
for i in range(n):
for j in range(n):
ans[d[i][j]]+=1
for i in range(1,n+1):
print(ans[i]) | n,x,y=map(int,input().split())
x-=1
y-=1
d=[[0]*n for i in range(n)]
for i in range(n):
for j in range(i+1,n):
d[i][j]=min(j-i,abs(x-i)+abs(y-j)+1)
# for i in d:
# print(i)
ans=[0]*(n+1)
for i in range(n):
for j in range(n):
ans[d[i][j]]+=1
for i in range(1,n):
print(ans[i]) | [
"expression.operation.binary.remove"
] | 502,290 | 502,291 | u225388820 | python |
p02726 | n, x, y = map(int,input().split())
ans = [0] * (n+10)
for i in range(1, n+1):
for j in range(i+1, n+1):
distance = min(abs(j-i), abs(x-i) + 1 + abs(y-j), abs(y-i) + 1 + abs(x-i))
ans[distance] += 1
for i in range(1, n):
print(ans[i]) | n, x, y = map(int,input().split())
ans = [0] * (n+10)
for i in range(1, n+1):
for j in range(i+1, n+1):
distance = min(abs(j-i), abs(x-i) + 1 + abs(y-j), abs(y-i) + 1 + abs(x-j))
ans[distance] += 1
for i in range(1, n):
print(ans[i]) | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 502,320 | 502,321 | u346395915 | python |
p02726 | import itertools
N, X, Y = map(int, input().split())
pos = [i for i in range(1,N+1)]
ways = list(itertools.combinations(pos,2))
dist_l = [min(abs(i-j), abs(i - X) + 1 + abs(Y - j)) for i,j in ways]
dic = collections.Counter(dist_l)
for i in range(1,N):
print(dic[i]) | import itertools
import collections
N, X, Y = map(int, input().split())
pos = [i for i in range(1,N+1)]
ways = list(itertools.combinations(pos,2))
dist_l = [min(abs(i-j), abs(i - X) + 1 + abs(Y - j)) for i,j in ways]
dic = collections.Counter(dist_l)
for i in range(1,N):
print(dic[i]) | [] | 502,329 | 502,330 | u726285999 | python |
p02726 | import collections
N,X,Y = map(int,input().split())
d = [[0]*(N+1) for _ in range(N+1)]
for i in range(1,N):#i => j
for j in range(i+1,N+1):
if(i>=Y or j<=X):
d[i][j] = j-i
elif(i<=X and j>=Y):
d[i][j] = (X-i)+1+(j-Y)
else:
a_path = j-i
b_path... | import collections
N,X,Y = map(int,input().split())
d = [[0]*(N+1) for _ in range(N+1)]
for i in range(1,N):#i => j
for j in range(i+1,N+1):
if(i>=Y or j<=X):
d[i][j] = j-i
elif(i<=X and j>=Y):
d[i][j] = (X-i)+1+(j-Y)
else:
a_path = j-i
b_path... | [] | 502,335 | 502,336 | u557282438 | python |
p02726 | N,X,Y = map(int,input().split())
A = [0]*(N-1)
mi = 0
for i in range(1,N+1):
for j in range(1,N+1):
if i < j :
mi = min(j-i,(abs(X-i)+abs(Y-j)+1))
A[mi-1] += 1
print(mi)
for i in range(N-1):
print(A[i]) | N,X,Y = map(int,input().split())
A = [0]*(N-1)
mi = 0
for i in range(1,N+1):
for j in range(1,N+1):
if i < j :
mi = min(j-i,(abs(X-i)+abs(Y-j)+1))
A[mi-1] += 1
for i in range(N-1):
print(A[i])
| [
"call.remove"
] | 502,340 | 502,341 | u318740143 | python |
p02726 | n,x,y = map(int,input().split())
a = [0 for i in range(1,n)]
l=y-x;m= max(x-1+l//2,x+n-y)
x-=1;y-=1
for i in range(n):
for j in range(i+1,n):
if i+1==j:
a[0]+=1
else:
k = j-i
if i<=x and j>=y:
k=k-l+1
elif i>=x and j<=y:
k=min(k,(l+1)-k)
elif i<=x:
k=x-i+mi... | n,x,y = map(int,input().split())
a = [0 for i in range(1,n)]
l=y-x;m= max(x-1+l//2,x+n-y)
x-=1;y-=1
for i in range(n):
for j in range(i+1,n):
if i+1==j:
a[0]+=1
else:
k = j-i
if i<=x and j>=y:
k=k-l+1
elif i>=x and j<=y:
k=min(k,(l+1)-k)
elif i<=x:
k=x-i+mi... | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 502,363 | 502,364 | u914802579 | python |
p02726 | N, X, Y = map(int, input().split())
X -= 1
Y -= 1
def dist(a, b):
return min(abs(b-a), abs(X-a) + 1 + abs(b-Y))
ANS = [0] * N
for i in range(N):
for j in range(i):
ANS[dist(i, j)] += 1
for a in ANS[1:]:
print(a) | N, X, Y = map(int, input().split())
X -= 1
Y -= 1
def dist(a, b):
return min(abs(b-a), abs(X-a) + 1 + abs(b-Y))
ANS = [0] * N
for i in range(N):
for j in range(i):
ANS[dist(j, i)] += 1
for a in ANS[1:]:
print(a) | [
"call.arguments.change",
"call.arguments.add"
] | 502,375 | 502,376 | u864197622 | python |
p02726 | N, X, Y = list(map(int, input().split()))
res = [0] * (n-1)
for i in range(1, N + 1):
for j in range(1, N + 1):
if i >= j:
continue
if i == X and Y == j:
key = 1
else:
key = int(min(j - i, abs(X - i) + abs(Y - j) + 1))
res[key] += 1
for i in range... | N, X, Y = list(map(int, input().split()))
res = [0] * N
for i in range(1, N + 1):
for j in range(1, N + 1):
if i >= j:
continue
if i == X and Y == j:
key = 1
else:
key = int(min(j - i, abs(X - i) + abs(Y - j) + 1))
res[key] += 1
for i in range(1, ... | [
"assignment.value.change",
"expression.operation.binary.change"
] | 502,381 | 502,382 | u891847179 | python |
p02726 | n,x,y=map(int, input().split())
ans=[0]*(n-1)
for i in range(n):
for j in range(i+1, n):
d=min(j-i, abs(x-i)+1+abs(j-y), abs(y-i)+1+abs(j-x))
ans[d-1]+=1
for a in ans:
print(a) | n,x,y=map(int, input().split())
ans=[0]*(n-1)
for i in range(1, n+1):
for j in range(i+1, n+1):
d=min(j-i, abs(x-i)+1+abs(j-y), abs(y-i)+1+abs(j-x))
#print(i,j,d)
ans[d-1]+=1
for a in ans:
print(a) | [
"call.arguments.add"
] | 502,390 | 502,391 | u782748646 | python |
p02726 | N, X, Y = map(int, input().split())
ans = [0] * (N - 1)
ans[0] = 1
for i in range(1, N - 1):
for j in range(i + 1, N + 1):
d = min(j - i, abs(Y - j) + abs(X - i) + 1)
ans[d - 1] += 1
print(ans)
| N, X, Y = map(int, input().split())
ans = [0] * (N - 1)
ans[0] = 1
for i in range(1, N - 1):
for j in range(i + 1, N + 1):
d = min(j - i, abs(Y - j) + abs(X - i) + 1)
ans[d - 1] += 1
for a in ans:
print(a)
| [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 502,396 | 502,397 | u811967730 | python |
p02726 | def main():
n,x,y=map(int,input().split())
dist=[0]*n
x-=1
y-=1
for i in range(n-1):
for j in range(i+1,n):
d=j-i
dist[min(d,abs(x-i)+abs(y-j)+1)-1]+=1
for i in dist:
print(i)
if __name__ == '__main__':
main() | def main():
n,x,y=map(int,input().split())
dist=[0]*(n-1)
x-=1
y-=1
for i in range(n-1):
for j in range(i+1,n):
d=j-i
dist[min(d,abs(x-i)+abs(y-j)+1)-1]+=1
for i in dist:
print(i)
if __name__ == '__main__':
main() | [] | 502,404 | 502,405 | u919730120 | python |
p02726 | n,x,y= map(int, input().split())
ans=[0]*n
for i in range(1,n):
for j in range(i+1,n+1):
ans[min(j-i,1+abs(i-x)+abs(j-y))-1]+=1
for i in range(n):
print(ans[i]) | n,x,y= map(int, input().split())
ans=[0]*(n-1)
for i in range(1,n):
for j in range(i+1,n+1):
ans[min(j-i,1+abs(i-x)+abs(j-y))-1]+=1
for i in range(n-1):
print(ans[i]) | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 502,437 | 502,438 | u970899068 | python |
p02726 | N,X,Y=map(int,input().split())
l=[0]*N
for i in range(1,N):
for j in range(i):
l[min(abs(i-j-1),abs(X-j-1)+abs(Y-i-1))]+=1
print(*l,sep="\n") | N,X,Y=map(int,input().split())
l=[0]*~-N
for i in range(1,N):
for j in range(i):
l[min(abs(i-j-1),abs(X-j-1)+abs(Y-i-1))]+=1
print(*l,sep="\n") | [] | 502,439 | 502,440 | u539281377 | python |
p02726 | N, X, Y = map(int, input().split())
mind = [[N] * N for i in range(N)]
for i in range(N):
for j in range(i+1, N):
mind[i][j] = min(abs(j-i), abs((X-1)-i)+1+abs(j-(Y-1)), abs((Y-1)-i)+1+abs(j-(X-1)))
mindcnt = [0] * N
for i in range(N):
for j in range(i+1, N):
mind = mind[i][j]
min... | N, X, Y = map(int, input().split())
mind = [[N] * N for i in range(N)]
for i in range(N):
for j in range(i+1, N):
mind[i][j] = min(abs(j-i), abs((X-1)-i)+1+abs(j-(Y-1)), abs((Y-1)-i)+1+abs(j-(X-1)))
mindcnt = [0] * N
for i in range(N):
for j in range(i+1, N):
d = mind[i][j]
mindcn... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 502,441 | 502,442 | u316341119 | python |
p02726 | def main():
n,x,y = tuple([int(t)for t in input().split()])
dmin = [[n]*n for _ in [0]*n]
nlist = list(range(n))
for i in range(n):
for j in range(i,n):
dmin[i][j] = j-i
dmin[j][i] = j-i
for i in range(x):
for j in range(y-1,n):
dmin[i][j] -= y... | def main():
n,x,y = tuple([int(t)for t in input().split()])
dmin = [[n]*n for _ in [0]*n]
nlist = list(range(n))
for i in range(n):
for j in range(i,n):
dmin[i][j] = j-i
dmin[j][i] = j-i
for i in range(x):
for j in range(y-1,n):
dmin[i][j] -= y... | [
"expression.operation.binary.remove"
] | 502,453 | 502,454 | u711238850 | python |
p02726 | def main():
n,x,y = tuple([int(t)for t in input().split()])
dmin = [[n]*n for _ in [0]*n]
nlist = list(range(n))
for i in range(n):
for j in range(i,n):
dmin[i][j] = j-i
dmin[j][i] = j-i
for i in range(x):
for j in range(y-1,n):
dmin[i][j] -= y... | def main():
n,x,y = tuple([int(t)for t in input().split()])
dmin = [[n]*n for _ in [0]*n]
nlist = list(range(n))
for i in range(n):
for j in range(i,n):
dmin[i][j] = j-i
dmin[j][i] = j-i
for i in range(x):
for j in range(y-1,n):
dmin[i][j] -= y... | [
"expression.operation.binary.add"
] | 502,455 | 502,454 | u711238850 | python |
p02726 | N, X, Y = map(int, input().split())
ans = [0] * (N - 1)
for i in range(1, N + 1, 1):
for j in range(i + 1, N + 1, 1):
tmp = min(
abs(j - i),
abs(X - i) + 1 + abs(j - Y),
abs(X - j) + 1 + abs(i - Y) # このパターンは
)
ans[tmp - 1] += 1
for a in ans:
print(a... | N, X, Y = map(int, input().split())
ans = [0] * (N - 1)
for i in range(1, N + 1, 1):
for j in range(i + 1, N + 1, 1):
tmp = min(
abs(j - i),
abs(X - i) + 1 + abs(j - Y),
abs(X - j) + 1 + abs(i - Y) # このパターンは
)
ans[tmp - 1] += 1
for a in ans:
print(a... | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 502,493 | 502,494 | u362771726 | python |
p02726 | N, X, Y = map(int, input().split())
ans = [0] * (N - 1)
for i in range(1, N + 1, 1):
for j in range(i + 1, N + 1, 1):
tmp = min(
abs(j - i),
abs(X - i) + 1 + abs(j - Y),
abs(X - j) + 1 + abs(i - Y) # このパターンは
)
ans[tmp - 1] += 1
print(ans) | N, X, Y = map(int, input().split())
ans = [0] * (N - 1)
for i in range(1, N + 1, 1):
for j in range(i + 1, N + 1, 1):
tmp = min(
abs(j - i),
abs(X - i) + 1 + abs(j - Y),
abs(X - j) + 1 + abs(i - Y) # このパターンは
)
ans[tmp - 1] += 1
for a in ans:
print(a... | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 502,495 | 502,494 | u362771726 | python |
p02726 | n,x,y = map(int, input().split())
t = [0 for i in range(n-1)]
x = x-1
y = y-1
for i in range(0,n):
for j in range(i,n):
a = abs(i-x)+abs(j-y)+1
b = abs(i-j)
if a < b:
t[a-1] += 1
else:
t[b-1] += 1
for k in range(0,n-1):
print(int(t[k])) | n,x,y = map(int, input().split())
t = [0 for i in range(n)]
x = x-1
y = y-1
for i in range(0,n):
for j in range(i,n):
a = abs(i-x)+abs(j-y)+1
b = abs(i-j)
if a < b:
t[a-1] += 1
else:
t[b-1] += 1
for k in range(0,n-1):
print(int(t[k])) | [
"expression.operation.binary.remove"
] | 502,498 | 502,499 | u589913372 | python |
p02726 | n, x, y = map(int, input().split())
x = x-1
y = y-1
from collections import deque
que = deque()
INF = 10**5
seen = [[INF] * n for _ in range(n)]
#import numpy as np
for i in range(n):
que.append(i)
seen[i][i] = 0
#print('---', i)
while len(que) > 0:
t = que.popleft()
step = [t-1, t+1]
... | n, x, y = map(int, input().split())
x = x-1
y = y-1
from collections import deque
que = deque()
INF = 10**5
seen = [[INF] * n for _ in range(n)]
#import numpy as np
for i in range(n):
que.append(i)
seen[i][i] = 0
#print('---', i)
while len(que) > 0:
t = que.popleft()
step = [t-1, t+1]
... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.branch.if.condition.change"
] | 502,561 | 502,562 | u558242240 | python |
p02726 | N,X,Y = map(int, input().split())
#N <=2*10**3
#総当たりはN*(N-1) = 4*10**6 間に合う
ans_dict = {i:0 for i in range(1,N+1)}
for i in range(1,N+1):
for j in range(i+1,N+1):
#print(i,j)
#ストレートで行くパターン
straight = j - i
#XYを経由するパターン
throught_XY = min(abs(X-i),abs(Y-i)) + min(abs(X-j),ab... | N,X,Y = map(int, input().split())
#N <=2*10**3
#総当たりはN*(N-1) = 4*10**6 間に合う
ans_dict = {i:0 for i in range(1,N+1)}
for i in range(1,N+1):
for j in range(i+1,N+1):
#print(i,j)
#ストレートで行くパターン
straight = j-i
#XYを経由するパターン
throught_XY = min(abs(X-i),abs(Y-i))+min(abs(X-j),abs(Y-... | [
"expression.operation.binary.remove"
] | 502,567 | 502,568 | u314089899 | python |
p02720 | # from sys import stdin
import sys
global cnt1
def bts(A, cnt, max):
# print(A)
if cnt == max:
global cnt1
cnt1 = cnt1+1
if cnt1 == K:
print(A)
sys.exit()
return
cnt = cnt+1
if A % 10 == 0:
bts(A*10+(A % 10), cnt, max)
bts(A*10+(A... | # from sys import stdin
import sys
global cnt1
def bts(A, cnt, max):
# print(A)
if cnt == max:
global cnt1
cnt1 = cnt1+1
if cnt1 == K:
print(A)
sys.exit()
return
cnt = cnt+1
if A % 10 == 0:
bts(A*10+(A % 10), cnt, max)
bts(A*10+(A... | [
"literal.number.integer.change",
"assignment.value.change",
"call.arguments.change",
"control_flow.loop.range.bounds.lower.change"
] | 502,595 | 502,596 | u396210538 | python |
p02720 | from collections import deque
k = 9 #+ (9*3-1)
count = 0
q = deque(range(1,10))
while count < k:
l = q.popleft()
resid = l % 10
if resid != 0: q.append(l*10 + resid - 1)
q.append(l*10 + resid)
if resid != 9: q.append(l*10 + resid + 1)
count += 1
print(l) | from collections import deque
k = int(input())
count = 0
q = deque(range(1,10))
while count < k:
l = q.popleft()
resid = l % 10
if resid != 0: q.append(l*10 + resid - 1)
q.append(l*10 + resid)
if resid != 9: q.append(l*10 + resid + 1)
count += 1
print(l) | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.add"
] | 502,603 | 502,604 | u621345513 | python |
p02720 | from collections import deque
stdin = sys.stdin
read_int = lambda : list(map(int,stdin.readline().split()))
K = read_int()[0]
q = deque()
for i in range(1, 10):
q.append(i)
def solve():
for _ in range(K - 1):
x = q.popleft()
if x % 10 != 0:
q.append(10 * x + (x % 10 - 1))
... | from collections import deque
import sys
stdin = sys.stdin
read_int = lambda : list(map(int,stdin.readline().split()))
K = read_int()[0]
q = deque()
for i in range(1, 10):
q.append(i)
def solve():
for _ in range(K - 1):
x = q.popleft()
if x % 10 != 0:
q.append(10 * x + (x % 10 - ... | [
"call.remove"
] | 502,605 | 502,606 | u507613674 | python |
p02720 | import math
from collections import defaultdict
ml=lambda:map(int,input().split())
ll=lambda:list(map(int,input().split()))
ii=lambda:int(input())
ip=lambda:input()
"""========main code==============="""
x=ii()
lol=[1,2,3,4,5,6,7,8,9]
ans=9
if(x>9):
for i in lol:
k=str(i)
a=int(k[len(k)-1])
... | import math
from collections import defaultdict
ml=lambda:map(int,input().split())
ll=lambda:list(map(int,input().split()))
ii=lambda:int(input())
ip=lambda:input()
"""========main code==============="""
x=ii()
lol=[1,2,3,4,5,6,7,8,9]
ans=9
if(x>9):
for i in lol:
k=str(i)
a=int(k[len(k)-1])
... | [
"call.arguments.change"
] | 502,611 | 502,612 | u706984643 | python |
p02720 | from collections import deque
K=int(input())
todo=deque(list(map(str,range(1,10))))
count=0
while todo:
num=todo.popleft()
count+=1
if count==k:
print(num)
exit()
base=int(num[-1])
n1=base-1
if n1!=-1:
todo.append(num+str(n1))
n2=base
todo.append(nu... | from collections import deque
K=int(input())
todo=deque(list(map(str,range(1,10))))
count=0
while todo:
num=todo.popleft()
count+=1
if count==K:
print(num)
exit()
base=int(num[-1])
n1=base-1
if n1!=-1:
todo.append(num+str(n1))
n2=base
todo.append(nu... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 502,613 | 502,614 | u842964692 | python |
p02720 | def main(argv):
k = int(sys.stdin.readline().rstrip("\n"))
if k < 10:
return print(k)
d = {i: [i] for i in range(10)}
counter = 9
n = 1
while counter < k:
next_d = {}
candidates = d[0]
candidates.extend(d[1])
next_d[0] = sorted([c for c in set(candidates)... | import sys
def main(argv):
k = int(sys.stdin.readline().rstrip("\n"))
if k < 10:
return print(k)
d = {i: [i] for i in range(10)}
counter = 9
n = 1
while counter < k:
next_d = {}
candidates = d[0]
candidates.extend(d[1])
next_d[0] = sorted([c for c in set... | [] | 502,617 | 502,618 | u096190786 | python |
p02720 | # solution
k=int(input())
from collections import deque
todo = deque([i for i in range(1, 10)])
count = 0
while len(todo) > 0:
value = todo.popleft()
seen.append(value)
value_digit1 = value % 10
count += 1
if count == k:
print(value)
break
if value_digit1==0:
todo.appen... | # solution
k=int(input())
from collections import deque
todo = deque([i for i in range(1, 10)])
count = 0
while len(todo) > 0:
value = todo.popleft()
value_digit1 = value % 10
count += 1
if count == k:
print(value)
break
if value_digit1==0:
todo.append(10*value)
tod... | [
"call.remove"
] | 502,623 | 502,624 | u024768467 | python |
p02720 | from collections import deque
K = int(input())
tree = deque([[0, i] for i in range(1, 10)])
i = 0
cnt = 9
while cnt <= K:
n = tree[i][1]
if n > 0:
tree.append([i, n - 1])
cnt += 1
tree.append([i, n])
cnt += 1
if n < 9:
tree.append([i, n + 1])
cnt += 1
i += 1
a... | from collections import deque
K = int(input())
tree = deque([[-1, i] for i in range(1, 10)])
i = 0
cnt = 9
while cnt <= K:
n = tree[i][1]
if n > 0:
tree.append([i, n - 1])
cnt += 1
tree.append([i, n])
cnt += 1
if n < 9:
tree.append([i, n + 1])
cnt += 1
i += 1
... | [
"assignment.value.change",
"call.arguments.change",
"expression.operation.unary.add",
"control_flow.branch.if.condition.change"
] | 502,628 | 502,629 | u811967730 | python |
p02720 | ## 解説をみての答え
from collections import deque
q = deque(range(1,10))
K = int(input())
for i in range(K):
x = q.popleft()
r = x % 10
if r != 0:
q.append((10 * x) + (r - 1))
q.append((10 * x) + r)
if r != 9:
q.put((10 * x) + (r + 1))
print(x) | from collections import deque
q = deque(range(1,10))
K = int(input())
for i in range(K):
x = q.popleft()
r = x % 10
if r != 0:
q.append((10 * x) + (r - 1))
q.append((10 * x) + r)
if r != 9:
q.append((10 * x) + (r + 1))
print(x) | [
"identifier.change"
] | 502,632 | 502,633 | u693007703 | python |
p02720 | def lower(upper):
if upper==9:
return [8,9]
elif upper==0:
return [0,1]
else:
return [upper-1,upper,upper+1]
def numerize(a):
return sum([a[i]*(10**i) for i in range(len(a))])
def getRunruns(digit):
if digit==1:
return [(i,) for i in range(10)]
elif digit==2:
... | def lower(upper):
if upper==9:
return [8,9]
elif upper==0:
return [0,1]
else:
return [upper-1,upper,upper+1]
def numerize(a):
return sum([a[i]*(10**i) for i in range(len(a))])
def getRunruns(digit):
if digit==1:
return [(i,) for i in range(10)]
elif digit==2:
... | [
"control_flow.loop.condition.change"
] | 502,636 | 502,637 | u309780279 | python |
p02720 | import queue
k = int(input())
q = queue.Queue()
for i in range(1,10):
q.put(i)
for i in range(k):
x = q.get()
p = 10 * x
m = x % 10
if not p == 0:
q.put(p + m - 1)
q.put(p + m)
if not p == 9:
q.put(p + m + 1)
print(x)
| import queue
k = int(input())
q = queue.Queue()
for i in range(1,10):
q.put(i)
for i in range(k):
x = q.get()
p = 10 * x
m = x % 10
if not m == 0:
q.put(p + m - 1)
q.put(p + m)
if not m == 9:
q.put(p + m + 1)
print(x)
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 502,642 | 502,643 | u934099192 | python |
p02720 | from collections import deque
k = int(input())
d = deque()
d += [1,2,3,4,5,6,7,8,9]
for i in range(k):
# print(d, now)
now = d.popleft()
if now%10 != 0:
d.append(10 * now + now % 10 - 1)
d.append(10 * now + now % 10)
if now%10 != 9:
d.append(10 * now + now % 10 + 1)
print(k, now) | from collections import deque
k = int(input())
d = deque()
d += [1,2,3,4,5,6,7,8,9]
for i in range(k):
# print(d, now)
now = d.popleft()
if now%10 != 0:
d.append(10 * now + now % 10 - 1)
d.append(10 * now + now % 10)
if now%10 != 9:
d.append(10 * now + now % 10 + 1)
print(now) | [
"call.arguments.change"
] | 502,669 | 502,670 | u242196904 | python |
p02720 | from collections import deque
K = int(input())
Q = list(range(1, 10))
for i in range(K):
x = Q[i]
y = x%10
if y != 0:
Q.append(10*x + y-1)
Q.append(10*x + y)
if y != 9:
Q.append(10*x + y+1)
print(Q[K]) | from collections import deque
K = int(input())
Q = list(range(1, 10))
for i in range(K):
x = Q[i]
y = x%10
if y != 0:
Q.append(10*x + y-1)
Q.append(10*x + y)
if y != 9:
Q.append(10*x + y+1)
print(Q[K-1]) | [
"expression.operation.binary.add"
] | 502,671 | 502,672 | u896726004 | python |
p02720 | import queue
K = int(input())
A = queue.Queue()
for i in range(1, 10):
A.put(i)
num = 0
while num < K:
emp = A.get()
var = emp % 10
if var != 0:
A.put(emp*10+var-1)
A.put(10*emp)
if var != 9:
A.put(emp*10+var+1)
num += 1
print(e... | import queue
K = int(input())
A = queue.Queue()
for i in range(1, 10):
A.put(i)
num = 0
while num < K:
emp = A.get()
var = emp % 10
if var != 0:
A.put(emp*10+var-1)
A.put(10*emp+var)
if var != 9:
A.put(emp*10+var+1)
num += 1
pri... | [
"expression.operation.binary.add"
] | 502,679 | 502,680 | u432098488 | python |
p02720 | from collections import deque
k=int(input())
q=deque(list(range(1, 10)))
ans,x,y=0,0,0
for i in range(k):
ans=q.popleft()
y=ans%10
x=ans*10+y
if y != 0:
q.append(tmp-1)
q.append(tmp)
if y != 9:
q.append(tmp+1)
print(ans)
| from collections import deque
k=int(input())
q=deque(list(range(1, 10)))
ans,x,y=0,0,0
for i in range(k):
ans=q.popleft()
y=ans%10
x=ans*10+y
if y != 0:
q.append(x-1)
q.append(x)
if y != 9:
q.append(x+1)
print(ans)
| [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 502,681 | 502,682 | u414458988 | python |
p02726 | N, X, Y = map(int, input().split())
ans = [0] * (N - 1)
X, Y = X - 1, Y - 1
Z = Y - X - 1
for i in range(N):
if i <= X:
for j in range(i + 1, Y):
p = min(j - i - 1, abs(i - X) + Y - j)
ans[p] += 1
for l in range(Y, N):
ans[l - i - Z - 1] += 1
elif (X < i) and (i < Y - 1):
for j... | N, X, Y = map(int, input().split())
ans = [0] * (N - 1)
X, Y = X - 1, Y - 1
Z = Y - X - 1
for i in range(N):
if i <= X:
for j in range(i + 1, Y):
p = min(j - i - 1, abs(i - X) + Y - j)
ans[p] += 1
for l in range(Y, N):
ans[l - i - Z - 1] += 1
elif (X < i) and (i < Y - 1):
for j... | [
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.remove"
] | 502,689 | 502,690 | u748241164 | python |
p02727 | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
X, Y, A, B, C, *PQR = map(int, read().split())
P = PQR[:A]
Q = PQR[A : A + B]
R = PQR[A + B :]
P.sort(reverse=True)
Q.sort(... | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
X, Y, A, B, C, *PQR = map(int, read().split())
P = PQR[:A]
Q = PQR[A : A + B]
R = PQR[A + B :]
P.sort(reverse=True)
Q.sort(... | [] | 502,767 | 502,768 | u968166680 | python |
p02727 | X,Y,A,B,C=map(int,input().split())
P=sorted(map(int,input().split()), reverse=True)[:X]
Q=sorted(map(int,input().split()), reverse=True)[:Y]
R=sorted(map(int,input().split()), reverse=True)[:X+Y]
i,j=X-1,Y-1
for r in R:
if i==-1 and j==-1:
break
elif j==-1:
if r>P[i]:
p[i]=r
... | X,Y,A,B,C=map(int,input().split())
P=sorted(map(int,input().split()), reverse=True)[:X]
Q=sorted(map(int,input().split()), reverse=True)[:Y]
R=sorted(map(int,input().split()), reverse=True)[:X+Y]
i,j=X-1,Y-1
for r in R:
if i==-1 and j==-1:
break
elif j==-1:
if r>P[i]:
P[i]=r
... | [
"assignment.variable.change",
"identifier.change"
] | 502,792 | 502,793 | u054825571 | python |
p02727 | x,y,a,b,c,=map(int,input().split())
p=list(map(int,input().split()))
q=list(map(int,input().split()))
r=list(map(int,input().split()))
p.sort(reverse=True)
q.sort(reverse=True)
r.sort(reverse=True)
p=p[:x]
q=q[:y]
ans=p+q
ans.sort(reverse=True)
ans=[0]+ans
nowi=x+y
r=[0]+r
nowr=0
while nowr<=c+1 and nowi>0 and r[nowr+1... | x,y,a,b,c,=map(int,input().split())
p=list(map(int,input().split()))
q=list(map(int,input().split()))
r=list(map(int,input().split()))
p.sort(reverse=True)
q.sort(reverse=True)
r.sort(reverse=True)
p=p[:x]
q=q[:y]
ans=p+q
ans.sort(reverse=True)
ans=[0]+ans
nowi=x+y
r=[0]+r
nowr=0
while nowr<=c-1 and nowi>0 and r[nowr+1... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.loop.condition.change"
] | 502,798 | 502,799 | u428199834 | python |
p02727 | x, y, a, b, c = map(int, input().split())
p =list(map(int, input().split()))
q = list(map(int, input().split()))
r = list(map(int, input().split()))
p = sorted(p)
p = sorted(p)
p = p[(len(p)-x):]
q = q[(len(q)-y):]
r=r+p
r=r+q
r = sorted(r)
print(sum(r[(len(r)-x-y):]))
| x, y, a, b, c = map(int, input().split())
p =list(map(int, input().split()))
q = list(map(int, input().split()))
r = list(map(int, input().split()))
p = sorted(p)
q = sorted(q)
p = p[(len(p)-x):]
q = q[(len(q)-y):]
r = r + p
r = r + q
r = sorted(r)
print(sum(r[(len(r)-x-y):]))
| [
"assignment.variable.change",
"identifier.change",
"assignment.value.change",
"call.arguments.change"
] | 502,836 | 502,837 | u566159623 | python |
p02727 | # -*- coding: utf-8 -*-
#############
# Libraries #
#############
import sys
input = sys.stdin.readline
import math
#from math import gcd
import bisect
from collections import defaultdict
from collections import deque
from functools import lru_cache
#############
# Constants #
#############
MOD = 10**9+7
INF = fl... | # -*- coding: utf-8 -*-
#############
# Libraries #
#############
import sys
input = sys.stdin.readline
import math
#from math import gcd
import bisect
from collections import defaultdict
from collections import deque
from functools import lru_cache
#############
# Constants #
#############
MOD = 10**9+7
INF = fl... | [
"call.arguments.keyword_argument.add"
] | 502,848 | 502,849 | u493130708 | python |
p02727 | from sys import stdin
def main():
x, y, a, b, c = map(int, stdin.readline().split())
p = list(map(int, stdin.readline().split()))
q = list(map(int, stdin.readline().split()))
r = list(map(int, stdin.readline().split()))
pqr = []
for pi in p:
pqr.append([pi, 0])
for qi in q:
... | from sys import stdin
def main():
x, y, a, b, c = map(int, stdin.readline().split())
p = list(map(int, stdin.readline().split()))
q = list(map(int, stdin.readline().split()))
r = list(map(int, stdin.readline().split()))
pqr = []
for pi in p:
pqr.append([pi, 0])
for qi in q:
... | [
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 502,854 | 502,855 | u390727364 | python |
p02727 | x, y, a, b, c = map(int, input().split())
red = list(map(int, input().split()))
green = list(map(int, input().split()))
colorless = list(map(int, input().split()))
red.sort(reverse = True)
green.sort(reverse = True)
colorless.sort(reverse = True)
ret = red[:x] + green[:y]
ret.sort()
for i in range(len(colorless)):
... | x, y, a, b, c = map(int, input().split())
red = list(map(int, input().split()))
green = list(map(int, input().split()))
colorless = list(map(int, input().split()))
red.sort(reverse = True)
green.sort(reverse = True)
colorless.sort(reverse = True)
ret = red[:x] + green[:y]
ret.sort()
for i in range(len(colorless)):
... | [
"control_flow.break.add"
] | 502,885 | 502,886 | u572138437 | python |
p02727 | x, y, a, b, c = map(int, input().split())
p = list(map(int, input().split()))
q = list(map(int, input().split()))
r = list(map(int, input().split()))
p.sort(reverse=True)
q.sort(reverse=True)
r.sort(reverse=True)
ans = p[:x] + q[:y] + r
print(sum(ans.sort(reverse=True)[:x + y])) | x, y, a, b, c = map(int, input().split())
p = list(map(int, input().split()))
q = list(map(int, input().split()))
r = list(map(int, input().split()))
p.sort(reverse=True)
q.sort(reverse=True)
r.sort(reverse=True)
ans = p[:x] + q[:y] + r
print(sum(sorted(ans, reverse=True)[:x + y]))
| [
"call.arguments.change",
"call.arguments.add"
] | 502,887 | 502,888 | u038408819 | python |
p02727 | X, Y, A, B, C = map(int, input().split())
P = sorted([int(i) for i in input().split()], reverse=True)
Q = sorted([int(i) for i in input().split()], reverse=True)
R = sorted([int(i) for i in input().split()])
S = sorted(P[:X]+Q[:Y]+R, reverse=True)
ans = sum(S[:X+Y])
| X, Y, A, B, C = map(int, input().split())
P = sorted([int(i) for i in input().split()], reverse=True)
Q = sorted([int(i) for i in input().split()], reverse=True)
R = sorted([int(i) for i in input().split()])
S = sorted(P[:X]+Q[:Y]+R, reverse=True)
print(sum(S[:X+Y]))
| [
"call.arguments.change"
] | 502,893 | 502,894 | u223646582 | python |
p02727 | x,y,a,b,c=map(int,input().split())
p=sorted(list(map(int,input().split())),reverse=True)
q=sorted(list(map(int,input().split())),reverse=True)
r=sorted(list(map(int,input().split())),reverse=True)
p2=p[:x]
q2=q[:y]
memop=x-1
memoq=y-1
sp=sum(p2)
sq=sum(q2)
k=0
flagp=0
flagq=0
while k<c:
if memop<0:
flagp=1
... | x,y,a,b,c=map(int,input().split())
p=sorted(list(map(int,input().split())),reverse=True)
q=sorted(list(map(int,input().split())),reverse=True)
r=sorted(list(map(int,input().split())),reverse=True)
p2=p[:x]
q2=q[:y]
memop=x-1
memoq=y-1
sp=sum(p2)
sq=sum(q2)
k=0
flagp=0
flagq=0
while k<c:
if memop<0:
flagp=1
... | [
"call.add"
] | 502,936 | 502,937 | u518064858 | python |
p02727 | x,y,a,b,c = map(int, input().split())
p = list(map(int, input().split()))
q = list(map(int, input().split()))
r = list(map(int, input().split()))
p = sorted(p, reverse=True)
q = sorted(q, reverse=True)
pq = sorted(p[:x] + q[:y])
r = sorted(r)
ans=0
j = r.pop()
for i in pq:
if i < j:
ans+=j
j = 0
if r:
... | x,y,a,b,c = map(int, input().split())
p = list(map(int, input().split()))
q = list(map(int, input().split()))
r = list(map(int, input().split()))
p = sorted(p, reverse=True)
q = sorted(q, reverse=True)
pq = sorted(p[:x] + q[:y])
r = sorted(r)
ans=0
j = r.pop()
for i in pq:
if i < j:
ans += j
j = 0
if r:... | [] | 502,959 | 502,960 | u521323621 | python |
p02727 | X, Y, A, B, C = map(int, input().split())
p = sorted(list(map(int, input().split())), reverse=True)
q = sorted(list(map(int, input().split())), reverse=True)
r = sorted(list(map(int, input().split())), reverse=True)
red = p[:X]
green = q[:Y]
red_no_eat = 0
green_no_eat = 0
for no in r:
red_worst = red[-red_no_eat... | X, Y, A, B, C = map(int, input().split())
p = sorted(list(map(int, input().split())), reverse=True)
q = sorted(list(map(int, input().split())), reverse=True)
r = sorted(list(map(int, input().split())), reverse=True)
red = p[:X]
green = q[:Y]
red_no_eat = 0
green_no_eat = 0
for no in r:
red_worst = red[-red_no_eat... | [
"expression.operator.compare.change",
"assignment.value.change"
] | 502,973 | 502,974 | u850390157 | python |
p02727 | X, Y, A, B, C = map(int, input().split())
p = list(map(int, input().split()))
q = list(map(int, input().split()))
r = list(map(int, input().split()))
p.sort(reverse=True)
q.sort(reverse=True)
r.sort(reverse=True)
sa = sum(p[:X])
sb = sum(q[:Y])
p.append(float('inf'))
q.append(float('inf'))
ans = sa + sb
nr = 0
np ... | X, Y, A, B, C = map(int, input().split())
p = list(map(int, input().split()))
q = list(map(int, input().split()))
r = list(map(int, input().split()))
p.sort(reverse=True)
q.sort(reverse=True)
r.sort(reverse=True)
sa = sum(p[:X])
sb = sum(q[:Y])
p.append(float('inf'))
q.append(float('inf'))
ans = sa + sb
nr = 0
np ... | [] | 502,993 | 502,994 | u627600101 | python |
p02727 | X, Y, A, B, C = map(int, input().split())
p = list(map(int, input().split()))
q = list(map(int, input().split()))
r = list(map(int, input().split()))
p.sort(reverse=True)
q.sort(reverse=True)
r.sort(reverse=True)
sa = sum(p[:X])
sb = sum(q[:Y])
p.append(float('inf'))
q.append(float('inf'))
ans = sa + sb
nr = 0
np ... | X, Y, A, B, C = map(int, input().split())
p = list(map(int, input().split()))
q = list(map(int, input().split()))
r = list(map(int, input().split()))
p.sort(reverse=True)
q.sort(reverse=True)
r.sort(reverse=True)
sa = sum(p[:X])
sb = sum(q[:Y])
p.append(float('inf'))
q.append(float('inf'))
ans = sa + sb
nr = 0
np ... | [
"identifier.change"
] | 502,995 | 502,994 | u627600101 | python |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.