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 |
|---|---|---|---|---|---|---|---|
p02761 | N,M = map(int,input().rstrip().split(" "))
ans = 0
n = [-1 for i in range(N)]
for i in range(M):
s,c = map(int,input().rstrip().split(" "))
s -= 1
if n[s] == -1 or n[s] == c:
n[s] = c
else:
ans = -1
if N != 1 and n[0] == 0:
ans = -1
if ans == -1:
print(-1)
if N == 0 and M == 0:
print(0)
else:
f... | N,M = map(int,input().rstrip().split(" "))
ans = 0
n = [-1 for i in range(N)]
for i in range(M):
s,c = map(int,input().rstrip().split(" "))
s -= 1
if n[s] == -1 or n[s] == c:
n[s] = c
else:
ans = -1
if N != 1 and n[0] == 0:
ans = -1
if ans == -1:
print(-1)
elif N == 1 and M == 0:
print(0)
else:
... | [
"control_flow.branch.if.replace.remove",
"control_flow.branch.else_if.replace.add",
"literal.number.integer.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"expression.operation.binary.remove"
] | 553,281 | 553,280 | u017050982 | python |
p02761 | def main():
N,M = map(int,input().split())
ansl = [-1]*N
isok = True
for i in range(M):
s,c = map(int, input().split())
if ansl[s-1]<0 : ansl[s-1]=c
elif ansl[s-1]!=c : isok = False
if ansl[0] == 0: isok = False
if ansl[0] == -1: ansl[0] = 1
for i in range(1,N):
... | def main():
N,M = map(int,input().split())
ansl = [-1]*N
isok = True
for i in range(M):
s,c = map(int, input().split())
if ansl[s-1]<0 : ansl[s-1]=c
elif ansl[s-1]!=c : isok = False
if N>1:
if ansl[0] == 0: isok = False
if ansl[0] == -1: ansl[0] = 1
... | [
"control_flow.branch.if.add",
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.lower.change"
] | 553,326 | 553,327 | u021022333 | python |
p02761 | n, m = map(int, input().split())
sc = [list(map(int, input().split())) for _ in range(m)]
ans = [-1] * n
if n == 1:
if m == 0:
print(0)
exit()
for i in range(m):
s = sc[i][0]
c = sc[i][1]
if ans[s-1] != -1 and ans[s-1] != c:
print(-1)
exit()
... | n, m = map(int, input().split())
sc = [list(map(int, input().split())) for _ in range(m)]
ans = [-1] * n
if n == 1:
if m == 0:
print(0)
exit()
for i in range(m):
s = sc[i][0]
c = sc[i][1]
if ans[s-1] != -1 and ans[s-1] != c:
print(-1)
exit()
... | [
"call.arguments.change"
] | 553,359 | 553,360 | u690781906 | python |
p02761 | N, M = [int(i) for i in input().split(" ")]
conds = []
for _ in range(M):
conds.append([int(i) for i in input().split(" ")])
exists = True
A = [None for _ in range(N)]
for s, c in conds:
idx = s-1
if A[idx] != None and A[idx] != c:
exists = False
break
A[idx] = c
def check():
if n... | N, M = [int(i) for i in input().split(" ")]
conds = []
for _ in range(M):
conds.append([int(i) for i in input().split(" ")])
exists = True
A = [None for _ in range(N)]
for s, c in conds:
idx = s-1
if A[idx] != None and A[idx] != c:
exists = False
break
A[idx] = c
def check():
if n... | [
"call.arguments.change"
] | 553,396 | 553,397 | u654127147 | python |
p02761 | import functools
n, m = map(int, input().split())
ls = [list(map(int, input().split())) for _ in range(m)]
ans = [-1] * n
flag = 0
for i in range(m):
keta = ls[i][0] - 1
if ls[i] == [1, 0] and n != 1:
flag = 1
break
else:
if ans[keta] == -1:
ans[keta] = ls[i][1]
... | import functools
n, m = map(int, input().split())
ls = [list(map(int, input().split())) for _ in range(m)]
ans = [-1] * n
flag = 0
for i in range(m):
keta = ls[i][0] - 1
if ls[i] == [1, 0] and n != 1:
flag = 1
break
else:
if ans[keta] == -1:
ans[keta] = ls[i][1]
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 553,408 | 553,409 | u386089355 | python |
p02761 | # coding: utf-8
N,M=map(int,input().split())
ansl=[None for i in range(N)]
flg=True
for i in range(M):
s,c=map(int,input().split())
if ansl[s-1]==None:
ansl[s-1]=str(c)
else:
if ansl[s-1]!=str(c):
flg=False
for i in range(N):
if ansl[i]==None:
if i==0:
a... | # coding: utf-8
N,M=map(int,input().split())
ansl=[None for i in range(N)]
flg=True
for i in range(M):
s,c=map(int,input().split())
if ansl[s-1]==None:
ansl[s-1]=str(c)
else:
if ansl[s-1]!=str(c):
flg=False
for i in range(N):
if ansl[i]==None:
if i==0 and N!=1:
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 553,426 | 553,427 | u095426154 | python |
p02761 | # coding: utf-8
N,M=map(int,input().split())
ansl=[None for i in range(N)]
flg=True
for i in range(M):
s,c=map(int,input().split())
if ansl[s-1]==None:
ansl[s-1]=str(c)
else:
if ansl[s-1]!=str(c):
flg=False
for i in range(N):
if ansl[i]==None:
if i==0:
a... | # coding: utf-8
N,M=map(int,input().split())
ansl=[None for i in range(N)]
flg=True
for i in range(M):
s,c=map(int,input().split())
if ansl[s-1]==None:
ansl[s-1]=str(c)
else:
if ansl[s-1]!=str(c):
flg=False
for i in range(N):
if ansl[i]==None:
if i==0 and N!=1:
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"literal.number.integer.change"
] | 553,428 | 553,427 | u095426154 | python |
p02761 | N, M = map(int, input().split())
A = [{i for i in range(0, 10)} for _ in range(N)]
A[0].discard(0)
T = True
for _ in range(M):
s, c = map(int, input().split())
A[s-1] = A[s-1] & set([c])
if len(A[s-1]) == 0:
T = False
if T:
X = ''
for i in range(N):
X += str(min(A[i]))
print(X)
e... | N, M = map(int, input().split())
A = [{i for i in range(0, 10)} for _ in range(N)]
if N > 1:
A[0].discard(0)
T = True
for _ in range(M):
s, c = map(int, input().split())
A[s-1] = A[s-1] & set([c])
if len(A[s-1]) == 0:
T = False
if T:
X = ''
for i in range(N):
X += str(min(A[i]))
... | [
"control_flow.branch.if.add"
] | 553,442 | 553,443 | u761720628 | python |
p02761 | def get_ints():
return list(map(int, input().split()))
n, m = get_ints()
digits = [-1 for i in range(n)]
for i in range(m):
s, c = get_ints()
s -= 1
if digits[s] >= 0 and digits[s] != c:
print(-1)
exit(0)
digits[s] = c
if digits[0] == 0:
if n == 1:
print(0)
else:
... | def get_ints():
return list(map(int, input().split()))
n, m = get_ints()
digits = [-1 for i in range(n)]
for i in range(m):
s, c = get_ints()
s -= 1
if digits[s] >= 0 and digits[s] != c:
print(-1)
exit(0)
digits[s] = c
if digits[0] == 0:
if n == 1:
print(0)
else:
... | [
"control_flow.branch.if.condition.change"
] | 553,470 | 553,471 | u390181802 | python |
p02761 | N,M = map(int, input().split())
d = ['x']*N
flg = 0
for i in range(M):
s,c = map(int, input().split())
s -= 1
if d[s] == 'x':
d[s] = c
if d[s] != c or (s==0 and c==0 and N>1):
flg = -1
ans = 0
for j in range(N):
N-=1
if d[j]=='x':
if j == 0 and N>1:
d[j] = 1
else:
d[j] = 0
an... | N,M = map(int, input().split())
d = ['x']*N
flg = 0
for i in range(M):
s,c = map(int, input().split())
s -= 1
if d[s] == 'x':
d[s] = c
if d[s] != c or (s==0 and c==0 and N>1):
flg = -1
ans = 0
for j in range(N):
N-=1
if d[j]=='x':
if j == 0 and N>0:
d[j] = 1
else:
d[j] = 0
an... | [
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 553,484 | 553,485 | u781758937 | python |
p02761 | N,M = map(int, input().split())
d = ['x']*N
flg = 0
for i in range(M):
s,c = map(int, input().split())
s -= 1
if d[s] == 'x':
d[s] = c
if d[s] != c or (s==0 and c==0 and N>1):
flg = -1
ans = 0
for j in range(N):
N-=1
if d[j]=='x':
if j == 0:
d[j] = 1
else:
d[j] = 0
ans += d[j... | N,M = map(int, input().split())
d = ['x']*N
flg = 0
for i in range(M):
s,c = map(int, input().split())
s -= 1
if d[s] == 'x':
d[s] = c
if d[s] != c or (s==0 and c==0 and N>1):
flg = -1
ans = 0
for j in range(N):
N-=1
if d[j]=='x':
if j == 0 and N>0:
d[j] = 1
else:
d[j] = 0
an... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 553,486 | 553,485 | u781758937 | python |
p02761 | N, M = map(int,input().split())
s = [0]*M
c = [0]*M
for i in range(M):
s[i], c[i] = map(int,input().split())
ans = [0]*N
if N != 1:
ans[0] = 1
error = 0
assign = [0]*M
for i in range(M):
assign[s[i]- 1] += 1
if assign[s[i] - 1] > 1 and ans[s[i] - 1] != c[i]:
error += 1
ans[s[i] - 1] = c... | N, M = map(int,input().split())
s = [0]*M
c = [0]*M
for i in range(M):
s[i], c[i] = map(int,input().split())
ans = [0]*N
if N != 1:
ans[0] = 1
error = 0
assign = [0]*N
for i in range(M):
assign[s[i]- 1] += 1
if assign[s[i] - 1] > 1 and ans[s[i] - 1] != c[i]:
error += 1
ans[s[i] - 1] = c... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 553,489 | 553,490 | u539969758 | python |
p02761 | N,M = map(int,input().split())
sc = []
for _ in range(M):
x = list(map(int,input().split()))
sc.append(x)
if N == 3:
ll = 1000
ls = 100
elif N == 2:
ll = 100
ls = 10
elif N == 1:
ll = 10
ls = 1
ans = -1
for i in range(ls,ll):
x = str(i)
check = 1
for j in sc:
s = j[0]... | N,M = map(int,input().split())
sc = []
for _ in range(M):
x = list(map(int,input().split()))
sc.append(x)
if N == 3:
ll = 1000
ls = 100
elif N == 2:
ll = 100
ls = 10
elif N == 1:
ll = 10
ls = 0
ans = -1
for i in range(ls,ll):
x = str(i)
check = 1
for j in sc:
s = j[0]... | [
"literal.number.integer.change",
"assignment.value.change"
] | 553,493 | 553,494 | u183896397 | python |
p02761 | N,M = map(int,input().split())
sc = []
for _ in range(M):
x = list(map(int,input().split()))
sc.append(x)
if N == 3:
ll = 1000
ls = 100
elif N == 2:
ll = 100
ls = 10
elif N == 1:
ll = 10
ls = 1
ans = -1
for i in range(ls,ll):
x = str(i)
check = 1
for j in sc:
s = j[0]... | N,M = map(int,input().split())
sc = []
for _ in range(M):
x = list(map(int,input().split()))
sc.append(x)
if N == 3:
ll = 1000
ls = 100
elif N == 2:
ll = 100
ls = 10
elif N == 1:
ll = 10
ls = 0
ans = -1
for i in range(ls,ll):
x = str(i)
check = 1
for j in sc:
s = j[0]... | [
"literal.number.integer.change",
"assignment.value.change",
"control_flow.break.remove"
] | 553,495 | 553,494 | u183896397 | python |
p02761 |
digit, m = map(int, input().split())
rules = []
for _ in range(m):
rules.append(list(map(int, input().split())))
numlst = [ -1 for _ in range(digit) ]
for rule in rules:
numindex = rule[0] - 1
# ルールの重複
if numlst[numindex] != -1 and numlst[numindex] != rule[1]:
print(-1)
exit()
nu... |
digit, m = map(int, input().split())
rules = []
for _ in range(m):
rules.append(list(map(int, input().split())))
numlst = [ -1 for _ in range(digit) ]
for rule in rules:
numindex = rule[0] - 1
# ルールの重複
if numlst[numindex] != -1 and numlst[numindex] != rule[1]:
print(-1)
exit()
nu... | [
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 553,506 | 553,507 | u209299893 | python |
p02761 |
digit, m = map(int, input().split())
rules = []
for _ in range(m):
rules.append(list(map(int, input().split())))
numlst = [ -1 for _ in range(digit) ]
for rule in rules:
numindex = rule[0] - 1
# ルールの重複
if numlst[numindex] != -1 and numlst[numindex] != rule[1]:
print(-1)
exit()
nu... |
digit, m = map(int, input().split())
rules = []
for _ in range(m):
rules.append(list(map(int, input().split())))
numlst = [ -1 for _ in range(digit) ]
for rule in rules:
numindex = rule[0] - 1
# ルールの重複
if numlst[numindex] != -1 and numlst[numindex] != rule[1]:
print(-1)
exit()
nu... | [
"control_flow.branch.if.condition.change"
] | 553,508 | 553,507 | u209299893 | python |
p02761 | # Code for C - Guess The Number
# Use input() to fetch data from STDIN
import sys
[n, m] = [int(x) for x in input().split()]
s = []
c = []
for i in range(m):
[x, y] = [int(x) for x in input().split()]
s.append(x)
c.append(y)
for x in range(1, 1000):
a = str(x)
if len(a) != n:
continue
... | # Code for C - Guess The Number
# Use input() to fetch data from STDIN
import sys
[n, m] = [int(x) for x in input().split()]
s = []
c = []
for i in range(m):
[x, y] = [int(x) for x in input().split()]
s.append(x)
c.append(y)
for x in range(1000):
a = str(x)
if len(a) != n:
continue
te... | [
"call.arguments.change"
] | 553,509 | 553,510 | u638629468 | python |
p02761 | n, m = map(int, input().split())
sc = [list(map(int, input().split()))for i in range(m)]
ans = -1
for i in range(1, 1000):
if len(str(i)) != n:
continue
for s, c in sc:
if str(i)[s-1] != str(c):
break
else:
ans = i
break
print(ans)
| n, m = map(int, input().split())
sc = [list(map(int, input().split()))for i in range(m)]
ans = -1
for i in range(1000):
if len(str(i)) != n:
continue
for s, c in sc:
if str(i)[s-1] != str(c):
break
else:
ans = i
break
print(ans)
| [
"call.arguments.change"
] | 553,521 | 553,522 | u644516473 | python |
p02761 | #n = int(input())
n,m = map(int,input().split())
#a_L = list(map(int,input().split()))
s_L,c_L = [],[]
for _ in range(m):
s,c = map(int,input().split())
s_L.append(s-1)
c_L.append(c)
ans = 10000
for i in range(700,703):
tmp =list(str(i))
#i = list(str(i))
#print(tmp)
flag = []
for j i... | #n = int(input())
n,m = map(int,input().split())
#a_L = list(map(int,input().split()))
s_L,c_L = [],[]
for _ in range(m):
s,c = map(int,input().split())
s_L.append(s-1)
c_L.append(c)
ans = 10000
for i in range(0,10000):
tmp =list(str(i))
flag = []
for j in range(m):
try:
... | [
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.lower.change",
"control_flow.loop.range.bounds.upper.change"
] | 553,525 | 553,526 | u625255205 | python |
p02761 | import sys
sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
printV = lambda x: print(*x, sep="\n")
printH = lambda x: print(" ".join(map(str,x)))
def IS(): return sys.stdin.readline()[:-1]
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list... | import sys
sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
printV = lambda x: print(*x, sep="\n")
printH = lambda x: print(" ".join(map(str,x)))
def IS(): return sys.stdin.readline()[:-1]
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list... | [
"control_flow.branch.if.condition.change",
"control_flow.branch.if.add"
] | 553,572 | 553,573 | u624696727 | python |
p02761 | n, m = [int(x) for x in input().split()]
sc = [[int(x) for x in input().split()] for i in range(m)]
r = [-1] * n
def solution():
for s, c in sc:
if s == 1 and c == 0 and n != 1:
return '-1'
if r[s - 1] >= 0 and r[s - 1] != c:
return '-1'
r[s - 1] = c
for i in rang... | n, m = [int(x) for x in input().split()]
sc = [[int(x) for x in input().split()] for i in range(m)]
r = [-1] * n
def solution():
for s, c in sc:
if s == 1 and c == 0 and n != 1:
return '-1'
if r[s - 1] >= 0 and r[s - 1] != c:
return '-1'
r[s - 1] = c
for i in rang... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 553,580 | 553,581 | u727407185 | python |
p02761 | N, M = map(int, input().split())
ans = [0] * N
ans_flag = [0] * N # s桁目に条件がきたら1
for _ in range(M):
s, c = map(int, input().split())
if N != 1 and s == 1 and c == 0: # 一番左が1の時点でN(>=2)桁がありえない
print(-1)
exit()
elif ans_flag[s-1] == 1 and ans[s-1] != c:
print(-1)
exit()
els... | N, M = map(int, input().split())
ans = [0] * N
ans_flag = [0] * N # s桁目に条件がきたら1
for _ in range(M):
s, c = map(int, input().split())
if N != 1 and s == 1 and c == 0: # 一番左が1の時点でN(>=2)桁がありえない
print(-1)
exit()
elif ans_flag[s-1] == 1 and ans[s-1] != c:
print(-1)
exit()
el... | [
"control_flow.branch.if.condition.change"
] | 553,585 | 553,586 | u767664985 | python |
p02761 | n, m = map(int, input().split())
sc = [tuple(map(int, input().split())) for _ in range(m)]
ans = '1'
if m == 1:
ans = '0'
for i in range(n-1):
ans += '0'
while len(ans) == n:
if all([ans[s-1] == str(c) for s, c in sc]):
print(int(ans))
exit()
ans = str(int(ans)+1)
print(-1) | n, m = map(int, input().split())
sc = [tuple(map(int, input().split())) for _ in range(m)]
ans = '1'
if n == 1:
ans = '0'
for i in range(n-1):
ans += '0'
while len(ans) == n:
if all([ans[s-1] == str(c) for s, c in sc]):
print(ans)
exit()
ans = str(int(ans)+1)
print(-1) | [
"identifier.change",
"control_flow.branch.if.condition.change",
"call.remove",
"call.arguments.change"
] | 553,591 | 553,592 | u384793271 | python |
p02761 | n, m = map(int, input().split())
sc = [list(map(int, input().split())) for _ in range(m)]
ans = [-1 for _ in range(n)]
for sci in sc:
if ans[sci[0]-1] == -1:
ans[sci[0]-1] = sci[1]
elif ans[sci[0]-1] != sci[1]:
print(-1)
exit(0)
if ans[0] == 0 and n != 1:
print(-1)
exit(0)
ansint = 0
for i, a in enumerate(... | n, m = map(int, input().split())
sc = [list(map(int, input().split())) for _ in range(m)]
ans = [-1 for _ in range(n)]
for sci in sc:
if ans[sci[0]-1] == -1:
ans[sci[0]-1] = sci[1]
elif ans[sci[0]-1] != sci[1]:
print(-1)
exit(0)
if ans[0] == 0 and n != 1:
print(-1)
exit(0)
ansint = 0
for i, a in enumerate(... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 553,593 | 553,594 | u630281418 | python |
p02761 | N, M = [int(i) for i in input().split()]
t = []
for i in range(M):
t += [[int(i) for i in input().split()]]
for i in range(1, 1000):
s = str(i)
s
if len(s) != N:
continue
isOK = True
for it in t:
if len(s) < it[0]:
isOK = False
else:
isOK = isOK a... | N, M = [int(i) for i in input().split()]
t = []
for i in range(M):
t += [[int(i) for i in input().split()]]
for i in range(1000):
s = str(i)
if len(s) != N:
continue
isOK = True
for it in t:
if len(s) < it[0]:
isOK = False
else:
isOK = isOK and (s[it[... | [
"call.arguments.change"
] | 553,601 | 553,602 | u225053756 | python |
p02761 | N,M = map(int,input().split())
SC = []
for _ in range(M):
sc = list(map(int,input().split()))
SC.append(sc)
#print(SC)
for num in range(1000):
ans = True
znum = str(num).zfill(3)
#print(znum)
for sc in SC:
if znum[sc[0]-1] != str(sc[1]):
ans = False
if ans:
if le... | N,M = map(int,input().split())
SC = []
for _ in range(M):
sc = list(map(int,input().split()))
SC.append(sc)
#print(SC)
for num in range(1000):
ans = True
#znum = str(num).zfill(3)
znum = str(num).zfill(N)
#print(znum)
for sc in SC:
if znum[sc[0]-1] != str(sc[1]):
ans = F... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 553,622 | 553,623 | u503228842 | python |
p02761 | N, M = map(int, input().split())
SC = [list(map(int, input().split())) for _ in range(M)]
def check(string):
for s, c in SC:
if string[s - 1] != str(c):
return False
return True
if N == 1:
for i in range(10 ** i):
if check(str(i)):
print (i)
exit()
... | N, M = map(int, input().split())
SC = [list(map(int, input().split())) for _ in range(M)]
def check(string):
for s, c in SC:
if string[s - 1] != str(c):
return False
return True
if N == 1:
for i in range(10 ** 1):
if check(str(i)):
print (i)
exit()
... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 553,657 | 553,658 | u263830634 | python |
p02761 | import sys
sys.setrecursionlimit(10 ** 8)
input = sys.stdin.readline
def main():
N, M = [int(x) for x in input().split()]
SC = [[int(x) for x in input().split()] for _ in range(N)]
f = False
for i in range(1000):
if len(str(i)) != N:
continue
x = str(i)
for s, c... | import sys
sys.setrecursionlimit(10 ** 8)
input = sys.stdin.readline
def main():
N, M = [int(x) for x in input().split()]
SC = [[int(x) for x in input().split()] for _ in range(M)]
f = False
for i in range(1000):
if len(str(i)) != N:
continue
x = str(i)
for s, c... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 553,693 | 553,694 | u098012509 | python |
p02762 | class UnionFind:
def __init__(self, n):
self.n = n
self.g = [i for i in range(n)]
self.nmembers = [1 for i in range(n)]
def __len__(self):
return self.n
def __str__(self):
return "group:{}\nnmembers:{}".format(self.g,self.nmembers)
def __getitem__(self,x):
return self.g[x]
def merge(se... | class UnionFind:
def __init__(self, n):
self.n = n
self.g = [i for i in range(n)]
self.nmembers = [1 for i in range(n)]
def __len__(self):
return self.n
def __str__(self):
return "group:{}\nnmembers:{}".format(self.g,self.nmembers)
def __getitem__(self,x):
return self.whichgroup(x)
def... | [
"function.return_value.change"
] | 553,699 | 553,700 | u845573105 | python |
p02762 | from collections import deque, Counter
import sys
N_MAX = 100000 + 5
sys.setrecursionlimit(N_MAX)
N, M, K = map(int, sys.stdin.readline().rstrip().split())
fr = [[] for _ in range(N)] # 友達関係
for _ in range(M):
a, b = map(int, sys.stdin.readline().rstrip().split())
fr[a - 1].append(b - 1)
fr[b - 1].appen... | from collections import deque, Counter
import sys
N_MAX = 100000 + 5
sys.setrecursionlimit(N_MAX)
N, M, K = map(int, sys.stdin.readline().rstrip().split())
fr = [[] for _ in range(N)] # 友達関係
for _ in range(M):
a, b = map(int, sys.stdin.readline().rstrip().split())
fr[a - 1].append(b - 1)
fr[b - 1].appen... | [
"assignment.add"
] | 553,730 | 553,731 | u726285999 | python |
p02762 | n,m,k = map(int,input().split())
f = [[] for _ in range(n)]
g = [[] for _ in range(n)]
for _ in range(m):
a,b = map(int,input().split())
a,b = a-1,b-1
f[a].append(b)
f[b].append(a)
for _ in range(k):
c,d = map(int,input().split())
c,d = c-1,d-1
g[c].append(d)
g[d].append(c)
d = {}
parent... | n,m,k = map(int,input().split())
f = [[] for _ in range(n)]
g = [[] for _ in range(n)]
for _ in range(m):
a,b = map(int,input().split())
a,b = a-1,b-1
f[a].append(b)
f[b].append(a)
for _ in range(k):
c,d = map(int,input().split())
c,d = c-1,d-1
g[c].append(d)
g[d].append(c)
d = {}
parent... | [
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 553,746 | 553,747 | u800396927 | python |
p02762 | import sys
sys.setrecursionlimit(1000000000)
n,m,k=map(int,input().split())
stock=[set() for i in range(n)]
ter=[0]*n
ans=[0]*n
for i in range(m):
a,b=map(int,input().split())
stock[a-1].append(b-1)
stock[b-1].append(a-1)
ans[a-1]-=1
ans[b-1]-=1
def dfs(j,k):
size[k]+=1
for next_j in stock[j... | import sys
sys.setrecursionlimit(10000000)
n,m,k=map(int,input().split())
stock=[[] for i in range(n)]
ter=[0]*n
ans=[0]*n
for i in range(m):
a,b=map(int,input().split())
stock[a-1].append(b-1)
stock[b-1].append(a-1)
ans[a-1]-=1
ans[b-1]-=1
def dfs(j,k):
size[k]+=1
for next_j in stock[j]:
... | [
"literal.number.integer.change",
"call.arguments.change"
] | 553,754 | 553,757 | u414920281 | python |
p02762 | import sys
sys.setrecursionlimit(1000000)
n,m,k=map(int,input().split())
stock=[set() for i in range(n)]
ter=[0]*n
ans=[0]*n
for i in range(m):
a,b=map(int,input().split())
stock[a-1].append(b-1)
stock[b-1].append(a-1)
ans[a-1]-=1
ans[b-1]-=1
def dfs(j,k):
size[k]+=1
for next_j in stock[j]:
... | import sys
sys.setrecursionlimit(10000000)
n,m,k=map(int,input().split())
stock=[[] for i in range(n)]
ter=[0]*n
ans=[0]*n
for i in range(m):
a,b=map(int,input().split())
stock[a-1].append(b-1)
stock[b-1].append(a-1)
ans[a-1]-=1
ans[b-1]-=1
def dfs(j,k):
size[k]+=1
for next_j in stock[j]:
... | [
"literal.number.integer.change",
"call.arguments.change"
] | 553,756 | 553,757 | u414920281 | python |
p02762 | class UnionFind:
def __init__(self, n):
self.table = [-1] * n
def _root(self, x):
if self.table[x] < 0:
return x
else:
self.table[x] = self._root(self.table[x])
return self.table[x]
def count(self, x):
return -self.table[self._root(x)]
... | class UnionFind:
def __init__(self, n):
self.table = [-1] * n
def _root(self, x):
if self.table[x] < 0:
return x
else:
self.table[x] = self._root(self.table[x])
return self.table[x]
def count(self, x):
return -self.table[self._root(x)]
... | [
"call.remove",
"call.arguments.change"
] | 553,777 | 553,778 | u026155812 | python |
p02762 | import sys
from io import StringIO
import unittest
import os
# union find木
# 参考：https://note.nkmk.me/python-union-find/
class UnionFind:
def __init__(self, n):
"""
コンストラクタ
:要素数 n:
"""
self.n = n
# 添字x: 値yとすると・・
# root以外の場合： 要素xは集合yに所属する。
# rootの場... | import sys
from io import StringIO
import unittest
import os
# union find木
# 参考：https://note.nkmk.me/python-union-find/
class UnionFind:
def __init__(self, n):
"""
コンストラクタ
:要素数 n:
"""
self.n = n
# 添字x: 値yとすると・・
# root以外の場合： 要素xは集合yに所属する。
# rootの場... | [
"call.arguments.change"
] | 553,784 | 553,785 | u550814027 | python |
p02762 | N, M, K = map(int, input().split())
F = [[] for _ in range(N)]
B = [[] for _ in range(N)]
for _ in range(M):
a, b = map(int, input().split())
a, b = a - 1, b - 1
F[a].append(b)
F[b].append(a)
print(F)
for _ in range(K):
c, d = map(int, input().split())
c, d = c - 1, d - 1
B[c].append(d)
... | N, M, K = map(int, input().split())
F = [[] for _ in range(N)]
B = [[] for _ in range(N)]
for _ in range(M):
a, b = map(int, input().split())
a, b = a - 1, b - 1
F[a].append(b)
F[b].append(a)
for _ in range(K):
c, d = map(int, input().split())
c, d = c - 1, d - 1
B[c].append(d)
B[d].ap... | [
"call.remove"
] | 553,786 | 553,787 | u934529721 | python |
p02762 | import sys
sys.setrecursionlimit(10 ** 6)
INF = float("inf")
MOD = 10 ** 9 + 7
def input():
return sys.stdin.readline().strip()
class UnionFind:
def __init__(self, n_nodes):
self.n_nodes = n_nodes
# self.parents[x] < 0 の時，xが根である．
# また，xが根の時，(-1) * (同一グループの要素数) が格納されるようになる.
... | import sys
sys.setrecursionlimit(10 ** 6)
INF = float("inf")
MOD = 10 ** 9 + 7
def input():
return sys.stdin.readline().strip()
class UnionFind:
def __init__(self, n_nodes):
self.n_nodes = n_nodes
# self.parents[x] < 0 の時，xが根である．
# また，xが根の時，(-1) * (同一グループの要素数) が格納されるようになる.
... | [
"identifier.change",
"call.arguments.change"
] | 553,813 | 553,814 | u346812984 | python |
p02762 | import sys
sys.setrecursionlimit(10**5)
n,m,k=map(int,input().split())
fr=[0 for _ in range(n)]
frl=[[] for i in range(n)]
frlist=[]
for i in range(m):
a,b=map(int,input().split())
frl[a-1].append(b)
frl[b-1].append(a)
frlist.append([a,b])
treelist=[]
hitobito=set()
def saiki(c,tmpi):
global hito... | import sys
sys.setrecursionlimit(10**5)
n,m,k=map(int,input().split())
fr=[0 for _ in range(n)]
frl=[[] for i in range(n)]
frlist=[]
for i in range(m):
a,b=map(int,input().split())
frl[a-1].append(b)
frl[b-1].append(a)
frlist.append([a,b])
treelist=[]
hitobito=set()
def saiki(c,tmpi):
global hito... | [
"call.remove"
] | 553,825 | 553,826 | u485979475 | python |
p02762 | import sys
input = sys.stdin.readline
from collections import deque
import copy
N, M, K = map(int, input().split())
friend = [deque() for _ in range(N)]
status = [-1]*N
numList = [0]*N
ans = [0]*N
for _ in range(M):
a, b = map(int, input().split())
friend[a-1].append(b-1)
friend[b-1].append(a-1)
ans[a... | import sys
input = sys.stdin.readline
from collections import deque
import copy
N, M, K = map(int, input().split())
friend = [deque() for _ in range(N)]
status = [-1]*N
numList = [0]*N
ans = [0]*N
for _ in range(M):
a, b = map(int, input().split())
friend[a-1].append(b-1)
friend[b-1].append(a-1)
ans[a... | [
"assignment.value.change"
] | 553,833 | 553,834 | u135346354 | python |
p02762 | 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]
def union(self, x, y):
x = ... | 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]
def union(self, x, y):
x = ... | [
"identifier.change"
] | 553,870 | 553,871 | u731448038 | python |
p02762 | from collections import deque,Counter
n,m,k = map(int,input().split())
G = [[] for _ in range(n)]
exc = [0]*n
for _ in range(m):
a,b = map(int,input().split())
a -= 1
b -= 1
G[a].append(b)
G[b].append(a)
exc[a] += 1
exc[b] += 1
stk = deque()
grp = [-1]*n
grpnum = 0
def dfs(s,g):
stk.ap... | from collections import deque,Counter
n,m,k = map(int,input().split())
G = [[] for _ in range(n)]
exc = [0]*n
for _ in range(m):
a,b = map(int,input().split())
a -= 1
b -= 1
G[a].append(b)
G[b].append(a)
exc[a] += 1
exc[b] += 1
stk = deque()
grp = [-1]*n
grpnum = 0
def dfs(s,g):
stk.ap... | [
"assignment.add"
] | 553,880 | 553,881 | u677121387 | python |
p02762 | from collections import deque, defaultdict
import sys
input = sys.stdin.buffer.readline
n, m, k = map(int, input().split())
#先ずは連結成分の数を調べる
G = defaultdict(lambda:deque([]))
for _ in range(m):
a, b = map(int, input().split())
a, b = a-1, b-1
G[a].append(b)
G[b].append(a)
NIL = -1
color = [NIL]*n
def d... | from collections import deque, defaultdict
import sys
input = sys.stdin.buffer.readline
n, m, k = map(int, input().split())
#先ずは連結成分の数を調べる
G = defaultdict(lambda:deque([]))
for _ in range(m):
a, b = map(int, input().split())
a, b = a-1, b-1
G[a].append(b)
G[b].append(a)
NIL = -1
color = [NIL]*n
def d... | [
"call.add"
] | 553,882 | 553,883 | u594803920 | python |
p02762 | N, M, K = map(int, input().split())
ans = [0] * (N + 1)
child = {i:[] for i in range(1, N+1)}
isChecked = [0] * (N + 1)
isBlocked = [set() for _ in range(N+1)]
for _ in range(M):
a, b = map(int, input().split())
child[a].append(b)
child[b].append(a)
for _ in range(K):
c, d = map(int, input().split... | N, M, K = map(int, input().split())
ans = [0] * (N + 1)
child = {i:[] for i in range(1, N+1)}
isChecked = [0] * (N + 1)
isBlocked = [set() for _ in range(N+1)]
for _ in range(M):
a, b = map(int, input().split())
child[a].append(b)
child[b].append(a)
for _ in range(K):
c, d = map(int, input().split... | [
"call.remove"
] | 553,894 | 553,895 | u268318377 | python |
p02762 | n, m, k = map(int, input().split())
graph = [[] for _ in range(n + 1)]
for _ in range(m):
a, b = map(int, input().split())
graph[a].append(b)
graph[b].append(a)
block = [[] for _ in range(n + 1)]
for _ in range(k):
c, d = map(int, input().split())
block[c].append(d)
block[d].append(c)
def df... | n, m, k = map(int, input().split())
graph = [[] for _ in range(n + 1)]
for _ in range(m):
a, b = map(int, input().split())
graph[a].append(b)
graph[b].append(a)
block = [[] for _ in range(n + 1)]
for _ in range(k):
c, d = map(int, input().split())
block[c].append(d)
block[d].append(c)
def df... | [
"call.arguments.change",
"io.output.change"
] | 553,908 | 553,909 | u940139461 | python |
p02761 | n, m = map(int, input().split())
c = [0]* m
s = [0]* m
for i in range(m):
s[i], c[i] = map(int, input().split())
flg = True
if n == 1:
i_str = str(0)
for j in range(m):
if i_str[s[j]-1] != str(c[j]):
flg = False
continue
if flg==True:
print(i)
exit()
... | n, m = map(int, input().split())
c = [0]* m
s = [0]* m
for i in range(m):
s[i], c[i] = map(int, input().split())
flg = True
if n == 1:
i = 0
i_str = str(i)
for j in range(m):
if i_str[s[j]-1] != str(c[j]):
flg = False
continue
if flg==True:
print(i)
... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 553,927 | 553,928 | u952467214 | python |
p02761 | import sys
n, m = [int(i) for i in sys.stdin.readline().split()]
ls = []
ans = ["x"] * (n)
for i in range(m):
s, c = [int(i) for i in sys.stdin.readline().split()]
s -= 1
if ans[s] != "x" and ans[s] != str(c):
ans = -1
break
else:
ans[s] = str(c)
if ans == -1 or (ans[0] == "0" an... | import sys
n, m = [int(i) for i in sys.stdin.readline().split()]
ls = []
ans = ["x"] * (n)
for i in range(m):
s, c = [int(i) for i in sys.stdin.readline().split()]
s -= 1
if ans[s] != "x" and ans[s] != str(c):
ans = -1
break
else:
ans[s] = str(c)
if ans == -1 or (ans[0] == "0" an... | [
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 553,943 | 553,944 | u190406011 | python |
p02761 | n,m = (int(num) for num in input().split())
ans = ["empty"] * n
isPossible = True
for _ in range(m):
s,c = (int(num) for num in input().split())
idx = s - 1
if ans[idx] == "empty" or ans[idx] == c:
ans[idx] = c
else:
isPossible = False
if n != 1 and ans[0] == 0:
isPossible = False
... | n,m = (int(num) for num in input().split())
ans = ["empty"] * n
isPossible = True
for _ in range(m):
s,c = (int(num) for num in input().split())
idx = s - 1
if ans[idx] == "empty" or ans[idx] == c:
ans[idx] = c
else:
isPossible = False
if n != 1 and ans[0] == 0:
isPossible = False
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 553,949 | 553,950 | u023540496 | python |
p02761 | n,m = (int(num) for num in input().split())
ans = ["empty"] * n
isPossible = True
for _ in range(m):
s,c = (int(num) for num in input().split())
idx = s - 1
if ans[idx] == "empty" or ans[idx] == c:
ans[idx] = c
else:
isPossible = False
if n != 0 and ans[0] == 0:
isPossible = False
... | n,m = (int(num) for num in input().split())
ans = ["empty"] * n
isPossible = True
for _ in range(m):
s,c = (int(num) for num in input().split())
idx = s - 1
if ans[idx] == "empty" or ans[idx] == c:
ans[idx] = c
else:
isPossible = False
if n != 1 and ans[0] == 0:
isPossible = False
... | [
"literal.number.integer.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 553,951 | 553,950 | u023540496 | python |
p02761 | import sys
n, m = map(int, input().split())
check = [list(map(int, input().split())) for i in range(m)]
for i in range(1, 1000):
x = str(i)
if len(x) != n:
continue
flg = True
for s, c in check:
if x[s-1] == str(c):
pass
else:
flg = False
if flg:
... | import sys
n, m = map(int, input().split())
check = [list(map(int, input().split())) for i in range(m)]
for i in range(1000):
x = str(i)
if len(x) != n:
continue
flg = True
for s, c in check:
if x[s-1] == str(c):
pass
else:
flg = False
if flg:
... | [
"call.arguments.change"
] | 553,952 | 553,953 | u595289165 | python |
p02761 | n, m = map(int, input().split())
d = [-1 for i in range(n)]
flag = True
for i in range(m):
s, c = map(int, input().split())
if d[s - 1] > -1 and d[s - 1] != c:
flag = False
elif s == 1 and n > 1 and c == 0:
flag = False
else:
d[s - 1] = c
if flag:
ans = ""
for i in range(n):
if d[i] == -1:... | n, m = map(int, input().split())
d = [-1 for i in range(n)]
flag = True
for i in range(m):
s, c = map(int, input().split())
if d[s - 1] > -1 and d[s - 1] != c:
flag = False
elif s == 1 and n > 1 and c == 0:
flag = False
else:
d[s - 1] = c
if flag:
ans = ""
for i in range(n):
if d[i] == -1:... | [] | 553,976 | 553,977 | u671455949 | python |
p02761 | n, m = map(int, input().split())
nList = ['*'] * n
flag = True
for i in range(m):
s, c = map(int, input().split())
if nList[s-1] == '*':
nList[s-1] = str(c)
elif nList[s-1] != str(c):
flag = False
break
if nList[0] == '0' and n > 2:
flag = False
if flag:
for i, num in enumera... | n, m = map(int, input().split())
nList = ['*'] * n
flag = True
for i in range(m):
s, c = map(int, input().split())
if nList[s-1] == '*':
nList[s-1] = str(c)
elif nList[s-1] != str(c):
flag = False
break
if nList[0] == '0' and n > 1:
flag = False
if flag:
for i, num in enumera... | [
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 553,978 | 553,979 | u384094369 | python |
p02761 | N, M = map(int, input().split())
res = ["*"]*N
flag = True
for i in range(M):
s, c = input().split()
if s == "1" and c == "0":
if N != 1:
flag = False
if res[int(s)-1] != "*" and res[int(s)-1] != c:
flag = False
res[int(s)-1] = c
if flag:
if res[0] == "*":
res[0]... | N, M = map(int, input().split())
res = ["*"]*N
flag = True
for i in range(M):
s, c = input().split()
if s == "1" and c == "0":
if N != 1:
flag = False
if res[int(s)-1] != "*" and res[int(s)-1] != c:
flag = False
res[int(s)-1] = c
if flag:
if res[0] == "*":
if N !... | [
"control_flow.branch.if.add"
] | 553,994 | 553,995 | u642012866 | python |
p02761 | n,m=map(int,input().split())
ans = [None]*n
for _ in range(m):
s,c = map(int,input().split())
if n > 1 and s==1 and c==0:
ans = [-1]
break
if ans[s-1] is None or ans[s-1] == c:
ans[s-1] = c
else:
ans = [-1]
break
else:
for i in range(n):
if ans[i]... | n,m=map(int,input().split())
ans = [None]*n
for _ in range(m):
s,c = map(int,input().split())
if n > 1 and s==1 and c==0:
ans = [-1]
break
if ans[s-1] is None or ans[s-1] == c:
ans[s-1] = c
else:
ans = [-1]
break
else:
for i in range(n):
if ans[i]... | [] | 554,004 | 554,005 | u867320886 | python |
p02761 | N, M = map(int, input().split())
s = []
c = []
for _ in range(M):
a, b = map(int, input().split())
s.append(a)
c.append(b)
ans = [-1] * N
flag = True
for i in range(M):
if N > 1 and s[i] == 1 and c[i] == 0: flag = False
if ans[s[i] - 1] < 0:
ans[s[i] - 1] = c[i]
elif ans[s[i] - 1] != c[i... | N, M = map(int, input().split())
s = []
c = []
for _ in range(M):
a, b = map(int, input().split())
s.append(a)
c.append(b)
ans = [-1] * N
flag = True
for i in range(M):
if N > 1 and s[i] == 1 and c[i] == 0: flag = False
if ans[s[i] - 1] < 0:
ans[s[i] - 1] = c[i]
elif ans[s[i] - 1] != c[i... | [
"control_flow.branch.if.condition.change"
] | 554,014 | 554,015 | u795688372 | python |
p02761 | N, M = map(int, input().split())
s = []
c = []
for _ in range(M):
a, b = map(int, input().split())
s.append(a)
c.append(b)
ans = [-1] * 3
flag = True
for i in range(M):
if N > 1 and s[i] == 1 and c[i] == 0: flag = False
if ans[s[i] - 1] < 0:
ans[s[i] - 1] = c[i]
elif ans[s[i] - 1] != c[i... | N, M = map(int, input().split())
s = []
c = []
for _ in range(M):
a, b = map(int, input().split())
s.append(a)
c.append(b)
ans = [-1] * N
flag = True
for i in range(M):
if N > 1 and s[i] == 1 and c[i] == 0: flag = False
if ans[s[i] - 1] < 0:
ans[s[i] - 1] = c[i]
elif ans[s[i] - 1] != c[i... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 554,016 | 554,015 | u795688372 | python |
p02761 | n, m = map(int, input().split())
l = [-1] * n
for _ in range(m):
s, c = map(int, input().split())
s -= 1
if l[s] == -1:
l[s] = c
elif l[s] != c:
print(-1)
exit()
if n > 1 and l[0] == 0:
print(-1)
exit()
if l[0] == -1:
if n == 0:
l[0] = 0
else:
... | n, m = map(int, input().split())
l = [-1] * n
for _ in range(m):
s, c = map(int, input().split())
s -= 1
if l[s] == -1:
l[s] = c
elif l[s] != c:
print(-1)
exit()
if n > 1 and l[0] == 0:
print(-1)
exit()
if l[0] == -1:
if n == 1:
l[0] = 0
else:
... | [
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 554,023 | 554,024 | u029576659 | python |
p02761 | import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline(... | import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline(... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 554,029 | 554,030 | u941753895 | python |
p02761 | n,m = map(int,input().split())
raw = []
for _ in range(m):
s,c = map(int,input().split())
s -= 1
raw.append([s,c])
for d in range(1000):
e = str(d)
e = '0' * (n-len(e)) + e
#print(e)
for x in raw:
s,c = x
if e[s] != str(c):
break
else:
if e[0] == '0':
continue
else:
pri... | n,m = map(int,input().split())
raw = []
for _ in range(m):
s,c = map(int,input().split())
s -= 1
raw.append([s,c])
for d in range(1000):
e = str(d)
e = '0' * (n-len(e)) + e
#print(e)
for x in raw:
s,c = x
if e[s] != str(c):
break
else:
if e[0] == '0' and n != 1:
continue
else... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 554,031 | 554,032 | u111365362 | python |
p02761 | n, m = [int(i) for i in input().split()]
sc = [[int(i) for i in input().split()] for _ in range(m)]
for i in range(10 ** (n - 1), 10 ** n):
s = str(i)
for j in sc:
if s[j[0]-1] != str(j[1]):
break
else:
print(i)
break
else:
print(-1)
| n, m = [int(i) for i in input().split()]
sc = [[int(i) for i in input().split()] for _ in range(m)]
for i in range(10 ** (n - 1) if n>1 else 0, 10 ** n):
s = str(i)
for j in sc:
if s[j[0]-1] != str(j[1]):
break
else:
print(i)
break
else:
print(-1)
| [
"control_flow.loop.range.bounds.lower.change"
] | 554,039 | 554,040 | u571969099 | python |
p02761 | n,m = map(int,input().split())
ans = [-1 for i in range(n)]
for i in range(m):
s,c = map(int,input().split())
if s == 1 and c == 0 and n != 1:
print(-1)
exit()
if ans[s-1] != -1 and ans[s-1] != str(c):
print(-1)
exit()
ans[s-1] = str(c)
for i in range(n):
if ans[i] == -1:
if i == 0:
... | n,m = map(int,input().split())
ans = [-1 for i in range(n)]
for i in range(m):
s,c = map(int,input().split())
if s == 1 and c == 0 and n != 1:
print(-1)
exit()
if ans[s-1] != -1 and ans[s-1] != str(c):
print(-1)
exit()
ans[s-1] = str(c)
for i in range(n):
if ans[i] == -1:
if i == 0 and n !... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 554,053 | 554,054 | u667024514 | python |
p02762 | import sys
sys.setrecursionlimit(10*9)
n,m,k = map(int,input().split())
parent_of = [-1 for _ in range(n)]
#print(parent_of)
def root_of(x):
if parent_of[x] < 0:
return x
else:
parent_of[x] = root_of(parent_of[x])
return parent_of[x]
def unite(x,y):
top_root_x = root_of(x)
top_root_y = root_of(y)
if top_ro... | import sys
sys.setrecursionlimit(10*9)
n,m,k = map(int,input().split())
parent_of = [-1 for _ in range(n)]
#print(parent_of)
def root_of(x):
if parent_of[x] < 0:
return x
else:
parent_of[x] = root_of(parent_of[x])
return parent_of[x]
def unite(x,y):
top_root_x = root_of(x)
top_root_y = root_of(y)
if top_ro... | [
"identifier.change"
] | 554,065 | 554,066 | u788703383 | python |
p02762 | n, m, k = map(int, input().split())
clusterN = [1] * n
clusterI = list(range(n))
out = [0] * n
def generateC(x):
if clusterI[x] != x:
minI = generateC(clusterI[x])
clusterI[x] = minI
return minI
else:
return x
def unite(x, y):
CX = generateC(x)
CY = generateC(y)
if CX != CY:
if CX > CY:
... | n, m, k = map(int, input().split())
clusterN = [1] * n
clusterI = list(range(n))
out = [0] * n
def generateC(x):
if clusterI[x] != x:
minI = generateC(clusterI[x])
clusterI[x] = minI
return minI
else:
return x
def unite(x, y):
CX = generateC(x)
CY = generateC(y)
if CX != CY:
if CX > CY:
... | [
"variable_access.subscript.index.change"
] | 554,067 | 554,068 | u875541136 | python |
p02762 | import sys
N,M,K=map(int,input().split())
s=[[]for i in range(N)]
tn=[0]*N
sys.setrecursionlimit(200000)
for i in range(M):
a,b=map(int,input().split())
s[a-1].append(b)
s[b-1].append(a)
tn[a-1]+=1
tn[b-1]+=1
l=[None]*N
def hu(n,t):
for i in s[n]:
if l[i-1]==None:
l[i-1]=t
... | import sys
N,M,K=map(int,input().split())
s=[[]for i in range(N)]
tn=[0]*N
sys.setrecursionlimit(200000)
for i in range(M):
a,b=map(int,input().split())
s[a-1].append(b)
s[b-1].append(a)
tn[a-1]+=1
tn[b-1]+=1
l=[None]*N
def hu(n,t):
l[n]=t
for i in s[n]:
if l[i-1]==None:
... | [
"assignment.add"
] | 554,071 | 554,072 | u187516587 | python |
p02762 |
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]
def union(self, x, y):
x = se... |
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]
def union(self, x, y):
x = se... | [
"call.arguments.change"
] | 554,112 | 554,113 | u755989869 | python |
p02762 | 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]
def union(self, x, y):
x = ... | 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]
def union(self, x, y):
x = ... | [
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 554,116 | 554,117 | u327532412 | python |
p02762 | import sys
sys.getrecursionlimit(10**6)
N,M,K = map(int,input().split())
par = [i for i in range(N+1)]
# 木の根を求める
def root(x):
if par[x] == x:
return x
else:
par[x] = root(par[x])
return par[x]
# xとyが同じ集合に属するか否か
def bool_same(x,y):
return root(x) == root(y)
# xとyの属する集合を併合
def uni... | import sys
sys.setrecursionlimit(10**6)
N,M,K = map(int,input().split())
par = [i for i in range(N+1)]
# 木の根を求める
def root(x):
if par[x] == x:
return x
else:
par[x] = root(par[x])
return par[x]
# xとyが同じ集合に属するか否か
def bool_same(x,y):
return root(x) == root(y)
# xとyの属する集合を併合
def uni... | [
"identifier.change"
] | 554,186 | 554,187 | u747602774 | python |
p02762 | # https://atcoder.jp/contests/abc157/submissions/10475457
import sys
readline = sys.stdin.readine
N, M, K = map(int, readline().split())
F = [[] for _ in range(N + 1)]
for _ in range(M):
a, b = map(int, readline().split())
F[a].append(b)
F[b].append(a)
B = [[] for _ in range(N + 1)]
for _ in range(K):
... | # https://atcoder.jp/contests/abc157/submissions/10475457
import sys
readline = sys.stdin.readline
N, M, K = map(int, readline().split())
F = [[] for _ in range(N + 1)]
for _ in range(M):
a, b = map(int, readline().split())
F[a].append(b)
F[b].append(a)
B = [[] for _ in range(N + 1)]
for _ in range(K):
... | [
"assignment.value.change",
"identifier.change"
] | 554,217 | 554,218 | u780475861 | python |
p02762 | #import sys
#sys.setrecursionlimit(500000) マージテクをちゃんとしていればこんなものはいらないはず……
class UF:
#経路圧縮＋マージテクのunion find木
def __init__(self,n):
self.n = n
self.parents = [-1] * (n+1) #1-indexedにするために１個足している
self.rnks = [0] * (n+1)
def find(self,n):
if self.parents[n] < 0:
retu... | #import sys
#sys.setrecursionlimit(500000) マージテクをちゃんとしていればこんなものはいらないはず……
class UF:
#経路圧縮＋マージテクのunion find木
def __init__(self,n):
self.n = n
self.parents = [-1] * (n+1) #1-indexedにするために１個足している
self.rnks = [0] * (n+1)
def find(self,n):
if self.parents[n] < 0:
retu... | [
"control_flow.return.add"
] | 554,225 | 554,226 | u695079172 | python |
p02762 | #import sys
#sys.setrecursionlimit(500000) マージテクをちゃんとしていればこんなものはいらないはず……
class UF:
#経路圧縮＋マージテクのunion find木
def __init__(self,n):
self.n = n
self.parents = [-1] * (n+1) #1-indexedにするために１個足している
self.rnks = [0] * (n+1)
def find(self,n):
if self.parents[n] < 0:
retu... | #import sys
#sys.setrecursionlimit(500000) マージテクをちゃんとしていればこんなものはいらないはず……
class UF:
#経路圧縮＋マージテクのunion find木
def __init__(self,n):
self.n = n
self.parents = [-1] * (n+1) #1-indexedにするために１個足している
self.rnks = [0] * (n+1)
def find(self,n):
if self.parents[n] < 0:
retu... | [
"assignment.value.change",
"identifier.change"
] | 554,227 | 554,228 | u695079172 | python |
p02762 |
import sys
sys.setrecursionlimit(999999999999)
class UF:
#経路圧縮のみのunion find木
def __init__(self,n):
self.n = n
self.parents = [-1] * (n+1) #1-indexedにするために１個足している
self.rnks = [0] * (n+1)
def find(self,n):
if self.parents[n] < 0:
return n
else:
... |
import sys
sys.setrecursionlimit(500000)
class UF:
#経路圧縮のみのunion find木
def __init__(self,n):
self.n = n
self.parents = [-1] * (n+1) #1-indexedにするために１個足している
self.rnks = [0] * (n+1)
def find(self,n):
if self.parents[n] < 0:
return n
else:
self... | [
"literal.number.integer.change",
"call.arguments.change"
] | 554,231 | 554,232 | u695079172 | python |
p02762 | n,m,k=map(int,input().split())
ab=[list(map(int,input().split()))for i in range(m)]
cd=[list(map(int,input().split()))for i in range(k)]
class UnionFind():
def __init__(self,n):
self.n=[-1]*n
self.r=[0]*n
def Find_Root(self,x):
if self.n[x]<0:
return x
else:
... | n,m,k=map(int,input().split())
ab=[list(map(int,input().split()))for i in range(m)]
cd=[list(map(int,input().split()))for i in range(k)]
class UnionFind():
def __init__(self,n):
self.n=[-1]*n
self.r=[0]*n
def Find_Root(self,x):
if self.n[x]<0:
return x
else:
... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.change"
] | 554,238 | 554,239 | u434872492 | python |
p02761 | # -*- coding: utf-8 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
import copy
import heapq
from collections import defaultdict
from heapq import heappop, heappush
import itertools
input = sys.stdin.readline
##### リストの 二分木検索 #####
# bisect_left(lists, 3)
# ... | # -*- coding: utf-8 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
import copy
import heapq
from collections import defaultdict
from heapq import heappop, heappush
import itertools
input = sys.stdin.readline
##### リストの 二分木検索 #####
# bisect_left(lists, 3)
# ... | [
"call.remove"
] | 554,257 | 554,258 | u448994613 | python |
p02761 | N,M = map(int,input().split())
sc = [[0,0]]*M
ans = [0]*N
f = True
ans = -1
for i in range(M):
sc[i] = list(map(int,input().split()))
for i in range(1000):
str_i = str(i)
if (len(str_i) == N):
f = True
for j in range(M):
f &= (str_i[sc[i][0]-1] == str(sc[i][1]))
if (f):
... | N,M = map(int,input().split())
sc = [[0,0]]*M
ans = [0]*N
f = True
ans = -1
for i in range(M):
sc[i] = list(map(int,input().split()))
for i in range(1000):
str_i = list(str(i))
if (len(str_i) == N):
f = True
for j in range(M):
f &= (str_i[sc[j][0]-1] == str(sc[j][1]))
if... | [
"call.add",
"call.arguments.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 554,267 | 554,268 | u202634017 | python |
p02761 | # C問題
N,M = map(int,input().split(" "))
Num = [0]*N
check = [0]*N
flag=0
for i in range(M):
s,c = map(int,input().split(" "))
if s==1 and c==0 and N!=1:
flag=1
break
elif check[s-1]==1 and Num[s-1]!=c:
flag=1
break
else:
Num[s-1] = c
check[s-1]=1
if flag=... | # C問題
N,M = map(int,input().split(" "))
Num = [0]*N
check = [0]*N
flag=0
for i in range(M):
s,c = map(int,input().split(" "))
if s==1 and c==0 and N!=1:
flag=1
break
elif check[s-1]==1 and Num[s-1]!=c:
flag=1
break
else:
Num[s-1] = c
check[s-1]=1
if flag=... | [
"control_flow.branch.if.condition.change"
] | 554,281 | 554,282 | u098982053 | python |
p02761 | n, m = map(int, input().split())
t = [None] * n
invalid = False
for _ in range(m):
s, c = map(int, input().split())
if t[s-1] is None or t[s-1] == c:
t[s-1] = c
else:
invalid = True
for i in range(n):
if t[i] is None:
if i == 0:
t[i] = 1
else:
t... | n, m = map(int, input().split())
t = [None] * n
invalid = False
for _ in range(m):
s, c = map(int, input().split())
if t[s-1] is None or t[s-1] == c:
t[s-1] = c
else:
invalid = True
for i in range(n):
if t[i] is None:
if i == 0 and n > 1:
t[i] = 1
else:
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 554,311 | 554,312 | u645855527 | python |
p02761 | n, num = map(int, input().split())
ans = [-1 for i in range(n)]
flag = True
for i in range(num):
s, c = map(int, input().split())
s -= 1
if ans[s] == -1 or ans[s] == c:
ans[s] = c
else:
flag = False
if n != 1 and ans[0] == 0:
flag = False
if flag:
if ans[0] == -1:
an... | n, num = map(int, input().split())
ans = [-1 for i in range(n)]
flag = True
for i in range(num):
s, c = map(int, input().split())
s -= 1
if ans[s] == -1 or ans[s] == c:
ans[s] = c
else:
flag = False
if n != 1 and ans[0] == 0:
flag = False
if flag:
if ans[0] == -1 and n != 1:... | [
"control_flow.branch.if.condition.change"
] | 554,336 | 554,337 | u301984327 | python |
p02761 | n, m = [int(v) for v in input().split()]
query = [tuple(int(v) for v in input().split()) for _ in range(m)]
res = [None] * n
for s, c in query:
s -= 1
if res[s] is None:
if n > 1 and c == 0 and s == 0:
res = None
break
res[s] = c
elif res[s] == c:
pass
e... | n, m = [int(v) for v in input().split()]
query = [tuple(int(v) for v in input().split()) for _ in range(m)]
res = [None] * n
for s, c in query:
s -= 1
if res[s] is None:
if n > 1 and c == 0 and s == 0:
res = None
break
res[s] = c
elif res[s] == c:
pass
e... | [
"control_flow.branch.if.condition.change"
] | 554,362 | 554,363 | u569280127 | python |
p02761 | # -*- coding: utf-8 -*-
n, m = map(int, input().split())
ds = [-1 for _ in range(n)]
f = True
for _ in range(m):
si, ci = map(int, input().split())
si -= 1
if ds[si] == -1:
ds[si] = ci
elif ds[si] == ci:
continue
else:
f = False
if f:
if len(ds) == 1:
s = ds[0]
... | # -*- coding: utf-8 -*-
n, m = map(int, input().split())
ds = [-1 for _ in range(n)]
f = True
for _ in range(m):
si, ci = map(int, input().split())
si -= 1
if ds[si] == -1:
ds[si] = ci
elif ds[si] == ci:
continue
else:
f = False
if f:
if len(ds) == 1:
s = max(0, ... | [
"call.add",
"call.arguments.change"
] | 554,390 | 554,391 | u056277698 | python |
p02761 | #!/usr/bin/env python3
import sys
#sys.setrecursionlimit(150000)
def solve(N: int, M: int, s: "List[int]", c: "List[int]"):
ans=[-1]*N
dame=False
for i in range(M):
if N!=1 and s[i]==1 and c[i]==0: dame=True
if ans[s[i]-1]!=-1 and ans[s[i]-1]!=c[i]: dame=True
ans[s[i]-1]=c[i]
f... | #!/usr/bin/env python3
import sys
#sys.setrecursionlimit(150000)
def solve(N: int, M: int, s: "List[int]", c: "List[int]"):
ans=[-1]*N
dame=False
for i in range(M):
if N!=1 and s[i]==1 and c[i]==0: dame=True
if ans[s[i]-1]!=-1 and ans[s[i]-1]!=c[i]: dame=True
ans[s[i]-1]=c[i]
f... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 554,424 | 554,425 | u090649502 | python |
p02761 | #
# ⋀_⋀
# (･ω･)
# .／ Ｕ ∽ Ｕ＼
# │＊ 合 ＊│
# │＊ 格 ＊│
# │＊ 祈 ＊│
# │＊ 願 ＊│
# │＊ ＊│
# ￣
#
import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,sqrt,factorial,hypot,log #log2ないｙｐ
from heapq import heappop, heappush, heappushpop
from collections import Counter,default... | #
# ⋀_⋀
# (･ω･)
# .／ Ｕ ∽ Ｕ＼
# │＊ 合 ＊│
# │＊ 格 ＊│
# │＊ 祈 ＊│
# │＊ 願 ＊│
# │＊ ＊│
# ￣
#
import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,sqrt,factorial,hypot,log #log2ないｙｐ
from heapq import heappop, heappush, heappushpop
from collections import Counter,default... | [
"control_flow.branch.if.condition.change"
] | 554,433 | 554,434 | u788137651 | python |
p02761 |
N, M = list(map(int, input().split()))
sol = [-1] * N
for i in range(M):
s, c = list(map(int, input().split()))
if sol[s-1] != -1 and sol[s-1] != c:
print('-1')
exit(0)
sol[s-1] = c
for v in range(1, 1000):
s = str(v)
if len(s) != N:
continue
fail = False
for i in ... | N, M = list(map(int, input().split()))
sol = [-1] * N
for i in range(M):
s, c = list(map(int, input().split()))
if sol[s-1] != -1 and sol[s-1] != c:
print('-1')
exit(0)
sol[s-1] = c
for v in range(0, 1000):
s = str(v)
if len(s) != N:
continue
fail = False
for i in ra... | [
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.lower.change"
] | 554,445 | 554,446 | u179053337 | python |
p02760 | 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(N):
for j in range(3):
for k in range(3):
if A[j][k]==b[i]:
A[j][k] = 0
if A[1][1]==0 and A[0][0]==0 and A[2][2]==0 or A[1][1]==0 and A[2][0]==0 and A[0][2]==0 or A[1][1]==0... | 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(N):
for j in range(3):
for k in range(3):
if A[j][k]==b[i]:
A[j][k] = 0
if A[1][1]==0 and A[0][0]==0 and A[2][2]==0 or A[1][1]==0 and A[2][0]==0 and A[0][2]==0 or A[1][1]==0... | [
"literal.number.integer.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 554,453 | 554,454 | u511457539 | python |
p02760 | 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(3):
if a[i][j] == b[k]:
a[i][j] = 0
ans = 'No'
for i in range(3):
if a[i][0]+a[i][1]+a[i][2] == 0:
ans = 'Yes'
i... | 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 a[i][j] == b[k]:
a[i][j] = 0
ans = 'No'
for i in range(3):
if a[i][0]+a[i][1]+a[i][2] == 0:
ans = 'Yes'
if a[0][i]+a[1][i]+... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 554,455 | 554,456 | u205087376 | python |
p02760 | 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(3):
if a[i][j] == b[k]:
a[i][j] = 0
ans = 'No'
for i in range(3):
if a[i][0]+a[i][1]+a[i][2] == 0:
ans = 'Yes'
if a[0][i]+a[1]... | 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 a[i][j] == b[k]:
a[i][j] = 0
ans = 'No'
for i in range(3):
if a[i][0]+a[i][1]+a[i][2] == 0:
ans = 'Yes'
if a[0][i]+a[1][i]+... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 554,457 | 554,456 | u205087376 | python |
p02760 | 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(3):
if a[i][j] == b[k]:
a[i][j] = 0
ans = 'No'
for i in range(3):
if a[i][0]+a[i][1]+a[i][2] == 0:
ans = 'Yes'
i... | 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 a[i][j] == b[k]:
a[i][j] = 0
ans = 'No'
for i in range(3):
if a[i][0]+a[i][1]+a[i][2] == 0:
ans = 'Yes'
i... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 554,455 | 554,459 | u205087376 | python |
p02760 | 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(3):
if a[i][j] == b[k]:
a[i][j] = 0
ans = 'No'
for i in range(3):
if a[i][0]+a[i][1]+a[i][2] == 0:
ans = 'Yes'
if a[0][i]+a[1]... | 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 a[i][j] == b[k]:
a[i][j] = 0
ans = 'No'
for i in range(3):
if a[i][0]+a[i][1]+a[i][2] == 0:
ans = 'Yes'
i... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 554,457 | 554,459 | u205087376 | python |
p02760 | 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(3):
if a[i][j] == b[k]:
a[i][j] = 0
ans = 'No'
for i in range(3):
if a[i][0]+a[i][1]+a[i][2] == 0:
ans = 'Yes'
if a[0][i]+a[1][i]+... | 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 a[i][j] == b[k]:
a[i][j] = 0
ans = 'No'
for i in range(3):
if a[i][0]+a[i][1]+a[i][2] == 0:
ans = 'Yes'
i... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 554,458 | 554,459 | u205087376 | python |
p02760 | import numpy as np
A = np.array(list(list(map(int, input().split())) for l in range(3)))
N = int(input())
b = np.array(list(int(input()) for l in range(N)))
bingo = np.zeros((3, 3))
bingo = bingo == 1
for b_i in b:
hantei = A == b_i
bingo = np.logical_or(bingo, hantei)
for i in range(3):
if all(bingo[i])... | import numpy as np
A = np.array(list(list(map(int, input().split())) for l in range(3)))
N = int(input())
b = np.array(list(int(input()) for l in range(N)))
bingo = np.zeros((3, 3))
bingo = bingo == 1
for b_i in b:
hantei = A == b_i
bingo = np.logical_or(bingo, hantei)
for i in range(3):
if all(bingo[i])... | [
"literal.number.integer.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 554,463 | 554,464 | u183657342 | python |
p02760 | import sys
A = [[0] * 3 for i in range(3)]
A1 = list(map(int, input().split()))
A2 = list(map(int, input().split()))
A3 = list(map(int, input().split()))
N = int(input())
for _ in range(N):
b = int(input())
if b in A1:
for a in [i for i, x in enumerate(A1) if x == b]:
A[0][a] = 1
if b... | import sys
A = [[0] * 3 for i in range(3)]
A1 = list(map(int, input().split()))
A2 = list(map(int, input().split()))
A3 = list(map(int, input().split()))
N = int(input())
for _ in range(N):
b = int(input())
if b in A1:
for a in [i for i, x in enumerate(A1) if x == b]:
A[0][a] = 1
if b... | [
"literal.number.integer.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 554,467 | 554,468 | u847758719 | python |
p02760 | a1 = list(map(int, input().split()))
a2 = list(map(int, input().split()))
a3 = list(map(int, input().split()))
al = a1+a2+a3
n =int(input())
for i in range(n):
b = int(input())
if b in al:
al[al.index()] = 0
if al[0] + al[1] + al[2] == 0 or al[3] + al[4] + al[5] == 0 or al[6] + al[7] + al[8] == 0 or a... | a1 = list(map(int, input().split()))
a2 = list(map(int, input().split()))
a3 = list(map(int, input().split()))
al = a1+a2+a3
n =int(input())
for i in range(n):
b = int(input())
if b in al:
al[al.index(b)] = 0
if al[0] + al[1] + al[2] == 0 or al[3] + al[4] + al[5] == 0 or al[6] + al[7] + al[8] == 0 or ... | [
"call.arguments.change"
] | 554,469 | 554,470 | u118760114 | python |
p02760 | a1 = list(map(int, input().split()))
a2 = list(map(int, input().split()))
a3 = list(map(int, input().split()))
al = a1+a2+a3
n =int(input())
for i in range(n):
b = int(input())
if b == al:
al[al.index()] = 0
if al[0] + al[1] + al[2] == 0 or al[3] + al[4] + al[5] == 0 or al[6] + al[7] + al[8] == 0 or a... | a1 = list(map(int, input().split()))
a2 = list(map(int, input().split()))
a3 = list(map(int, input().split()))
al = a1+a2+a3
n =int(input())
for i in range(n):
b = int(input())
if b in al:
al[al.index(b)] = 0
if al[0] + al[1] + al[2] == 0 or al[3] + al[4] + al[5] == 0 or al[6] + al[7] + al[8] == 0 or ... | [
"control_flow.branch.if.condition.change",
"call.arguments.change"
] | 554,471 | 554,470 | u118760114 | python |
p02760 | n = []
for i in range(3):
n.extend(list(map(int, input().split())))
m = int(input())
for i in range(m):
num = int(input())
if num in n: n[n.index(num)] = 0
check = "No"
for j in range(3):
if n[j + 0] == 0 and n[j + 3] == 0 and n[j + 6] == 0:
check = "Yes"
break
if n[j + 0] == 0 an... | n = []
for i in range(3):
n.extend(list(map(int, input().split())))
m = int(input())
for i in range(m):
num = int(input())
if num in n: n[n.index(num)] = 0
check = "No"
for j in range(3):
if n[j + 0] == 0 and n[j + 3] == 0 and n[j + 6] == 0:
check = "Yes"
break
if n[j * 3] == 0 an... | [
"control_flow.loop.for.condition.change",
"control_flow.branch.if.condition.change"
] | 554,480 | 554,481 | u908505367 | 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 n in range(N):
B.append(int(input()))
ans='No'
def judge(A, B):
for i in range(3):
if A[i] in B:
A[i] = 1
else:
A[i] = 0
judge(A1,... | A1 = list(map(int, input().split()))
A2 = list(map(int, input().split()))
A3 = list(map(int, input().split()))
N = int(input())
B = []
for n in range(N):
B.append(int(input()))
ans='No'
def judge(A, B):
for i in range(3):
if A[i] in B:
A[i] = 1
else:
A[i] = 0
judge(A1,... | [
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 554,484 | 554,485 | u523087093 | 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 n in range(N):
B.append(int(input()))
ans='No'
#判定式
def judge(A, B):
for i in range(3):
if A[i] in B:
A[i] = 1
else:
A[i] = 0
... | A1 = list(map(int, input().split()))
A2 = list(map(int, input().split()))
A3 = list(map(int, input().split()))
N = int(input())
B = []
for n in range(N):
B.append(int(input()))
ans='No'
def judge(A, B):
for i in range(3):
if A[i] in B:
A[i] = 1
else:
A[i] = 0
judge(A1,... | [
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 554,486 | 554,485 | u523087093 | python |
p02760 | a = [[0] * 3 for i in range(3)]
for i in range(3):
a[i] = list(map(int, input().split(' ')))
n = int(input())
for i in range(n):
b = int(input())
for r in range(3):
for c in range(3):
if a[r][c] == b:
a[r][c] = 0
a = np.array(a)
sum1 = a.sum(axis=0)
sum2 = a.sum(a... | import numpy as np
a = [[0] * 3 for i in range(3)]
for i in range(3):
a[i] = list(map(int, input().split(' ')))
n = int(input())
for i in range(n):
b = int(input())
for r in range(3):
for c in range(3):
if a[r][c] == b:
a[r][c] = 0
a = np.array(a)
sum1 = a.sum(ax... | [] | 554,493 | 554,494 | u864551836 | python |
p02760 | import sys
a=[]
for i in range(3):
a1,a2,a3=map(int,input().split())
a.append([a1,a2,a3])
check=[[0]*3 for i in range(3)]
n=int(input())
b=[]
for i in range(n):
b.append(int(input()))
for i in b:
for j in range(3):
if i in a[j]:
check[j][a[j].index(i)]=1
naname=[0]*3
for i in range(3):
if sum(a... | import sys
a=[]
for i in range(3):
a1,a2,a3=map(int,input().split())
a.append([a1,a2,a3])
check=[[0]*3 for i in range(3)]
n=int(input())
b=[]
for i in range(n):
b.append(int(input()))
for i in b:
for j in range(3):
if i in a[j]:
check[j][a[j].index(i)]=1
naname=[0]*3
for i in range(3):
if sum(c... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 554,495 | 554,496 | u527261492 | python |
p02760 | d=[list(map(int,input().split()))for i in range(3)]
row=int(input())
num=[int(input()) for j in range(row)]
bingo=0
for a in range(3):
if d[0][a] in num and d[1][a] in num and d[2][a] in num:
bingo=bingo+1
if d[a][0] in num and d[a][1] in num and d[a][2] in num:
bingo=bingo+1
if d[1][1] in num and d[2][2] i... | d=[list(map(int,input().split()))for i in range(3)]
row=int(input())
num=[int(input()) for j in range(row)]
bingo=0
for a in range(3):
if d[0][a] in num and d[1][a] in num and d[2][a] in num:
bingo=bingo+1
if d[a][0] in num and d[a][1] in num and d[a][2] in num:
bingo=bingo+1
if d[1][1] in num and d[2][2] i... | [
"literal.number.integer.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 554,503 | 554,504 | u692498898 | python |
p02760 | import numpy as np
A1 = list(map(int, input().split()));
A2 = list(map(int, input().split()));
A3 = list(map(int, input().split()));
N = int(input());
#Bの配列を作成
B = [];
for i in range(N):
b = int(input())
B.append(b);
#ビンゴの行列を作成
A = np.hstack([A1,A2,A3]);
for i in range(N):
for j in range(len(A)):
if B[i]... | import numpy as np
A1 = list(map(int, input().split()));
A2 = list(map(int, input().split()));
A3 = list(map(int, input().split()));
N = int(input());
#Bの配列を作成
B = [];
for i in range(N):
b = int(input())
B.append(b);
#ビンゴの行列を作成
A = np.hstack([A1,A2,A3]);
for i in range(N):
for j in range(len(A)):
if B[i]... | [
"literal.number.integer.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 554,509 | 554,510 | u508061226 | python |
p02760 | #!/usr/bin/env python3
def main():
*N, = map(int, open(0).read().split())
A = N[0:9]
N_number = N[9]
b = N[10:]
Ab_comm = set(A) & set(b)
A_rep = [0 if i in Ab_comm else i for i in A]
Ax=[]
Ay=[]
for i in range(0,3):
Ax.append(A_rep[i] + A_rep[i + 1] + A_rep[i + 2])
... | #!/usr/bin/env python3
def main():
*N, = map(int, open(0).read().split())
A = N[0:9]
N_number = N[9]
b = N[10:]
Ab_comm = set(A) & set(b)
A_rep = [0 if i in Ab_comm else i for i in A]
Ax=[]
Ay=[]
for i in range(0,3):
Ax.append(A_rep[3*i] + A_rep[3*i + 1] + A_rep[3*i + 2])
... | [
"expression.operation.binary.add"
] | 554,515 | 554,516 | u428891594 | python |
p02760 | a = [list(map(int,input().split())) for _ in range(3)]
n = int(input())
b = [int(input()) for _1 in range(n)]
for bingo in b:
for i in range(3):
for j in range(3):
if a[i][j] == bingo:
a[i][j] = 0
triple_pair =[a[0][t1]+a[1][t1]+a[2][t1] for t1 in range(3)] + [a[t2][0]+a[t2][1]+a... | a = [list(map(int,input().split())) for _ in range(3)]
n = int(input())
b = [int(input()) for _1 in range(n)]
for bingo in b:
for i in range(3):
for j in range(3):
if a[i][j] == bingo:
a[i][j] = 0
triple_pair =[a[0][t1]+a[1][t1]+a[2][t1] for t1 in range(3)] + [a[t2][0]+a[t2][1]+a... | [
"literal.number.integer.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 554,517 | 554,518 | u136843617 | python |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.