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 |
|---|---|---|---|---|---|---|---|
p02760 | A = []
for i in range(3):
A.append(list(map(int, input().split())))
N = int(input())
b = []
for i in range(N):
b.append(int(input()))
bingo = []
for t in range(N):
for i in range(3):
if b[t] in A[i]:
j = A[i].index(b[t])
#bingo.append((i, j))
A[i][j] = True
for... | A = []
for i in range(3):
A.append(list(map(int, input().split())))
N = int(input())
b = []
for i in range(N):
b.append(int(input()))
bingo = []
for t in range(N):
for i in range(3):
if b[t] in A[i]:
j = A[i].index(b[t])
#bingo.append((i, j))
A[i][j] = True
ans... | [
"assignment.add"
] | 554,525 | 554,526 | u266569040 | python |
p02760 | #7
a = [[map(int,input().split())] for _ in range(3)]
n = int(input())
b = [int(input()) for _ in range(n)]
for i in range(3):
for j in range(3):
if a[i][j] in b:
a[i][j] = -1
bingo = 0
for i in range(3):
if a[i][0] == a[i][1] == a[i][2] == -1:
bingo = 1
for j in range(3):... | #7
a = [list(map(int,input().split())) for _ in range(3)]
n = int(input())
b = [int(input()) for _ in range(n)]
for i in range(3):
for j in range(3):
if a[i][j] in b:
a[i][j] = -1
bingo = 0
for i in range(3):
if a[i][0] == a[i][1] == a[i][2] == -1:
bingo = 1
for j in range... | [
"assignment.value.change",
"call.arguments.change",
"control_flow.branch.if.condition.change"
] | 554,540 | 554,541 | u211805975 | python |
p02760 | import sys
row1 = [int(n) for n in input().split()]
row2 = [int(n) for n in input().split()]
row3 = [int(n) for n in input().split()]
card = [row1,row2,row3]
#print(card)
N = int(input())
for n in range(N):
bn = int(input())
for i in range(len(card)):
for j in range(len(card)):
if card[i... | import sys
row1 = [int(n) for n in input().split()]
row2 = [int(n) for n in input().split()]
row3 = [int(n) for n in input().split()]
card = [row1,row2,row3]
#print(card)
N = int(input())
for n in range(N):
bn = int(input())
for i in range(len(card)):
for j in range(len(card)):
if card[i... | [
"call.add"
] | 554,544 | 554,545 | u433371341 | python |
p02760 | import numpy as np
sheet=[input().split() for l in range(3)]
n=int(input())
b=[input() for i in range(n)]
a=np.array(sheet)
i,j,k,c,z=0,0,0,0,0
for i in range(3):
for j in range(3):
for k in range(n):
if a[i][j]==b[k]:
a[i][j]="x"
if a[0][0]==a[1][1]==a[2][2]=="x":
c+=1
... | import numpy as np
sheet=[input().split() for l in range(3)]
n=int(input())
b=[input() for i in range(n)]
a=np.array(sheet)
i,j,k,c,z=0,0,0,0,0
for i in range(3):
for j in range(3):
for k in range(n):
if a[i][j]==b[k]:
a[i][j]="x"
if a[0][0]==a[1][1]==a[2][2]=="x":
c+=1
... | [
"literal.number.integer.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 554,552 | 554,553 | u434296044 | python |
p02760 | a=[list(map(int,input().split())) for i in range(3)]
n=int(input())
b=[int(input() for i in range(n))]
flag =False
for i in range(3):
if all(a[i][j] in b for j in range(3)):
flag=True
if all(a[j][i] in b for j in range(3)):
flag=True
if all(a[j][j] in b for j in range(3)) or all(a[i][2-i] in b for i in rang... | a=[list(map(int,input().split())) for i in range(3)]
n=int(input())
b=[int(input()) for i in range(n)]
flag =False
for i in range(3):
if all(a[i][j] in b for j in range(3)):
flag=True
if all(a[j][i] in b for j in range(3)):
flag=True
if all(a[j][j] in b for j in range(3)) or all(a[i][2-i] in b for i in rang... | [
"call.arguments.change"
] | 554,558 | 554,559 | u798093965 | python |
p02760 | a=[]
a.append(list(map(int,input().split())))
a.append(list(map(int,input().split())))
a.append(list(map(int,input().split())))
n=int(input())
for _ in range(n):
b=int(input())
for i in range(3):
for j in range(3):
if a[i][j]==b:
a[i][j]=0
ans = 0
for i in range(3):
if su... | a=[]
a.append(list(map(int,input().split())))
a.append(list(map(int,input().split())))
a.append(list(map(int,input().split())))
n=int(input())
for _ in range(n):
b=int(input())
for i in range(3):
for j in range(3):
if a[i][j]==b:
a[i][j]=0
ans = 0
for i in range(3):
if su... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.branch.if.condition.change"
] | 554,575 | 554,576 | u707124227 | python |
p02760 | A = [list(map(int, input().split())) for i in range(3)]
N = int(input())
b = [int(input()) for i in range(N)]
judge = 0
for i in range(3):
for j in range(3):
if A[i][j] in b:
A[i][j] = 0
for i in range(3):
if A[i][0] + A[i][1] + A[i][2] == 0 or A[0][i] + A[1][i] + A[2][i] == 0 or A[0][0]+A[1][1]+A[2][... | A = [list(map(int, input().split())) for i in range(3)]
N = int(input())
b = [int(input()) for i in range(N)]
judge = 0
for i in range(3):
for j in range(3):
if A[i][j] in b:
A[i][j] = 0
for i in range(3):
if A[i][0] + A[i][1] + A[i][2] == 0 or A[0][i] + A[1][i] + A[2][i] == 0 or A[0][0]+A[1][1]+A[2][... | [
"control_flow.break.remove"
] | 554,577 | 554,578 | u352402050 | python |
p02760 | a1=list(map(int, input().split()))
a2=list(map(int, input().split()))
a3=list(map(int, input().split()))
n=int(input())
b=[0]*n
for i in range(n):
b[i]=int(input())
for i in range(n):
for j in range(3):
if a1[j]==b[i]:
a1[j]=-1
if a2[j]==b[i]:
a2[j]=-1
if a3[j]==b... | a1=list(map(int, input().split()))
a2=list(map(int, input().split()))
a3=list(map(int, input().split()))
n=int(input())
b=[0]*n
for i in range(n):
b[i]=int(input())
for i in range(n):
for j in range(3):
if a1[j]==b[i]:
a1[j]=-1
if a2[j]==b[i]:
a2[j]=-1
if a3[j]==b... | [
"literal.number.integer.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 554,589 | 554,590 | u915066452 | python |
p02760 | a1 = list(map(int, input().split()))
a2 = list(map(int, input().split()))
a3 = list(map(int, input().split()))
n = int(input())
b = []
for i in range(n):
x = int(input())
b.append(x)
for i in b:
if i in a1:
a1[a1.index(i)] = 'X'
if i in a2:
a2[a2.index(i)] = 'X'
if i in a3:
... | a1 = list(map(int, input().split()))
a2 = list(map(int, input().split()))
a3 = list(map(int, input().split()))
n = int(input())
b = []
for i in range(n):
x = int(input())
b.append(x)
for i in b:
if i in a1:
a1[a1.index(i)] = 'X'
if i in a2:
a2[a2.index(i)] = 'X'
if i in a3:
... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 554,593 | 554,594 | u246343119 | python |
p02760 | a1 = list(map(int, input().split()))
a2 = list(map(int, input().split()))
a3 = list(map(int, input().split()))
n = int(input())
b = []
for i in range(n):
x = int(input())
b.append(x)
for i in b:
if i in a1:
a1[a1.index(i)] = 'X'
if i in a2:
a2[a2.index(i)] = 'X'
if i in a3:
... | a1 = list(map(int, input().split()))
a2 = list(map(int, input().split()))
a3 = list(map(int, input().split()))
n = int(input())
b = []
for i in range(n):
x = int(input())
b.append(x)
for i in b:
if i in a1:
a1[a1.index(i)] = 'X'
if i in a2:
a2[a2.index(i)] = 'X'
if i in a3:
... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 554,595 | 554,594 | u246343119 | python |
p02760 | a1 = list(map(int, input().split()))
a2 = list(map(int, input().split()))
a3 = list(map(int, input().split()))
n = int(input())
b = []
for i in range(n):
x = int(input())
b.append(x)
for i in b:
if i in a1:
a1[a1.index(i)] = 'X'
if i in a2:
a2[a2.index(i)] = 'X'
if i in a3:
... | a1 = list(map(int, input().split()))
a2 = list(map(int, input().split()))
a3 = list(map(int, input().split()))
n = int(input())
b = []
for i in range(n):
x = int(input())
b.append(x)
for i in b:
if i in a1:
a1[a1.index(i)] = 'X'
if i in a2:
a2[a2.index(i)] = 'X'
if i in a3:
... | [
"control_flow.branch.if.condition.change",
"identifier.change"
] | 554,596 | 554,594 | u246343119 | python |
p02760 | A = []
for _ in range(3):
A += list(map(int, input().split()))
N = int(input())
B = [int(input()) for i in range(N)]
for i in range(0,N-1):
for j in range(9):
if B[i] == A[j]:
A[j] = 0
if A[0]==A[1]==A[2]==0 or A[3]==A[4]==A[5]==0 or A[6]==A[7]==A[8]==0 or A[0]==A[3]==A[6]==0 or A[1]==A[4... | A = []
for _ in range(3):
A += list(map(int, input().split()))
N = int(input())
B = [int(input()) for i in range(N)]
for i in range(0,N):
for j in range(9):
if B[i] == A[j]:
A[j] = 0
if A[0]==A[1]==A[2]==0 or A[3]==A[4]==A[5]==0 or A[6]==A[7]==A[8]==0 or A[0]==A[3]==A[6]==0 or A[1]==A[4]=... | [
"expression.operation.binary.remove"
] | 554,601 | 554,602 | u581603131 | python |
p02760 | a=[list(map(int,input().split())) for i in range(3)]
n=int(input())
b=[input() for i in range(n)]
for i in range(3):
for j in range(3):
for k in range(n):
if b[k]==a[i][j]:
a[i][j]=0
if (a[0][0]==0 and a[1][0]==0 and a[2][0]==0) or (a[0][1]==0 and a[1][1]==0 and a[2][1]==0) or (a[0][2]==0 and a[1][2... | a=[list(map(int,input().split())) for i in range(3)]
n=int(input())
b=[int(input()) for i in range(n)]
for i in range(3):
for j in range(3):
for k in range(n):
if b[k]==a[i][j]:
a[i][j]=0
if (a[0][0]==0 and a[1][0]==0 and a[2][0]==0) or (a[0][1]==0 and a[1][1]==0 and a[2][1]==0) or (a[0][2]==0 and a... | [
"call.add",
"call.arguments.change"
] | 554,603 | 554,604 | u482743994 | python |
p02760 | bingo = []
b = []
for i in range(3):
tmp = list(map(int,input().split()))
bingo.append(tmp)
n = int(input())
while True:
try:
b.append(int(input()))
except EOFError:
break
lis1 = [bingo[0][0],bingo[0][1],bingo[0][2]]
lis2 = [bingo[1][0],bingo[1][1],bingo[1][2]]
lis3 = [bingo[2][0],bingo[2][1],bingo[... | bingo = []
b = []
for i in range(3):
tmp = list(map(int,input().split()))
bingo.append(tmp)
n = int(input())
while True:
try:
b.append(int(input()))
except EOFError:
break
lis1 = [bingo[0][0],bingo[0][1],bingo[0][2]]
lis2 = [bingo[1][0],bingo[1][1],bingo[1][2]]
lis3 = [bingo[2][0],bingo[2][1],bingo[... | [
"call.remove"
] | 554,613 | 554,614 | u987326700 | python |
p02760 | bingo = []
b = []
for i in range(3):
tmp = list(map(int,input().split()))
bingo.append(tmp)
n = int(input())
while True:
try:
b.append(int(input()))
except EOFError:
break
lis1 = [bingo[0][0],bingo[0][1],bingo[0][2]]
lis2 = [bingo[1][0],bingo[1][1],bingo[1][2]]
lis3 = [bingo[2][0],bingo[2][1],bingo[... | bingo = []
b = []
for i in range(3):
tmp = list(map(int,input().split()))
bingo.append(tmp)
n = int(input())
while True:
try:
b.append(int(input()))
except EOFError:
break
lis1 = [bingo[0][0],bingo[0][1],bingo[0][2]]
lis2 = [bingo[1][0],bingo[1][1],bingo[1][2]]
lis3 = [bingo[2][0],bingo[2][1],bingo[... | [
"literal.number.integer.change",
"assignment.value.change",
"variable_access.subscript.index.change"
] | 554,615 | 554,614 | u987326700 | python |
p02760 | a=[]
for i in range(3):
a.append(list(map(int,input().split())))
n=int(input())
for k in range(n):
bk=int(input())
for i in range(3):
for j in range(3):
if bk==a[i][j]:
a[i][j]=0
c=0
for i in range(3):
if a[0][i]==a[1][i] and a[0][i]==a[2][i]:
c += 1
if a[0]=... | a=[]
for i in range(3):
a.append(list(map(int,input().split())))
n=int(input())
for k in range(n):
bk=int(input())
for i in range(3):
for j in range(3):
if bk==a[i][j]:
a[i][j]=0
c=0
for i in range(3):
if a[0][i]==a[1][i] and a[0][i]==a[2][i]:
c += 1
if a[0]... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 554,616 | 554,617 | u263753244 | python |
p02760 | A=[0,0,0]
S=[0,0,0]
for i in range(3):
A[i]=[int(x) for x in input().split()]
S[i]=[0,0,0]
N=int(input())
for i in range(N):
b=int(input())
for x in range(3):
for y in range(3):
if A[x][y]==b:
S[x][y]=1
flag=False
for i in range(3):
if S[i]==[1,1,1]:
... | A=[0,0,0]
S=[0,0,0]
for i in range(3):
A[i]=[int(x) for x in input().split()]
S[i]=[0,0,0]
N=int(input())
for i in range(N):
b=int(input())
for x in range(3):
for y in range(3):
if A[x][y]==b:
S[x][y]=1
flag=False
for i in range(3):
if S[i]==[1,1,1]:
... | [
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 554,618 | 554,619 | u330728443 | python |
p02760 | import numpy as np
a_list=[]
for i in range(3):
tmp=list(map(int,input().split()))
a_list.append(tmp)
a_list=np.array(a_list)
num=int(input())
for i in range(num):
tmp=int(input())
a_list[a_list==tmp]=-1
yes_no=False
for i in range(3):
if sum(a_list[i])==-3:
yes_no=True
break
tmp=0
for j in ran... | import numpy as np
a_list=[]
for i in range(3):
tmp=list(map(int,input().split()))
a_list.append(tmp)
a_list=np.array(a_list)
num=int(input())
for i in range(num):
tmp=int(input())
a_list[a_list==tmp]=-1
yes_no=False
for i in range(3):
if sum(a_list[i])==-3:
yes_no=True
break
tmp=0
for j in ran... | [] | 554,622 | 554,623 | u699296734 | python |
p02760 | import numpy as np
def isBingo(isOpen):
if np.any(np.all(isOpen==1,axis=0)==True) or \
np.any(np.all(isOpen==1,axis=1)==True):
return "Yes"
cnt1=0
cnt2=0
for i in range(3):
if isOpen[i][i]==1:
cnt1+=1
if isOpen[i][2-i]==1:
cnt1+=1
if cnt1==3 o... | import numpy as np
def isBingo(isOpen):
if np.any(np.all(isOpen==1,axis=0)==True) or \
np.any(np.all(isOpen==1,axis=1)==True):
return "Yes"
cnt1=0
cnt2=0
for i in range(3):
if isOpen[i][i]==1:
cnt1+=1
if isOpen[i][2-i]==1:
cnt2+=1
if cnt1==3 o... | [
"identifier.change",
"call.arguments.add"
] | 554,632 | 554,633 | u970133396 | python |
p02760 | A = []
for i in range(3):
A.append(input().split())
N = int(input())
B = []
for i in range(N):
B = input()
for j in range(3):
for k in range(3):
if A[j][k] == B:
A[j][k] = 0
if A[0][0] == 0 and A[0][1] == 0 and A[0][2] == 0:
print('Yes')
elif A[1][0] == 0 and A[1][0]... | A = []
for i in range(3):
A.append(input().split())
N = int(input())
B = []
for i in range(N):
B = input()
for j in range(3):
for k in range(3):
if A[j][k] == B:
A[j][k] = 0
if A[0][0] == 0 and A[0][1] == 0 and A[0][2] == 0:
print('Yes')
elif A[1][0] == 0 and A[1][1]... | [
"literal.number.integer.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 554,636 | 554,635 | u793875993 | python |
p02760 | #!/usr/bin/env python3
A = [list(map(int, input().split())) for i in range(3)]
B = [[0, 0, 0], [0, 0, 0], [0, 0, 0]]
N = int(input())
# print(A)
for i in range(N):
num = int(input())
for j in range(3):
for k in range(3):
if A[j][k] == num:
B[j][k] = 1
# print(B)
flag = 0
... | #!/usr/bin/env python3
A = [list(map(int, input().split())) for i in range(3)]
B = [[0, 0, 0], [0, 0, 0], [0, 0, 0]]
N = int(input())
# print(A)
for i in range(N):
num = int(input())
for j in range(3):
for k in range(3):
if A[j][k] == num:
B[j][k] = 1
# print(B)
flag = 0
... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 554,643 | 554,644 | u239528020 | python |
p02760 | #--Bingo
a_11, a_12, a_13 = map(int, input().split(" "))
a_21, a_22, a_23 = map(int, input().split(" "))
a_31, a_32, a_33 = map(int, input().split(" "))
N = int(input())
List = [int(input()) for i in range(N)]
#--horizontal
bingo = [[a_11, a_12, a_13], [a_21, a_22, a_23], [a_31, a_32, a_33],
[a_11, a_21, a_3... | #--Bingo
a_11, a_12, a_13 = map(int, input().split(" "))
a_21, a_22, a_23 = map(int, input().split(" "))
a_31, a_32, a_33 = map(int, input().split(" "))
N = int(input())
List = [int(input()) for i in range(N)]
#--horizontal
bingo = [[a_11, a_12, a_13], [a_21, a_22, a_23], [a_31, a_32, a_33],
[a_11, a_21, a_3... | [
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 554,648 | 554,649 | u949234226 | python |
p02760 | a11, a12, a13 = map(int,input().split())
a21, a22, a23 = map(int,input().split())
a31, a32, a33 = map(int,input().split())
n=int(input())
b=[0]*n
for i in range(n):
b[i]=int(input())
for i in range(n):
if b[i] == a11:
a11=0
elif b[i] == a12:
a12 = 0
elif b[i] == a13:
a13 = 0
elif b[i] == a21:
... | a11, a12, a13 = map(int,input().split())
a21, a22, a23 = map(int,input().split())
a31, a32, a33 = map(int,input().split())
n=int(input())
b=[0]*n
for i in range(n):
b[i]=int(input())
for i in range(n):
if b[i] == a11:
a11=0
elif b[i] == a12:
a12 = 0
elif b[i] == a13:
a13 = 0
elif b[i] == a21:
... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 554,652 | 554,653 | u884601206 | python |
p02760 | a11, a12, a13 = map(int,input().split())
a21, a22, a23 = map(int,input().split())
a31, a32, a33 = map(int,input().split())
n=int(input())
b=[0]*n
for i in range(n):
b[i]=int(input())
for i in range(n):
if b[i] == a11:
a11=0
elif b[i] == a12:
a12 = 0
elif b[i] == a13:
a13 = 0
elif b[i] == a21:
... | a11, a12, a13 = map(int,input().split())
a21, a22, a23 = map(int,input().split())
a31, a32, a33 = map(int,input().split())
n=int(input())
b=[0]*n
for i in range(n):
b[i]=int(input())
for i in range(n):
if b[i] == a11:
a11=0
elif b[i] == a12:
a12 = 0
elif b[i] == a13:
a13 = 0
elif b[i] == a21:
... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 554,654 | 554,653 | u884601206 | python |
p02760 | import sys
ll = [[int(x) for x in input().split()] for y in range(3)]
n = int(input())
for i in range(n):
b = int(input())
for ii in range(3):
if b in ll[ii]:
ll[ii][ll[ii].index(b)] = 0
for i in range(3):
if ll[i][0] == ll[i][1] == ll[i][2] == 0:
print("Yes")
sys.exi... | import sys
ll = [[int(x) for x in input().split()] for y in range(3)]
n = int(input())
for i in range(n):
b = int(input())
for ii in range(3):
if b in ll[ii]:
ll[ii][ll[ii].index(b)] = 0
for i in range(3):
if ll[i][0] == ll[i][1] == ll[i][2] == 0:
print("Yes")
sys.exi... | [
"call.remove"
] | 554,661 | 554,662 | u693945629 | python |
p02760 | import sys
A=[list(map(int,input().split())) for i in range(3)]
N=int(input())
b=[]
for i in range(N):
b.append(int(input()))
for i in range(3):
for j in range(3):
for x in range(N):
if A[i][j]==b[x]:
A[i][j]=0
for i in range(3):
if A[i][0]==0 and A[i][1]==0 and A[i][... | import sys
A=[list(map(int,input().split())) for i in range(3)]
N=int(input())
b=[]
for i in range(N):
b.append(int(input()))
for i in range(3):
for j in range(3):
for x in range(N):
if A[i][j]==b[x]:
A[i][j]=0
for i in range(3):
if A[i][0]==0 and A[i][1]==0 and A[i][... | [
"literal.number.integer.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 554,663 | 554,664 | u924783770 | python |
p02762 | import sys
input = sys.stdin.readline
n, m, k = map(int,input().split())
A = [list(map(int,input().split())) for i in range(m)]
B = [list(map(int,input().split())) for i in range(k)]
# print(A)
# print(B)
for i in range(m):
for j in range(2):
A[i][j] -= 1
for i in range(k):
for j in range(2):
B[... | import sys
input = sys.stdin.readline
n, m, k = map(int,input().split())
A = [list(map(int,input().split())) for i in range(m)]
B = [list(map(int,input().split())) for i in range(k)]
# print(A)
# print(B)
for i in range(m):
for j in range(2):
A[i][j] -= 1
for i in range(k):
for j in range(2):
B[... | [
"expression.operation.unary.add",
"function.return_value.change"
] | 554,667 | 554,668 | u325227960 | python |
p02762 | import sys
input = sys.stdin.readline
n, m, k = map(int,input().split())
A = [list(map(int,input().split())) for i in range(m)]
B = [list(map(int,input().split())) for i in range(k)]
for i in range(m):
for j in range(2):
A[i][j] -= 1
for i in range(k):
for j in range(2):
B[i][j] -= 1
class Un... | import sys
input = sys.stdin.readline
n, m, k = map(int,input().split())
A = [list(map(int,input().split())) for i in range(m)]
B = [list(map(int,input().split())) for i in range(k)]
# print(A)
# print(B)
for i in range(m):
for j in range(2):
A[i][j] -= 1
for i in range(k):
for j in range(2):
B[... | [
"expression.operation.unary.add",
"function.return_value.change"
] | 554,669 | 554,668 | u325227960 | python |
p02762 | import sys
from io import StringIO
import unittest
class UnionFind():
# 作りたい要素数nで初期化
# 使用するインスタンス変数の初期化
def __init__(self, n):
self.n = n
# root[x]<0ならそのノードが根かつその値が木の要素数
# rootノードでその木の要素数を記録する
self.root = [-1]*(n+1)
# 木をくっつける時にアンバランスにならないように調整する
self.rnk = [0... | import sys
from io import StringIO
import unittest
class UnionFind():
# 作りたい要素数nで初期化
# 使用するインスタンス変数の初期化
def __init__(self, n):
self.n = n
# root[x]<0ならそのノードが根かつその値が木の要素数
# rootノードでその木の要素数を記録する
self.root = [-1]*(n+1)
# 木をくっつける時にアンバランスにならないように調整する
self.rnk = [0... | [
"call.add"
] | 554,682 | 554,683 | u697696097 | python |
p02762 | import sys
from io import StringIO
import unittest
class UnionFind():
# 作りたい要素数nで初期化
# 使用するインスタンス変数の初期化
def __init__(self, n):
self.n = n
# root[x]<0ならそのノードが根かつその値が木の要素数
# rootノードでその木の要素数を記録する
self.root = [-1]*(n+1)
# 木をくっつける時にアンバランスにならないように調整する
self.rnk = [0... | import sys
from io import StringIO
import unittest
class UnionFind():
# 作りたい要素数nで初期化
# 使用するインスタンス変数の初期化
def __init__(self, n):
self.n = n
# root[x]<0ならそのノードが根かつその値が木の要素数
# rootノードでその木の要素数を記録する
self.root = [-1]*(n+1)
# 木をくっつける時にアンバランスにならないように調整する
self.rnk = [0... | [
"call.add"
] | 554,684 | 554,685 | u697696097 | python |
p02762 | from collections import deque
from copy import deepcopy
class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return... | from collections import deque
from copy import deepcopy
class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return... | [
"call.add",
"call.arguments.change",
"identifier.change",
"io.output.change"
] | 554,686 | 554,687 | u978178314 | python |
p02762 | from collections import defaultdict
class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
... | from collections import defaultdict
class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
... | [] | 554,709 | 554,710 | u185325486 | python |
p02763 | import bisect
n = int(input().strip())
S = input().strip()
L=[[] for _ in range(26)]
for i,s in enumerate(S):
L[ord(s)-ord("a")].append(i)
q = int(input().strip())
for _ in range(q):
query=input().strip().split()
if query[0]=="1":
i=int(query[1])
i-=1
c=query[2]
if S[i]!=c:
... | import bisect
n = int(input().strip())
S = list(input().strip())
L=[[] for _ in range(26)]
for i,s in enumerate(S):
L[ord(s)-ord("a")].append(i)
q = int(input().strip())
for _ in range(q):
query=input().strip().split()
if query[0]=="1":
i=int(query[1])
i-=1
c=query[2]
if S[i... | [
"call.add",
"call.arguments.change"
] | 554,730 | 554,731 | u970133396 | python |
p02763 | n = int(input())
s = input()
q = int(input())
commands = []
for _ in range(q):
com, x, y = input().split()
commands.append((com, int(x), y))
size = 1
while size < n:
size *= 2
# initialize
segment_tree = [0 for _ in range(2 * size - 1)]
def alphabet2bit(string):
return 1 << (26 - (ord(string) - ord(... | n = int(input())
s = input()
q = int(input())
commands = []
for _ in range(q):
com, x, y = input().split()
commands.append((com, int(x), y))
size = 1
while size < n:
size *= 2
# initialize
segment_tree = [0 for _ in range(2 * size - 1)]
def alphabet2bit(string):
return 1 << (ord(string) - ord('a'))
... | [
"call.arguments.change"
] | 554,732 | 554,733 | u940139461 | python |
p02763 | NN = 19
X = [0] * ((1<<NN+1)-1)
def popcount(x):
x -= (x >> 1) & 0x55555555
x = (x & 0x33333333) + ((x >> 2) & 0x33333333)
x = (x + (x >> 4)) & 0x0f0f0f0f
x += x >> 8
x += x >> 16
return x & 0x3f
def update(a, x):
i = (1<<NN) - 1 + a
X[i] = x
while True:
i = (i-1) // 2
... | NN = 19
X = [0] * ((1<<NN+1)-1)
def popcount(x):
x -= (x >> 1) & 0x55555555
x = (x & 0x33333333) + ((x >> 2) & 0x33333333)
x = (x + (x >> 4)) & 0x0f0f0f0f
x += x >> 8
x += x >> 16
return x & 0x3f
def update(a, x):
i = (1<<NN) - 1 + a
X[i] = x
while True:
i = (i-1) // 2
... | [
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 554,750 | 554,751 | u864197622 | python |
p02763 | n=int(input())+1
data=[0]*n*2
def update(i,x):
i+=n
data[i]=x
i//=2
while i:
data[i]=data[i*2]|data[i*2+1]
i//=2
def query(l,r):
l+=n
r+=n
s=0
while l<r:
if l&1:
s|=data[l]
l+=1
if r&1:
r-=1
s|=data[r]
... | n=int(input())+1
data=[0]*n*2
def update(i,x):
i+=n
data[i]=x
i//=2
while i:
data[i]=data[i*2]|data[i*2+1]
i//=2
def query(l,r):
l+=n
r+=n
s=0
while l<r:
if l&1:
s|=data[l]
l+=1
if r&1:
r-=1
s|=data[r]
... | [] | 554,752 | 554,753 | u350248178 | python |
p02763 | class SegTree:
def __init__(self, N, S):
self.N = 2 ** ((N-1).bit_length())
self.tree = [0 for i in range(self.N * 2 - 1)]
for i in range(len(S)):
self.tree[self.N - 1 + i] = 1 << (ord(S[i] - ord("a")))
for i in range(self.N - 2, -1, -1):
self.tree[i] = self.... | class SegTree:
def __init__(self, N, S):
self.N = 2 ** ((N-1).bit_length())
self.tree = [0 for i in range(self.N * 2 - 1)]
for i in range(len(S)):
self.tree[self.N - 1 + i] = 1 << (ord(S[i]) - ord("a"))
for i in range(self.N - 2, -1, -1):
self.tree[i] = self.... | [
"call.arguments.change"
] | 554,772 | 554,773 | u230117534 | python |
p02763 | import sys
input = lambda: sys.stdin.readline().rstrip()
def resolve():
class BinaryIndexedTree():
def __init__(self, n):
self.n = n
self.bit = [0]*(n+1)
def add(self, item, pos):
index = pos
while index < self.n+1:
self.bit[index] ... | import sys
input = lambda: sys.stdin.readline().rstrip()
def resolve():
class BinaryIndexedTree():
def __init__(self, n):
self.n = n
self.bit = [0]*(n+1)
def add(self, item, pos):
index = pos
while index < self.n+1:
self.bit[index] ... | [
"expression.operation.binary.remove"
] | 554,843 | 554,844 | u648881683 | python |
p02763 | class BinaryIndexTree: # 1-indexed
def __init__(self, n):
self.size = n
self.tree = [0] * (n + 1)
def sum(self, i):
s = 0
while i > 0:
s += self.tree[i]
i -= i & -i
return s
def add(self, i, x):
while i <= self.size:
self... | class BinaryIndexTree: # 1-indexed
def __init__(self, n):
self.size = n
self.tree = [0] * (n + 1)
def sum(self, i):
s = 0
while i > 0:
s += self.tree[i]
i -= i & -i
return s
def add(self, i, x):
while i <= self.size:
self... | [
"assignment.add"
] | 554,849 | 554,850 | u994988729 | python |
p02763 | n, s, q = int(input()), input(), int(input())
class SegmentTree:
def __init__(self, n, func=lambda x, y: min(x, y), ide=float("inf")):
self.n = 2 ** (n-1).bit_length()
self.data = [ide] * (self.n*2)
self.func, self.ide = func, ide
def build(self, data):
for i, x in enumerat... | n, s, q = int(input()), input(), int(input())
class SegmentTree:
def __init__(self, n, func=lambda x, y: min(x, y), ide=float("inf")):
self.n = 2 ** (n-1).bit_length()
self.data = [ide] * (self.n*2)
self.func, self.ide = func, ide
def build(self, data):
for i, x in enumerat... | [
"assignment.change"
] | 554,878 | 554,879 | u193182854 | python |
p02763 | """SegTree, bitで集合を管理する
Returns:
[type]: [description]
"""
import sys
sys.setrecursionlimit(4100000)
import math
import logging
logging.basicConfig(level=logging.DEBUG)
logger = logging.getLogger(__name__)
from operator import or_
class SegTree:
"""ノードで集合をもつ
"""
def __init__(self, N, segfunc, id... | """SegTree, bitで集合を管理する
Returns:
[type]: [description]
"""
import sys
sys.setrecursionlimit(4100000)
import math
import logging
logging.basicConfig(level=logging.DEBUG)
logger = logging.getLogger(__name__)
from operator import or_
class SegTree:
"""ノードで集合をもつ
"""
def __init__(self, N, segfunc, id... | [
"control_flow.branch.if.condition.change"
] | 554,908 | 554,909 | u359619351 | python |
p02763 |
class SegmentTree:
def __init__(self, base_array,n , default_value = 0, segfunc = lambda a, b: a + b): #元配列、大きさ、デフォルト値
self._num = 2 ** (n - 1).bit_length()
self._seg = [default_value] * 2 * self._num
self._segfunc = segfunc
self._ide_ele = default_value
for i in range(n):
... |
class SegmentTree:
def __init__(self, base_array,n , default_value = 0, segfunc = lambda a, b: a + b): #元配列、大きさ、デフォルト値
self._num = 2 ** (n - 1).bit_length()
self._seg = [default_value] * 2 * self._num
self._segfunc = segfunc
self._ide_ele = default_value
for i in range(n):
... | [
"call.remove"
] | 554,938 | 554,939 | u652583512 | python |
p02763 | # -*- coding: utf-8 -*-
import sys
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a... | # -*- coding: utf-8 -*-
import sys
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a... | [
"assignment.add"
] | 555,045 | 555,046 | u588341295 | python |
p02763 | import sys
sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(ro... | import sys
sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(ro... | [
"expression.operation.binary.add"
] | 555,053 | 555,054 | u353797797 | python |
p02763 | import sys
sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(ro... | import sys
sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(ro... | [
"assignment.value.change",
"identifier.change"
] | 555,055 | 555,056 | u353797797 | python |
p02763 | import sys
sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(ro... | import sys
sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(ro... | [
"assignment.value.change",
"identifier.change"
] | 555,057 | 555,056 | u353797797 | python |
p02763 | import sys
from collections import *
import heapq
import math
import bisect
from itertools import permutations,accumulate,combinations,product
from math import gcd
import copy
def input():
return sys.stdin.readline()[:-1]
def ruiseki(lst):
return [0]+list(accumulate(lst))
mod=pow(10,9)+7
n=int(input())
s=input... | import sys
from collections import *
import heapq
import math
import bisect
from itertools import permutations,accumulate,combinations,product
from math import gcd
import copy
def input():
return sys.stdin.readline()[:-1]
def ruiseki(lst):
return [0]+list(accumulate(lst))
mod=pow(10,9)+7
n=int(input())
s=input... | [
"call.remove"
] | 555,068 | 555,069 | u654470292 | python |
p02763 | class SegTree:
""" segment tree with point modification and range product. """
# # https://yukicoder.me/submissions/452850
def __init__(self, N, data_f = min, data_unit=1<<30):
self.N = N
self.data_f = data_f
self.data_unit = data_unit
self.data = [self.data_unit] * (N + N)
... | class SegTree:
""" segment tree with point modification and range product. """
# # https://yukicoder.me/submissions/452850
def __init__(self, N, data_f = min, data_unit=1<<30):
self.N = N
self.data_f = data_f
self.data_unit = data_unit
self.data = [self.data_unit] * (N + N)
... | [
"assignment.add"
] | 555,176 | 555,177 | u401686269 | python |
p02763 | import bisect
from collections import defaultdict
N = int(input())
S = input()
Q = int(input())
dict = defaultdict(list)
for i in range(N):
dict[S[i]].append(i)
# print(dict)
ans = []
for _ in range(Q):
a, b, c = input().split()
a = int(a)
if a == 1:
b = int(b) - 1
if S[b] == c:
... | import bisect
from collections import defaultdict
N = int(input())
# 書き換える時に文字列だと不便なのでリスト化しておく
S = list(input())
Q = int(input())
dict = defaultdict(list)
for i in range(N):
dict[S[i]].append(i)
# print(dict)
ans = []
for _ in range(Q):
a, b, c = input().split()
a = int(a)
if a == 1:
b = in... | [
"call.add",
"call.arguments.change",
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 555,190 | 555,191 | u285681431 | python |
p02763 | import bisect
from collections import defaultdict
N = int(input())
S = input()
Q = int(input())
dict = defaultdict(list)
for i in range(N):
dict[S[i]].append(i)
# print(dict)
ans = []
for _ in range(Q):
a, b, c = input().split()
a = int(a)
if a == 1:
b = int(b) - 1
if S[b] == c:
... | import bisect
from collections import defaultdict
N = int(input())
S = list(input())
Q = int(input())
dict = defaultdict(list)
for i in range(N):
dict[S[i]].append(i)
# print(dict)
ans = []
for _ in range(Q):
a, b, c = input().split()
a = int(a)
if a == 1:
b = int(b) - 1
if S[b] == c... | [
"call.add",
"call.arguments.change",
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 555,192 | 555,193 | u285681431 | python |
p02763 | #A1 ~ Aiまでの和 O(logN)
def BIT_query(BIT,idx):
res_sum = 0
while idx > 0:
res_sum += BIT[idx]
idx -= idx&(-idx)
return res_sum
#Ai += x O(logN)
def BIT_update(BIT,idx,x):
while idx <= n:
BIT[idx] += x
idx += idx&(-idx)
return
alps = 'abcdefghijklmnopqrstuvwxyz'
n = ... | #A1 ~ Aiまでの和 O(logN)
def BIT_query(BIT,idx):
res_sum = 0
while idx > 0:
res_sum += BIT[idx]
idx -= idx&(-idx)
return res_sum
#Ai += x O(logN)
def BIT_update(BIT,idx,x):
while idx <= n:
BIT[idx] += x
idx += idx&(-idx)
return
alps = 'abcdefghijklmnopqrstuvwxyz'
n = ... | [
"call.add",
"call.arguments.change"
] | 555,198 | 555,199 | u493520238 | python |
p02763 | N = int(input())
S = input()
Q = int(input())
QUERY = [input().split() for _ in range(Q)]
def or_more_pow_two(n):
if (n & (n-1)) == 0:
return n
return 1<<(len(bin(n))-2)
class SegmentTree:
def __init__(self, n, l):
self.n = or_more_pow_two(n)*2
self.tree = [0]*self.n
for i,... | N = int(input())
S = input()
Q = int(input())
QUERY = [input().split() for _ in range(Q)]
# N = 4
# S = "abcd"
# QUERY = [s.split() for s in [
# "2 1 4", # 4
# "2 1 3", # 3
# "2 3 4", # 2
# "2 4 4", # 1
# "1 2 a", # aacd
# "2 1 2", # 1
# "2 1 3", # 2
# ]]
# Q = len(QUERY)
def or_more_pow_tw... | [
"assignment.change"
] | 555,204 | 555,205 | u599547273 | python |
p02763 | from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, floor
fro... | from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, floor
fro... | [
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 555,211 | 555,212 | u499381410 | python |
p02763 | from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, floor
fro... | from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, floor
fro... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"literal.number.integer.change"
] | 555,213 | 555,212 | u499381410 | python |
p02763 | from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, floor
fro... | from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, floor
fro... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"literal.number.integer.change"
] | 555,214 | 555,212 | u499381410 | python |
p02763 | import bisect # 配列二分法
from collections import defaultdict
N = int(input())
S = [*input()]
Q = int(input())
d = defaultdict(list)
# 各アルファベットの出現場所を記録
for i, c in enumerate(S):
d[c] += [i]
# この時点でどのアルファベットについてもソート済み
# print(d)
for _ in range(Q):
q, y, z = input().split()
if q == '1':
i = int(y) -... | import bisect # 配列二分法
from collections import defaultdict
N = int(input())
S = [*input()]
Q = int(input())
d = defaultdict(list)
# 各アルファベットの出現場所を記録
for i, c in enumerate(S):
d[c] += [i]
# この時点でどのアルファベットについてもソート済み
# print(d)
for _ in range(Q):
q, y, z = input().split()
if q == '1':
i = int(y) -... | [
"expression.operation.binary.remove"
] | 555,219 | 555,220 | u726285999 | python |
p02763 | #!usr/bin/env python3
from collections import defaultdict, deque, Counter, OrderedDict
from bisect import bisect_left, bisect_right
from functools import reduce, lru_cache
from heapq import heappush, heappop, heapify
import itertools, bisect
import math, fractions
import sys, copy
def L(): return sys.stdin.readline()... | #!usr/bin/env python3
from collections import defaultdict, deque, Counter, OrderedDict
from bisect import bisect_left, bisect_right
from functools import reduce, lru_cache
from heapq import heappush, heappop, heapify
import itertools, bisect
import math, fractions
import sys, copy
def L(): return sys.stdin.readline()... | [
"assignment.add"
] | 555,241 | 555,242 | u481187938 | python |
p02763 | import sys
# input = sys.stdin.buffer.readline
def getN():
return int(input())
def getNM():
return map(int, input().split())
def getlist():
return list(map(int, input().split()))
import math
import heapq
import bisect
from collections import defaultdict, Counter, deque
MOD = 10**9 + 7
INF = 10**21
class S... | import sys
# input = sys.stdin.buffer.readline
def getN():
return int(input())
def getNM():
return map(int, input().split())
def getlist():
return list(map(int, input().split()))
import math
import heapq
import bisect
from collections import defaultdict, Counter, deque
MOD = 10**9 + 7
INF = 10**21
class S... | [] | 555,268 | 555,269 | u827202523 | python |
p02763 | import sys
#input = sys.stdin.buffer.readline
#sys.setrecursionlimit(10**9)
#from functools import lru_cache
def RD(): return sys.stdin.read()
def II(): return int(input())
def MI(): return map(int,input().split())
def MF(): return map(float,input().split())
def LI(): return list(map(int,input().split()))
d... | import sys
#input = sys.stdin.buffer.readline
#sys.setrecursionlimit(10**9)
#from functools import lru_cache
def RD(): return sys.stdin.read()
def II(): return int(input())
def MI(): return map(int,input().split())
def MF(): return map(float,input().split())
def LI(): return list(map(int,input().split()))
d... | [
"call.arguments.change",
"expression.operation.unary.add"
] | 555,287 | 555,288 | u477977638 | python |
p02763 | N=int(input())
S=input()
slst=[s for s in S]
Q=int(input())
class Bit:
def __init__(self, n):
self.size = n
self.tree = [0] * (n + 1)
def sum(self, i):
s = 0
while i > 0:
s += self.tree[i]
i -= i & -i
return s
def add(self, i, x):
... | N=int(input())
S=input()
slst=[s for s in S]
Q=int(input())
class Bit:
def __init__(self, n):
self.size = n
self.tree = [0] * (n + 1)
def sum(self, i):
s = 0
while i > 0:
s += self.tree[i]
i -= i & -i
return s
def add(self, i, x):
... | [
"assignment.add"
] | 555,295 | 555,296 | u860829879 | python |
p02763 | from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
import itertools
from functools import *
from itertools import permutations,combinations,groupby
import sys
import bisect
import string
import math
import time
import random
def Golf():
*a,=map(int,open(0))
def S_():
re... | from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
import itertools
from functools import *
from itertools import permutations,combinations,groupby
import sys
import bisect
import string
import math
import time
import random
def Golf():
*a,=map(int,open(0))
def S_():
re... | [
"assignment.add"
] | 555,331 | 555,332 | u623819879 | python |
p02765 | K,R = map (int, input ().split ())
if K < 10:
print (R-100*(10-K))
else:
print (R) | K,R = map (int, input ().split ())
if K < 10:
print (R+100*(10-K))
else:
print (R) | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 555,382 | 555,383 | u316603606 | python |
p02765 | N, K = map(int, input())
a = 0
if N < 10:
a = 100*(10-N) + K
print(a)
elif N >= 10:
print(K)
| N, K = map(int, input().split())
a = 0
if N < 10:
a = 100*(10-N) + K
print(a)
elif N >= 10:
print(K)
| [
"call.add"
] | 555,387 | 555,388 | u337573893 | python |
p02765 | N, R = map(int, input().split())
print(R-max(0, 10-N)*100) | N, R = map(int, input().split())
print(R+max(0, 10-N)*100)
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 555,391 | 555,392 | u874320250 | python |
p02765 | N, R = map(int, input().split())
print(R if N>=10 else R-100*(10-N))
| N, R = map(int, input().split())
print(R if N>=10 else R+100*(10-N))
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 555,395 | 555,396 | u539367121 | python |
p02765 | N, R = map(int, input().split())
print(R if N>=10 else R-100*(10-K)) | N, R = map(int, input().split())
print(R if N>=10 else R+100*(10-N))
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change",
"identifier.change"
] | 555,397 | 555,396 | u539367121 | python |
p02765 | N,R = map(int,input().split())
if N <= 10:
print(100*(10-N)+R)
else:
print(B) | N,R = map(int,input().split())
if N <= 10:
print(100*(10-N)+R)
else:
print(R) | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 555,398 | 555,399 | u848535504 | python |
p02765 | n,r = input().split()
n = int(n)
r = int(r)
if n >= 10:
i = r
else:
i = r + 100 * (10 - n) | n,r = input().split()
n = int(n)
r = int(r)
if n >= 10:
i = r
else:
i = r + 100 * (10 - n)
print(i) | [
"call.add"
] | 555,406 | 555,407 | u774827549 | python |
p02765 | n,r = int(input().split())
n = int(n)
r = int(r)
if n >= 10:
i = r
else:
i = r + 100 * (10 - n)
print(i) | n,r = input().split()
n = int(n)
r = int(r)
if n >= 10:
i = r
else:
i = r + 100 * (10 - n)
print(i) | [
"call.remove",
"call.arguments.change"
] | 555,408 | 555,407 | u774827549 | python |
p02765 | N, R = map(int, input().split())
if N < 10:
ans = R + 100 * (10 - N)
else:
ans = N
print(ans)
| N, R = map(int, input().split())
if N < 10:
ans = R + 100 * (10 - N)
else:
ans = R
print(ans)
| [
"assignment.value.change",
"identifier.change"
] | 555,411 | 555,412 | u344888046 | python |
p02765 | a,b = map(int,input().split())
if a >= 10:
print(str(b))
else:
print(str(b-100*(10-a))) | a,b = map(int,input().split())
if a >= 10:
print(str(b))
else:
print(str(b+100*(10-a))) | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 555,417 | 555,418 | u763628696 | python |
p02765 | a,b = map(int,input().split())
if a >= 10:
print(str(b))
else:
print(str(100*(10-a))) | a,b = map(int,input().split())
if a >= 10:
print(str(b))
else:
print(str(b+100*(10-a))) | [
"expression.operation.binary.add"
] | 555,419 | 555,418 | u763628696 | python |
p02765 | n,r=map(int,input().split())
rate=r if n>=10 else 100*(10-r)
print(r) | n,r=map(int,input().split())
rate= r if n>=10 else r+100*(10-n)
print(rate) | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change",
"call.arguments.change",
"io.output.change"
] | 555,420 | 555,421 | u731362892 | python |
p02765 | n, r = map(int, input().split())
print(r if n >= 10 else r - (100 * (10 - n))) | n, r = map(int, input().split())
print(r if n >= 10 else r + (100 * (10 - n)))
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 555,427 | 555,428 | u392361133 | python |
p02765 |
def main():
n, r = map(int, input().split())
if n >= 10:
print(r)
else:
print(r - (100 * (10 - n)))
if __name__ == "__main__":
main()
|
def main():
n, r = map(int, input().split())
if n >= 10:
print(r)
else:
print(r + (100 * (10 - n)))
if __name__ == "__main__":
main()
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 555,448 | 555,449 | u274615057 | python |
p02765 |
def main():
n, r = map(int, input().split())
if n >= 10:
print(r)
else:
print(100 * (10 - n))
if __name__ == "__main__":
main()
|
def main():
n, r = map(int, input().split())
if n >= 10:
print(r)
else:
print(r + (100 * (10 - n)))
if __name__ == "__main__":
main()
| [
"call.arguments.add",
"call.arguments.change"
] | 555,450 | 555,449 | u274615057 | python |
p02765 |
def main():
n, r = map(int, input().split())
if n >= 10:
print(r)
else:
print(100 * (10 - k))
if __name__ == "__main__":
main()
|
def main():
n, r = map(int, input().split())
if n >= 10:
print(r)
else:
print(r + (100 * (10 - n)))
if __name__ == "__main__":
main()
| [
"call.arguments.add",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 555,451 | 555,449 | u274615057 | python |
p02765 | N, R = map(int, input().split())
print(R - 100 * max(0, 10-N)) | N, R = map(int, input().split())
print(R + 100 * max(0, 10-N)) | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 555,515 | 555,516 | u871841829 | python |
p02765 | a, b = list(map(int, input().split()))
if a >= 10:
my_result = b
else:
my_result = b - 100 * (10 - a)
print(my_result) | a, b = list(map(int, input().split()))
if a >= 10:
my_result = b
else:
my_result = b + 100 * (10 - a)
print(my_result) | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 555,517 | 555,518 | u174536291 | python |
p02765 | a,b=list(map(int,input().split()))
if a<0:
print(100*(10-a)+b)
else:
print(b)
| a,b=list(map(int,input().split()))
if a<10:
print(100*(10-a)+b)
else:
print(b) | [
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 555,519 | 555,520 | u754511616 | python |
p02765 | n, r = map(int, input().split())
print(r + 100*(10 - n)) | n, r = map(int, input().split())
print(r + max(0, 100*(10 - n))) | [
"call.add",
"call.arguments.change"
] | 555,527 | 555,529 | u347600233 | python |
p02765 | tmp = input().split(" ")
N = int(tmp[0])
R = int(tmp[1])
if N >= 10:
print(R)
else:
ans = R + 100 * (100 - N)
print(int(ans)) | tmp = input().split(" ")
N = int(tmp[0])
R = int(tmp[1])
if N >= 10:
print(R)
else:
ans = R + 100 * (10 - N)
print(int(ans)) | [
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 555,530 | 555,531 | u739843002 | python |
p02765 | N, R = map(int, input().split())
print(R if N>=10 else R-100*(10-N)) | N, R = map(int, input().split())
print(R if N>=10 else R+100*(10-N)) | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 555,545 | 555,546 | u612635771 | python |
p02765 | N,R = map(int,input().split())
if N < 10:
R = R - 100 * (10 - N)
print(R)
else:
print(R) | N,R = map(int,input().split())
if N < 10:
R = R + 100 * (10 - N)
print(R)
else:
print(R) | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 555,558 | 555,559 | u342062419 | python |
p02765 | N,R = map(int,input().split)
if N < 10:
R = R - 100 * (10 - N)
print(R)
else:
print(R) | N,R = map(int,input().split())
if N < 10:
R = R + 100 * (10 - N)
print(R)
else:
print(R) | [
"call.add",
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 555,560 | 555,559 | u342062419 | python |
p02765 | N,R = map(int,input().split())
if N < 10:
R = 100 * (10 - N)
print(R)
else:
print(R) | N,R = map(int,input().split())
if N < 10:
R = R + 100 * (10 - N)
print(R)
else:
print(R) | [
"assignment.change"
] | 555,561 | 555,559 | u342062419 | python |
p02765 | N,R = map(int,input().split)
if N < 10:
R = 100 * (10 - N)
print(R)
else:
print(R) | N,R = map(int,input().split())
if N < 10:
R = R + 100 * (10 - N)
print(R)
else:
print(R) | [
"call.add"
] | 555,562 | 555,559 | u342062419 | python |
p02765 | N,R = map(int,input())
if N < 10:
R = 100 * (10 - N)
print(R)
else:
print(R) | N,R = map(int,input().split())
if N < 10:
R = R + 100 * (10 - N)
print(R)
else:
print(R) | [
"call.add"
] | 555,563 | 555,559 | u342062419 | python |
p02765 | a,b=map(int,input().split())
c=0
res = 0
if a >=10:
print(b)
else:
c = 100 * (10-a)
res = b-c
print(res) | a,b=map(int,input().split())
c=0
res = 0
if a >=10:
print(b)
else:
c = 100 * (10-a)
res = b+c
print(res) | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 555,567 | 555,568 | u113255362 | python |
p02765 | def main():
n, r = map(int,input().split())
if n >= 10:
print(r)
else:
print(r + 100* (10 - r))
main() | def main():
n, r = map(int,input().split())
if n >= 10:
print(r)
else:
print(r + 100* (10 - n))
main() | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 555,574 | 555,575 | u962609087 | python |
p02765 | def main():
n, r = map(int,input().split())
if n >= 10:
print(r)
else:
print(r + 100* (10 - k))
main() | def main():
n, r = map(int,input().split())
if n >= 10:
print(r)
else:
print(r + 100* (10 - n))
main() | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 555,577 | 555,575 | u962609087 | python |
p02763 | from collections import defaultdict,deque
import sys,heapq,bisect,math,itertools,string,queue,copy,time
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpl_str(): return list(sys.s... | from collections import defaultdict,deque
import sys,heapq,bisect,math,itertools,string,queue,copy,time
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpl_str(): return list(sys.s... | [
"assignment.change"
] | 555,670 | 555,671 | u333945892 | python |
p02765 | n,r = map(int,input().split())
print(r+100*(10-n)) | n,r = map(int,input().split())
print(r+100*(10-n) if n<10 else r) | [] | 555,699 | 555,700 | u107915058 | python |
p02765 | n, r = map(int, input().split())
if n < 10:
print((r + 100*(10-r)))
else:
print(n) | n, r = map(int, input().split())
if n < 10:
print((r + 100*(10-n)))
else:
print(r) | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 555,701 | 555,702 | u441902623 | python |
p02765 | N, R = input().split()
N = int(N)
R = int(R)
if N>=10 :
x = R
else:
x = R - 100*(10-N)
print(x) | N, R = input().split()
N = int(N)
R = int(R)
if N>=10 :
x = R
else:
x = R + 100*(10-N)
print(x) | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 555,711 | 555,712 | u509516894 | python |
p02765 | n,r = map(int,input().split())
if(n <=10):
print(r-100*(10-n))
else:
print(r) | n,r = map(int,input().split())
if(n <=10):
print(r-100*(n-10))
else:
print(r)
| [
"expression.operation.binary.remove"
] | 555,715 | 555,716 | u696684809 | python |
p02765 | n,r=map(int,input().split())
print(r) if n>=10 else print(r-100*(10-n)) | n,r=map(int,input().split())
print(r) if n>=10 else print(r+100*(10-n))
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 555,728 | 555,729 | u555356625 | python |
p02765 | N, R = map(int, input().split())
if N >= 10: print(R)
else: print(R - 100*(10-N)) | N, R = map(int, input().split())
if N >= 10: print(R)
else: print(R + 100*(10-N)) | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 555,753 | 555,754 | u309120194 | python |
p02765 | N, R = map(int, input().split())
if N >= 10: print(K)
else: print(100*(10-K)) | N, R = map(int, input().split())
if N >= 10: print(R)
else: print(R + 100*(10-N)) | [
"identifier.change",
"call.arguments.change",
"io.output.change",
"expression.operation.binary.change"
] | 555,755 | 555,754 | u309120194 | python |
p02765 | n, r = map(int, input().split())
print(r if n >= 10 else r - 100 * (10 - n)) | n, r = map(int, input().split())
print(r if n >= 10 else r + 100 * (10 - n)) | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 555,781 | 555,782 | u978167553 | python |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.