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 9
values |
|---|---|---|---|---|---|---|---|
p02838 | """
def solve(string):
n, *a = map(int, string.split())
a = ("{:060b}".format(_a) for _a in a)
m, ans = 10**9 + 7, 0
for s in map(lambda x: x.count("1"), zip(*a)):
ans <<= 1
ans += s * (n - s)
ans %= m
return str(ans)
if __name__ == '__main__':
import sys
print(solv... | """
def solve(string):
n, *a = map(int, string.split())
a = ("{:060b}".format(_a) for _a in a)
m, ans = 10**9 + 7, 0
for s in map(lambda x: x.count("1"), zip(*a)):
ans <<= 1
ans += s * (n - s)
ans %= m
return str(ans)
if __name__ == '__main__':
import sys
print(solv... | [
"call.add",
"call.arguments.change"
] | 644,078 | 644,079 | u046187684 | python |
p02838 | def solve(string):
n, *a = map(int, string.split())
a = ("{:060b}".format(_a) for _a in a)
m = 10**9 + 7
ans = 0
for s in map(str.count("1"), zip(*a)):
ans <<= 1
ans += s * (n - s)
ans %= m
return str(ans)
if __name__ == '__main__':
import sys
print(solve(sys.st... | def solve(string):
n, *a = map(int, string.split())
a = ("{:060b}".format(_a) for _a in a)
m = 10**9 + 7
ans = 0
for s in map(lambda x: x.count("1"), zip(*a)):
ans <<= 1
ans += s * (n - s)
ans %= m
return str(ans)
if __name__ == '__main__':
import sys
print(solv... | [
"call.arguments.change"
] | 644,080 | 644,081 | u046187684 | python |
p02838 | import numpy as np
mod = 10**9+7
N = int(input())
A = list(map(int,input().split()))
A = np.array(A, dtype = np.int64)
tmp = 0
for i in range(61):
tmp_1 = np.count_nonzero
tmp += ((tmp_1)*(N - tmp_1)*(2**i)) % mod
A = A >> 1
print(tmp % mod) | import numpy as np
mod = 10**9+7
N = int(input())
A = list(map(int,input().split()))
A = np.array(A, dtype = np.int64)
tmp = 0
for i in range(61):
tmp_1 = np.count_nonzero(A & 1)
tmp += ((tmp_1)*(N - tmp_1)*(2**i)) % mod
A = A >> 1
print(tmp % mod) | [
"call.arguments.add"
] | 644,088 | 644,089 | u841621946 | python |
p02838 | import numpy as np
mod = 10**9+7
N = int(input())
A = list(map(int,input().split()))
A = np.array(A, dtype = np.int64)
tmp = 0
for i in range(61):
tmp_1 = np.sum(A & 1)
tmp += ((tmp_1)*(N - tmp_1)*(2**i)) % mod
A = A >> 1
print(tmp % mod)
| import numpy as np
mod = 10**9+7
N = int(input())
A = list(map(int,input().split()))
A = np.array(A, dtype = np.int64)
tmp = 0
for i in range(61):
tmp_1 = np.count_nonzero(A & 1)
tmp += ((tmp_1)*(N - tmp_1)*(2**i)) % mod
A = A >> 1
print(tmp % mod) | [
"assignment.value.change",
"identifier.change"
] | 644,090 | 644,089 | u841621946 | python |
p02838 | a=int(input())
n=list(map(int,input().split()))
mod=10**9+7
import numpy as np
a=np.array(a)
md = len(bin(max(a)))
ans = 0
for d in range(md):
cnt1 = np.count_nonzero((a>>d)&1)
ans += cnt1 * (n-cnt1) * (1<<d)
ans %= mod
print(ans%mod)
| n=int(input())
a=list(map(int,input().split()))
mod=10**9+7
import numpy as np
a=np.array(a)
md = len(bin(max(a)))
ans = 0
for d in range(md):
cnt1 = np.count_nonzero((a>>d)&1)
ans += cnt1 * (n-cnt1) * (1<<d)
ans %= mod
print(ans%mod)
| [
"assignment.variable.change",
"identifier.change"
] | 644,168 | 644,169 | u332253305 | python |
p02838 | MOD = 10**9 + 7
N = int(input())
A = list(map(int, input().split()))
ans = 0
m = 1
for _ in range(60):
bits = sum((a & m for a in A))
print(bits)
bits //= m
ans += (bits * (N - bits) * m)
ans %= MOD
m <<= 1
print(ans % MOD)
| MOD = 10**9 + 7
N = int(input())
A = list(map(int, input().split()))
ans = 0
m = 1
for i in range(60):
bits = sum((a & m for a in A))
bits //= m
ans += (bits * (N - bits) * m)
ans %= MOD
m <<= 1
print(ans % MOD)
| [
"identifier.change",
"call.remove"
] | 644,247 | 644,248 | u910756197 | python |
p02838 | N = 60
MOD = 10**9 + 7
n = int(input())
c0 = [0 for _ in range(N)]
c1 = [0 for _ in range(N)]
a = list(map(int,input().split()))
for i in range(n):
for j in range(N):
if a[i] & (1 << j) == 0:
c0[j] += 1
else:
c1[j] += 1
ans = 0
for i in range(n-1):
for j in range(N):
... | N = 60
MOD = 10**9 + 7
n = int(input())
c0 = [0 for _ in range(N)]
c1 = [0 for _ in range(N)]
a = list(map(int,input().split()))
for i in range(n):
for j in range(N):
if a[i] & (1 << j) == 0:
c0[j] += 1
else:
c1[j] += 1
ans = 0
for i in range(n-1):
for j in range(N):
... | [
"identifier.change",
"expression.operation.binary.change"
] | 644,317 | 644,318 | u330661451 | python |
p02838 | import bisect
N = int(input())
An = list(map(int,input().split(' ')))
bit_list = [1]
for i in range(100000):
bit_list.append(bit_list[i]*2)
if bit_list[i+1] > 10**12:
break
start_point = bisect.bisect_right(bit_list,max(An))
keta_list = [0] * start_point
for A in An:
abin = format(A, 'b')
for... | import bisect
N = int(input())
An = list(map(int,input().split(' ')))
bit_list = [1]
for i in range(100000):
bit_list.append(bit_list[i]*2)
if bit_list[i+1] > 2**60:
break
start_point = bisect.bisect_right(bit_list,max(An))
keta_list = [0] * start_point
for A in An:
abin = format(A, 'b')
for... | [
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 644,387 | 644,388 | u415154163 | python |
p02838 | import bisect
N = int(input())
An = list(map(int,input().split(' ')))
bit_list = [1]
for i in range(100000):
bit_list.append(bit_list[i]*2)
if bit_list[i+1] > 10**12:
break
start_point = bisect.bisect_left(bit_list,max(An))
keta_list = [0] * start_point
for A in An:
abin = format(A, 'b')
for ... | import bisect
N = int(input())
An = list(map(int,input().split(' ')))
bit_list = [1]
for i in range(100000):
bit_list.append(bit_list[i]*2)
if bit_list[i+1] > 2**60:
break
start_point = bisect.bisect_right(bit_list,max(An))
keta_list = [0] * start_point
for A in An:
abin = format(A, 'b')
for... | [
"literal.number.integer.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"identifier.change"
] | 644,389 | 644,388 | u415154163 | python |
p02838 | import numpy as np
MAX_DIGIT = 60
MOD = 1e9 + 7
N = int(input())
A = np.array([int(a) for a in input().split()])
answer = 0
for d in range(MAX_DIGIT + 1):
A, r = (A>>1), A % 2
s = int(r.sum())
base = (1<<d) % MOD #this may be key
answer += (base * s * (N - s)) % MOD
answer %= MOD
print(answer)
| import numpy as np
MAX_DIGIT = 60
MOD = 10**9 + 7
N = int(input())
A = np.array([int(a) for a in input().split()])
answer = 0
for d in range(MAX_DIGIT + 1):
A, r = (A>>1), A % 2
s = int(r.sum())
base = (1<<d) % MOD #this may be key
answer += (base * s * (N - s)) % MOD
answer %= MOD
print(answer)
| [
"assignment.value.change",
"expression.operation.binary.change"
] | 644,399 | 644,400 | u065621181 | python |
p02838 | import numpy as np
N = int(input())
A = np.array(input().split(), dtype=np.int64)
X = (1 << np.arange(60, dtype=np.int64)) & A.reshape(-1,1)
B = np.sum(X != 0, axis=0)
total = 0
for i,count in enumerate(B):
total += count * (N - count) * (1 << i)
print(total % (10**9 + 7)) | import numpy as np
N = int(input())
A = np.array(input().split(), dtype=np.int64)
X = (1 << np.arange(60, dtype=np.int64)) & A.reshape(-1,1)
B = np.sum(X != 0, axis=0)
total = 0
for i,count in enumerate(B):
total += int(count) * int(N - count) * int(1 << i)
print(total % (10**9 + 7)) | [
"call.add",
"call.arguments.change",
"type_conversion.to_integer.change",
"type_conversion.to_number.change"
] | 644,443 | 644,444 | u663093503 | python |
p02838 | N = int(input())
A = list(map(int, input().split()))
def sumXOR( arr, n):
sum = 0
for i in range(0, 64):
# Count of zeros and ones
zc = 0
oc = 0
# Individual sum at each bit position
idsum = 0
for j in range(0, n):
if (arr[j] % ... | N = int(input())
A = list(map(int, input().split()))
def sumXOR( arr, n):
sum = 0
for i in range(0, 64):
# Count of zeros and ones
zc = 0
oc = 0
# Individual sum at each bit position
idsum = 0
for j in range(0, n):
if (arr[j] % ... | [] | 644,451 | 644,452 | u861095163 | python |
p02838 | def sumXOR( arr, n):
MOD = 10 ** 9 + 7
sum = 0
for i in range(0, 61):
zc = 0
oc = 0
idsum = 0
for j in range(0, n):
if (arr[j] % 2 == 0):
zc = zc + 1
else:
oc = oc + 1
arr[j] = i... | def sumXOR(arr, n):
MOD = 10 ** 9 + 7
sum = 0
for i in range(0, 61):
zc = 0
oc = 0
idsum = 0
for j in range(0, n):
if (arr[j] % 2 == 0):
zc = zc + 1
else:
oc = oc + 1
arr[j] = arr... | [
"call.remove",
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 644,453 | 644,454 | u802963389 | python |
p02838 | def fastio():
import sys
from io import StringIO
from atexit import register
global input
sys.stdin = StringIO(sys.stdin.read())
input = lambda : sys.stdin.readline().rstrip('\r\n')
sys.stdout = StringIO()
register(lambda : sys.__stdout__.write(sys.stdout.getvalue()))
fastio()
MOD = 10... | def fastio():
import sys
from io import StringIO
from atexit import register
global input
sys.stdin = StringIO(sys.stdin.read())
input = lambda : sys.stdin.readline().rstrip('\r\n')
sys.stdout = StringIO()
register(lambda : sys.__stdout__.write(sys.stdout.getvalue()))
fastio()
MOD = 10... | [] | 644,504 | 644,505 | u075489826 | python |
p02838 | import sys
def input():
return sys.stdin.readline()[:-1]
N = int(input())
A=list(map(int,input().split()))
l=[0]*59
for i in A:
s=str(bin(i))[2:]
for j in range(len(s)):
if s[-j-1]=="1":
l[j]+=1
a=0
for i in range(59):
a=(a+2**i*l[i]*(N-l[i]))%(10**9+7)
print(a) | import sys
def input():
return sys.stdin.readline()[:-1]
N = int(input())
A=list(map(int,input().split()))
l=[0]*60
for i in A:
s=str(bin(i))[2:]
for j in range(len(s)):
if s[-j-1]=="1":
l[j]+=1
a=0
for i in range(60):
a=(a+2**i*l[i]*(N-l[i]))%(10**9+7)
print(a) | [
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 644,600 | 644,601 | u187516587 | python |
p02838 | #!/usr/bin/env python3
import sys
sys.setrecursionlimit(10**6)
input = sys.stdin.readline
MOD = 10**9 + 7
def sumXOR(arr, n):
sumation = 0
for i in range(0, 64):
zc = 0
oc = 0
idsum = 0
for j in range(0, n):
if (arr[j] % 2 == 0):
zc = zc + 1
... | #!/usr/bin/env python3
import sys
sys.setrecursionlimit(10**6)
input = sys.stdin.readline
MOD = 10**9 + 7
def sumXOR(arr, n):
sumation = 0
for i in range(0, 64):
zc = 0
oc = 0
idsum = 0
for j in range(0, n):
if (arr[j] % 2 == 0):
zc = zc + 1
... | [
"call.remove",
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 644,650 | 644,651 | u052499405 | python |
p02838 | n=int(input())
a=[int(i) for i in input().split()]
cnt=[0 for i in range(64)]
mask=1
for i in range(64):
for j in a:
if j|mask==j: #立っている
cnt[i]+=1
mask*=2
x=1
res=0
for i in range(64):
res+=2*cnt[i]*(n-cnt[i])*x
res%=1000000007
x*=2
print(res//2) | n=int(input())
a=[int(i) for i in input().split()]
cnt=[0 for i in range(64)]
mask=1
for i in range(64):
for j in a:
if j|mask==j: #立っている
cnt[i]+=1
mask*=2
x=1
res=0
for i in range(64):
res+=cnt[i]*(n-cnt[i])*x
res%=1000000007
x*=2
print(res)
| [
"expression.operation.binary.remove"
] | 644,652 | 644,653 | u422104747 | python |
p02837 | n = int(input())
lst = [[-1 for _ in range(n)] for _ in range(n)]
for _ in range(n):
c = int(input())
for c1 in range(c):
x, y = map(int, input().split())
x -= 1
lst[_][x] = y
ans = 0
for bit in range(n**2-1):
flg = True
for a in range(n):
if (bit >> a) & 1:
... | n = int(input())
lst = [[-1 for _ in range(n)] for _ in range(n)]
for _ in range(n):
c = int(input())
for c1 in range(c):
x, y = map(int, input().split())
x -= 1
lst[_][x] = y
ans = 0
for bit in range(2**n):
flg = True
for a in range(n):
if (bit >> a) & 1:
... | [
"expression.operation.binary.remove"
] | 644,700 | 644,701 | u606146341 | python |
p02837 | n = int(input())
lst = [[-1 for _ in range(n)] for _ in range(n)]
for _ in range(n):
c = int(input())
for c1 in range(c):
x, y = map(int, input().split())
x -= 1
lst[_][x] = y
ans = 0
for bit in range(n**2):
flg = True
for a in range(n):
if (bit >> a) & 1:
fo... | n = int(input())
lst = [[-1 for _ in range(n)] for _ in range(n)]
for _ in range(n):
c = int(input())
for c1 in range(c):
x, y = map(int, input().split())
x -= 1
lst[_][x] = y
ans = 0
for bit in range(2**n):
flg = True
for a in range(n):
if (bit >> a) & 1:
... | [
"expression.operation.binary.remove"
] | 644,702 | 644,701 | u606146341 | python |
p02837 | n = int(input())
lst = [[-1 for _ in range(n)] for _ in range(n)]
for _ in range(n):
c = int(input())
for c1 in range(c):
x, y = map(int, input().split())
x -= 1
lst[_][x] = y
ans = 0
for bit in range(n**2 - 1):
flg = True
for a in range(n):
if (bit >> a) & 1:
... | n = int(input())
lst = [[-1 for _ in range(n)] for _ in range(n)]
for _ in range(n):
c = int(input())
for c1 in range(c):
x, y = map(int, input().split())
x -= 1
lst[_][x] = y
ans = 0
for bit in range(2**n):
flg = True
for a in range(n):
if (bit >> a) & 1:
... | [
"expression.operation.binary.remove"
] | 644,703 | 644,701 | u606146341 | python |
p02837 | n = int(input())
lst = [[-1 for _ in range(n)] for _ in range(n)]
for _ in range(n):
c = int(input())
for c1 in range(c):
x, y = map(int, input().split())
x -= 1
lst[_][x] = y
ans = 0
for bit in range(n**2-1):
flg = True
for a in range(n):
if (bit >> a) & 1:
... | n = int(input())
lst = [[-1 for _ in range(n)] for _ in range(n)]
for _ in range(n):
c = int(input())
for c1 in range(c):
x, y = map(int, input().split())
x -= 1
lst[_][x] = y
ans = 0
for bit in range(2**n):
flg = True
for a in range(n):
if (bit >> a) & 1:
... | [
"expression.operation.binary.remove"
] | 644,700 | 644,704 | u606146341 | python |
p02837 | n = int(input())
lst = [[-1 for _ in range(n)] for _ in range(n)]
for _ in range(n):
c = int(input())
for c1 in range(c):
x, y = map(int, input().split())
x -= 1
lst[_][x] = y
ans = 0
for bit in range(n**2):
flg = True
for a in range(n):
if (bit >> a) & 1:
fo... | n = int(input())
lst = [[-1 for _ in range(n)] for _ in range(n)]
for _ in range(n):
c = int(input())
for c1 in range(c):
x, y = map(int, input().split())
x -= 1
lst[_][x] = y
ans = 0
for bit in range(2**n):
flg = True
for a in range(n):
if (bit >> a) & 1:
... | [
"expression.operation.binary.remove"
] | 644,702 | 644,704 | u606146341 | python |
p02837 | n = int(input())
lst = [[-1 for _ in range(n)] for _ in range(n)]
for _ in range(n):
c = int(input())
for c1 in range(c):
x, y = map(int, input().split())
x -= 1
lst[_][x] = y
ans = 0
for bit in range(n**2 - 1):
flg = True
for a in range(n):
if (bit >> a) & 1:
... | n = int(input())
lst = [[-1 for _ in range(n)] for _ in range(n)]
for _ in range(n):
c = int(input())
for c1 in range(c):
x, y = map(int, input().split())
x -= 1
lst[_][x] = y
ans = 0
for bit in range(2**n):
flg = True
for a in range(n):
if (bit >> a) & 1:
... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 644,703 | 644,704 | u606146341 | python |
p02837 | n = int(input())
a = [0]*n
x = [[] for i in range(n)]
y = [[] for i in range(n)]
for i in range(n):
a[i] = int(input())
for j in range(a[i]):
tmp1,tmp2 = list(map(int,input().split()))
x[i].append(tmp1-1)
y[i].append(tmp2)
ans = 0
honest = [0]*n
cnt=0
for i in range(2**n): #bit全探索
f... | n = int(input())
a = [0]*n
x = [[] for i in range(n)]
y = [[] for i in range(n)]
for i in range(n):
a[i] = int(input())
for j in range(a[i]):
tmp1,tmp2 = list(map(int,input().split()))
x[i].append(tmp1-1)
y[i].append(tmp2)
ans = 0
honest = [0]*n
cnt=0
for i in range(2**n): #bit全探索
f... | [
"control_flow.break.remove"
] | 644,715 | 644,716 | u184817817 | python |
p02837 | def main():
N = int(input())
S = [[] * N for i in range(N)]
ans = 0
for i in range(N):
A = int(input())
for j in range(A):
x, y = map(int, input().split())
S[i].append([x-1, y])
P = [0]*N
for i in range(2**N):
for j in range(N):
if P... | def main():
N = int(input())
S = [[] * N for i in range(N)]
ans = 0
for i in range(N):
A = int(input())
for j in range(A):
x, y = map(int, input().split())
S[i].append([x-1, y])
P = [0]*N
for i in range(2**N):
for j in range(N):
... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"literal.string.change"
] | 644,717 | 644,718 | u098335893 | python |
p02837 | def main():
N = int(input())
S = [[] * N for i in range(N)]
ans = 0
for i in range(N):
A = int(input())
for j in range(A):
x, y = map(int, input().split())
S[i].append([x-1, y])
P = [0]*N
for i in range(2**N):
for j in range(N):
if P... | def main():
N = int(input())
S = [[] * N for i in range(N)]
ans = 0
for i in range(N):
A = int(input())
for j in range(A):
x, y = map(int, input().split())
S[i].append([x-1, y])
P = [0]*N
for i in range(2**N):
for j in range(N):
... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"literal.string.change"
] | 644,719 | 644,718 | u098335893 | python |
p02837 | import collections
import itertools
n = int(input())
per_dict = collections.defaultdict(list)
for i in range(n):
a = int(input())
for j in range(a):
x, y = map(int, input().split())
per_dict[i + 1].append([x,y])
for i in range(n, -1, -1):
flag = True
for honests in itertools.combinations(range(1, n ... | import collections
import itertools
n = int(input())
per_dict = collections.defaultdict(list)
for i in range(n):
a = int(input())
for j in range(a):
x, y = map(int, input().split())
per_dict[i + 1].append([x,y])
for i in range(n, -1, -1):
flag = True
for honests in itertools.combinations(range(1, n ... | [
"assignment.add"
] | 644,722 | 644,723 | u558494840 | python |
p02837 | import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
from collections import deque
sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7
DR = [1, -1, 0, 0]
DC = [0, 0, 1, -1]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(... | import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
from collections import deque
sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7
DR = [1, -1, 0, 0]
DC = [0, 0, 1, -1]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 644,728 | 644,729 | u531436689 | python |
p02837 | N = int(input())
table = [[-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())
table[i][x] = y
# print(table)
# table[i][x] 人iが人xを正直者;1,真偽不明:0,未言及:-1
ans = 0
for i in range(2**N):
hito = [0]*N
for j in range(N):
if i ... | N = int(input())
table = [[-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())
table[i][x-1] = y
# print(table)
# table[i][x] 人iが人xを正直者;1,真偽不明:0,未言及:-1
ans = 0
for i in range(2**N):
hito = [0]*N
for j in range(N):
if ... | [
"assignment.change"
] | 644,736 | 644,737 | u503228842 | python |
p02837 | N = int(input())
remarks = []
for i in range(N):
w = []
for j in range(int(input())):
w.append(list(map(int, input().split())))
remarks.append(w)
def power2(n):
if n == 1:
return [[1], [0]]
res = []
for l in power2(n-1):
res.append([1] + l)
res.append([0] + l)
... | N = int(input())
remarks = []
for i in range(N):
w = []
for j in range(int(input())):
w.append(list(map(int, input().split())))
remarks.append(w)
def power2(n):
if n == 1:
return [[1], [0]]
res = []
for l in power2(n-1):
res.append([1] + l)
res.append([0] + l)
... | [
"control_flow.continue.remove",
"control_flow.pass.add",
"control_flow.break.remove"
] | 644,742 | 644,743 | u724428568 | python |
p02837 | N = int(input())
remarks = []
for i in range(N):
w = []
for j in range(int(input())):
w.append(list(map(int, input().split())))
remarks.append(w)
def power2(n):
if n == 1:
return [[1], [0]]
res = []
for l in power2(n-1):
res.append([1] + l)
res.append([0] + l)
... | N = int(input())
remarks = []
for i in range(N):
w = []
for j in range(int(input())):
w.append(list(map(int, input().split())))
remarks.append(w)
def power2(n):
if n == 1:
return [[1], [0]]
res = []
for l in power2(n-1):
res.append([1] + l)
res.append([0] + l)
... | [
"control_flow.break.remove"
] | 644,742 | 644,745 | u724428568 | python |
p02837 | def bin_(n):
return str(bin(n))[2: ]
N = int(input())
syougen = [[] for i in range(N)]
for i in range(N):
a = int(input())
for j in range(a):
x,y = input().split()
x,y = int(x)-1,int(y)
syougen[i].append((x,y))
start = 2**N-1
max_ = 0
for i in range(2**N):
num = i
uso = 0
... | def bin_(n):
return str(bin(n))[2: ]
N = int(input())
syougen = [[] for i in range(N)]
for i in range(N):
a = int(input())
for j in range(a):
x,y = input().split()
x,y = int(x)-1,int(y)
syougen[i].append((x,y))
start = 2**N-1
max_ = 0
for i in range(2**N):
num = i
uso = 0
... | [
"call.remove"
] | 644,746 | 644,747 | u720384347 | python |
p02837 | N = int(input())
testinomy = [[-1 for _ in range(N)] for _ in range(N)]
for i in range(N):
A = int(input())
testinomy[i][i] = 1
for j in range(A):
x, y = map(int, input().split())
testinomy[i][x - 1] = y
ans = 0
for honests in range(N ** 2 - 1):
bit = '{:015b}'.format(honests)[::-1]
... | N = int(input())
testinomy = [[-1 for _ in range(N)] for _ in range(N)]
for i in range(N):
A = int(input())
testinomy[i][i] = 1
for j in range(A):
x, y = map(int, input().split())
testinomy[i][x - 1] = y
ans = 0
for honests in range(2 ** N):
bit = '{:015b}'.format(honests)[::-1]
... | [
"expression.operation.binary.remove"
] | 644,748 | 644,749 | u168333670 | python |
p02837 | n = int(input())
Adj = [[-1]*n for _ in range(n)]
for i in range(n):
ai = int(input())
for j in range(ai):
xij,yij = map(int, input().split( ))
xij -= 1
Adj[i][xij] = yij###==ってなんぞ
#print(Adj)
ans = 0
bt = 1<<n
for b in range(bt):#全探索
flag = True
tmp = 0
for i in range(n):... | n = int(input())
Adj = [[-1]*n for _ in range(n)]
for i in range(n):
ai = int(input())
for j in range(ai):
xij,yij = map(int, input().split( ))
xij -= 1
Adj[i][xij] = yij###==ってなんぞ
#print(Adj)
ans = 0
bt = 1<<n
for b in range(bt):#全探索
flag = True
tmp = 0
for i in range(n):... | [
"control_flow.branch.if.condition.change"
] | 644,757 | 644,758 | u520276780 | python |
p02837 | # C問題
from itertools import combinations
import numpy as np
N = int(input())
A = []
x = []
y = []
for i in range(N):
# 人iの証言を格納する
Ai = int(input())
A.append(Ai)
x.append([])
y.append([])
for j in range(Ai):
xyij = input().split(" ")
x[i].append(int(xyij[0]) - 1)
y[i].append(int(xyij[1]))
def judge_contra... | # C問題
from itertools import combinations
import numpy as np
N = int(input())
A = []
x = []
y = []
for i in range(N):
# 人iの証言を格納する
Ai = int(input())
A.append(Ai)
x.append([])
y.append([])
for j in range(Ai):
xyij = input().split(" ")
x[i].append(int(xyij[0]) - 1)
y[i].append(int(xyij[1]))
def judge_contra... | [
"call.add",
"call.arguments.change"
] | 644,765 | 644,766 | u283341082 | python |
p02837 | import sys
input = sys.stdin.readline
_n = int(input())
said = []
for i in range(_n):
ai = int(input())
said.append([list(map(int, input().split())) for _ in range(ai)])
ans = 0
for i in range(2 ** _n):
ynflg = 1
flg = format(i, 'b').zfill(_n)
for sy, tag in zip(said, flg):
if tag == 0:
... | import sys
input = sys.stdin.readline
_n = int(input())
said = []
for i in range(_n):
ai = int(input())
said.append([list(map(int, input().split())) for _ in range(ai)])
ans = 0
for i in range(2 ** _n):
ynflg = 1
flg = format(i, 'b').zfill(_n)
for sy, tag in zip(said, flg):
if tag == '0':... | [
"control_flow.branch.if.condition.change"
] | 644,770 | 644,771 | u056083426 | python |
p02839 | import time
t1 = time.time()
h,w = map(int,input().split())
grid = []
for i in range(h):
grid.append(list(map(int,input().split())))
for i in range(h):
lsti = list(map(int,input().split()))
for j in range(w):
grid[i][j] = abs(grid[i][j]-lst[j])
lst = [[set() for _ in range(w)] for _ in range(h)]
lst... | import time
t1 = time.time()
h,w = map(int,input().split())
grid = []
for i in range(h):
grid.append(list(map(int,input().split())))
for i in range(h):
lst = list(map(int,input().split()))
for j in range(w):
grid[i][j] = abs(grid[i][j]-lst[j])
lst = [[set() for _ in range(w)] for _ in range(h)]
lst[... | [
"assignment.variable.change",
"identifier.change"
] | 644,875 | 644,876 | u201928947 | python |
p02839 | import sys
#input = sys.stdin.readline
def main():
inp = lambda: list(map(int, input().split()))
h,w=inp()
a=[inp() for _ in range(h)]
b=[inp() for _ in range(h)]
d=[[0]*w for _ in range(h)]
for i in range(h):
for j in range(w):
d[i][j]=abs(a[i][j]-b[i][j])
zero=80*(h+w... | import sys
#input = sys.stdin.readline
def main():
inp = lambda: list(map(int, input().split()))
h,w=inp()
a=[inp() for _ in range(h)]
b=[inp() for _ in range(h)]
d=[[0]*w for _ in range(h)]
for i in range(h):
for j in range(w):
d[i][j]=abs(a[i][j]-b[i][j])
zero=80*(h+w... | [
"call.remove"
] | 644,877 | 644,878 | u919730120 | python |
p02839 | H,W = map(int,input().split())
A = np.zeros((H,W))
for c in [1,-1]:
for i in range(H):
num = list(map(int,input().split()))
A[i,:] += np.array(num) * c
M = 160*80
dp = [[0]*W for _ in range(H)]
dp[0][0] = 1 << M
for i in range(H):
for j in range(W):
if i > 0:
dp[i][j] |= dp[... | import numpy as np
H,W = map(int,input().split())
A = np.zeros((H,W))
for c in [1,-1]:
for i in range(H):
num = list(map(int,input().split()))
A[i,:] += np.array(num) * c
M = 160*80
dp = [[0]*W for _ in range(H)]
dp[0][0] = 1 << M
for i in range(H):
for j in range(W):
if i > 0:
... | [] | 644,997 | 644,998 | u700278227 | python |
p02839 | import numpy as np
H, W = map(int, input().split())
As = [list(map(int, input().split())) for _ in range(H)]
Bs = [list(map(int, input().split())) for _ in range(H)]
ds = [[abs(A-B) for A, B in zip(row_A, row_B)] for row_A, row_B in zip(As, Bs)]
size = 165
dp = np.full((H, W, size), False)
dp[0][0][ds[0][0]] = True... | import numpy as np
H, W = map(int, input().split())
As = [list(map(int, input().split())) for _ in range(H)]
Bs = [list(map(int, input().split())) for _ in range(H)]
ds = [[abs(A-B) for A, B in zip(row_A, row_B)] for row_A, row_B in zip(As, Bs)]
size = 100005
dp = np.full((H, W, size), False)
dp[0][0][ds[0][0]] = T... | [
"literal.number.integer.change",
"assignment.value.change"
] | 645,139 | 645,137 | u034128150 | python |
p02839 | import numpy as np
H, W = map(int, input().split())
As = [list(map(int, input().split())) for _ in range(H)]
Bs = [list(map(int, input().split())) for _ in range(H)]
ds = [[abs(A-B) for A, B in zip(row_A, row_B)] for row_A, row_B in zip(As, Bs)]
size = 165
dp = np.full((H, W, size), False)
dp[0][0][ds[0][0]] = True... | import numpy as np
H, W = map(int, input().split())
As = [list(map(int, input().split())) for _ in range(H)]
Bs = [list(map(int, input().split())) for _ in range(H)]
ds = [[abs(A-B) for A, B in zip(row_A, row_B)] for row_A, row_B in zip(As, Bs)]
size = 10005
dp = np.full((H, W, size), False)
dp[0][0][ds[0][0]] = Tr... | [
"literal.number.integer.change",
"assignment.value.change"
] | 645,139 | 645,140 | u034128150 | python |
p02839 | R, C = map(int, input().split())
A = [list(map(int, input().split())) for _ in range(R)]
B = [list(map(int, input().split())) for _ in range(R)]
dp = [0] * R
dp[0] = s = 1 << 6400
for row_a, row_b in zip(A, B):
for i, (a, b) in enumerate(zip(row_a, row_b)):
d = abs(a - b)
if i > 0:
dp... | R, C = map(int, input().split())
A = [list(map(int, input().split())) for _ in range(R)]
B = [list(map(int, input().split())) for _ in range(R)]
dp = [0] * C
dp[0] = s = 1 << 6400
for row_a, row_b in zip(A, B):
for i, (a, b) in enumerate(zip(row_a, row_b)):
d = abs(a - b)
if i > 0:
dp... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 645,184 | 645,185 | u638282348 | python |
p02839 | import numpy as np
h,w=map(int,input().split())
a=[list(map(int,input().split())) for _ in range(h)]
b=[list(map(int,input().split())) for _ in range(h)]
d=[]
for i in range(h):
d.append([abs(a[i][j]-b[i][j]) for j in range(w)])
dp=np.zeros((h,w,200))
# dp[r][c][j]:(r,c)まで考えたときjにできるかbool値
dp[0,0,d[0][0]+100]=1
for i ... | import numpy as np
h,w=map(int,input().split())
a=[list(map(int,input().split())) for _ in range(h)]
b=[list(map(int,input().split())) for _ in range(h)]
d=[]
for i in range(h):
d.append([abs(a[i][j]-b[i][j]) for j in range(w)])
dp=np.zeros((h,w,12800))
# dp[r][c][j]:(r,c)まで考えたときjにできるか。0：できない。1以上：できる。
dp[0,0,d[0][0]+... | [
"literal.number.integer.change",
"assignment.value.change",
"call.arguments.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 645,204 | 645,203 | u707124227 | python |
p02839 | H, W = map(int, input().split())
A = [list(map(int, input().split())) for _ in range(H)]
B = [list(map(int, input().split())) for _ in range(H)]
Z = 100
dp = [[0] * (W + 1) for _ in range(H + 1)]
dp[0][0] = (1 << Z)
for h in range(H):
for w in range(W):
d = dp[h][w]
k = abs(A[h][w] - B[h][w])
... | H, W = map(int, input().split())
A = [list(map(int, input().split())) for _ in range(H)]
B = [list(map(int, input().split())) for _ in range(H)]
Z = 1000
dp = [[0] * (W + 1) for _ in range(H + 1)]
dp[0][0] = (1 << Z)
for h in range(H):
for w in range(W):
d = dp[h][w]
k = abs(A[h][w] - B[h][w])
... | [
"literal.number.integer.change",
"assignment.value.change"
] | 645,217 | 645,218 | u392319141 | python |
p02839 | import sys,bisect,string,math,time,functools,random,fractions
from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
from itertools import permutations,combinations,groupby
def Golf():*a,=map(int,open(0))
def I():return int(input())
def S_():return input()
def IS():return input().s... | import sys,bisect,string,math,time,functools,random,fractions
from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
from itertools import permutations,combinations,groupby
def Golf():*a,=map(int,open(0))
def I():return int(input())
def S_():return input()
def IS():return input().s... | [
"literal.number.integer.change",
"assignment.variable.change",
"variable_access.subscript.index.change"
] | 645,221 | 645,222 | u623819879 | python |
p02839 | import sys
from collections import deque
def input(): return sys.stdin.readline().strip()
def main():
H, W = map(int, input().split())
A = []
for _ in range(H):
A.append(list(map(int, input().split())))
B = []
for _ in range(H):
B.append(list(map(int, input().split())))
""... | import sys
from collections import deque
def input(): return sys.stdin.readline().strip()
def main():
H, W = map(int, input().split())
A = []
for _ in range(H):
A.append(list(map(int, input().split())))
B = []
for _ in range(H):
B.append(list(map(int, input().split())))
""... | [
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"identifier.replace.add",
"literal.replace.remove"
] | 645,264 | 645,265 | u107639613 | python |
p02839 | def run():
ofs = 100
H, W = map(int, input().split())
dp = [[0 for w in range(W)] for h in range(H)]
a = [list(map(int, input().split())) for i in range(H)]
b = [list(map(int, input().split())) for i in range(H)]
c = [[abs(a[i][j] - b[i][j]) for j in range(W)] for i in range(H)]
dp[0][0] = (1 << ofs + c[0... | def run():
ofs = 1000
H, W = map(int, input().split())
dp = [[0 for w in range(W)] for h in range(H)]
a = [list(map(int, input().split())) for i in range(H)]
b = [list(map(int, input().split())) for i in range(H)]
c = [[abs(a[i][j] - b[i][j]) for j in range(W)] for i in range(H)]
dp[0][0] = (1 << ofs + c[... | [
"literal.number.integer.change",
"assignment.value.change"
] | 645,286 | 645,287 | u365375535 | python |
p02839 | # -*- coding: utf-8 -*-
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
write = sys.stdout.write
# template
def resolve():
ofs = 80
h, w = map(int, readline().split())
A = [list(map(int, readline().split())) for i in range(h)]
B = [list(map(int, readline().split())) for i ... | # -*- coding: utf-8 -*-
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
write = sys.stdout.write
# template
def resolve():
ofs = 1000
h, w = map(int, readline().split())
A = [list(map(int, readline().split())) for i in range(h)]
B = [list(map(int, readline().split())) for ... | [
"literal.number.integer.change",
"assignment.value.change"
] | 645,320 | 645,319 | u379629675 | python |
p02839 | # -*- coding: utf-8 -*-
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
write = sys.stdout.write
# template
def resolve():
ofs = 80
h, w = map(int, readline().split())
A = [list(map(int, readline().split())) for i in range(h)]
B = [list(map(int, readline().split())) for i ... | # -*- coding: utf-8 -*-
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
write = sys.stdout.write
# template
def resolve():
ofs = 3200
h, w = map(int, readline().split())
A = [list(map(int, readline().split())) for i in range(h)]
B = [list(map(int, readline().split())) for ... | [
"literal.number.integer.change",
"assignment.value.change"
] | 645,320 | 645,321 | u379629675 | python |
p02839 | h, w = map(int, input().split())
a = [list(map(int, input().split())) for _ in range(h)]
b = [list(map(int, input().split())) for _ in range(h)]
x = (h + w) * 80
dp = [[0] * w for _ in range(h)]
d = abs(a[0][0] - b[0][0])
dp[0][0] = 1 << (x - d)
for i in range(h):
for j, (ae, be) in enumerate(zip(a[i], b[i])):
... | h, w = map(int, input().split())
a = [list(map(int, input().split())) for _ in range(h)]
b = [list(map(int, input().split())) for _ in range(h)]
x = (h + w) * 80
dp = [[0] * w for _ in range(h)]
d = abs(a[0][0] - b[0][0])
dp[0][0] = 1 << (x - d)
for i in range(h):
for j, (ae, be) in enumerate(zip(a[i], b[i])):
... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 645,322 | 645,323 | u893063840 | python |
p02839 | H, W=map(int, input().split())
maxK=161
A=[list(map(int, input().split())) for _ in range(H)]
B=[list(map(int, input().split())) for _ in range(H)]
C=[[abs(A[i][j]-B[i][j]) for j in range(W)] for i in range(H)]
dp=[[[0 for _ in range(maxK+1)] for _ in range(W+1)] for _ in range(H+1)]
dp[1][1][C[0][0]]=1
for i in range(... | H, W=map(int, input().split())
maxK=80*80+1
A=[list(map(int, input().split())) for _ in range(H)]
B=[list(map(int, input().split())) for _ in range(H)]
C=[[abs(A[i][j]-B[i][j]) for j in range(W)] for i in range(H)]
dp=[[[0 for _ in range(maxK+1)] for _ in range(W+1)] for _ in range(H+1)]
dp[1][1][C[0][0]]=1
for i in ra... | [
"literal.number.integer.change",
"assignment.value.change"
] | 645,497 | 645,498 | u419877586 | python |
p02839 | H, W=map(int, input().split())
maxK=81
A=[list(map(int, input().split())) for _ in range(H)]
B=[list(map(int, input().split())) for _ in range(H)]
C=[[abs(A[i][j]-B[i][j]) for j in range(W)] for i in range(H)]
dp=[[[0 for _ in range(maxK+1)] for _ in range(W+1)] for _ in range(H+1)]
dp[1][1][C[0][0]]=1
for i in range(1... | H, W=map(int, input().split())
maxK=80*80+1
A=[list(map(int, input().split())) for _ in range(H)]
B=[list(map(int, input().split())) for _ in range(H)]
C=[[abs(A[i][j]-B[i][j]) for j in range(W)] for i in range(H)]
dp=[[[0 for _ in range(maxK+1)] for _ in range(W+1)] for _ in range(H+1)]
dp[1][1][C[0][0]]=1
for i in ra... | [
"literal.number.integer.change",
"assignment.value.change"
] | 645,499 | 645,498 | u419877586 | python |
p02839 | import numpy as np
i8 = np.int64
i4 = np.int32
def calc(dp1, dp2, k):
dp2[k:] += dp1[:dp1.shape[0]-k]
dp2[:dp2.shape[0]-k] += dp1[k:]
def solve(z, dp):
zero = dp.shape[2] // 2
dp[0, 0, zero + z[0, 0]] = 1
dp[0, 0, zero - z[0, 0]] = 1
for x in range(1, z.shape[1]):
calc(dp[0, x - 1], dp... | import numpy as np
i8 = np.int64
i4 = np.int32
def calc(dp1, dp2, k):
dp2[k:] += dp1[:dp1.shape[0]-k]
dp2[:dp2.shape[0]-k] += dp1[k:]
def solve(z, dp):
zero = dp.shape[2] // 2
dp[0, 0, zero + z[0, 0]] = 1
dp[0, 0, zero - z[0, 0]] = 1
for x in range(1, z.shape[1]):
calc(dp[0, x - 1], dp... | [
"call.add"
] | 645,507 | 645,508 | u326609687 | python |
p02839 | import numpy as np
i8 = np.int64
i4 = np.int32
def calc(dp1, dp2, k):
dp2[k:] += dp1[:dp1.shape[0]-k]
dp2[:dp2.shape[0]-k] += dp1[k:]
def solve(z, dp):
zero = dp.shape[2] // 2
dp[0, 0, zero + z[0, 0]] = 1
dp[0, 0, zero - z[0, 0]] = 1
for x in range(1, z.shape[1]):
calc(dp[0, x - 1], dp... | import numpy as np
i8 = np.int64
i4 = np.int32
def calc(dp1, dp2, k):
dp2[k:] += dp1[:dp1.shape[0]-k]
dp2[:dp2.shape[0]-k] += dp1[k:]
def solve(z, dp):
zero = dp.shape[2] // 2
dp[0, 0, zero + z[0, 0]] = 1
dp[0, 0, zero - z[0, 0]] = 1
for x in range(1, z.shape[1]):
calc(dp[0, x - 1], dp... | [
"literal.number.integer.change",
"control_flow.branch.if.condition.change",
"call.add"
] | 645,509 | 645,508 | u326609687 | python |
p02839 | import numpy as np
i8 = np.int64
i4 = np.int32
def calc(dp1, dp2, k):
dp2[k:] += dp1[:dp1.shape[0]-k]
dp2[:dp2.shape[0]-k] += dp1[k:]
def solve(z, dp):
zero = dp.shape[2] // 2
dp[0, 0, zero + z[0, 0]] = 1
dp[0, 0, zero - z[0, 0]] = 1
for x in range(1, z.shape[1]):
calc(dp[0, x - 1], dp... | import numpy as np
i8 = np.int64
i4 = np.int32
def calc(dp1, dp2, k):
dp2[k:] += dp1[:dp1.shape[0]-k]
dp2[:dp2.shape[0]-k] += dp1[k:]
def solve(z, dp):
zero = dp.shape[2] // 2
dp[0, 0, zero + z[0, 0]] = 1
dp[0, 0, zero - z[0, 0]] = 1
for x in range(1, z.shape[1]):
calc(dp[0, x - 1], dp... | [
"call.add"
] | 645,509 | 645,510 | u326609687 | python |
p02839 | #!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return... | #!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return... | [
"expression.operation.binary.change"
] | 645,516 | 645,517 | u423585790 | python |
p02839 | import numpy as np
H, W = map(int, input().split())
lst1 = []
lst2 = []
for _ in range(H):
lst1.append([int(i) for i in input().split()])
for _ in range(H):
lst2.append([int(i) for i in input().split()])
arr1, arr2 = np.array(lst1), np.array(lst2)
arr = np.abs(arr1 - arr2)
d = [[0] * W for _ in range(H)]
m = ... | import numpy as np
H, W = map(int, input().split())
lst1 = []
lst2 = []
for _ in range(H):
lst1.append([int(i) for i in input().split()])
for _ in range(H):
lst2.append([int(i) for i in input().split()])
arr1, arr2 = np.array(lst1), np.array(lst2)
arr = np.abs(arr1 - arr2)
d = [[0] * W for _ in range(H)]
m = ... | [
"call.remove"
] | 645,518 | 645,519 | u780475861 | python |
p02841 | MD = [map(int, input().split()) for _ in range(N)]
M, D = [list(i) for i in zip(*MD)]
if D[1] == 1:
print(1)
else:
print(0)
| MD = [map(int, input().split()) for _ in range(2)]
M, D = [list(i) for i in zip(*MD)]
if D[1] == 1:
print(1)
else:
print(0) | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 645,567 | 645,568 | u861274887 | python |
p02841 | md1=map(int,input().split())
md2=map(int,input().split())
print(1 if md1[0]!=md2[0] else 0) | md1=list(map(int,input().split()))
md2=list(map(int,input().split()))
print(1 if md1[0]!=md2[0] else 0)
| [
"assignment.value.change",
"identifier.change",
"call.function.change",
"call.arguments.change"
] | 645,589 | 645,590 | u556594202 | python |
p02841 | print(+('1\n'in[*open(0)][1])) | print(+(' 1\n'in[*open(0)][1])) | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 645,597 | 645,598 | u729133443 | python |
p02841 | m1,d1 = map(int,input().split())
m2,d2 = map(int,input().split())
if mi == m2:
print(0)
else:
print(1) | m1,d1 = map(int,input().split())
m2,d2 = map(int,input().split())
if m1 == m2:
print(0)
else:
print(1) | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 645,624 | 645,625 | u357751375 | python |
p02841 | # -*- coding: utf-8 -*-
#############
# Libraries #
#############
import sys
input = sys.stdin.readline
import math
#from math import gcd
import bisect
from collections import defaultdict
from collections import deque
from collections import Counter
from functools import lru_cache
#############
# Constants #
#####... | # -*- coding: utf-8 -*-
#############
# Libraries #
#############
import sys
input = sys.stdin.readline
import math
#from math import gcd
import bisect
from collections import defaultdict
from collections import deque
from collections import Counter
from functools import lru_cache
#############
# Constants #
#####... | [
"identifier.change",
"call.function.change",
"call.arguments.change",
"io.output.change"
] | 645,626 | 645,627 | u493130708 | python |
p02841 | m1, d1 = map(int,input().split())
m2, d2 = map(int,input().split())
if m1 != m2 and m2 == 1:
print(1)
else:
print(0) | m1, d1 = map(int,input().split())
m2, d2 = map(int,input().split())
if m1 != m2 and d2 == 1:
print(1)
else:
print(0) | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 645,644 | 645,645 | u068142202 | python |
p02841 | l1 = list(map(int,input().split()))
l2 = list(map(int,input().split()))
if l[1] == 1:
print('1')
else:
print('0') | l1 = list(map(int,input().split()))
l2 = list(map(int,input().split()))
if l2[1] == 1:
print('1')
else:
print('0') | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 645,648 | 645,649 | u264681142 | python |
p02841 | a, b = map(int, input().split())
c, d = map(int, input().split())
print(a!=c) | a, b = map(int, input().split())
c, d = map(int, input().split())
print(int(a!=c)) | [
"call.arguments.add",
"call.arguments.change"
] | 645,652 | 645,653 | u667084803 | python |
p02841 | a, b = map(int, input().split())
c, d = map(int, input().split())
print(a!=b) | a, b = map(int, input().split())
c, d = map(int, input().split())
print(int(a!=c)) | [
"call.arguments.add",
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 645,654 | 645,653 | u667084803 | python |
p02841 | def main():
m1, d1 = map(int, input().split())
m2, d2 = map(int, input().split())
if m1 == m2:
print('1')
else:
print('0')
if __name__ == '__main__':
main()
| def main():
m1, d1 = map(int, input().split())
m2, d2 = map(int, input().split())
if m1 != m2:
print('1')
else:
print('0')
if __name__ == '__main__':
main()
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 645,676 | 645,677 | u197956883 | python |
p02841 | print(1+input().find(input()[:2])) | print(0-input().find(input()[:2])) | [] | 645,679 | 645,680 | u490642448 | python |
p02841 | print(input().count(input()[:2])) | print(0-input().find(input()[:2])) | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 645,681 | 645,680 | u490642448 | python |
p02841 | m1, d1 = map(int, input().split())
m2, d2 = map(int, input().split())
print(1 if m1!=d1 else 0) | m1, d1 = map(int, input().split())
m2, d2 = map(int, input().split())
print(1 if m1!=m2 else 0) | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 645,691 | 645,692 | u690536347 | python |
p02841 | M_1, D_1 = map(int, input().split())
M_2, D_2 = map(int, input().split())
if M_1 != M_2:
print(0)
else:
print(1)
| M_1, D_1 = map(int, input().split())
M_2, D_2 = map(int, input().split())
if M_1 != M_2:
print(1)
else:
print(0)
| [
"literal.number.integer.change",
"call.arguments.change",
"io.output.change"
] | 645,697 | 645,698 | u370721525 | python |
p02838 | import numpy as np
N = int(input())
A = np.array(input().split(), np.int64)
ans = 0
for k in range(60):
x = sum(A >> k & 1)
ans += x * (N - x) * 2**k
print(ans % (10**9+7))
| import numpy as np
N = int(input())
A = np.array(input().split(), np.int64)
ans = 0
for k in range(60):
x = int(np.sum(A >> k & 1))
ans += x * (N - x) * 2**k
print(ans % (10**9+7))
| [
"call.add",
"call.arguments.change"
] | 645,736 | 645,735 | u006493569 | python |
p02838 | N = int(input())
lis = [0]*60
for a in input().split():
a = int(a)
for i,j in range(60):
lis[i] += a % 2
a = a//2
ans = 0
for i, j in enumerate(lis):
ans += j * (N-j) *(2**i)
ans = ans % (10**9 + 7)
print(ans)
| N = int(input())
lis = [0]*60
for a in input().split():
a = int(a)
for i in range(60):
lis[i] += a % 2
a = a//2
ans = 0
for i, j in enumerate(lis):
ans += j * (N-j) *(2**i)
ans = ans % (10**9 + 7)
print(ans) | [] | 645,761 | 645,762 | u262869085 | python |
p02838 | # -*- coding: utf-8 -*-
import numpy as np
def main():
mod = 10 ** 9 + 7
N = int(input())
A = list(map(int, input().split()))
A = np.array(A, np.int64)
ans = 0
for i in range(60):
bit = np.count_nonzero(A | 0)
ans += bit * (N - bit) * (2 ** i)
ans %= mod
A >>= 1
... | # -*- coding: utf-8 -*-
import numpy as np
def main():
mod = 10 ** 9 + 7
N = int(input())
A = list(map(int, input().split()))
A = np.array(A, np.int64)
ans = 0
for i in range(60):
bit = np.count_nonzero(A & 1)
ans += bit * (N - bit) * (2 ** i)
ans %= mod
A >>= 1
... | [] | 645,850 | 645,851 | u981040490 | python |
p02838 | import numpy as np
n=int(input())
a= list(map(int,input().split()))
a=np.array(a,np.int64)
print(a)
max=60
mod=10**9+7
ans=0
cnt1=0
cnt0=0
for i in range(max):
new_a=(a>>i & 1)
cnt1=np.count_nonzero(new_a)
cnt0=n-cnt1
ans=(ans+cnt1*cnt0*(2**i))%mod
cnt1=0
cnt0=0
print(ans)
... | import numpy as np
n=int(input())
a= list(map(int,input().split()))
a=np.array(a,np.int64)
max=60
mod=10**9+7
ans=0
cnt1=0
cnt0=0
for i in range(max):
new_a=(a>>i & 1)
cnt1=np.count_nonzero(new_a)
cnt0=n-cnt1
ans=(ans+cnt1*cnt0*(2**i))%mod
cnt1=0
cnt0=0
print(ans)
... | [
"call.remove"
] | 645,854 | 645,855 | u397035018 | python |
p02838 | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
MOD = 10**9+7
N = int(input())
A = list(map(int, input().split()))
B = [0]*60
C = [0]*60
for i in range(60):
for j in range(N):
if (A[j]>>i)&1 == 0:
C[i] += 1
else:
B[i] += 1
ans = 0
for i in range(60):
... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
MOD = 10**9+7
N = int(input())
A = list(map(int, input().split()))
B = [0]*60
C = [0]*60
for i in range(60):
for j in range(N):
if (A[j]>>i)&1 == 0:
C[i] += 1
else:
B[i] += 1
ans = 0
for i in range(60):
... | [
"expression.operation.binary.add"
] | 645,893 | 645,894 | u741397536 | python |
p02838 | MOD = int(1e9) + 7
n = int(input())
a = list(map(int, input().split()))
ans = 0
for b in range(60)[::-1]:
ans <<=1
print(ans)
c = sum(a[i]>>b & 1 for i in range(n))
ans = (ans + c*(n-c))%MOD
print(ans) | MOD = int(1e9) + 7
n = int(input())
a = list(map(int, input().split()))
ans = 0
for b in range(60)[::-1]:
ans <<=1
c = sum(a[i]>>b & 1 for i in range(n))
ans = (ans + c*(n-c))%MOD
print(ans) | [
"call.remove"
] | 645,924 | 645,925 | u117348081 | python |
p02838 |
mod = 10**9 + 7
def main():
n = int(input())
A = [int(a) for a in input().split()]
ans = 0
for k in range(60):
a = 0
for i in range(n):
a += A[i] & 1
A[i] <<= 1
da = (1 << k) % mod
da *= (n - a)*a
da %= mod
ans += da
ans ... |
mod = 10**9 + 7
def main():
n = int(input())
A = [int(a) for a in input().split()]
ans = 0
for k in range(60):
a = 0
for i in range(n):
a += A[i] & 1
A[i] >>= 1
da = (1 << k) % mod
da *= (n - a)*a
da %= mod
ans += da
ans ... | [
"expression.operator.change"
] | 645,950 | 645,951 | u747184036 | python |
p02841 | M_1, D_1 = map(int, input().split(" "))
M_2, D_2 = map(int, input().split(" "))
print(0 if M_1 == M_2 else 0) | M_1, D_1 = map(int, input().split(" "))
M_2, D_2 = map(int, input().split(" "))
print(0 if M_1 == M_2 else 1) | [
"literal.number.integer.change",
"call.arguments.change",
"io.output.change"
] | 645,957 | 645,958 | u500415792 | python |
p02841 | # A - November 30
def main():
M1, _, M2, _ = map(int, open(0).read().split())
print(M1 != M2)
if __name__ == "__main__":
main()
| # A - November 30
def main():
M1, _, M2, _ = map(int, open(0).read().split())
print(int(M1 != M2))
if __name__ == "__main__":
main()
| [
"call.arguments.add",
"call.arguments.change"
] | 645,959 | 645,960 | u077291787 | python |
p02841 | m1,d1=map(int,input().split())
m2,d2=map(int,input().split())
print(1 if d2==1 else 2) | m1,d1=map(int,input().split())
m2,d2=map(int,input().split())
print(1 if d2==1 else 0) | [
"literal.number.integer.change",
"call.arguments.change",
"io.output.change"
] | 645,961 | 645,962 | u038819082 | python |
p02841 | a, _ = map(int, input().split())
c, d = map(int, input().split())
if a == c and d == 1:
print("1")
else:
print("0") | a, _ = map(int, input().split())
c, d = map(int, input().split())
if a != c and d == 1:
print("1")
else:
print("0")
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 645,963 | 645,964 | u756195685 | python |
p02841 | a, _ = map(int, input().split())
c, d = map(int, input().split())
if a == c and d == 1:
print("1")
else:
print("2")
| a, _ = map(int, input().split())
c, d = map(int, input().split())
if a != c and d == 1:
print("1")
else:
print("0")
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 645,965 | 645,964 | u756195685 | python |
p02841 | a, b = map(int,input().split())
c, d = map(int,input().split())
if d == "1":
print("1")
else:
print("0") | a, b = map(int,input().split())
c, d = map(int,input().split())
if d == 1:
print("1")
else:
print("0")
| [
"control_flow.branch.if.condition.change"
] | 645,974 | 645,975 | u972892985 | python |
p02841 | m,d = map(int,input().split())
m2,d2 = ap(int,input().split())
if(m!=m2):
print(1)
else:
print(0) | m,d = map(int,input().split())
m2,d2 = map(int,input().split())
if(m!=m2):
print(1)
else:
print(0)
| [
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 645,978 | 645,979 | u777394984 | python |
p02841 | def mainFunc():
m1, d1 = list(map(int, list(input().split(" "))))
m2, d2 = list(map(int, list(input().split(" "))))
ans = '1' if m1 == m2 else '0'
print(ans)
mainFunc() | def mainFunc():
m1, d1 = list(map(int, list(input().split(" "))))
m2, d2 = list(map(int, list(input().split(" "))))
ans = '1' if m1 != m2 else '0'
print(ans)
mainFunc() | [
"misc.opposites",
"expression.operator.compare.change",
"assignment.value.change"
] | 645,982 | 645,983 | u610387229 | python |
p02841 | m1, d1 = map(int, input().split())
m2, d2 = map(int, input().split())
if m1 != m2:
print(0)
else:
print(1) | m1, d1 = map(int, input().split())
m2, d2 = map(int, input().split())
if m1 != m2:
print(1)
else:
print(0) | [
"literal.number.integer.change",
"call.arguments.change",
"io.output.change"
] | 645,986 | 645,987 | u031324264 | python |
p02841 | a,b = list(map(int, input().split()))
c,d = list(map(int, input().split()))
if (a != b):
print(1)
else:
print(0) | a,b = list(map(int, input().split()))
c,d = list(map(int, input().split()))
if (a != c):
print(1)
else:
print(0) | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 645,992 | 645,993 | u498575211 | python |
p02841 | in1=input().split()
in2=input().split()
if int(in1[0])==int(in2[0]):
return 0
else:
return 1 | in1=input().split()
in2=input().split()
if int(in1[0])==int(in2[0]):
print(0)
else:
print(1) | [
"function.return_value.change",
"call.arguments.change"
] | 645,998 | 645,999 | u074060241 | python |
p02841 | m1,d1 = map(int,input().aplit())
m2,d2= map(int,input().split())
if m1!=m2:
print(1)
else:
print(0) | m1,d1 = map(int,input().split())
m2,d2= map(int,input().split())
if m1!=m2:
print(1)
else:
print(0) | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 646,024 | 646,025 | u382907940 | python |
p02841 | m1,d1 = map(int,input().aplit())
m2,d2= map(int,input().split())
if m1!=m2:print(1)
else: print(0) | m1,d1 = map(int,input().split())
m2,d2= map(int,input().split())
if m1!=m2:
print(1)
else:
print(0) | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 646,026 | 646,025 | u382907940 | python |
p02841 | a, b = map(int, input().split())
c, d = map(int, input().split())
if(a != b):
print(1)
else:
print(0) | a, b = map(int, input().split())
c, d = map(int, input().split())
if(a != c):
print(1)
else:
print(0)
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 646,047 | 646,048 | u583276018 | python |
p02841 | m1, d1 = map(int, input().split())
m2, d2 = map(int, input().split())
if m1 != m2:
print(0)
else:
print(1) | m1, d1 = map(int, input().split())
m2, d2 = map(int, input().split())
if m1 != m2:
print(1)
else:
print(0) | [
"literal.number.integer.change",
"call.arguments.change",
"io.output.change"
] | 646,049 | 646,050 | u138781768 | python |
p02841 | print(1 if int(input().split()[2])==1 else 0) | input()
print(1 if int(input().split()[1])==1 else 0) | [
"call.add",
"literal.number.integer.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"io.output.change"
] | 646,062 | 646,063 | u388817534 | python |
p02841 | for i in range(2):
n.append([int(x) for x in input().split()])
print(1 if n[0][0]!=n[1][0] else 0) | n=[]
for i in range(2):
n.append([int(x) for x in input().split()])
print(1 if n[0][0]!=n[1][0] else 0) | [
"assignment.add"
] | 646,080 | 646,081 | u295294832 | python |
p02841 | m1, d1 = map(int, input().split)
m2, d2 = map(int, input().split)
if(m1 == m2):
print('0')
exit()
print('1')
| m1, d1 = map(int, input().split())
m2, d2 = map(int, input().split())
if(m1 == m2):
print('0')
exit()
print('1')
| [
"call.add"
] | 646,121 | 646,122 | u830297276 | python |
p02841 | l = input().split(' ')
m = input().split(' ')
x = m[1]
if str(x) == 1:
print(1)
else:
print(0) | l = input().split(' ')
m = input().split(' ')
x = int(m[1])
if x == 1:
print(1)
else:
print(0) | [
"call.add",
"control_flow.branch.if.add"
] | 646,148 | 646,149 | u700929101 | python |
p02841 | str = [input() for i in range(2)]
s1 = str[0].split()
s2 = str[1].split()
if s1[0] != s2[1] and int(s1[1]) != int(s2[1]):
print("1")
else:
print("0") | str = [input() for i in range(2)]
s1 = str[0].split()
s2 = str[1].split()
if s1[0] != s2[0] and int(s1[1]) >= int(s2[1]):
print("1")
else:
print("0") | [
"literal.number.integer.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"expression.operator.compare.change"
] | 646,152 | 646,153 | u571646975 | python |
p02841 | ip=input().strip()
while((len)==0):
ip=input().strip()
m,d=map(int,ip.split())
m1,d1=map(int,input().split())
odd=[1,3,5,7,8,10,12]
eve=[4,6,9,11]
if m in odd:
if(d==31):
print(1)
else:
print(0)
elif m in even:
if(d==30):
print(1)
else:
print(0)
else:
if(d==28):
print(1)
else:
prin... | ip=input().strip()
while((len)==0):
ip=input().strip()
m,d=map(int,ip.split())
m1,d1=map(int,input().split())
odd=[1,3,5,7,8,10,12]
eve=[4,6,9,11]
if m in odd:
if(d==31):
print(1)
else:
print(0)
elif m in eve:
if(d==30):
print(1)
else:
print(0)
else:
if(d==28):
print(1)
else:
print... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 646,158 | 646,159 | u002813843 | python |
p02841 | m1, d1 = map(int, input().split())
m2, d2 = map(int, input().split())
print(m1 == m2 if 1 else 0)
| m1, d1 = map(int, input().split())
m2, d2 = map(int, input().split())
print(0 if m1 == m2 else 1)
| [
"literal.number.integer.change",
"call.arguments.change",
"io.output.change"
] | 646,162 | 646,163 | u698849142 | python |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.