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 |
|---|---|---|---|---|---|---|---|
p02837 | import sys
N = int(input())
A = []
[A.append([]) for _ in range(N)]
for i in range(N):
for j in range(int(input())):
x , y = map(int,input().split())
A[i].append([x,y])
maxT = 0
for i in range(2**N -1):
ju = [0] * N
ind = 0
# trust
trust = 0
for b in reversed(str(bin(i))[2::... | import sys
N = int(input())
A = []
[A.append([]) for _ in range(N)]
for i in range(N):
for j in range(int(input())):
x , y = map(int,input().split())
A[i].append([x,y])
maxT = 0
for i in range(2**N ):
ju = [0] * N
ind = 0
trust = 0
for b in reversed(str(bin(i))[2::]):
if... | [
"expression.operation.binary.remove"
] | 641,450 | 641,451 | u192042624 | python |
p02837 | import itertools
n = int(input())
speak = [[] for _ in range(n)]
for i in range(n):
s = int(input())
for j in range(s):
a,b = map(int,input().split())
tal = (a-1,b)
speak[i].append(tal)
check = 0
b = [i for i in range(n)]
c = len(b)
b_pairs = []
for i in range(1,n+1):
b_pairs ... | import itertools
n = int(input())
speak = [[] for _ in range(n)]
for i in range(n):
s = int(input())
for j in range(s):
a,b = map(int,input().split())
tal = (a-1,b)
speak[i].append(tal)
check = 0
b = [i for i in range(n)]
c = len(b)
b_pairs = []
for i in range(1,n+1):
b_pairs ... | [
"control_flow.break.remove",
"control_flow.continue.add"
] | 641,454 | 641,455 | u346395915 | python |
p02837 | N=int(input())
g=[[-1]*N for _ in range(N)]
ans=0
for i in range(N):
A=int(input())
for _ in range(A):
x,y=map(int,input().split())
g[i][x-1]=y
for s in range(2**N):
flag=1
for i in range(N):
if (s>>i&1):
for j in range(N):
if g[i][j]!=-1 and (s>>j&1)=... | N=int(input())
g=[[-1]*N for _ in range(N)]
ans=0
for i in range(N):
A=int(input())
for _ in range(A):
x,y=map(int,input().split())
g[i][x-1]=y
for s in range(2**N):
flag=1
for i in range(N):
if (s>>i&1):
for j in range(N):
if g[i][j]!=-1 and (s>>j&1)!... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 641,459 | 641,460 | u265506056 | python |
p02837 | N=int(input())
g=[[-1]*N for _ in range(N)]
ans=0
for i in range(N):
A=int(input())
for _ in range(A):
x,y=map(int,input().split())
g[i][x-1]=y
for s in range(2**N):
flag=1
for i in range(N):
if (s>>i)==1:
for j in range(N):
if g[i][j]!=-1 and (s>>j)!=... | N=int(input())
g=[[-1]*N for _ in range(N)]
ans=0
for i in range(N):
A=int(input())
for _ in range(A):
x,y=map(int,input().split())
g[i][x-1]=y
for s in range(2**N):
flag=1
for i in range(N):
if (s>>i&1):
for j in range(N):
if g[i][j]!=-1 and (s>>j&1)!... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 641,461 | 641,462 | u265506056 | python |
p02837 | N=int(input())
g=[[-1]*N for _ in range(N)]
ans=0
for i in range(N):
A=int(input())
for _ in range(A):
x,y=map(int,input().split())
g[i][x-1]=y
for s in range(2**N):
flag=1
for i in range(N):
if (s>>i)==1:
for j in range(N):
if g[i][j]!=-1 and (s>>j&1)... | N=int(input())
g=[[-1]*N for _ in range(N)]
ans=0
for i in range(N):
A=int(input())
for _ in range(A):
x,y=map(int,input().split())
g[i][x-1]=y
for s in range(2**N):
flag=1
for i in range(N):
if (s>>i&1):
for j in range(N):
if g[i][j]!=-1 and (s>>j&1)!... | [
"control_flow.branch.if.condition.change"
] | 641,463 | 641,462 | u265506056 | python |
p02837 | n = int(input())
s =[[] for _ in range(n)]
for i in range(n):
a_tmp = int(input())
for _ in range(a_tmp):
x,y = map(int,input().split())
s[i].append([x,y])
#print(s)
mx = 2**n -1
def hantei(num):
flag=0
bi =[0 for _ in range(n)]
for j in range(n):
bi[j] = (num>>j)%2
... | n = int(input())
s =[[] for _ in range(n)]
for i in range(n):
a_tmp = int(input())
for _ in range(a_tmp):
x,y = map(int,input().split())
s[i].append([x,y])
#print(s)
mx = 2**n
def hantei(num):
flag=0
bi =[0 for _ in range(n)]
for j in range(n):
bi[j] = (num>>j)%2
... | [
"expression.operation.binary.remove"
] | 641,479 | 641,480 | u797572808 | python |
p02837 | def main():
N = int(input())
testimony = [[] for i in range(N)]
for i in range(N):
for j in range(int(input())):
x,y = map(int,input().split())
testimony[i].append([x,y])
ans = 0
for i in range(2**N):##証言について、2^N通り
for j in range(N):##N人について検証
... | def main():
N = int(input())
testimony = [[] for i in range(N)]
for i in range(N):
for j in range(int(input())):
x,y = map(int,input().split())
testimony[i].append([x-1,y])##0-indexに直す
ans = 0
for i in range(2**N):##証言について、2^N通り
for j in range(N):##N人について... | [
"expression.operation.binary.add"
] | 641,493 | 641,494 | u497952650 | python |
p02837 | import sys
input = sys.stdin.readline
N = int(input())
A = []
xy = []
ans = []
sm = 0
for _ in range(N):
temp = int(input())
A.append([temp, sm])
sm += temp
for _ in range(A[-1][0]):
xy.append(list(map(int, input().split())))
for i in range(2**N):
flag = True
binary = bin(i)[2:]
... | import sys
input = sys.stdin.readline
N = int(input())
A = []
xy = []
ans = []
sm = 0
for _ in range(N):
temp = int(input())
A.append([temp, sm])
sm += temp
for _ in range(A[-1][0]):
xy.append(list(map(int, input().split())))
for i in range(2**N):
flag = True
binary = bin(i)[2:]
i... | [
"expression.operation.binary.remove"
] | 641,505 | 641,506 | u047023156 | python |
p02837 | def bitcnt(n):
n=(n&0x55555555)+(n>>1&0x55555555)
n=(n&0x33333333)+(n>>2&0x33333333)
n=(n&0x0f0f0f0f)+(n>>4&0x0f0f0f0f)
n=(n&0x00ff00ff)+(n>>8&0x00ff00ff)
n=(n&0x0000ffff)+(n>>16&0x0000ffff)
return n
N = int(input())
xy = [[-1 for j in range(N)] for i in range(N)]
for i in range(N):
for j in range(int(inp... | def bitcnt(n):
n=(n&0x55555555)+(n>>1&0x55555555)
n=(n&0x33333333)+(n>>2&0x33333333)
n=(n&0x0f0f0f0f)+(n>>4&0x0f0f0f0f)
n=(n&0x00ff00ff)+(n>>8&0x00ff00ff)
n=(n&0x0000ffff)+(n>>16&0x0000ffff)
return n
N = int(input())
xy = [[-1 for j in range(N)] for i in range(N)]
for i in range(N):
for j in range(int(inp... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 641,527 | 641,528 | u804455323 | python |
p02837 | N = int(input())
evidences = [[] for _ in range(N)]
for i in range(N):
A = int(input())
for _ in range(A):
x, y = map(int, input().split())
evidences[i].append((x - 1, y))
ans=0
for i in range(N**2):
flag=True
for j in range(N):
if (i>>j)&1==0:
continue
for x... | N = int(input())
evidences = [[] for _ in range(N)]
for i in range(N):
A = int(input())
for _ in range(A):
x, y = map(int, input().split())
evidences[i].append((x - 1, y))
ans=0
for i in range(2**N):
flag=True
for j in range(N):
if (i>>j)&1==0:
continue
for x... | [
"expression.operation.binary.remove"
] | 641,550 | 641,551 | u970899068 | python |
p02837 | n=int(input())
Y=[]*n
for i in range(n):
Y.append([-1]*n)
for i in range(n):
for j in range(int(input())):
x,y=map(int,input().split())
Y[i][x-1]=y
ans=0
for c in range(2**n):
b=bin(c)[2:]
B=[0]*n
for i in range(len(b)):
B[i]=int(b[i])
a=0
for i in range(n):
... | n=int(input())
Y=[]*n
for i in range(n):
Y.append([-1]*n)
for i in range(n):
for j in range(int(input())):
x,y=map(int,input().split())
Y[i][x-1]=y
ans=0
for c in range(2**n):
b=bin(c)[2:]
B=[0]*n
for i in range(len(b)):
B[-i-1]=int(b[-i-1])
a=0
for i in range... | [
"expression.operation.unary.add",
"call.arguments.change"
] | 641,555 | 641,556 | u774539708 | python |
p02837 | #!/usr/bin/env python3
def put(a, k, v):
if k in a:
if a[k] != v:
return False
else:
a[k] = v
return True
def check(n, t, i):
a = {}
m = 0
for j in range(n):
honest = i >> j & 1
m += honest
if not put(a, j+1, honest):
return 0
... | #!/usr/bin/env python3
def put(a, k, v):
if k in a:
if a[k] != v:
return False
else:
a[k] = v
return True
def check(n, t, i):
a = {}
m = 0
for j in range(n):
honest = i >> j & 1
m += honest
if not put(a, j+1, honest):
return 0
... | [
"control_flow.branch.if.add"
] | 641,563 | 641,564 | u904608957 | python |
p02837 | n = int(input())
def func(x):
res = []
for i in range(n):
res.append(x%2)
x //= 2
return res
test = {}
for i in range(n):
A = int(input())
test[i+1] = []
for a in range(A):
x,y = map(int,input().split())
test[i].append((x,y))
ans = 0
for i in range(2**n):
people = func(i)
for i in ran... | n = int(input())
def func(x):
res = []
for i in range(n):
res.append(x%2)
x //= 2
return res
test = {}
for i in range(n):
A = int(input())
test[i+1] = []
for a in range(A):
x,y = map(int,input().split())
test[i+1].append((x,y))
ans = 0
for i in range(2**n):
people = func(i)
for i in r... | [
"expression.operation.binary.add"
] | 641,569 | 641,570 | u103902792 | python |
p02837 | # -*- coding: utf-8 -*-
################ DANGER ################
test = ""
#test = \
"""
3
2
2 1
3 0
2
3 1
1 0
2
1 1
2 0
ans 0
"""
"""
3
1
2 1
1
1 1
1
2 0
ans 2
"""
"""
2
1
2 0
1
1 0
ans 1
"""
########################################
test = list(reversed(test.strip().splitlines()))
if test:
def input2():
... | # -*- coding: utf-8 -*-
################ DANGER ################
test = ""
#test = \
"""
3
2
2 1
3 0
2
3 1
1 0
2
1 1
2 0
ans 0
"""
"""
3
1
2 1
1
1 1
1
2 0
ans 2
"""
"""
2
1
2 0
1
1 0
ans 1
"""
########################################
test = list(reversed(test.strip().splitlines()))
if test:
def input2():
... | [
"control_flow.loop.for.condition.change",
"control_flow.branch.if.condition.change"
] | 641,583 | 641,584 | u272075541 | python |
p02837 | n=int(input())
l=[0 for i in range(n)]
for i in range(n):
ka=int(input())
r,w=[],[]
for k in range(ka):
x,y=map(int,input().split())
r.append(x-1) if y else w.append(x-1)
l[i]=(set(r),set(w))
ans=0
for j in range(2**n):
v=format(j,"b").zfill(n)
R,W=set(),set()
RR={i for i in range(n) if v[i]=="1"}... | n=int(input())
l=[0 for i in range(n)]
for i in range(n):
ka=int(input())
r,w=[],[]
for k in range(ka):
x,y=map(int,input().split())
r.append(x-1) if y else w.append(x-1)
l[i]=(set(r),set(w))
ans=0
for j in range(2**n):
v=format(j,"b").zfill(n)
R,W=set(),set()
RR={t for t in range(n) if v[t]=="1"}... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.break.remove",
"control_flow.continue.add"
] | 641,589 | 641,590 | u896741788 | python |
p02837 | def main():
from collections import defaultdict
d = defaultdict(list)
n = int(input())
for i in range(n):
a = int(input())
for _ in range(a):
x, y = [int(x) for x in input().split()]
d[i].append((x-1, y))
ans = 0
from itertools import product
for ts i... | def main():
from collections import defaultdict
d = defaultdict(list)
n = int(input())
for i in range(n):
a = int(input())
for _ in range(a):
x, y = [int(x) for x in input().split()]
d[i].append((x-1, y))
ans = 0
from itertools import product
for ts i... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 641,591 | 641,592 | u185034753 | python |
p02837 | def main():
from collections import defaultdict
d = defaultdict(list)
n = int(input())
for i in range(n):
a = int(input())
for _ in range(a):
x, y = [int(x) for x in input().split()]
d[i].append((x, y))
ans = 0
from itertools import product
for ts in ... | def main():
from collections import defaultdict
d = defaultdict(list)
n = int(input())
for i in range(n):
a = int(input())
for _ in range(a):
x, y = [int(x) for x in input().split()]
d[i].append((x-1, y))
ans = 0
from itertools import product
for ts i... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 641,593 | 641,592 | u185034753 | python |
p02837 | n = int(input())
g = [[-1 for j in range(n)] for i in range(n)]
for i in range(n):
a = int(input())
for _ in range(a):
x, y = map(int, input().split())
g[i][x - 1] = y
ans = 0
for s in range(2**n):
ok = True
for i in range(n):
k = 0
if (s >> i & 1) == 1:
... | n = int(input())
g = [[-1 for j in range(n)] for i in range(n)]
for i in range(n):
a = int(input())
for _ in range(a):
x, y = map(int, input().split())
g[i][x - 1] = y
ans = 0
for s in range(2**n):
ok = True
k = 0
for i in range(n):
if (s >> i & 1) == 1:
... | [
"assignment.add",
"assignment.remove"
] | 641,594 | 641,595 | u276204978 | python |
p02837 | N = int(input())
A = [[-1 for i in range(N)] for i in range(N)]
for i in range(N):
m = int(input())
for i in range(m):
x,y = map(int,input().split())
A[i][x-1] = y
ans = 0
for i in range(1<<N):
honets = [0 for i in range(N)]
for j in range(N):
if (i>>j) & 1:
honets[j]... | N = int(input())
A = [[-1 for i in range(N)] for i in range(N)]
for i in range(N):
m = int(input())
for j in range(m):
x,y = map(int,input().split())
A[i][x-1] = y
#print(A)
ans = 0
for i in range(1<<N):
honets = [0 for i in range(N)]
for j in range(N):
if (i>>j) & 1:
... | [
"identifier.change"
] | 641,599 | 641,600 | u626217906 | python |
p02837 | N = int(input())
testimony = [[] for _ in range(N)]
ans = 0
for n in range(N):
A = int(input())
for _ in range(A):
x,y = map(int,input().split())
testimony[n].append([x-1,y]) # 人のナンバリングを0startにする
print(testimony)
for bit in range(2**N):
# print("bit",bit)
honest_cnt = 0
for j in rang... | N = int(input())
testimony = [[] for _ in range(N)]
ans = 0
for n in range(N):
A = int(input())
for _ in range(A):
x,y = map(int,input().split())
testimony[n].append([x-1,y]) # 人のナンバリングを0startにする
# print(testimony)
for bit in range(2**N):
# print("bit",bit)
honest_cnt = 0
for j in ra... | [
"call.remove"
] | 641,608 | 641,609 | u996665352 | python |
p02837 | N = int(input())
testimony = [[] for _ in range(N)]
ans = 0
for n in range(N):
A = int(input())
for _ in range(A):
x,y = map(int,input().split())
testimony[n].append([x-1,y]) # 人のナンバリングを0startにする
for bit in range(1<<n):
honest_cnt = 0
for j in range(N):
if (bit>>j) & 1:
... | N = int(input())
testimony = [[] for _ in range(N)]
ans = 0
for n in range(N):
A = int(input())
for _ in range(A):
x,y = map(int,input().split())
testimony[n].append([x-1,y]) # 人のナンバリングを0startにする
# print(testimony)
for bit in range(2**N):
# print("bit",bit)
honest_cnt = 0
for j in ra... | [] | 641,610 | 641,609 | u996665352 | python |
p02837 | import itertools
n=int(input())
g=[[-1 for _ in range(15)] for _ in range(15)]
for i in range(n):
a=int(input())
for j in range(a):
x,y=map(int,input().split())
g[i][x-1]=y
ans=0
for i in range(2**n):
honests = [0 for _ in range(n)]
for j in range(n):
if(i>>j)&1:
ho... | import itertools
n=int(input())
g=[[-1 for _ in range(15)] for _ in range(15)]
for i in range(n):
a=int(input())
for j in range(a):
x,y=map(int,input().split())
g[i][x-1]=y
ans=0
for i in range(2**n):
honests = [0 for _ in range(n)]
for j in range(n):
if(i>>j)&1:
ho... | [
"call.remove"
] | 641,611 | 641,612 | u032484849 | python |
p02837 | n = int(input())
A = []
ans = 0
for i in range(n):
x =int(input())
lists = [list(map(int,input().split())) for j in range(x)]
A.append(lists)
for i in range(2**n):
honesty = [0]*n
for j in range(n):
if (i>>j) & 1:
honesty[j] = 1
true = 1
for j in range(n):
if hon... | n = int(input())
A = []
ans = 0
for i in range(n):
x =int(input())
lists = [list(map(int,input().split())) for j in range(x)]
A.append(lists)
for i in range(2**n):
honesty = [0]*n
for j in range(n):
if (i>>j) & 1:
honesty[j] = 1
true = 1
for j in range(n):
if hon... | [
"call.remove"
] | 641,613 | 641,614 | u612223903 | python |
p02837 | n = int(input())
A = []
ans = 0
for i in range(n):
x =int(input())
lists = [list(map(int,input().split())) for j in range(x)]
A.append(lists)
for i in range(2**n):
honesty = [0]*n
for j in range(n):
if (i>>j) & 1:
honesty[j] = 1
true = 1
for j in range(n):
if hon... | n = int(input())
A = []
ans = 0
for i in range(n):
x =int(input())
lists = [list(map(int,input().split())) for j in range(x)]
A.append(lists)
for i in range(2**n):
honesty = [0]*n
for j in range(n):
if (i>>j) & 1:
honesty[j] = 1
true = 1
for j in range(n):
if hon... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"misc.opposites",
"expression.operator.compare.change"
] | 641,615 | 641,614 | u612223903 | python |
p02837 | import sys
input = sys.stdin.readline
n = int(input())
from collections import defaultdict
d = defaultdict(list)
for i in range(n):
a = int(input())
for _ in range(a):
x, y = [int(x) for x in input().split()]
d[i].append((x - 1, y))
ans = 0
for k in range(2**n):
res = 0
j = bin(k)[2:]... | import sys
input = sys.stdin.readline
n = int(input())
from collections import defaultdict
d = defaultdict(list)
for i in range(n):
a = int(input())
for _ in range(a):
x, y = [int(x) for x in input().split()]
d[i].append((x - 1, y))
ans = 0
for k in range(2**n):
res = 0
j = bin(k)[2:]... | [
"assignment.add",
"assignment.remove"
] | 641,619 | 641,620 | u609061751 | python |
p02837 | n = int(input())
lst = [[-1 for _ in range(n)] for __ in range(n)]
for i in range(n):
ai = int(input())
for j in range(ai):
hito, which = map(int, input().split())
lst[i][hito-1] = which
ans = 0
muri = 0
for i in range(2**n):
kumi = list(format(i, '0'+str(n)+'b'))
temp = 0
for j in ... | n = int(input())
lst = [[-1 for _ in range(n)] for __ in range(n)]
for i in range(n):
ai = int(input())
for j in range(ai):
hito, which = map(int, input().split())
lst[i][hito-1] = which
ans = 0
muri = 0
for i in range(2**n):
kumi = list(format(i, '0'+str(n)+'b'))
temp = 0
muri = 0
... | [
"assignment.add",
"assignment.remove"
] | 641,629 | 641,630 | u287132915 | python |
p02837 | N=int(input())
A=[[-1]*N for _ in range(N)]
for i in range(N):
a=int(input())
for j in range(a):
x,y=map(int, input().split())
A[j][x-1]=y
#正直者が正直者に不親切と言われていない
#→正直ものが不親切を正直者と言っていないか
ans=0
for i in range(2**N):
ok=True
for j in range(N):
if (i>>j&1)==1:
for k in range(N):
if A[j][k]!=... | N=int(input())
A=[[-1]*N for _ in range(N)]
for i in range(N):
a=int(input())
for j in range(a):
x,y=map(int, input().split())
A[i][x-1]=y
#正直者が正直者に不親切と言われていない
#→正直ものが不親切を正直者と言っていないか
ans=0
for i in range(2**N):
ok=True
for j in range(N):
if (i>>j&1)==1:
for k in range(N):
if A[j][k]!=... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 641,631 | 641,632 | u784022244 | python |
p02837 | N=int(input())
A=[[-1]*N for _ in range(N)]
for i in range(N):
a=int(input())
for j in range(a):
x,y=map(int, input().split())
A[a][x-1]=y
#正直者が正直者に不親切と言われていない
#→正直ものが不親切を正直者と言っていないか
ans=0
for i in range(2**N):
ok=True
for j in range(N):
if (i>>j&1)==1:
for k in range(N):
if A[j][k]!=... | N=int(input())
A=[[-1]*N for _ in range(N)]
for i in range(N):
a=int(input())
for j in range(a):
x,y=map(int, input().split())
A[i][x-1]=y
#正直者が正直者に不親切と言われていない
#→正直ものが不親切を正直者と言っていないか
ans=0
for i in range(2**N):
ok=True
for j in range(N):
if (i>>j&1)==1:
for k in range(N):
if A[j][k]!=... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 641,633 | 641,632 | u784022244 | python |
p02837 | N=int(input())
A=[[-1]*N for _ in range(N)]
for i in range(N):
a=int(input())
for j in range(a):
x,y=map(int, input().split())
A[a][x-1]=y
#正直者が正直者に不親切と言われていない
#→正直ものが不親切を正直者と言っていないか
ans=0
for i in range(2**N):
ok=True
for j in range(N):
if i>>j&1==1:
for k in range(N):
if A[j][k]!=-1... | N=int(input())
A=[[-1]*N for _ in range(N)]
for i in range(N):
a=int(input())
for j in range(a):
x,y=map(int, input().split())
A[i][x-1]=y
#正直者が正直者に不親切と言われていない
#→正直ものが不親切を正直者と言っていないか
ans=0
for i in range(2**N):
ok=True
for j in range(N):
if (i>>j&1)==1:
for k in range(N):
if A[j][k]!=... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"control_flow.break.remove"
] | 641,634 | 641,632 | u784022244 | python |
p02837 | N=int(input())
S=[[-1]*N for _ in range(N)]
for _ in range(N):
A=int(input())
for i in range(A):
x, y=map(int, input().split())
S[i][x-1]=y
ans=0
for s in range(2**N):
ok=True
for i in range(N):
#正直者について見ていく
if (s>>i&1)==1:
for j in range(N):
#それぞれ正直者の証言が矛盾ないか
if S[i][j... | N=int(input())
S=[[-1]*N for _ in range(N)]
for i in range(N):
A=int(input())
for _ in range(A):
x, y=map(int, input().split())
S[i][x-1]=y
ans=0
for s in range(2**N):
ok=True
for i in range(N):
#正直者について見ていく
if (s>>i&1)==1:
for j in range(N):
#それぞれ正直者の証言が矛盾ないか
if S[i][j... | [
"identifier.change"
] | 641,635 | 641,636 | u784022244 | python |
p02837 | N=int(input())
S=[[-1]*N for _ in range(N)]
for _ in range(N):
A=int(input())
for i in range(A):
x, y=map(int, input().split())
S[i][x-1]=y
ans=0
for s in range(2**N):
ok=True
for i in range(N):
#正直者について見ていく
if (s<<i&1)==1:
for j in range(N):
#それぞれ正直者の証言が矛盾ないか
if S[i][j... | N=int(input())
S=[[-1]*N for _ in range(N)]
for i in range(N):
A=int(input())
for _ in range(A):
x, y=map(int, input().split())
S[i][x-1]=y
ans=0
for s in range(2**N):
ok=True
for i in range(N):
#正直者について見ていく
if (s>>i&1)==1:
for j in range(N):
#それぞれ正直者の証言が矛盾ないか
if S[i][j... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 641,638 | 641,636 | u784022244 | python |
p02837 | n=int(input())
xy=[[]for _ in range(n)]
for i in range(n):
for j in range(int(input())):
xy[i].append(list(map(int,input().split())))
ans=0
for i in range(1,1<<n):
syojiki=[(i&(1<<j)!=0)+0 for j in range(n)]
flag=True
for j in range(n):
for x,y in xy[j]:
if syojiki[x-1]!=y^syojiki[j]^1:flag=False
... | n=int(input())
xy=[[]for _ in range(n)]
for i in range(n):
for j in range(int(input())):
xy[i].append(list(map(int,input().split())))
ans=0
for i in range(1,1<<n):
syojiki=[(i&(1<<j)!=0)+0 for j in range(n)]
flag=True
for j in range(n):
for x,y in xy[j]:
if syojiki[x-1]!=y and syojiki[j]==1:flag=F... | [
"control_flow.branch.if.condition.change"
] | 641,639 | 641,640 | u227082700 | python |
p02837 | #標準入力受け取り
N = int(input())
shougen = []
A_lis = []
for _ in range(N):
A = int(input())
A_lis.append(A)
minishougen = []
for j in range(A):
xy = list(map(int, input().split()))
minishougen.append(xy)
shougen.append(minishougen)
#ビットの配列作る
bit_lis = []
for i in range(2 ** N):
mini_... | #標準入力受け取り
N = int(input())
shougen = []
A_lis = []
for _ in range(N):
A = int(input())
A_lis.append(A)
minishougen = []
for j in range(A):
xy = list(map(int, input().split()))
minishougen.append(xy)
shougen.append(minishougen)
#ビットの配列作る
bit_lis = []
for i in range(2 ** N):
mini_... | [
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"control_flow.branch.if.condition.change"
] | 641,645 | 641,646 | u944643608 | python |
p02837 | N=int(input())
X=[]
Y=[]
for n in range(N):
A=int(input())
lx=[]
ly=[]
for m in range(A):
x,y=map(int,input().strip().split())
lx.append(x)
ly.append(y)
X.append(lx)
Y.append(ly)
def judge(l,X,Y):
honest=True
for n in range(N):
if l[n]==1:
... | N=int(input())
X=[]
Y=[]
for n in range(N):
A=int(input())
lx=[]
ly=[]
for m in range(A):
x,y=map(int,input().strip().split())
lx.append(x)
ly.append(y)
X.append(lx)
Y.append(ly)
def judge(l,X,Y):
honest=True
for n in range(N):
if l[n]==1:
... | [
"call.remove"
] | 641,647 | 641,648 | u613920660 | python |
p02837 | n=int(input())
talk=[]
for _ in range(n):
a=int(input())
sei=set([])
uso=set([])
for __ in range(a):
x,y=map(int,input().split())
if y==1:
sei.add(x-1)
else:
uso.add(x-1)
talk.append((sei,uso))
#print(talk)
result=0
for i in range(2**n):
#pr... | n=int(input())
talk=[]
for _ in range(n):
a=int(input())
sei=set([])
uso=set([])
for __ in range(a):
x,y=map(int,input().split())
if y==1:
sei.add(x-1)
else:
uso.add(x-1)
talk.append((sei,uso))
#print(talk)
result=0
for i in range(2**n):
fla... | [
"expression.operation.binary.remove"
] | 641,649 | 641,650 | u588794534 | python |
p02837 | from collections import deque
n = int(input())
lists = deque()
A = deque()
ans = 0
for _ in range(n):
a = int(input())
A.append(a)
tmp = [list(map(int, input().split())) for _ in range(a)]
lists.append(tmp)
for bit in range(1<<n):
flag = True
is_honest = [(bit>>i)&1 for i in range(n)]
prin... | from collections import deque
n = int(input())
lists = deque()
A = deque()
ans = 0
for _ in range(n):
a = int(input())
A.append(a)
tmp = [list(map(int, input().split())) for _ in range(a)]
lists.append(tmp)
for bit in range(1<<n):
flag = True
is_honest = [(bit>>i)&1 for i in range(n)]
for ... | [
"call.remove"
] | 641,651 | 641,652 | u323045245 | python |
p02837 | n = int(input())
A = []
X = []
for i in range(n):
a = int(input())
A.append(a)
lis = []
for j in range(a):
lis.append(list(map(int, input().split())))
X.append(lis)
ans = 0
for i in range(2 ** n):
H_lis = [0 for i in range(n)]
for j in range(n):
if ((i >> j) & 1):
... | n = int(input())
A = []
X = []
for i in range(n):
a = int(input())
A.append(a)
lis = []
for j in range(a):
lis.append(list(map(int, input().split())))
X.append(lis)
ans = 0
for i in range(2 ** n):
H_lis = [0 for i in range(n)]
for j in range(n):
if ((i >> j) & 1):
... | [
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 641,659 | 641,660 | u016302627 | python |
p02837 | n = int(input())
def popcount(x):
return bin(x).count('1')
g = [[-1 for j in range(n)] for i in range(n)]
for i in range(n):
a = int(input())
for j in range(a):
x, y = map(int, input().split())
x -= 1
g[x][y] = y
ans = 0
for i in range(1 << n):
d = [0 for _ in range(n)]
f... | n = int(input())
def popcount(x):
return bin(x).count('1')
g = [[-1 for j in range(n)] for i in range(n)]
for i in range(n):
a = int(input())
for j in range(a):
x, y = map(int, input().split())
x -= 1
g[i][x] = y
ans = 0
for i in range(1 << n):
d = [0 for _ in range(n)]
f... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 641,688 | 641,689 | u697101155 | python |
p02837 | def main():
N = int(input())
d = defaultdict(list)
for i in range(N):
n = int(input())
for _ in range(n):
d[i].append(list(map(int, input().split())))
max_trust_num = 0
# check all possible combinations of Honest or Unkind.
for i in range(2**N):
trust = True
... | from collections import defaultdict
def main():
N = int(input())
d = defaultdict(list)
for i in range(N):
n = int(input())
for _ in range(n):
d[i].append(list(map(int, input().split())))
max_trust_num = 0
# check all possible combinations of Honest or Unkind.
for i... | [] | 641,696 | 641,697 | u411353821 | python |
p02837 | import sys, math
from pprint import pprint
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int(input())
rl = lambda: list(map(int, input().split()))
mod = 10**9 + 7
N = ri()
A = []
for i in range(N):
a = []
for j in range(ri()):
x, y = rl()
a.append((x-1, y))
A.append(a)
def check(A, b):
... | import sys, math
from pprint import pprint
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int(input())
rl = lambda: list(map(int, input().split()))
mod = 10**9 + 7
N = ri()
A = []
for i in range(N):
a = []
for j in range(ri()):
x, y = rl()
a.append((x-1, y))
A.append(a)
def check(A, b):
... | [
"call.remove"
] | 641,698 | 641,699 | u596505843 | python |
p02837 | n = int(input())
honest = []
unkind = []
for _ in range(n):
a = int(input())
ho = []
un = []
for _ in range(a):
x, y = map(int, input().split())
if y == 1:
ho.append(x-1)
else:
un.append(y-1)
honest.append(ho)
unkind.append(un)
# 全探索
ans = []
for ... | n = int(input())
honest = []
unkind = []
for _ in range(n):
a = int(input())
ho = []
un = []
for _ in range(a):
x, y = map(int, input().split())
if y == 1:
ho.append(x-1)
else:
un.append(x-1)
honest.append(ho)
unkind.append(un)
# 全探索
ans = []
for ... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 641,700 | 641,701 | u070201429 | python |
p02837 | n = int(input())
#証言のリスト
l = [[-1] * n for i in range(n)]
for i in range(n):
a = int(input())
for j in range(a):
x, y = map(int, input().split())
#証言の記録
l[i][x-1] = y
ans = 0
for i in range(2**n):
Val = True
for j in range(n):
if (i >> j & 1) == 1: #iにおけるjビット目が、1であれ... | n = int(input())
#証言のリスト
l = [[-1] * n for i in range(n)]
for i in range(n):
a = int(input())
for j in range(a):
x, y = map(int, input().split())
#証言の記録
l[i][x-1] = y
ans = 0
for i in range(2**n):
Val = True
for j in range(n):
if (i >> j & 1) == 1: #iにおけるjビット目が、1であれ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 641,712 | 641,713 | u955125992 | python |
p02837 | n = int(input())
#証言のリスト
l = [[-1] * n for i in range(n)]
for i in range(n):
a = int(input())
for j in range(a):
x, y = map(int, input().split())
#証言の記録
l[i][x-1] = y
ans = 0
for i in range(2**n):
Val = True
for j in range(n):
if (i >> j & 1) == 1: #iにおけるjビット目が、1であれ... | n = int(input())
#証言のリスト
l = [[-1] * n for i in range(n)]
for i in range(n):
a = int(input())
for j in range(a):
x, y = map(int, input().split())
#証言の記録
l[i][x-1] = y
ans = 0
for i in range(2**n):
Val = True
for j in range(n):
if (i >> j & 1) == 1: #iにおけるjビット目が、1であれ... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"call.arguments.change",
"io.output.change"
] | 641,714 | 641,713 | u955125992 | python |
p02837 | n = int(input())
#証言のリスト
l = [[-1] * n for i in range(n)]
for i in range(n):
a = int(input())
for j in range(a):
x, y = map(int, input().split())
#証言の記録
l[i][x-1] = y
ans = 0
for i in range(2**n):
Val = True
for j in range(n):
if (i >> j & 1): #iにおけるjビット目が、1であれば
... | n = int(input())
#証言のリスト
l = [[-1] * n for i in range(n)]
for i in range(n):
a = int(input())
for j in range(a):
x, y = map(int, input().split())
#証言の記録
l[i][x-1] = y
ans = 0
for i in range(2**n):
Val = True
for j in range(n):
if (i >> j & 1) == 1: #iにおけるjビット目が、1であれ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"identifier.change"
] | 641,715 | 641,713 | u955125992 | python |
p02837 | n = int(input())
#証言のリスト
l = [[-1] * n for i in range(n)]
for i in range(n):
a = int(input())
for j in range(a):
x, y = map(int, input().split())
#証言の記録
l[i][x-1] = y
ans = 0
for i in range(2**n):
Val = True
for j in range(n):
if (i >> j & 1): #iにおけるjビット目が、1であれば
... | n = int(input())
#証言のリスト
l = [[-1] * n for i in range(n)]
for i in range(n):
a = int(input())
for j in range(a):
x, y = map(int, input().split())
#証言の記録
l[i][x-1] = y
ans = 0
for i in range(2**n):
Val = True
for j in range(n):
if (i >> j & 1) == 1: #iにおけるjビット目が、1であれ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 641,716 | 641,713 | u955125992 | python |
p02837 | n = int(input())
word = []
for i in range(n):
a = int(input())
l = [list(map(int,input().split())) for _ in range(a)]
word.append(l)
print(word)
ans = 0
for i in range(2**n):
flag = 0
count = 0
for j in range(n):
if ((i>>j)&1)==1 and flag==0:
for k,l in word[j]:
if ((i>>(k-1))&1) != l:
... | n = int(input())
word = []
for i in range(n):
a = int(input())
l = [list(map(int,input().split())) for _ in range(a)]
word.append(l)
ans = 0
for i in range(2**n):
flag = 0
count = 0
for j in range(n):
if ((i>>j)&1)==1 and flag==0:
for k,l in word[j]:
if ((i>>(k-1))&1) != l:
flag... | [
"call.remove"
] | 641,749 | 641,750 | u472696272 | python |
p02821 | from bisect import bisect_left
N, M = map(int, input().split())
A = list(map(int, input().split()))
A.sort()
def get_count(tot):
'''
tot以上を満たす幸福度の握手の個数を数える
'''
ret = 0
for i in range(N):
cnt = bisect_left(A, tot-A[i])
ret += N - cnt
return ret
# 右からの累積和
Asum = A[:]
for i in r... | from bisect import bisect_left
N, M = map(int, input().split())
A = list(map(int, input().split()))
A.sort()
def get_count(tot):
'''
tot以上を満たす幸福度の握手の個数を数える
'''
ret = 0
for i in range(N):
cnt = bisect_left(A, tot-A[i])
ret += N - cnt
return ret
# 右からの累積和
Asum = A[:]
for i in r... | [
"call.add"
] | 641,847 | 641,848 | u503228842 | python |
p02821 | def resolve():
import sys
def LI():
return list(map(int, sys.stdin.readline().rstrip().split())) # 空白あり
def S():
return sys.stdin.readline().rstrip()
N, M = map(int, S().split())
A = LI()
A.sort()
def f(n,x): # A[n]+A[i]>=x となる i の最小値
left = -1
right = N... | def resolve():
import sys
def LI():
return list(map(int, sys.stdin.readline().rstrip().split())) # 空白あり
def S():
return sys.stdin.readline().rstrip()
N, M = map(int, S().split())
A = LI()
A.sort()
def f(n,x): # A[n]+A[i]>=x となる i の最小値
left = -1
right = N... | [
"call.arguments.change"
] | 641,871 | 641,872 | u119148115 | python |
p02821 | import bisect
n, m = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
a_cum = [0 for _ in range(n+1)]
for i in range(n):
a_cum[i+1] = a_cum[i] + a[i]
l, r = 0, 10 ** 6
while r - l > 1:
x = (l + r) // 2
cnt = 0
for i in range(n):
idx = bisect.bisect_left(a, x-a[i])
... | import bisect
n, m = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
a_cum = [0 for _ in range(n+1)]
for i in range(n):
a_cum[i+1] = a_cum[i] + a[i]
l, r = 0, 10 ** 6
while r - l > 1:
x = (l + r) // 2
cnt = 0
for i in range(n):
idx = bisect.bisect_left(a, x-a[i])
... | [
"expression.operation.binary.change"
] | 641,908 | 641,909 | u139112865 | python |
p02821 | import sys; input = sys.stdin.buffer.readline
sys.setrecursionlimit(10**7)
from collections import defaultdict
import bisect
con = 10 ** 9 + 7; INF = float("inf")
def getlist():
return list(map(int, input().split()))
def Binary_Search(A, N, M):
#初期化
left = 0
right = 10 ** 7
ans = 0
#累積和
Asum = [0]
for i in r... | import sys; input = sys.stdin.buffer.readline
sys.setrecursionlimit(10**7)
from collections import defaultdict
import bisect
con = 10 ** 9 + 7; INF = float("inf")
def getlist():
return list(map(int, input().split()))
def Binary_Search(A, N, M):
#初期化
left = 0
right = 10 ** 7
ans = 0
#累積和
Asum = [0]
for i in r... | [
"expression.operation.unary.add",
"call.arguments.change"
] | 641,934 | 641,935 | u627417051 | python |
p02821 | import numpy as np
N,M,*A = map(int, open('0').read().split())
A = np.sort(A)
B = np.cumsum(np.concatenate([[0],A[::-1]]))
l = -1
r = 10**6
while l+1<r:
s = (l+r)//2
cnt = np.sum(N-np.searchsorted(A,s-A))
if cnt>=M:
l = s
else:
r = s
ind = np.searchsorted(A,r-A)
M -= np.sum(N-ind)
ans = np.sum(B[N-ind]+... | import numpy as np
N,M,*A = map(int, open(0).read().split())
A = np.sort(A)
B = np.cumsum(np.concatenate([[0],A[::-1]]))
l = -1
r = 10**6
while l+1<r:
s = (l+r)//2
cnt = np.sum(N-np.searchsorted(A,s-A))
if cnt>=M:
l = s
else:
r = s
ind = np.searchsorted(A,r-A)
M -= np.sum(N-ind)
ans = np.sum(B[N-ind]+A*... | [
"call.arguments.change"
] | 641,988 | 641,989 | u476604182 | python |
p02821 | from bisect import bisect_left
from itertools import accumulate
N,M,*A = map(int, open('0').read().split())
A.sort()
B = list(accumulate(A[::-1]))
l = -1
r = 10**9
while l+1<r:
s = (l+r)//2
cnt = 0
for c in A:
i = bisect_left(A,s-c)
cnt += N-i
if cnt>=M:
l = s
else:
r = s
ans = 0
for c in A:
... | from bisect import bisect_left
from itertools import accumulate
N,M,*A = map(int, open(0).read().split())
A.sort()
B = list(accumulate(A[::-1]))
l = -1
r = 10**6
while l+1<r:
s = (l+r)//2
cnt = 0
for c in A:
i = bisect_left(A,s-c)
cnt += N-i
if cnt>=M:
l = s
else:
r = s
ans = 0
for c in A:
i... | [
"call.arguments.change",
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 641,990 | 641,991 | u476604182 | python |
p02821 | from bisect import bisect_left
from itertools import accumulate
N,M,*A = map(int, open('0').read().split())
A.sort()
B = list(accumulate(A[::-1]))
l = -1
r = 10**9
while l+1<r:
s = (l+r)//2
cnt = 0
for c in A:
i = bisect_left(A,s-c)
cnt += N-i
if cnt>=M:
l = s
else:
r = s
ans = 0
for c in A:
... | from bisect import bisect_left
from itertools import accumulate
N,M,*A = map(int, open(0).read().split())
A.sort()
B = list(accumulate(A[::-1]))
l = -1
r = 10**9
while l+1<r:
s = (l+r)//2
cnt = 0
for c in A:
i = bisect_left(A,s-c)
cnt += N-i
if cnt>=M:
l = s
else:
r = s
ans = 0
for c in A:
i... | [
"call.arguments.change"
] | 641,990 | 641,992 | u476604182 | python |
p02821 | N, M = map(int, input().split())
A = [int(c) for c in input().split()]
A.sort(reverse=True)
B = A[::-1]
l = 0
r = 10**6
def f(m):
cnt = 0
j = 0
for i in range(N):
while j<N:
if A[i]+B[j]>=m:
cnt += N-j
break
j += 1
return cnt>=M
while l+1<r:
n = (l+r)//2
if f(n):
l = n
... | N, M = map(int, input().split())
A = [int(c) for c in input().split()]
A.sort(reverse=True)
B = A[::-1]
l = 0
r = 10**6
def f(m):
cnt = 0
j = 0
for i in range(N):
while j<N:
if A[i]+B[j]>=m:
cnt += N-j
break
j += 1
return cnt>=M
while l+1<r:
n = (l+r)//2
if f(n):
l = n
... | [
"call.remove"
] | 641,993 | 641,994 | u476604182 | python |
p02821 | N, M = map(int, input().split())
A = [int(c) for c in input().split()]
A.sort(reverse=True)
B = A[::-1]
l = 0
r = 10**6
def f(m):
cnt = 0
j = 0
for i in range(N):
while j<N:
if A[i]+B[j]>=m:
cnt += N-j
break
j += 1
return cnt>=M
while l+1<r:
n = (l+r)//2
if f(n):
l = n
... | N, M = map(int, input().split())
A = [int(c) for c in input().split()]
A.sort(reverse=True)
B = A[::-1]
l = 0
r = 10**6
def f(m):
cnt = 0
j = 0
for i in range(N):
while j<N:
if A[i]+B[j]>=m:
cnt += N-j
break
j += 1
return cnt>=M
while l+1<r:
n = (l+r)//2
if f(n):
l = n
... | [
"control_flow.break.add"
] | 641,995 | 641,994 | u476604182 | python |
p02837 | n = int(input())
a = [[-1for _ in range(n)]for _ in range(n)]
ans = 0
for i in range(n):
m = int(input())
for j in range(m):
x,y = map(int,input().split())
a[i][x-1] = y
for i in range(2**n):
#bit全探索
#d:正直者と仮定してる人
d = []
p = len(bin(i))
q = bin(i)
for j in range(p-2):
q = bin(i>>j)
if... | n = int(input())
a = [[-1for _ in range(n)]for _ in range(n)]
ans = 0
for i in range(n):
m = int(input())
for j in range(m):
x,y = map(int,input().split())
a[i][x-1] = y
for i in range(2**n):
#bit全探索
#d:正直者と仮定してる人
d = []
p = len(bin(i))
q = bin(i)
for j in range(p-2):
q = bin(i>>j)
if... | [
"call.remove"
] | 642,100 | 642,101 | u061071198 | python |
p02837 | from itertools import product
N = int(input())
c = product(range(2), repeat=N)
d = [[] for _ in range(N)]
for i in range(N):
A = int(input())
for _ in range(A):
x, y = map(int, input().split())
d[i].append((x, y))
ans = 0
for l in c:
o = [None]*N
is_conflict = False
for i, j in e... | from itertools import product
N = int(input())
c = product(range(2), repeat=N)
d = [[] for _ in range(N)]
for i in range(N):
A = int(input())
for _ in range(A):
x, y = map(int, input().split())
d[i].append((x, y))
ans = 0
for l in c:
o = [None]*N
is_conflict = False
for i, j in e... | [
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 642,102 | 642,103 | u690536347 | python |
p02837 | n = int(input())
List = [[0 for i in range(n)] for j in range(n)]
for i in range(n):
num_evidence = int(input())
for j in range(num_evidence):
darega, doushita = map(int,input().split())
List[i][darega - 1] = doushita * 2 - 1
# print(List)
def is_inconsistent(all_evidence, honest_or_unkind):
for i in ... | n = int(input())
List = [[0 for i in range(n)] for j in range(n)]
for i in range(n):
num_evidence = int(input())
for j in range(num_evidence):
darega, doushita = map(int,input().split())
List[i][darega - 1] = doushita * 2 - 1
def is_inconsistent(all_evidence, honest_or_unkind):
for i in range(n):
if ... | [
"expression.operation.binary.remove"
] | 642,119 | 642,120 | u930177016 | python |
p02837 | N = int(input())
D = [[-1]*N for i in range(N)]
for i in range(N):
A = int(input())
for j in range(A):
x,y = map(int,input().split())
D[i][x-1] = y
ans = 0
for i in range(2*N+1):
T = []
n = i
for j in range(N):
T.append(n%2)
n//=2
res = 1
for j in range(N):
... | N = int(input())
D = [[-1]*N for i in range(N)]
for i in range(N):
A = int(input())
for j in range(A):
x,y = map(int,input().split())
D[i][x-1] = y
ans = 0
for i in range(2**N):
T = []
n = i
for j in range(N):
T.append(n%2)
n//=2
res = 1
for j in range(N):
... | [
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.remove"
] | 642,144 | 642,143 | u350997995 | python |
p02837 | from collections import deque
N = int(input())
Tlist = deque([])
for i in range(N):
list = []
n = int(input())
if n != 0:
for i in range(n): #因数注意！
o = input()
m = o.split()
p = [int(j) for j in m] #1列の数列をリスト化
list.append(p)
Tlist.append(list)
... | from collections import deque
N = int(input())
Tlist = deque([])
for i in range(N):
list = []
n = int(input())
if n != 0:
for i in range(n): #因数注意！
o = input()
m = o.split()
p = [int(j) for j in m] #1列の数列をリスト化
list.append(p)
Tlist.append(list)
... | [
"call.remove"
] | 642,157 | 642,158 | u982944976 | python |
p02837 | N = int(input())
ary = [[-1] * N for i in range(N)]
for i in range(N):
for j in range(int(input())):
x, y = map(int, input().split())
ary[i][x - 1] = y
print(ary)
ret = 0
for a in range(2 ** N):
flg = True
for i in range(N):
if (a >> i & 1) == 1:
for j in range(N):
... | N = int(input())
ary = [[-1] * N for i in range(N)]
for i in range(N):
for j in range(int(input())):
x, y = map(int, input().split())
ary[i][x - 1] = y
ret = 0
for a in range(2 ** N):
flg = True
for i in range(N):
if (a >> i & 1) == 1:
for j in range(N):
... | [
"call.remove"
] | 642,163 | 642,164 | u987170100 | python |
p02837 | from collections import Counter
N = int(input())
ans = 0
evidence = [[] for n in range(N)]
for n in range(N):
A = int(input())
for a in range(A):
lis = list(map(int, input().split()))
evidence[n].append(lis)
for n in range(1 << N):
bits = [(n >> i) & 1 for i in range(N)]
boolean = True... | from collections import Counter
N = int(input())
ans = 0
evidence = [[] for n in range(N)]
for n in range(N):
A = int(input())
for a in range(A):
lis = list(map(int, input().split()))
evidence[n].append(lis)
for n in range(1 << N):
bits = [(n >> i) & 1 for i in range(N)]
flag = True
... | [
"assignment.add"
] | 642,178 | 642,179 | u196697332 | python |
p02837 | n = int(input())
xys = [[] for _ in range(n)]
for i in range(n):
a = int(input())
for j in range(a):
x, y = map(int, input().split())
xys[i].append((x-1, y))
ans = 0
for i in range(1<<n):
ok = True
for j in range(n):
# if jth person may be honest, verify testimony of him.
... | n = int(input())
xys = [[] for _ in range(n)]
for i in range(n):
a = int(input())
for j in range(a):
x, y = map(int, input().split())
xys[i].append((x-1, y))
ans = 0
for i in range(1<<n):
ok = True
for j in range(n):
# if jth person may be honest, verify testimony of him.
... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 642,180 | 642,181 | u382423941 | python |
p02837 | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
n = int(input())
mtx = []
for i in range(n):
a = int(input())
l = []
for j in range(a):
x,y = map(int, input().split())
l.append([x, y])
mtx.append(l)
def counter(sample):
if sample == 0:
return 0
else:
return (sam... | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
n = int(input())
mtx = []
for i in range(n):
a = int(input())
l = []
for j in range(a):
x,y = map(int, input().split())
l.append([x, y])
mtx.append(l)
def counter(sample):
if sample == 0:
return 0
else:
return coun... | [
"call.add",
"function.return_value.change"
] | 642,209 | 642,210 | u130492706 | python |
p02837 | N = int(input())
g = [[-1]*N for i in range(N)] #何も証言していないのを-1。i番目の人がj番目の人を正直ものといっているか、不親切といっているか、なにもいってないか。
for i in range(N):
A = int(input())
for i in range(A):
a,x = map(int, input().split())
a -= 1
g[i][a] = x
ans = 0
for i in range(1 << N):
d=[0]*N
for j in range(N):
... | N = int(input())
g = [[-1]*N for i in range(N)] #何も証言していないのを-1。i番目の人がj番目の人を正直ものといっているか、不親切といっているか、なにもいってないか。
for i in range(N):
A = int(input())
for j in range(A):
a,x = map(int, input().split())
a -= 1
g[i][a] = x
ans = 0
for i in range(1 << N):
d=[0]*N
for j in range(N):
... | [
"identifier.change"
] | 642,220 | 642,221 | u836939578 | python |
p02837 | N = int(input())
data = []
for _ in range(N):
A = int(input())
items = []
for __ in range(A):
x, y = map(int, input().split())
items.append((x - 1, y))
data.append(items)
best = 0
def check(i):
for j in range(N):
if ((i >> j) & 1) == 1:
for x, y in data[j]:
... | N = int(input())
data = []
for _ in range(N):
A = int(input())
items = []
for __ in range(A):
x, y = map(int, input().split())
items.append((x - 1, y))
data.append(items)
best = 0
def check(i):
for j in range(N):
if ((i >> j) & 1) == 1:
for x, y in data[j]:
... | [
"expression.operation.binary.remove"
] | 642,243 | 642,244 | u684305751 | python |
p02837 | import sys
def main():
N = int(input())
statement = [[] for i in range(N)]
for i in range(N):
message = int(input())
for j in range(message):
num, tmp = map(int, input().split())
if tmp == 1:
TF = True
else:
TF = False
... | import sys
def main():
N = int(input())
statement = [[] for i in range(N)]
for i in range(N):
message = int(input())
for j in range(message):
num, tmp = map(int, input().split())
if tmp == 1:
TF = True
else:
TF = False
... | [
"call.arguments.change"
] | 642,251 | 642,252 | u237362582 | python |
p02837 | # -*- coding: utf-8 -*-
from itertools import combinations
n = int(input())
al = []
for _ in range(n):
a = int(input())
xy = [list(map(int, input().split())) for _ in range(a)]
al.append(xy)
res = 0
for i in range(1,n+1):
for c in combinations(range(n), i):
flag = True
for X in c:
... | # -*- coding: utf-8 -*-
from itertools import combinations
n = int(input())
al = []
for _ in range(n):
a = int(input())
xy = [list(map(int, input().split())) for _ in range(a)]
al.append(xy)
res = 0
for i in range(1,n+1):
for c in combinations(range(n), i):
flag = True
for X in c:
... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 642,253 | 642,254 | u620868411 | python |
p02837 | N = int(input())
A = [] #どこからどこまでがiさんの証言かN×2の配列
tes = []#証言を入れていく
pro_sta = []#過程の状態
tes_count = 0
suc_flag = 1 #矛盾が生じてなければ1
max_honest = 0
# 入力受け取り
for i in range(N):
a = int(input())
A.append([tes_count,tes_count + a])
tes_count += a
for k in range(a):
x,y = list(map(int,input().split()))
... | N = int(input())
A = [] #どこからどこまでがiさんの証言かN×2の配列
tes = []#証言を入れていく
pro_sta = []#過程の状態
tes_count = 0
suc_flag = 1 #矛盾が生じてなければ1
max_honest = 0
# 入力受け取り
for i in range(N):
a = int(input())
A.append([tes_count,tes_count + a])
tes_count += a
for k in range(a):
x,y = list(map(int,input().split()))
... | [
"expression.operation.binary.remove"
] | 642,264 | 642,265 | u190909444 | python |
p02837 | n=int(input())
X=[]
Y=[]
A=[0]*n
for i in range(n):
A[i]=int(input())
a=A[i]
x=[0]*a
y=[0]*a
for j in range(a):
x[j],y[j]=[int(s) for s in input().split()]
X.append(x)
Y.append(y)
s=0
for i in range(2**n):
c=0
d=0
B=[0]*n
for j in range(n):
if((i >> j) & 1):
c=c+1
B[j]=1
f... | n=int(input())
X=[]
Y=[]
A=[0]*n
for i in range(n):
A[i]=int(input())
a=A[i]
x=[0]*a
y=[0]*a
for j in range(a):
x[j],y[j]=[int(s) for s in input().split()]
X.append(x)
Y.append(y)
s=0
for i in range(2**n):
c=0
d=0
B=[0]*n
for j in range(n):
if((i >> j) & 1):
c=c+1
B[j]=1
f... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 642,278 | 642,279 | u151305655 | python |
p02837 | n=int(input())
a=[[] for i in range(n)]
for i in range(n):
c=int(input())
for j in range(c):
x,y = map(int, input().split())
a[i].append([x,y])
from itertools import permutations, combinations,combinations_with_replacement,product
ans3 = 0
for ans in product([0,1],repeat=n):
flag = True
... | n=int(input())
a=[[] for i in range(n)]
for i in range(n):
c=int(input())
for j in range(c):
x,y = map(int, input().split())
a[i].append([x,y])
from itertools import permutations, combinations,combinations_with_replacement,product
ans3 = 0
for ans in product([0,1],repeat=n):
flag = True
... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 642,282 | 642,283 | u064408584 | python |
p02837 | n = int(input())
a = []
xy = [[] for i in range(n)]
for i in range(n):
a.append(int(input()))
for j in range(a[i]):
x,y = map(int,input().split())
xy[i].append([x-1,y])
print(xy)
ans = 0
for i in range(1<<(n)):
memo = []
cnt = 0
for j in range(n):
if ((i>>j)&1):
... | n = int(input())
a = []
xy = [[] for i in range(n)]
for i in range(n):
a.append(int(input()))
for j in range(a[i]):
x,y = map(int,input().split())
xy[i].append([x-1,y])
ans = 0
for i in range(1<<(n)):
memo = []
cnt = 0
for j in range(n):
if ((i>>j)&1):
memo.ap... | [
"call.remove"
] | 642,296 | 642,297 | u626468554 | python |
p02837 | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
N = int(input())
L = [[-1 for j in range(N)] for i in range(N)]
for i in range(N):
A = int(input())
for j in range(A):
x, y = map(int, input().split())
L[i][x-1] = y
ans = 0
for i in range(2**(N)):
if len(str(bin(i))[2... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
N = int(input())
L = [[-1 for j in range(N)] for i in range(N)]
for i in range(N):
A = int(input())
for j in range(A):
x, y = map(int, input().split())
L[i][x-1] = y
ans = 0
for i in range(2**(N)):
if len(str(bin(i))[2... | [
"control_flow.continue.remove",
"control_flow.pass.add"
] | 642,333 | 642,334 | u741397536 | python |
p02837 | N = int(input())
L = []
candidates = [list(bin(i)[2:].zfill(N)) for i in range(2**N - 1)]
for i in range(N):
A = int(input())
said = [list(map(int,input().split())) for i in range(A)]
L.append(said)
ans = 0
for pattern in candidates:
tmp = 0
flag = 1
for j in range(N): #pattern内全て
if p... | N = int(input())
L = []
candidates = [list(bin(i)[2:].zfill(N)) for i in range(2**N)]
for i in range(N):
A = int(input())
said = [list(map(int,input().split())) for i in range(A)]
L.append(said)
ans = 0
for pattern in candidates:
tmp = 0
flag = 1
for j in range(N): #pattern内全て
if patte... | [
"expression.operation.binary.remove"
] | 642,340 | 642,341 | u729627789 | python |
p02837 | import copy
N = int(input())
X = []
for i in range(N):
A = int(input())
X.append([])
for _ in range(A):
X[i].append(list(map(int, input().split())))
print(X)
def rec(condition, i):
if i==N:
return condition.count(1)
_X = X[i]
_condition = copy.copy(condition)
through_condition = copy.copy(condi... | import copy
N = int(input())
X = []
for i in range(N):
A = int(input())
X.append([])
for _ in range(A):
X[i].append(list(map(int, input().split())))
def rec(condition, i):
if i==N:
return condition.count(1)
_X = X[i]
_condition = copy.copy(condition)
through_condition = copy.copy(condition)
th... | [
"call.remove"
] | 642,344 | 642,345 | u077075933 | python |
p02837 | def main():
# input
n = int(input())
li = []
for i in range(n):
a = int(input())
dic = {}
for j in range(a):
x, y = map(int, input().split())
dic[x] = y
li.append(dic)
print(li)
# calc
ans = 0
flag = False
for num in range(1, ... | def main():
# input
n = int(input())
li = []
for i in range(n):
a = int(input())
dic = {}
for j in range(a):
x, y = map(int, input().split())
dic[x] = y
li.append(dic)
# print(li)
# calc
ans = 0
flag = False
for num in range(1... | [
"call.remove"
] | 642,359 | 642,360 | u086716588 | python |
p02837 | N = int(input())
A = [0] * N
data = [[] for _ in range(N)]
for i in range(N):
A[i] = int(input())
for j in range(A[i]):
new = list(map(int,input().split()))
new[0] -= 1
data[i].append(new)
m = -1
for n in range(2**N):
nn = n
cur = [0] * N
for i in range(N):
cur[i] = ... | N = int(input())
A = [0] * N
data = [[] for _ in range(N)]
for i in range(N):
A[i] = int(input())
for j in range(A[i]):
new = list(map(int,input().split()))
new[0] -= 1
data[i].append(new)
m = -1
for n in range(2**N):
nn = n
cur = [0] * N
for i in range(N):
cur[i] = ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.break.remove",
"control_flow.continue.add"
] | 642,363 | 642,364 | u512007680 | python |
p02837 | import copy
N = int(input())
A = []
xy=[]
for i in range(N):
A.append(int(input()))
xy.append([])
for j in range(A[-1]):
xy[-1].append([int(x) for x in input().split()])
#print(xy)
tr = [[]]
for i in range(N):
tr[0].append(-1)
#print(tr)
for i in range(len(xy)):
for j in xy[i]:
... | import copy
N = int(input())
A = []
xy=[]
for i in range(N):
A.append(int(input()))
xy.append([])
for j in range(A[-1]):
xy[-1].append([int(x) for x in input().split()])
#print(xy)
tr = [[]]
for i in range(N):
tr[0].append(-1)
#print(tr)
for i in range(len(xy)):
for j in xy[i]:
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 642,371 | 642,372 | u917363866 | python |
p02837 | def check_valid(flag):
for i, m in mentions.items():
if not (flag & (1 << i)):
continue
for j, honest in m.items():
if honest and flag & (1 << j):
continue
if not honest and not (flag & (1 << j)):
continue
return False
... | def check_valid(flag):
for i, m in mentions.items():
if not (flag & (1 << i)):
continue
for j, honest in m.items():
if honest and flag & (1 << j):
continue
if not honest and not (flag & (1 << j)):
continue
return False
... | [
"call.arguments.add"
] | 642,373 | 642,374 | u170839742 | python |
p02837 | import sys
input = sys.stdin.buffer.readline
def main():
N = int(input())
# S = input().rstrip()
mS = [[] for _ in [0,]*(N+1)]
for i in range(N):
Ai = int(input())
for j in range(Ai):
x, y = map(int, input().split())
mS[i+1].append((x,y))
# T1, T2 = map(int,... | import sys
input = sys.stdin.buffer.readline
def main():
N = int(input())
# S = input().rstrip()
mS = [[] for _ in [0,]*(N+1)]
for i in range(N):
Ai = int(input())
for j in range(Ai):
x, y = map(int, input().split())
mS[i+1].append((x,y))
# T1, T2 = map(int,... | [
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"assignment.variable.change"
] | 642,377 | 642,378 | u557168336 | python |
p02837 | import sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
mod = 10**9+7
Max = sys.maxsize
def l(): #intのlist
return list(map(int,input().split()))
def m(): #複数文字
return map(int,input().split())
def onem(): #Nとかの取得
return int(input())
def s(x): #圧縮
a = []
aa = x[0]
su = 1
for i ... | import sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
mod = 10**9+7
Max = sys.maxsize
def l(): #intのlist
return list(map(int,input().split()))
def m(): #複数文字
return map(int,input().split())
def onem(): #Nとかの取得
return int(input())
def s(x): #圧縮
a = []
aa = x[0]
su = 1
for i ... | [
"expression.operation.binary.remove"
] | 642,391 | 642,392 | u807772568 | python |
p02837 | n = int(input())
g = [[-1 for j in range(n)] for i in range(n)]
for i in range(n):
for _ in range(int(input())):
x,y = map(int,input().split())
q[i][x-1] = y
ans = 0
for s in range(2**n):
ok = True
for i in range(n):
if (s>>i&1) == 1:
for j in range(n):
... | n = int(input())
g = [[-1 for j in range(n)] for i in range(n)]
for i in range(n):
for _ in range(int(input())):
x,y = map(int,input().split())
g[i][x-1] = y
ans = 0
for s in range(2**n):
ok = True
for i in range(n):
if (s>>i&1) == 1:
for j in range(n):
... | [
"assignment.variable.change",
"identifier.change",
"assignment.value.change",
"call.arguments.change"
] | 642,422 | 642,423 | u580093517 | python |
p02837 | n=int(input())
a=[]
for i in range(n):
m=int(input())
a.append(list(list(map(int,input().split())) for j in range(m)))
print(a)
ans=0
for i in range(2**n):
r=1
ib=list(format(i,"b").zfill(n))
for j in range(n):
if ib[j]=="1":
for k in range(len(a[j])):
if int(ib[a... | n=int(input())
a=[]
for i in range(n):
m=int(input())
a.append(list(list(map(int,input().split())) for i in range(m)))
ans=0
for i in range(2**n):
r=1
ib=list(format(i,"b").zfill(n))
for j in range(n):
if ib[j]=="1":
for k in range(len(a[j])):
if int(ib[a[j][k][0... | [
"identifier.change",
"call.arguments.change",
"call.remove"
] | 642,443 | 642,444 | u121921603 | python |
p02837 | n = int(input())
xy = []
for _ in range(n):
a = int(input())
xy.append([list(map(int, input().split())) for _ in range(a)])
ans = 0
for i in range(2**n):
pat = []
for j in range(n):
pat.append((i>>j)%2)
check = True
for j in range(n):
if pat[j]:
for z in xy[j]:
... | n = int(input())
xy = []
for _ in range(n):
a = int(input())
xy.append([list(map(int, input().split())) for _ in range(a)])
ans = 0
for i in range(2**n):
pat = []
for j in range(n):
pat.append((i>>j)%2)
check = True
for j in range(n):
if pat[j]:
for z in xy[j]:
... | [
"call.remove"
] | 642,451 | 642,452 | u601384736 | python |
p02837 | n=int(input())
a=[[list(map(int,input().split()))for _ in'_'*int(input())]for _ in'_'*n]
m=0
for i in range(2**n):
*s,=map(int,bin(i)[2:].zfill(n))
f=1
for j,t in enumerate(a):
g=s[~j]^1
for x,y in t:f&=s[-x]==y^g
m=max(m,sum(s)*f)
print(m) | n=int(input())
a=[[list(map(int,input().split()))for _ in'_'*int(input())]for _ in'_'*n]
m=0
for i in range(2**n):
*s,=map(int,bin(i)[2:].zfill(n))
f=1
for j,t in enumerate(a):
if s[~j]:
for x,y in t:f&=s[-x]==y
m=max(m,sum(s)*f)
print(m) | [
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 642,453 | 642,454 | u729133443 | python |
p02837 | import math
def inputIntList():
return [int(s) for s in input().split()]
def inputInt():
return int(input())
def main():
N = inputInt()
A = [[] for _ in range(N)]
for i in range(N):
for _ in range(inputInt()):
A[i].append(inputIntList())
ret = 0
for i in range(2 ** ... | import math
def inputIntList():
return [int(s) for s in input().split()]
def inputInt():
return int(input())
def main():
N = inputInt()
A = [[] for _ in range(N)]
for i in range(N):
for _ in range(inputInt()):
A[i].append(inputIntList())
ret = 0
for i in range(2 ** ... | [
"control_flow.continue.add",
"control_flow.break.add"
] | 642,456 | 642,457 | u343128979 | python |
p02837 | N = int(input())
xy = [[] for _ in range(N)]
for i in range(N):
A = int(input())
for j in range(A):
xy_ = tuple(map(int,input().split()))
xy[i].append(xy_)
bN = 2**N
ans = 0
for b in range(bN):
for n in range(N):
if (b >> n) & 1:
for x,y in xy[n]:
if y !=... | N = int(input())
xy = [[] for _ in range(N)]
for i in range(N):
A = int(input())
for j in range(A):
xy_ = tuple(map(int,input().split()))
xy[i].append(xy_)
bN = 2**N
ans = 0
for b in range(bN):
for n in range(N):
if (b >> n) & 1:
for x,y in xy[n]:
if y !=... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 642,460 | 642,461 | u864013199 | python |
p02837 | n = int(input())
XY = []
ans = 0
for i in range(n):
a = int(input())
XY.append([])
for j in range(a):
XY[i].append(list(map(int,input().split())))
for i in range(2**n):
i = format(i, 'b')
i = i.zfill(n)
temp = i.count("1")
temp2 = 0
print(i)
for j in range(n):
if i[j] == "1":
for k in ra... | n = int(input())
XY = []
ans = 0
for i in range(n):
a = int(input())
XY.append([])
for j in range(a):
XY[i].append(list(map(int,input().split())))
for i in range(2**n):
i = format(i, 'b')
i = i.zfill(n)
temp = i.count("1")
temp2 = 0
for j in range(n):
if i[j] == "1":
for k in range(len(XY[... | [
"call.remove"
] | 642,465 | 642,466 | u535236942 | python |
p02837 | N = int(input())
E = []
for n in range(N):
A = int(input())
for _ in range(A):
x, y = list(map(int, input().split()))
E.append((n, x - 1, y))
ans = 0
for k in range((1 << N) - 1, -1, -1):
status = [(k >> i) & 1 for i in range(N)]
no_paradox = True
for Xa, Xb, yb in E:
if (sta... | N = int(input())
E = []
for n in range(N):
A = int(input())
for _ in range(A):
x, y = list(map(int, input().split()))
E.append((n, x - 1, y))
ans = 0
for k in range((1 << N) - 1, -1, -1):
status = [(k >> i) & 1 for i in range(N)]
no_paradox = True
for Xa, Xb, yb in E:
if (sta... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 642,472 | 642,473 | u546104065 | python |
p02837 | N = int(input())
L = []
for i in range(N):
A = int(input())
LA = []
for j in range(A):
LA.append(list(map(int,input().split())))
L.append(LA)
from itertools import product
LL = list(product(range(2), repeat=N))
cnt = 0
for i in LL:
flg = True
for j in range(len(L)):
#jの情報は、(hito=x, singi = y=1,0)
... | N = int(input())
L = []
for i in range(N):
A = int(input())
LA = []
for j in range(A):
LA.append(list(map(int,input().split())))
L.append(LA)
from itertools import product
LL = list(product(range(2), repeat=N))
cnt = 0
for i in LL:
flg = True
for j in range(len(L)):
#jの情報は、(hito=x, singi = y=1,0)
... | [
"literal.number.integer.change",
"control_flow.branch.if.condition.change",
"misc.opposites",
"expression.operator.compare.change"
] | 642,474 | 642,475 | u113971909 | python |
p02837 | N = int(input())
T = []
for i in range(N):
A = int(input())
for j in range(A):
x,y = map(int,input().split())
T.append([i,x-1,y==1])
ans = 0
for i in range(1<<N):
h=[]
for j in range(N):
if(i&(1<<(j+1))):
h.append(j)
for j,x,y in T:
if(j in h):
... | N = int(input())
T = []
for i in range(N):
A = int(input())
for j in range(A):
x,y = map(int,input().split())
T.append([i,x-1,y==1])
ans = 0
for i in range(1<<N):
h=[]
for j in range(N):
if(i&(1<<j)):
h.append(j)
for j,x,y in T:
if(j in h):
i... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 642,498 | 642,499 | u118642796 | python |
p02838 | n=int(input())
A=list(map(int,input().split()))
ans=0
for d in range(60):
n_1 = 0
for a in A:
if (a>>d)&1 == 1:
n_1 += 1
n_0 = n-n_1
ans += n_0*n_1
ans %= 10**9+7
print(ans) | n=int(input())
A=list(map(int,input().split()))
ans=0
for d in range(61):
n_1 = 0
for a in A:
if (a>>d)&1 == 1:
n_1 += 1
n_0 = n - n_1
ans += n_0*n_1 * 2**d
ans %= 10**9+7
print(ans) | [
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 642,560 | 642,561 | u474202990 | python |
p02838 | n=int(input())
l=[int(c) for c in input().spilt()]
ans=0
mod=10**9+7
for i in range(60):
s=sum(a>>i&1 for a in l)
ans+=s*(n-s)<<i%mod
ans%=mod
print(ans)
| n=int(input())
l=[int(c) for c in input().split()]
ans=0
mod=10**9+7
for i in range(60):
s=sum(a>>i&1 for a in l)
ans+=s*(n-s)<<i%mod
ans%=mod
print(ans)
| [
"assignment.value.change",
"identifier.change"
] | 642,566 | 642,567 | u896741788 | python |
p02838 | n=int(input())
l=[int(c) for c in input().splt()]
ans=0
mod=10**9+7
for i in range(60):
s=sum(a>>i&1 for a in l)
ans+=s*(n-s)<<i%mod
ans%=mod
print(ans) | n=int(input())
l=[int(c) for c in input().split()]
ans=0
mod=10**9+7
for i in range(60):
s=sum(a>>i&1 for a in l)
ans+=s*(n-s)<<i%mod
ans%=mod
print(ans)
| [
"assignment.value.change",
"identifier.change"
] | 642,568 | 642,567 | u896741788 | python |
p02838 | import numpy as np
N=int(input())
A=np.array([int(x) for x in input().split()])
ans=0
M=pow(10,9)+7
for i in range(100):
one=np.sum((A>>i)&1)
zero=N-one
ans+=(one*zero)*pow(2,i)
ans%=M
#print(one,zero)
print(int(ans)) | import numpy as np
N=int(input())
A=np.array([int(x) for x in input().split()])
ans=0
M=pow(10,9)+7
for i in range(100):
one=int(np.sum((A>>i)&1))
zero=N-one
ans+=(one*zero)*pow(2,i)
ans%=M
#print(one,zero)
print(ans) | [
"call.add",
"call.arguments.change",
"call.remove"
] | 642,616 | 642,615 | u539367121 | python |
p02838 | import numpy as np
N=int(input())
A=np.array([int(x) for x in input().split()])
ans=0
M=pow(10,9)+7
for i in range(100):
one=np.sum((A>>i)&1)
zero=N-one
ans+=(one*zero)*pow(2,i)
ans%=M
#print(one,zero)
print(ans) | import numpy as np
N=int(input())
A=np.array([int(x) for x in input().split()])
ans=0
M=pow(10,9)+7
for i in range(100):
one=int(np.sum((A>>i)&1))
zero=N-one
ans+=(one*zero)*pow(2,i)
ans%=M
#print(one,zero)
print(ans) | [
"call.add",
"call.arguments.change"
] | 642,617 | 642,615 | u539367121 | python |
p02838 | import numpy as np
N=int(input())
A=np.array([int(x) for x in input().split()])
ans=0
M=pow(10,9)+7
for i in range(100):
one=np.sum((A>>i)&1)
zero=N-one
ans+=(one*zero)*pow(2,i)
ans%=M
#print(one,zero)
print(ans) | import numpy as np
N=int(input())
A=np.array([int(x) for x in input().split()])
ans=0
M=pow(10,9)+7
for i in range(100):
one=int(np.sum((A>>i)&1))
zero=N-one
ans+=(one*zero)*pow(2,i,M)
ans%=M
#print(one,zero)
print(ans) | [
"call.add",
"call.arguments.change",
"call.arguments.add"
] | 642,617 | 642,618 | u539367121 | python |
p02838 | #!/usr/bin/env python3
#ABC147 D
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(1000000)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from col... | #!/usr/bin/env python3
#ABC147 D
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(1000000)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from col... | [
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 642,664 | 642,665 | u191874006 | python |
p02836 | S = str(input())
s = [i for i in range(int(len(S) / 2)) if S[i] != S[-i]]
print(len(s)) | S = str(input())
s = [i for i in range(int(len(S) / 2)) if S[i] != S[-i - 1]]
print(len(s)) | [
"assignment.change"
] | 642,681 | 642,682 | u674736819 | python |
p02836 | a=input()
n=len(a)
li=list(a)
b=0
for k in range(0,n//2-1):
if not li[k]==li[n-1-k]:
b=b+1
print(b)
| a=input()
n=len(a)
li=list(a)
b=0
for k in range(0,n//2):
if not li[k]==li[n-1-k]:
b=b+1
print(b)
| [
"expression.operation.binary.remove"
] | 642,683 | 642,684 | u608726540 | python |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.