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 |
|---|---|---|---|---|---|---|---|
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[j][k][0]-1])!=a[j][k][1]:
r=0
if r==1:
ans=max(ans,ib.count("1"))
print(ans)
|
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]-1])!=a[j][k][1]:
r=0
if r==1:
ans=max(ans,ib.count("1"))
print(ans)
|
[
"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]:
if pat[z[0]-1] != z[1]:
check = False
if check:
print(pat)
ans = max(ans, sum(pat))
print(ans)
|
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]:
if pat[z[0]-1] != z[1]:
check = False
if check:
ans = max(ans, sum(pat))
print(ans)
|
[
"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 ** N):
bits = [i >> j & 1 for j in range(N)]
for i, a in enumerate(A):
if bits[i] == 0:
continue
for x, y in a:
if bits[x - 1] == y:
continue
break
else:
ret = max(ret, sum(bits))
return ret
if __name__ == "__main__":
print(main())
|
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 ** N):
bits = [i >> j & 1 for j in range(N)]
for i, a in enumerate(A):
if bits[i] == 0:
continue
for x, y in a:
# print(bits, bits[x - 1], y)
if bits[x - 1] == y:
continue
break
else:
continue
break
else:
ret = max(ret, sum(bits))
return ret
if __name__ == "__main__":
print(main())
|
[
"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 != b >> (x-1):
break
else:
continue
break
else:
ans = max(ans,bin(b).count("1"))
print(ans)
|
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 != (b >> (x-1) & 1):
break
else:
continue
break
else:
ans = max(ans,bin(b).count("1"))
print(ans)
|
[
"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 range(len(XY[j])):
if str(XY[j][k][1]) != i[XY[j][k][0]-1]:
temp2 = 1
break
if temp2 == 0:
if ans < temp:
ans = temp
print(ans)
|
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[j])):
if str(XY[j][k][1]) != i[XY[j][k][0]-1]:
temp2 = 1
break
if temp2 == 0:
if ans < temp:
ans = temp
print(ans)
|
[
"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 (status[Xa] == 1 and status[Xb] == yb):
no_paradox = False
break
if no_paradox:
ans = max(ans, sum(status))
print(ans)
|
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 (status[Xa] == 1 and status[Xb] != yb):
no_paradox = False
break
if no_paradox:
ans = max(ans, sum(status))
print(ans)
|
[
"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)
#iの情報は、(singi = (1/0,...,1/0))
for x,y in L[j]:
#jさんの情報
#i[j] :sinngi 正解
#y:sinngi を変換
if i[j]==0:
y = ~y
#x-1さんの正解i[j]
if i[x-1]==y:
flg = False
break
if flg:
cnt = max(cnt,sum(i))
print(cnt)
|
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)
#iの情報は、(singi = (1/0,...,1/0))
for x,y in L[j]:
#jさんの情報
#i[j] :sinngi 正解
#y:sinngi を変換
if i[j]==1:
if i[x-1]!=y:
flg = False
break
if flg:
cnt = max(cnt,sum(i))
print(cnt)
|
[
"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):
if(not((x in h)==y)):
break
else:
ans = max(ans,len(h))
print(ans)
|
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):
if(not((x in h)==y)):
break
else:
ans = max(ans,len(h))
print(ans)
|
[
"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 collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
n = I()
a = LI()
b = [0]*60
for i in range(n):
for j in range(a[i].bit_length()):
if (a[i] >> j) & 1:
b[j] += 1
ans = 0
tmp = 0
for i in range(59):
r = n-b[i]
ans += b[i]*r*(2**tmp)
ans %= mod
tmp += 1
print(ans)
|
#!/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 collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
n = I()
a = LI()
b = [0]*60
for i in range(n):
for j in range(a[i].bit_length()):
if (a[i] >> j) & 1:
b[j] += 1
ans = 0
tmp = 0
for i in range(60):
r = n-b[i]
ans += b[i]*r*(2**tmp)
ans %= mod
tmp += 1
print(ans)
|
[
"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
|
p02836
|
s=list(input())
l = len(s)//2
cnt = 0
for i in range(l-1):
if s[i] != s[-i+1]:
cnt += 1
print(cnt)
|
s=list(input())
l = len(s)//2
cnt = 0
for i in range(l):
if s[i] != s[-i-1]:
cnt += 1
print(cnt)
|
[
"expression.operation.binary.remove",
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 642,689
| 642,690
|
u626468554
|
python
|
p02836
|
S = input()
ans = 0
N = len(S)
for i in range(N):
if S[i] != S[N-1-i]:
ans += 1
print(cnt//2)
|
S = input()
ans = 0
N = len(S)
for i in range(N):
if S[i] != S[N-1-i]:
ans += 1
print(ans//2)
|
[
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 642,691
| 642,692
|
u847605090
|
python
|
p02836
|
S = input()
cnt = 0
N = len(S)
for i in range(N):
if S[i] != S[N-1-i]:
cnt += 1
print(cnt)
|
S = input()
cnt = 0
N = len(S)
for i in range(N):
if S[i] != S[N-1-i]:
cnt += 1
print(cnt//2)
|
[
"expression.operation.binary.add"
] | 642,695
| 642,696
|
u606523772
|
python
|
p02836
|
s = input() # 複数の入力値を取得
num = int(len(s) / 2)
print(num)
j = len(s) - 1
ans = 0
for i in range(num):
if s[i] != s[i + j]:
ans += 1
j -= 2
print(ans)
|
s = input() # 複数の入力値を取得
num = int(len(s) / 2)
j = len(s) - 1
ans = 0
for i in range(num):
if s[i] != s[i + j]:
ans += 1
j -= 2
print(ans)
|
[
"call.remove"
] | 642,701
| 642,702
|
u395010524
|
python
|
p02836
|
s=input()
ans=0
for i in range(len(s)//2)-1:
if s[i]!=s[len(s)-1-i]:
ans+=1
print(ans)
|
s=input()
ans=0
for i in range(len(s)//2):
if s[i]!=s[len(s)-1-i]:
ans+=1
print(ans)
|
[
"expression.operation.binary.remove"
] | 642,703
| 642,704
|
u566529875
|
python
|
p02836
|
s = input()
kk = len(s)
k = k//2
ans = 0
for i in range(k):
if s[i] != s[kk - i - 1]:
ans += 1
print(ans)
|
s = input()
kk = len(s)
k = kk//2
ans = 0
for i in range(k):
if s[i] != s[kk - i - 1]:
ans += 1
print(ans)
|
[
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 642,707
| 642,708
|
u720636500
|
python
|
p02836
|
s = input()
len_s = len(s)
total = 0
for i in range((len_s + 1) // 2):
if s[i] == s[len_s - i - 1]:
total += 1
print(total)
|
s = input()
len_s = len(s)
total = 0
for i in range((len_s + 1) // 2):
if s[i] != s[len_s - i - 1]:
total += 1
print(total)
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 642,709
| 642,710
|
u880646180
|
python
|
p02836
|
s = input()
len_s = len(s)
total = 0
for i in range(len_s // 2):
if s[i] == s[len_s - i - 1]:
total += 1
print(total)
|
s = input()
len_s = len(s)
total = 0
for i in range((len_s + 1) // 2):
if s[i] != s[len_s - i - 1]:
total += 1
print(total)
|
[
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 642,711
| 642,710
|
u880646180
|
python
|
p02836
|
s = input()
ans = 0
for c0, c1 in zip(s[:len(s)//2], s[-len(s)//2-1:-1]):
if c0 != c1:
ans += 1
print(ans)
|
s = input()
ans = 0
for c0, c1 in zip(s[:len(s)//2], s[:-len(s)//2-1:-1]):
if c0 != c1:
ans += 1
print(ans)
|
[
"call.arguments.change"
] | 642,715
| 642,716
|
u668923019
|
python
|
p02836
|
S = input()
l = len(S)
c = 0
for i in range(l // 2):
if S[i] == S[l-i]:
pass
else:
c +=1
print(c)
|
S = input()
l = len(S)
c = 0
for i in range(l // 2):
if S[i] == S[l-i-1]:
pass
else:
c +=1
print(c)
|
[
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 642,719
| 642,720
|
u873616440
|
python
|
p02836
|
S = input()
l = len(S)
c = 0
for i in range(l // 2):
if S[i] == S[l-i]:
c +=1
print(c)
|
S = input()
l = len(S)
c = 0
for i in range(l // 2):
if S[i] == S[l-i-1]:
pass
else:
c +=1
print(c)
|
[
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"control_flow.pass.add"
] | 642,721
| 642,720
|
u873616440
|
python
|
p02836
|
s = input()
cnt = 0
for i in range(len(s)//2):
if s[1] != s[-i-1]:
cnt += 1
print(cnt)
|
s = input()
cnt = 0
for i in range(len(s)//2):
if s[i] != s[-i-1]:
cnt += 1
print(cnt)
|
[
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 642,722
| 642,723
|
u159228113
|
python
|
p02836
|
S = input()
count = 0
for i in range(int(len(S)/2)):
if S[i] != S[len(S)-i]:
count += 1
print(count)
|
S = input()
count = 0
for i in range(int(len(S)/2)):
if S[i] != S[len(S)-i-1]:
count += 1
print(count)
|
[
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 642,728
| 642,729
|
u589432040
|
python
|
p02836
|
s = input()
n = len(s)
cost = 0
for i in range(n // 2):
cost += (s[i] != s[n - i])
print(cost)
|
s = input()
n = len(s)
cost = 0
for i in range(n // 2):
cost += (s[i] != s[n - i - 1])
print(cost)
|
[
"expression.operation.binary.add"
] | 642,732
| 642,733
|
u538276565
|
python
|
p02836
|
S = list(input())
cou = 0
for i in range(len(S)//2):
if S[i] != S[-i]:
cou += 1
print(cou)
|
S = list(input())
cou = 0
for i in range(len(S)//2):
if S[i] != S[-i-1]:
cou += 1
print(cou)
|
[
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 642,734
| 642,735
|
u013594089
|
python
|
p02836
|
s = input()
ans = 0
for i in range((len(s)-1)//2+1):
if a[i] != a[-1-i]:
ans += 1
print(ans)
|
s = input()
ans = 0
for i in range((len(s)-1)//2+1):
if s[i] != s[-1-i]:
ans += 1
print(ans)
|
[
"identifier.change",
"control_flow.branch.if.condition.change"
] | 642,740
| 642,741
|
u426108351
|
python
|
p02836
|
S=input()
slen = len(S)
slen2 = slen // 2
ans=0
for i in range (slen2):
if S[i] != S[-i]:
ans += 1
print(ans)
|
S=input()
slen = len(S)
slen2 = slen // 2
ans=0
for i in range (slen2):
if S[i] != S[-i-1]:
ans += 1
print(ans)
|
[
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 642,742
| 642,743
|
u107091170
|
python
|
p02836
|
s=input();l=len(s)//2-1;c=0
for i in range(l):
if s[i]!=s[-i-1]:
c+=1
print(c)
|
s=input();l=len(s)//2;c=0
for i in range(l):
if s[i]!=s[-i-1]:
c+=1
print(c)
|
[
"expression.operation.binary.remove"
] | 642,759
| 642,760
|
u179539980
|
python
|
p02836
|
s=input();l=len(s)//2-1;c=0
for i in range(l):
if s[i]!=s[-i]:
c+=1
print(c)
|
s=input();l=len(s)//2;c=0
for i in range(l):
if s[i]!=s[-i-1]:
c+=1
print(c)
|
[
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 642,761
| 642,760
|
u179539980
|
python
|
p02836
|
s = input()
count = 0
for i, c in enumerate(s):
if i >= (len(s) - 1) // 2:
break
if c != s[len(s) - 1 - i]:
count += 1
print(count)
|
s = input()
count = 0
for i, c in enumerate(s):
if i > (len(s) - 1) // 2:
break
if c != s[len(s) - 1 - i]:
count += 1
print(count)
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 642,764
| 642,765
|
u763177133
|
python
|
p02836
|
s=input()
count=0
i=0
while i<=(len(s) // 2):
if s[i]!=s[-(i+1)]:
count+=1
i+=1
print(count)
|
s=input()
count=0
i=0
while i<(len(s) // 2):
if s[i]!=s[-(i+1)]:
count+=1
i+=1
print(count)
|
[
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 642,766
| 642,767
|
u392433152
|
python
|
p02836
|
s=input()
i=0
count=0
while i<range(len(s)//2):
if s[i]!=s[-(i+1)]:
count+=1
i+=1
print(count)
|
s=input()
count=0
i=0
while i<(len(s) // 2):
if s[i]!=s[-(i+1)]:
count+=1
i+=1
print(count)
|
[
"assignment.variable.change",
"identifier.change",
"control_flow.loop.condition.change"
] | 642,769
| 642,767
|
u392433152
|
python
|
p02836
|
s = input()
ans = 0
for i in range(len(S)//2):
if S[i] != S[-i-1]:
ans+=1
print(ans)
|
S = input()
ans = 0
for i in range(len(S)//2):
if S[i] != S[-i-1]:
ans+=1
print(ans)
|
[
"assignment.variable.change",
"identifier.change"
] | 642,780
| 642,781
|
u905582793
|
python
|
p02836
|
str = input()
lst = list(str)
count = 0
print(lst)
for i in range(int((len(lst))/2)):
if lst[i] != lst[-i-1]:
count += 1
else:
pass
print(count)
|
str = input()
lst = list(str)
count = 0
for i in range(int(len(lst)/2)):
if lst[i] != lst[-i-1]:
count += 1
else:
pass
print(count)
|
[
"call.remove",
"call.arguments.change"
] | 642,784
| 642,785
|
u769551032
|
python
|
p02838
|
# 0がX個、1がY個ある(ただしX+Y=N)とき、Xorの組み合わせ自体は N*(N-1)//2 通りある。
# しかし、それらの和をとることを考えてみた時
# (0,0)と(1,1)を選んだ場合はそのXORは0になることに注意すると、(0,1)の組み合わせの個数だけ数えれば良い。
# これは、たとえば 〇〇〇●●●●(X=3,Y=4)から〇と●を選ぶ組み合わせは何個あるか、という問いと同じことなので
# Nの値には依存することはなく、単純にX*Y通りとなる。
# よって
# ΣΣ A_i Xor A_j = X*Y
# この処理によって、O(N^2)が、O(N)(=Aの各数字を一通り調べる)に減らせる。
# これを各ケタについて計算し、合計すれば良い。
# ケタ数が60まで定まっているので 計算量は O(Nlog(max(A)))≦ O(N*60)
# あるケタのbitを取り出すには ビットシフト「>>」でずらして下1ケタだけを見ると便利。
N=int(input())
A=list(map(int,input().split()))
p=10**9+7
ans=0
for k in range(60):
cnt_z=0
cnt_o=0
#print(A)
for i in range(N):
s=A[i]%2
if s==0:
cnt_z +=1
else:
cnt_o +=1
A[i] >>= 1
ans += ((2**k)*cnt_z*cnt_o)%p
print(ans)
|
# 0がX個、1がY個ある(ただしX+Y=N)とき、Xorの組み合わせ自体は N*(N-1)//2 通りある。
# しかし、それらの和をとることを考えてみた時
# (0,0)と(1,1)を選んだ場合はそのXORは0になることに注意すると、(0,1)の組み合わせの個数だけ数えれば良い。
# これは、たとえば 〇〇〇●●●●(X=3,Y=4)から〇と●を選ぶ組み合わせは何個あるか、という問いと同じことなので
# Nの値には依存することはなく、単純にX*Y通りとなる。
# よって
# ΣΣ A_i Xor A_j = X*Y
# この処理によって、O(N^2)が、O(N)(=Aの各数字を一通り調べる)に減らせる。
# これを各ケタについて計算し、合計すれば良い。
# ケタ数が60まで定まっているので 計算量は O(Nlog(max(A)))≦ O(N*60)
# あるケタのbitを取り出すには ビットシフト「>>」でずらして下1ケタだけを見ると便利。
N=int(input())
A=list(map(int,input().split()))
p=10**9+7
ans=0
for k in range(60):
cnt_z=0
cnt_o=0
#print(A)
for i in range(N):
s=A[i]%2
if s==0:
cnt_z +=1
else:
cnt_o +=1
A[i] >>= 1
ans += ((2**k)*cnt_z*cnt_o)%p
print(ans%p)
|
[
"expression.operation.binary.add"
] | 642,821
| 642,822
|
u089142196
|
python
|
p02838
|
#python3
import numpy as np
n=int(input())
a=np.array([int(i) for i in input().split()])
mod=int(1e9+7)
ans=0
for k in range(60):
b = (a>>k)&1
m = b.sum()
ans += m*(n-m)*2**k
print(ans%mod)
|
#python3
import numpy as np
n=int(input())
a=np.array([int(i) for i in input().split()])
mod=int(1e9+7)
ans=0
for k in range(60):
b = (a>>k)&1
m = np.count_nonzero(b)
ans += m*(n-m)*2**k
print(ans%mod)
|
[
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 642,830
| 642,831
|
u775681539
|
python
|
p02838
|
import sys
## io ##
def IS(): return sys.stdin.readline().rstrip()
def II(): return int(IS())
def MII(): return list(map(int, IS().split()))
def MIIZ(): return list(map(lambda x: x-1, MII()))
import numpy as np
#======================================================#
MOD=10**9+7
def main():
n = II()
aa = np.array(MII())
ans = 0
for i in range(60):
cnt1 = ((aa&1).sum())//1
ans += (cnt1*(n-cnt1)*(2**i))%MOD
aa >>= 1
print(ans%MOD)
if __name__ == '__main__':
main()
|
import sys
## io ##
def IS(): return sys.stdin.readline().rstrip()
def II(): return int(IS())
def MII(): return list(map(int, IS().split()))
def MIIZ(): return list(map(lambda x: x-1, MII()))
import numpy as np
#======================================================#
MOD=10**9+7
def main():
n = II()
aa = np.array(MII())
ans = 0
for i in range(60):
cnt1 = int((aa&1).sum())
ans += (cnt1*(n-cnt1)*(2**i))%MOD
aa >>= 1
print(ans%MOD)
if __name__ == '__main__':
main()
|
[
"call.add",
"type_conversion.to_integer.change",
"type_conversion.to_number.change",
"expression.operation.binary.remove"
] | 642,836
| 642,837
|
u638902622
|
python
|
p02838
|
import sys
## io ##
def IS(): return sys.stdin.readline().rstrip()
def II(): return int(IS())
def MII(): return list(map(int, IS().split()))
def MIIZ(): return list(map(lambda x: x-1, MII()))
import numpy as np
#======================================================#
MOD=10**9+7
def main():
n = II()
aa = np.array(MII())
ans = 0
for i in range(60):
cnt1 = (aa&1).sum()
ans += cnt1*(n-cnt1)*(2**i)
aa >>= 1
print(ans%MOD)
if __name__ == '__main__':
main()
|
import sys
## io ##
def IS(): return sys.stdin.readline().rstrip()
def II(): return int(IS())
def MII(): return list(map(int, IS().split()))
def MIIZ(): return list(map(lambda x: x-1, MII()))
import numpy as np
#======================================================#
MOD=10**9+7
def main():
n = II()
aa = np.array(MII())
ans = 0
for i in range(60):
cnt1 = int((aa&1).sum())
ans += cnt1*(n-cnt1)*(2**i)
aa >>= 1
print(ans%MOD)
if __name__ == '__main__':
main()
|
[
"call.add",
"call.arguments.change"
] | 642,838
| 642,839
|
u638902622
|
python
|
p02838
|
import sys
input = sys.stdin.readline
def main():
n=int(input())
#a=list(map(lambda x:list(map(int,list(bin(int(x))[2:]))),input().split()))
a=list(map(int,input().split()))
mod=pow(10,9)+7
bit=[]
for ai in a:
for j in range(61):
if ((ai>>j)&1):
bit[j]+=1
for i in range(61):# 2^iの位
ans+=(pow(2,i,mod)*bit[i]*(n-bit[i]))%mod
ans%=mod
print(ans)
if __name__=='__main__':
main()
|
import sys
input = sys.stdin.readline
def main():
n=int(input())
#a=list(map(lambda x:list(map(int,list(bin(int(x))[2:]))),input().split()))
a=list(map(int,input().split()))
mod=pow(10,9)+7
bit=[0]*61
for ai in a:
for j in range(61):
if ((ai>>j)&1):
bit[j]+=1
ans=0
for i in range(61):# 2^iの位
ans+=(pow(2,i,mod)*bit[i]*(n-bit[i]))%mod
ans%=mod
print(ans)
if __name__=='__main__':
main()
|
[
"assignment.change",
"assignment.add"
] | 642,841
| 642,842
|
u707124227
|
python
|
p02838
|
import numpy as np
N = int(input())
A = np.array(list(map(int, input().split())))
mod = 10**9 + 7
ans = 0
for i in range(60):
c = len(A[A&1==1])
a >>= 1
ans = (ans + c*(N-c)*pow(2,i,mod))%mod
print(ans)
|
import numpy as np
N = int(input())
A = np.array(list(map(int, input().split())))
mod = 10**9 + 7
ans = 0
for i in range(60):
c = len(A[A&1==1])
A >>= 1
ans = (ans + c*(N-c)*pow(2,i,mod))%mod
print(ans)
|
[
"identifier.change"
] | 642,875
| 642,876
|
u855710796
|
python
|
p02838
|
n=int(input())
a=list(map(int,input().split()))
m=10**9+7
bo=[0]*61
bz=[0]*61
for i in a:
t=format(i,'061b')
for j in range(61):
if t[j]=='0':
bz[j]+=1
else:
bo[j]+=1
bo=bo[::-1]
bz=bz[::-1]
x=0
for i in range(61):
x+=bo[i]*bz[i]*(2**i)
print(x)
|
n=int(input())
a=list(map(int,input().split()))
m=10**9+7
bo=[0]*61
bz=[0]*61
for i in a:
t=format(i,'061b')
for j in range(61):
if t[j]=='0':
bz[j]+=1
else:
bo[j]+=1
bo=bo[::-1]
bz=bz[::-1]
x=0
for i in range(61):
x+=bo[i]*bz[i]*(2**i)
x%=m
print(x%m)
|
[
"expression.operation.binary.add"
] | 642,906
| 642,907
|
u539517139
|
python
|
p02838
|
mod = 10**9+7
N = int(input())
A = list(map(int, input().split()))
mx = max(A)
d = {i:0 for i in range(len(str(bin(mx))))}
for a in A:
for i in range(len(str(bin(a)))-2):
if (a>>i)&1:
d[i] += 1
ans = 0
for k, v in d.items():
ans += v*(10-v) * (2**k)
ans %= mod
print(ans)
|
mod = 10**9+7
N = int(input())
A = list(map(int, input().split()))
mx = max(A)
d = {i:0 for i in range(len(str(bin(mx)))-2)}
for a in A:
for i in range(len(str(bin(a)))-2):
if (a>>i)&1:
d[i] += 1
ans = 0
for k, v in d.items():
ans += v*(N-v) * (2**k)
ans %= mod
print(ans)
|
[
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change"
] | 642,928
| 642,929
|
u844646164
|
python
|
p02838
|
n = int(input())
a = list(map(int, input().split()))
c1_list = [0]*60
for i in range(n):
b = format(a[i], '060b')
print(b)
for j in range(len(b)):
if b[j] == "1":
c1_list[j] += 1
count = 0
for i in range(60):
count = (count + c1_list[i]*(n-c1_list[i])*2**(59-i)) % 1000000007
print(count)
|
n = int(input())
a = list(map(int, input().split()))
c1_list = [0]*60
for i in range(n):
b = format(a[i], '060b')
for j in range(len(b)):
if b[j] == "1":
c1_list[j] += 1
count = 0
for i in range(60):
count = (count + c1_list[i]*(n-c1_list[i])*2**(59-i)) % 1000000007
print(count)
|
[
"call.remove"
] | 642,938
| 642,939
|
u626881915
|
python
|
p02838
|
N = int(input())
A = list(map(int, input().split()))
mod = 10**9 + 7
ans = 0
for i in range(60):
X = sum([1 for x in A if (x >> 1) & 1])
ans += (1 << i) * X * (N - X)
ans %= mod
print(ans)
|
N = int(input())
A = list(map(int, input().split()))
mod = 10**9 + 7
ans = 0
for i in range(60):
X = sum([1 for x in A if (x >> i) & 1])
ans += (1 << i) * X * (N - X)
ans %= mod
print(ans)
|
[
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"expression.operation.binary.change"
] | 642,951
| 642,952
|
u801049006
|
python
|
p02838
|
import numpy as np
n = int(input())
aa = list(map(int, input().split()))
mod = 10**9+7
res = 1
pow2 = 1
ans = 0
for i in range(60):
cnt = np.count_nonzero(np.array(aa)&2)
ans = (ans + cnt * (n-cnt) * res)%mod
res = (res*2)%mod
pow2*=2
print(ans)
|
import numpy as np
n = int(input())
aa = list(map(int, input().split()))
mod = 10**9+7
res = 1
pow2 = 1
ans = 0
for i in range(60):
cnt = np.count_nonzero(np.array(aa)&pow2)
ans = (ans + cnt * (n-cnt) * res)%mod
res = (res*2)%mod
pow2*=2
print(ans)
|
[
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"expression.operation.binary.change"
] | 642,961
| 642,962
|
u303739137
|
python
|
p02838
|
n = int(input())
aa = list(map(int, input().split()))
mod = 10**9+7
res = 1
pow2 = 1
ans = 0
for i in range(60):
cnt = np.count_nonzero(np.array(aa)&2)
ans = (ans + cnt * (n-cnt) * res)%mod
res = (res*2)%mod
pow2*=2
print(ans)
|
import numpy as np
n = int(input())
aa = list(map(int, input().split()))
mod = 10**9+7
res = 1
pow2 = 1
ans = 0
for i in range(60):
cnt = np.count_nonzero(np.array(aa)&pow2)
ans = (ans + cnt * (n-cnt) * res)%mod
res = (res*2)%mod
pow2*=2
print(ans)
|
[
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"expression.operation.binary.change"
] | 642,963
| 642,962
|
u303739137
|
python
|
p02838
|
import numpy as np
mod = 1000000007
n = int(input())
a = np.array(list(map(int, input().split())))
bit = 1
ans = 0
for i in range(60):
a_and = a & 1
cnt_one = np.count_nonzero(a_and)
ans += (cnt_one * (n - cnt_one) * bit) % mod
a >>= 1
bit *= 2
bit % mod
print(ans)
|
import numpy as np
mod = 1000000007
n = int(input())
a = np.array(list(map(int, input().split())))
bit = 1
ans = 0
for i in range(60):
a_and = a & 1
cnt_one = np.count_nonzero(a_and)
ans += (cnt_one * (n - cnt_one) * bit) % mod
ans %= mod
a >>= 1
bit *= 2
bit % mod
print(ans)
|
[] | 642,968
| 642,969
|
u111473084
|
python
|
p02838
|
import numpy as np
mod = 1000000007
n = int(input())
a = np.array(list(map(int, input().split())))
bit = 1
ans = 0
for n in range(60):
a_and = a & 1
cnt_one = np.count_nonzero(a_and)
ans += (cnt_one * (n - cnt_one) * bit) % mod
a >>= 1
bit *= 2
bit % mod
print(ans)
|
import numpy as np
mod = 1000000007
n = int(input())
a = np.array(list(map(int, input().split())))
bit = 1
ans = 0
for i in range(60):
a_and = a & 1
cnt_one = np.count_nonzero(a_and)
ans += (cnt_one * (n - cnt_one) * bit) % mod
ans %= mod
a >>= 1
bit *= 2
bit % mod
print(ans)
|
[
"identifier.change"
] | 642,970
| 642,969
|
u111473084
|
python
|
p02838
|
MOD = (10**9) + 7
n = int(input())
a = list(map(int,intput().split()))
cnt = [0] * 60
for num in a:
for j in range(60):
cnt[j] += (num >> j) % 2
ans = 0
for b in range(60):
ans += cnt[b] * (n-cnt[b]) << b
ans %= MOD
print(ans)
|
MOD = (10**9) + 7
n = int(input())
a = list(map(int,input().split()))
cnt = [0] * 60
for num in a:
for j in range(60):
cnt[j] += (num >> j) % 2
ans = 0
for b in range(60):
ans += cnt[b] * (n-cnt[b]) << b
ans %= MOD
print(ans)
|
[
"assignment.value.change",
"identifier.change",
"call.function.change",
"call.arguments.change"
] | 642,986
| 642,987
|
u818476133
|
python
|
p02838
|
MOD = (10**9) + 7
n = int(input())
a = list(map(int,intput().split()))
cnt = [0] * 60
for num in a:
for j in range(60):
cnt[j] += num >> j
ans = 0
for b in range(60):
ans += cnt[b] * (n-cnt[b]) << b
ans %= MOD
print(ans)
|
MOD = (10**9) + 7
n = int(input())
a = list(map(int,input().split()))
cnt = [0] * 60
for num in a:
for j in range(60):
cnt[j] += (num >> j) % 2
ans = 0
for b in range(60):
ans += cnt[b] * (n-cnt[b]) << b
ans %= MOD
print(ans)
|
[
"assignment.value.change",
"identifier.change",
"call.function.change",
"call.arguments.change"
] | 642,988
| 642,987
|
u818476133
|
python
|
p02838
|
import numpy as np
import sys, math
from itertools import permutations, combinations
from collections import defaultdict, Counter, deque
from math import factorial#, gcd
from bisect import bisect_left #bisect_left(list, value)
sys.setrecursionlimit(10**7)
enu = enumerate
MOD = 10**9+7
def input(): return sys.stdin.readline()[:-1]
def pri(x): print('\n'.join(map(str, x)))
N = int(input())
A = np.array(input().split(), np.int)
#print(A)
cnt = 0
for i in range(61):
B = (A>>i)&1
z = np.count_nonzero(B)
cnt += z*(N-z)*(2**(i))
print(cnt)
|
import numpy as np
import sys, math
from itertools import permutations, combinations
from collections import defaultdict, Counter, deque
from math import factorial#, gcd
from bisect import bisect_left #bisect_left(list, value)
sys.setrecursionlimit(10**7)
enu = enumerate
MOD = 10**9+7
def input(): return sys.stdin.readline()[:-1]
def pri(x): print('\n'.join(map(str, x)))
N = int(input())
A = np.array(input().split(), np.int)
#print(A)
cnt = 0
for i in range(61):
B = (A>>i)&1
z = np.count_nonzero(B)
cnt += z*(N-z)*(2**(i))
cnt %= MOD
print(cnt)
|
[] | 642,993
| 642,994
|
u625729943
|
python
|
p02838
|
N = int(input())
A = list(map(int, input().split()))
count = [0] * 60
m = 1000000007
def pow_k(x, n):
if n == 0:
return 1
K = 1
while n > 1:
if n % 2 != 0:
K = (K * x) % 1000000007
x = (x * x) % 1000000007
n //= 2
return (K * x) % 1000000007
mul = [pow_k(2,59-i) for i in range(60)]
for a in A:
b = bin(a)
for i in range(1,len(b)-1):
if b[-i] == '1':
count[-i] += 1
print(sum([count[i]*(N-count[i])*mul[i]%m for i in range(60)]))
|
N = int(input())
A = list(map(int, input().split()))
count = [0] * 60
m = 1000000007
def pow_k(x, n):
if n == 0:
return 1
K = 1
while n > 1:
if n % 2 != 0:
K = (K * x) % 1000000007
x = (x * x) % 1000000007
n //= 2
return (K * x) % 1000000007
mul = [pow_k(2,59-i) for i in range(60)]
for a in A:
b = bin(a)
for i in range(1,len(b)-1):
if b[-i] == '1':
count[-i] += 1
print(sum([count[i]*(N-count[i])*mul[i]%m for i in range(60)])%m)
|
[
"expression.operation.binary.add"
] | 643,014
| 643,015
|
u093041722
|
python
|
p02838
|
import numpy as np
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
n = int(readline())
a = np.array(read().split(), np.int64)
mod = 10 ** 9 + 7
ans = 0
for i in range(61):
b = a >> i & 1
x = len(b) - sum(b)
y = n - x
z = x * y
z *= 2 ** i
z %= mod
ans += z
ans %= mod
print(ans)
|
import numpy as np
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
n = int(readline())
a = np.array(read().split(), np.int64)
mod = 10 ** 9 + 7
ans = 0
for i in range(61):
b = a >> i & 1
x = np.count_nonzero(b)
y = n - x
z = x * y
z *= 2 ** i
z %= mod
ans += z
ans %= mod
print(ans)
|
[
"expression.operation.binary.remove"
] | 643,038
| 643,039
|
u706330549
|
python
|
p02838
|
import numpy as np
mod = 10**9 + 7
N = int(input())
A = np.array(list(map(int, input().split())))
ans = 0
for n in range(len(bin(max(A)))):
n_1 = np.count_nonzero((A >> n)&1)
n_0 = N - num_1
ans += ((2 ** n)*n_1*n_0) % mod
print(ans%mod)
|
import numpy as np
mod = 10**9 + 7
N = int(input())
A = np.array(list(map(int, input().split())))
ans = 0
for n in range(len(bin(max(A)))):
n_1 = np.count_nonzero((A >> n)&1)
n_0 = N - n_1
ans += ((2 ** n)*n_1*n_0) % mod
print(ans%mod)
|
[
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 643,040
| 643,041
|
u686036872
|
python
|
p02838
|
def cmb(n, r, p):
if (r < 0) or (n < r):
return 0
r = min(r, n - r)
return fac[n]*finv[r]*finv[n-r]%p
def perm(n,r,p):
if (r < 0) or (n < r):
return 0
return fac[n]*finv[n-r]%p
N = 31000
MOD = pow(10,9)+7
fac = [-1]*(N+1); fac[0] = 1; fac[1] = 1 #階乗
finv = [-1]*(N+1); finv[0] = 1; finv[1] = 1 #階乗の逆元
inv = [-1]*(N+1); inv[0] = 0; inv[1] = 1 #逆元
for i in range(2,N+1):
fac[i] = fac[i-1]*i%MOD
inv[i] = MOD - inv[MOD%i]*(MOD//i)%MOD
finv[i] = finv[i-1]*inv[i]%MOD
M = int(input())
A = list(map(int,input().split()))
MAX = 63
L = [0]*MAX
for i in range(M):
for j in range(MAX):
if A[i]>>j&1:
L[j] += 1
#print(L)
ans = 0
for i in range(MAX):
base = pow(2,i)
kosu = cmb(M,2,MOD)-cmb(L[i],2,MOD)-cmb(M-L[i],2,MOD)
ans += base*kosu%MOD
print(ans%MOD)
|
def cmb(n, r, p):
if (r < 0) or (n < r):
return 0
r = min(r, n - r)
return fac[n]*finv[r]*finv[n-r]%p
def perm(n,r,p):
if (r < 0) or (n < r):
return 0
return fac[n]*finv[n-r]%p
N = 310000
MOD = pow(10,9)+7
fac = [-1]*(N+1); fac[0] = 1; fac[1] = 1 #階乗
finv = [-1]*(N+1); finv[0] = 1; finv[1] = 1 #階乗の逆元
inv = [-1]*(N+1); inv[0] = 0; inv[1] = 1 #逆元
for i in range(2,N+1):
fac[i] = fac[i-1]*i%MOD
inv[i] = MOD - inv[MOD%i]*(MOD//i)%MOD
finv[i] = finv[i-1]*inv[i]%MOD
M = int(input())
A = list(map(int,input().split()))
MAX = 63
L = [0]*MAX
for i in range(M):
for j in range(MAX):
if A[i]>>j&1:
L[j] += 1
#print(L)
ans = 0
for i in range(MAX):
base = pow(2,i)
kosu = cmb(M,2,MOD)-cmb(L[i],2,MOD)-cmb(M-L[i],2,MOD)
ans += base*kosu%MOD
print(ans%MOD)
|
[
"literal.number.integer.change",
"assignment.value.change"
] | 643,147
| 643,148
|
u197457087
|
python
|
p02838
|
def cmb(n, r, p):
if (r < 0) or (n < r):
return 0
r = min(r, n - r)
return fac[n]*finv[r]*finv[n-r]%p
def perm(n,r,p):
if (r < 0) or (n < r):
return 0
return fac[n]*finv[n-r]%p
N = 31000
MOD = pow(10,9)+7
fac = [-1]*(N+1); fac[0] = 1; fac[1] = 1 #階乗
finv = [-1]*(N+1); finv[0] = 1; finv[1] = 1 #階乗の逆元
inv = [-1]*(N+1); inv[0] = 0; inv[1] = 1 #逆元
for i in range(2,N+1):
fac[i] = fac[i-1]*i%MOD
inv[i] = MOD - inv[MOD%i]*(MOD//i)%MOD
finv[i] = finv[i-1]*inv[i]%MOD
M = int(input())
A = list(map(int,input().split()))
MAX = 60
L = [0]*MAX
for i in range(M):
for j in range(MAX):
if A[i]>>j&1:
L[j] += 1
#print(L)
ans = 0
for i in range(MAX):
base = pow(2,i)
kosu = cmb(M,2,MOD)-cmb(L[i],2,MOD)-cmb(M-L[i],2,MOD)
ans += base*kosu%MOD
print(ans%MOD)
|
def cmb(n, r, p):
if (r < 0) or (n < r):
return 0
r = min(r, n - r)
return fac[n]*finv[r]*finv[n-r]%p
def perm(n,r,p):
if (r < 0) or (n < r):
return 0
return fac[n]*finv[n-r]%p
N = 310000
MOD = pow(10,9)+7
fac = [-1]*(N+1); fac[0] = 1; fac[1] = 1 #階乗
finv = [-1]*(N+1); finv[0] = 1; finv[1] = 1 #階乗の逆元
inv = [-1]*(N+1); inv[0] = 0; inv[1] = 1 #逆元
for i in range(2,N+1):
fac[i] = fac[i-1]*i%MOD
inv[i] = MOD - inv[MOD%i]*(MOD//i)%MOD
finv[i] = finv[i-1]*inv[i]%MOD
M = int(input())
A = list(map(int,input().split()))
MAX = 63
L = [0]*MAX
for i in range(M):
for j in range(MAX):
if A[i]>>j&1:
L[j] += 1
#print(L)
ans = 0
for i in range(MAX):
base = pow(2,i)
kosu = cmb(M,2,MOD)-cmb(L[i],2,MOD)-cmb(M-L[i],2,MOD)
ans += base*kosu%MOD
print(ans%MOD)
|
[
"literal.number.integer.change",
"assignment.value.change"
] | 643,149
| 643,148
|
u197457087
|
python
|
p02838
|
import numpy as np
n=int(input())
a=np.array(list(map(int,input().split())))
mod=10**9+7
s=0
for i in range(60):
bit = np.count_nonzero(a & 1)
print(bit)
s += bit*(n-bit)*(2**i)
a >>= 1
print(s % mod)
|
import numpy as np
n=int(input())
a=np.array(list(map(int,input().split())))
mod=10**9+7
s=0
for i in range(60):
bit = np.count_nonzero(a & 1)
s += bit*(n-bit)*(2**i)
a >>= 1
print(s % mod)
|
[
"call.remove"
] | 643,150
| 643,151
|
u094191970
|
python
|
p02838
|
N, *A = map(int, open(0).read().split())
A = np.array(A, dtype=np.int64)
mod = 10**9 + 7
ans = 0
for i in range(60):
mask = 1 << i
cnt = np.count_nonzero(A&mask)
x = cnt * (N-cnt)
x *= mask % mod
ans += x
ans %= mod
print(ans)
|
import numpy as np
N, *A = map(int, open(0).read().split())
A = np.array(A, dtype=np.int64)
mod = 10**9 + 7
ans = 0
for i in range(60):
mask = 1 << i
cnt = np.count_nonzero(A&mask)
x = cnt * (N-cnt)
x *= mask % mod
ans += x
ans %= mod
print(ans)
|
[] | 643,171
| 643,172
|
u814271993
|
python
|
p02838
|
N = int(input())
A = list(map(int,input().split()))
mod = 10**9+7
ans = 0
for bit in range(10):
m = 1 << bit
# bit桁目のbitが立っている時の数
c = sum(a&m for a in A) >> bit
# bit桁目の1の合計
ans += (c*(N-c))<<bit
# 繰り上がりのない足し算
ans %= mod
print(ans)
|
N = int(input())
A = list(map(int,input().split()))
mod = 10**9+7
ans = 0
for bit in range(60):
m = 1 << bit
# bit桁目のbitが立っている時の数
c = sum(a&m for a in A) >> bit
# bit桁目の1の合計
ans += (c*(N-c))<<bit
# 繰り上がりのない足し算
ans %= mod
print(ans)
|
[
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 643,206
| 643,207
|
u679520304
|
python
|
p02838
|
n=int(input())
lists=list(map(int,input().split()))
length=61
use=[0 for i in range(61)]
a,b=divmod(n,9)
anslist=[0 for i in range(a+1)]
for j in range(n):
k=format(lists[j],"0%ib"%length)
k=k[::-1]
p,q=divmod(n,9)
if p>a:
anslist.append(int(k))
else:
anslist[p]+=int(k)
answer=0
for some in anslist:
some=str(some)
some=some.zfill(61)
for j in range(61):
if int(some[j])!=0:
use[j]+=int(some[j])
for j in range(61):
answer+=(2**j)*use[j]*(n-use[j])%(10**9+7)
print(answer%(10**9+7))
|
n=int(input())
lists=list(map(int,input().split()))
length=61
use=[0 for i in range(61)]
a,b=divmod(n,9)
anslist=[0 for i in range(a+1)]
for j in range(n):
k=format(lists[j],"0%ib"%length)
k=k[::-1]
p,q=divmod(j,9)
if p>a:
anslist.append(str(k))
else:
anslist[p]+=int(k)
answer=0
for some in anslist:
some=str(some)
some=some.zfill(61)
for j in range(61):
if int(some[j])!=0:
use[j]+=int(some[j])
for j in range(61):
answer+=(2**j)*use[j]*(n-use[j])%(10**9+7)
print(answer%(10**9+7))
|
[
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"call.function.change"
] | 643,210
| 643,211
|
u780962115
|
python
|
p02838
|
n = int(input())
a = list(map(int,input().split()))
mod = 10e9+7
ans = 0
for i in range(60):
x = 1<< i
l = len([1 for j in a if j & x])
ans += x * l * (n-l) % mod
ans %= mod
print(ans)
|
n = int(input())
a = list(map(int,input().split()))
mod = 10**9+7
ans = 0
for i in range(60):
x = 1<< i
l = len([1 for j in a if j & x])
ans += x * l * (n-l) % mod
ans %= mod
print(ans)
|
[
"assignment.value.change",
"expression.operation.binary.change"
] | 643,233
| 643,234
|
u740284863
|
python
|
p02838
|
N = int(input())
A = list(map(int, input().split()))
m = 1000000007
result = 0
for bit in range(60):
m = 1 << bit
c = sum(a & m for a in A) >> bit
result += (c * (N - c)) << bit
result %= m
print(result)
|
N = int(input())
A = list(map(int, input().split()))
m = 1000000007
result = 0
for i in range(60):
j = 1 << i
c = sum(a & j for a in A) >> i
result += (c * (N - c)) << i
result %= m
print(result)
|
[
"identifier.change",
"assignment.variable.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 643,235
| 643,236
|
u347640436
|
python
|
p02838
|
import numpy as np
N = int(input())
A = np.fromstring(input(), np.int64, ' ')
result = 0
for bit in range(60):
c = int((A & 1).sum())
A >>= 1
result = (result + c * (N - c) * (1 << bit)) % 1000000007
print(result)
|
import numpy as np
N = int(input())
A = np.fromstring(input(), dtype = np.int64, sep = ' ')
result = 0
for bit in range(60):
c = int((A & 1).sum())
A >>= 1
result = (result + c * (N - c) * (1 << bit)) % 1000000007
print(result)
|
[
"call.arguments.keyword_argument.add"
] | 643,237
| 643,238
|
u347640436
|
python
|
p02838
|
import numpy as np
N = int(input())
A = np.fromiter(map(int, input().split()))
result = 0
for b in range(60):
bs = int(((A >> b) & 1).sum())
result = (result + bs * (N - bs) * (1 << b)) % 1000000007
print(result)
|
import numpy as np
N = int(input())
A = np.fromiter(map(int, input().split()), np.int64)
result = 0
for b in range(60):
bs = int(((A >> b) & 1).sum())
result = (result + bs * (N - bs) * (1 << b)) % 1000000007
print(result)
|
[
"call.arguments.add"
] | 643,239
| 643,240
|
u347640436
|
python
|
p02838
|
import numpy as np
N = int(input())
A = np.array(list(map(int, input().split())))
result = 0
for b in range(60):
bs = ((A >> b) & 1).sum()
result = (result + bs * (N - bs) * (1 << b)) % 1000000007
print(result)
|
import numpy as np
N = int(input())
A = np.array(list(map(int, input().split())))
result = 0
for b in range(60):
bs = int(((A >> b) & 1).sum())
result = (result + bs * (N - bs) * (1 << b)) % 1000000007
print(result)
|
[
"call.add",
"call.arguments.change"
] | 643,241
| 643,242
|
u347640436
|
python
|
p02838
|
import numpy as np
N = int(input())
A = np.asarray(list(map(int, input().split())))
result = 0
for b in range(60):
bs = ((A >> b) & 1).sum()
result = (result + bs * (N - bs) * (1 << b)) % 1000000007
print(result)
|
import numpy as np
N = int(input())
A = np.array(list(map(int, input().split())))
result = 0
for b in range(60):
bs = int(((A >> b) & 1).sum())
result = (result + bs * (N - bs) * (1 << b)) % 1000000007
print(result)
|
[
"assignment.value.change",
"identifier.change",
"call.add",
"call.arguments.change"
] | 643,243
| 643,242
|
u347640436
|
python
|
p02838
|
n = int(input())
A = list(map(int, input().split()))
MOD = 1e9+7
ans = 0
for i in range(60):
cnt = 0
for a in A:
cnt += a>>i&1
ans += cnt*(n-cnt)*2**i
ans %= MOD
print(ans)
|
n = int(input())
A = list(map(int, input().split()))
MOD = 10**9+7
ans = 0
for i in range(60):
cnt = 0
for a in A:
cnt += a>>i&1
ans += cnt*(n-cnt)*2**i
ans %= MOD
print(ans)
|
[
"assignment.value.change",
"expression.operation.binary.change"
] | 643,253
| 643,252
|
u826785572
|
python
|
p02838
|
N = int(input())
A = map(int, input().split())
D = [[0, 0] for _ in range(60)]
for a in A:
for i in range(60):
if (a >> i) & 1:
D[i][1] += 1
else:
D[i][0] += 1
ans = 0
mod = 10 ** 9 + 7
for idx, d in enumerate(D):
ans += (d[0] * d[1] * (1 << idx)) % mod
print(ans)
|
N = int(input())
A = map(int, input().split())
D = [[0, 0] for _ in range(60)]
for a in A:
for i in range(60):
if (a >> i) & 1:
D[i][1] += 1
else:
D[i][0] += 1
ans = 0
mod = 10 ** 9 + 7
for idx, d in enumerate(D):
ans = (ans + (d[0] * d[1] * (1 << idx))) % mod
print(ans)
|
[
"assignment.value.change"
] | 643,268
| 643,269
|
u724687935
|
python
|
p02838
|
##かっこいい実装
import numpy as np
#mod = 10**9+7
#n = int(input())
#a = np.fromstring(input(), dtype = np.int64, sep = ' ')
#
#result = 0
#for i in range(60):
# count_one = int((a&1).sum())
# result += count_one*(n-count_one)*(2**i)
# a >>= 1
#print(result%mod)
N = int(input())
A = np.fromstring(input(),dtype = np.int64, sep = ' ')
Large = 10**9 + 7
ans = 0
for i in range(60):
sum1 = (A&1).sum()
ans += sum1*(N-sum1) * 2**i
#ans %= Large
A>>=1 # A = A>>1とする
print(ans%Large)
|
##かっこいい実装
import numpy as np
#mod = 10**9+7
#n = int(input())
#a = np.fromstring(input(), dtype = np.int64, sep = ' ')
#
#result = 0
#for i in range(60):
# count_one = int((a&1).sum())
# result += count_one*(n-count_one)*(2**i)
# a >>= 1
#print(result%mod)
N = int(input())
A = np.fromstring(input(),dtype = np.int64, sep = ' ')
Large = 10**9 + 7
ans = 0
for i in range(60):
sum1 = int((A&1).sum())
ans += sum1*(N-sum1) * 2**i
#ans %= Large
A>>=1 # A = A>>1とする
print(ans%Large)
|
[
"call.add",
"call.arguments.change"
] | 643,272
| 643,273
|
u797106134
|
python
|
p02838
|
n=int(input())
l=sorted(list(map(int,input().split())))
for i,x in enumerate(l):
l[i]=format(x,'63b')
memo=[0]*63
for i in range(61):
for j in range(n):
if l[j][i]=='1':
memo[-i-1]+=1
now=1
ans=0
mod=10**9+7
for x in memo:
ans+=(now*x*(n-x))%mod
now*=2
print(ans%mod)
|
n=int(input())
l=sorted(list(map(int,input().split())))
for i,x in enumerate(l):
l[i]=format(x,'63b')
memo=[0]*63
for i in range(63):
for j in range(n):
if l[j][i]=='1':
memo[-i-1]+=1
now=1
ans=0
mod=10**9+7
for x in memo:
ans+=(now*x*(n-x))%mod
now*=2
print(ans%mod)
|
[
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 643,293
| 643,294
|
u769870836
|
python
|
p02838
|
n=int(input())
a=list(map(int,input().split()))
mod=10**9+7
ans=0
for i in range(60):
x=1<<(i+1)
z=o=0
for j in range(n):
if a[j]&x:o+=1
else:z+=1
ans=(ans+((x%mod)*o*z)%mod)%mod
print(ans)
|
n=int(input())
a=list(map(int,input().split()))
mod=10**9+7
ans=0
for i in range(60):
x=1<<i
z=o=0
for j in range(n):
if a[j]&x:o+=1
else:z+=1
ans=(ans+((x%mod)*o*z)%mod)%mod
print(ans)
|
[] | 643,315
| 643,316
|
u227082700
|
python
|
p02838
|
n = int(input())
a = list(map(int, input().split()))
mod = 10**9+7
result = [0 for _ in range(120)]
for i in a:
x = format(i, "060b")[::-1]
for j in range(60):
result[j] = result[j]+(x[j]=="1")
result = [(n-i)*i for i in result]
for i in range(70):
result[i+1] += result[i]//2
result[i] = result[i]%2
print(int("".join(map(str, result[::-1])), 2)%mod)
|
n = int(input())
a = list(map(int, input().split()))
mod = 10**9+7
result = [0 for _ in range(120)]
for i in a:
x = format(i, "060b")[::-1]
for j in range(60):
result[j] = result[j]+(x[j]=="1")
result = [(n-i)*i for i in result]
for i in range(119):
result[i+1] += result[i]//2
result[i] = result[i]%2
print(int("".join(map(str, result[::-1])), 2)%mod)
|
[
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 643,429
| 643,430
|
u413165887
|
python
|
p02838
|
import numpy as np
mod = 10**9+7
n = int(input())
a = np.fromstring(input(), dtype = np.int64, sep = ' ')
result = 0
for i in range(60):
count_one = (a&1).sum()
result += count_one*(n-count_one)*(2**i)
a >>= 1
print(result%mod)
|
import numpy as np
mod = 10**9+7
n = int(input())
a = np.fromstring(input(), dtype = np.int64, sep = ' ')
result = 0
for i in range(60):
count_one = int((a&1).sum())
result += count_one*(n-count_one)*(2**i)
a >>= 1
print(result%mod)
|
[
"call.add",
"call.arguments.change"
] | 643,431
| 643,432
|
u413165887
|
python
|
p02838
|
n = int(input())
arr = np.array([int(i) for i in input().split()])
mod = 10 ** 9 + 7
s = 0
for i in range(60):
c1 = np.count_nonzero(arr & 1)
s += 2 ** i * c1 * (n - c1)
arr = arr >> 1
print(s % mod)
|
import numpy as np
n = int(input())
arr = np.array([int(i) for i in input().split()])
mod = 10 ** 9 + 7
s = 0
for i in range(60):
c1 = np.count_nonzero(arr & 1)
s += 2 ** i * c1 * (n - c1)
arr = arr >> 1
print(s % mod)
|
[] | 643,435
| 643,436
|
u837677955
|
python
|
p02838
|
import numpy as np
import sys
n = int(input())
a = np.array(sys.stdin.read().split(), dtype=np.int64)
mod = 10 ** 9 + 7
ans = 0
for i in range(63):
b = (a >> i) & 1
x = np.count_nonzero(b)
x = x * (n - x)
ans += x * pow(2, i, mod) % mod
print(ans)
|
import numpy as np
import sys
n = int(input())
a = np.array(sys.stdin.read().split(), dtype=np.int64)
mod = 10 ** 9 + 7
ans = 0
for i in range(63):
b = (a >> i) & 1
x = np.count_nonzero(b)
x = x * (n - x)
ans += x * pow(2, i, mod) % mod
print(ans % mod)
|
[
"expression.operation.binary.add"
] | 643,437
| 643,438
|
u157020659
|
python
|
p02838
|
import numpy as np
import sys
n = int(input())
a = np.array(sys.stdin.read().split(), dtype=np.int64)
mod = 10 ** 9 + 7
ans = 0
for i in range(63):
b = (a >> i) & 1
print(b)
x = np.count_nonzero(b)
x = x * (n - x)
ans += x * pow(2, i, mod) % mod
print(ans)
|
import numpy as np
import sys
n = int(input())
a = np.array(sys.stdin.read().split(), dtype=np.int64)
mod = 10 ** 9 + 7
ans = 0
for i in range(63):
b = (a >> i) & 1
x = np.count_nonzero(b)
x = x * (n - x)
ans += x * pow(2, i, mod) % mod
print(ans % mod)
|
[
"call.remove"
] | 643,439
| 643,438
|
u157020659
|
python
|
p02838
|
import numpy as np
n = int(input())
mod = 10**9+7
a = np.array(list(map(int,input().split())))
ans = 0
for i in range(60):
#aをiビット右にずらす、iは60桁目まで、&1で対象のビットが1のもの以外を0にその数をカウントする。
b = np.count_nonzero(a >>i&1)
ans += ((2**i)*(n-b)*b)%mod
print(ans)
|
import numpy as np
n = int(input())
mod = 10**9+7
a = np.array(list(map(int,input().split())))
ans = 0
for i in range(60):
#aをiビット右にずらす、iは60桁目まで、&1で対象のビットが1のもの以外を0にその数をカウントする。
b = np.count_nonzero(a >>i&1)
ans += ((2**i)*(n-b)*b)%mod
print(ans%mod)
|
[
"expression.operation.binary.add"
] | 643,442
| 643,443
|
u549383771
|
python
|
p02838
|
n = int(input())
mod = 10**9+7
a = np.array(list(map(int,input().split())))
ans = 0
for i in range(60):
#aをiビット右にずらす、iは60桁目まで、&1で対象のビットが1のもの以外を0にその数をカウントする。
b = np.count_nonzero(a >>i&1)
ans += ((2**i)*(n-b)*b)%mod
print(ans)
|
import numpy as np
n = int(input())
mod = 10**9+7
a = np.array(list(map(int,input().split())))
ans = 0
for i in range(60):
#aをiビット右にずらす、iは60桁目まで、&1で対象のビットが1のもの以外を0にその数をカウントする。
b = np.count_nonzero(a >>i&1)
ans += ((2**i)*(n-b)*b)%mod
print(ans%mod)
|
[
"expression.operation.binary.add"
] | 643,444
| 643,443
|
u549383771
|
python
|
p02838
|
n = int(input())
a = [int(i) for i in input().split()]
mod = 10 ** 9 + 7
ans = 0
for i in range(60):
b = sum(map(lambda x: (x >> i)&1, a))
c = n - b
ans += b * c * i % mod
print(ans%mod)
|
n = int(input())
a = [int(i) for i in input().split()]
mod = 10 ** 9 + 7
ans = 0
for i in range(60):
b = sum(map(lambda x: (x >> i)&1, a))
c = n - b
ans += b * c * (1<<i) % mod
print(ans%mod)
|
[] | 643,462
| 643,463
|
u571969099
|
python
|
p02838
|
import sys
import numpy as np
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
MOD = 10 ** 9 + 7
N = ir()
A = np.array(lr(), np.int64)
answer = 0
limit = A.max().bit_length()
for i in range(limit):
B = (A >> i) & 1
x = np.count_nonzero(B)
y = N - x
add = (x*y) * 2 ** i % MOD
answer += add
print(answer%MOD)
|
import sys
import numpy as np
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
MOD = 10 ** 9 + 7
N = ir()
A = np.array(lr(), np.int64)
answer = 0
limit = int(A.max()).bit_length()
for i in range(limit):
B = (A >> i) & 1
x = np.count_nonzero(B)
y = N - x
add = (x*y) * 2 ** i % MOD
answer += add
print(answer%MOD)
|
[
"call.add",
"call.arguments.change"
] | 643,506
| 643,507
|
u600402037
|
python
|
p02838
|
import numpy as np
n=int(input())
a=np.array([int(i) for i in input().split()])
mod=1e9+7
ans=0
for k in range(60):
b=(a>>k)&1
m=np.count_nonzero(b)
ans+=m*(n-m)*(2**k)
ans%=mod
print(ans)
|
import numpy as np
n=int(input())
a=np.array([int(i) for i in input().split()])
mod=int(1e9+7)
ans=0
for k in range(60):
b=(a>>k)&1
m=np.count_nonzero(b)
ans+=m*(n-m)*2**k
ans%=mod
print(ans)
|
[
"call.add",
"call.arguments.change"
] | 643,528
| 643,529
|
u547167033
|
python
|
p02838
|
N = int(input())
A = list(map(int, input().split()))
ans = 0
M = 10**9+7
for i in range(60):
for j in range(N):
x = 0
if A[j]>>i & 1:
x += 1
now = x * (N - x) % M
for j in range(i):
now = now * 2 % M
ans += now
ans %= M
print(ans)
|
N = int(input())
A = list(map(int, input().split()))
ans = 0
M = 10**9+7
for i in range(60):
x = 0
for j in range(N):
if A[j]>>i & 1:
x += 1
now = x * (N - x) % M
for j in range(i):
now = now * 2 % M
ans += now
ans %= M
print(ans)
|
[
"assignment.add",
"assignment.remove"
] | 643,562
| 643,563
|
u514401521
|
python
|
p02838
|
MOD = 1000000007
n = int(input())
a = list(map(int,input().split()))
ans = 0
for k in range(60):
mask = 1<<k
cnt1 = sum(1 for x in a if x&mask != 0)
ans += cnt1*(n-cnt1)*(1<<k)
print(ans)
|
MOD = 1000000007
n = int(input())
a = list(map(int,input().split()))
ans = 0
for k in range(60):
mask = 1<<k
cnt1 = sum(1 for x in a if x&mask != 0)
ans += cnt1*(n-cnt1)*(1<<k)
print(ans%MOD)
|
[
"expression.operation.binary.add"
] | 643,605
| 643,606
|
u271063202
|
python
|
p02838
|
n=int(input())
a=list(map(int,input().split()))
mod=10**9+7
ans=0
ar=[0]*60
for i in a:
for j in range(60):
if i&(1<<j):
ar[j]+=1
for i ,j in enumerate(ar):
b=n-j
ans+= j*b*1<<i
print(ans)
|
n=int(input())
a=list(map(int,input().split()))
mod=10**9+7
ans=0
ar=[0]*60
for i in a:
for j in range(60):
if i&(1<<j):
ar[j]+=1
for i ,j in enumerate(ar):
b=n-j
ans+= j*b*2**i
print(ans%mod)
|
[
"expression.operation.binary.add"
] | 643,651
| 643,652
|
u038815010
|
python
|
p02838
|
import numpy as np
N = int(input())
A = np.array(list(map(int, input().split())))
Cn, ans = N * (N-1) // 2, 0
for i in range(60):
count = np.sum(A % 2)
A //= 2
if count == 0:
continue
ans += (Cn - (count*(count-1)//2 + (N-count)*(N-count-1)//2)) * (2**i)
print(ans % (10**9 + 7))
|
import numpy as np
N = int(input())
A = np.array(list(map(int, input().split())))
Cn, ans = N * (N-1) // 2, 0
for i in range(60):
count = int(np.sum(A % 2))
A //= 2
if count == 0:
continue
ans += (Cn - (count*(count-1)//2 + (N-count)*(N-count-1)//2)) * (2**i)
print(ans % (10**9 + 7))
|
[
"call.add",
"call.arguments.change"
] | 643,719
| 643,720
|
u551909378
|
python
|
p02838
|
N = int(input())
A = list(map(int, input().split()))
MOD = 10**9 + 7
max_digit = 60
result = 0
base = 1
for _ in range(max_digit + 1):
c0 = 0
for i in range(N):
a = A[i]
A[i] >>= 1
c0 += (a==0)
result = (result + (base*(N - c0)*c0) % MOD) % MOD
base = base*2 % MOD
print(result)
|
N = int(input())
A = list(map(int, input().split()))
MOD = 10**9 + 7
max_digit = 60
result = 0
base = 1
for _ in range(max_digit + 1):
c0 = 0
for i in range(N):
a = A[i] % 2
A[i] >>= 1
c0 += (a==0)
result = (result + (base*(N - c0)*c0) % MOD) % MOD
base = base*2 % MOD
print(result)
|
[
"assignment.change"
] | 643,765
| 643,766
|
u922449550
|
python
|
p02838
|
import sys
stdin = sys.stdin
mod = 1000000007
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()
nas = lambda: stdin.readline().split()
n = ni()
a = na()
ans = 0
for i in range(61):
z, o = [0] * 2
for j in range(n):
if a[j] & (1 << i):
o += 1
else:
z += 1
ans += z * o * (2 ** i)
print(ans)
|
import sys
stdin = sys.stdin
mod = 1000000007
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()
nas = lambda: stdin.readline().split()
n = ni()
a = na()
ans = 0
for i in range(61):
z, o = [0] * 2
for j in range(n):
if a[j] & (1 << i):
o += 1
else:
z += 1
ans += z * o * (2 ** i)
ans %= mod
print(ans)
|
[] | 643,806
| 643,807
|
u535423069
|
python
|
p02838
|
import numpy as np
n = int(input())
arr = np.array(map(int, input().split()))
mod = 10 ** 9 + 7
ans = 0
for i in range(60):
c1 = np.count_nonzero(arr & 1)
ans += 2 ** i * c1 * (n - c1)
arr >>= 1
print(ans%mod)
|
import numpy as np
n = int(input())
arr = np.array(list(map(int, input().split())))
mod = 10 ** 9 + 7
ans = 0
for i in range(60):
c1 = np.count_nonzero(arr & 1)
ans += 2 ** i * c1 * (n - c1)
arr >>= 1
print(ans%mod)
|
[
"call.arguments.add",
"call.arguments.change"
] | 643,834
| 643,835
|
u777283665
|
python
|
p02838
|
import numpy as np
n = int(input())
arr = np.array(map(int, input().split()))
mod = 10 ** 9 + 7
ans = 0
for i in range(60):
c1 = np.count_nonzero(arr & 1)
ans += 2 ** i * c1 * (n - c1)
arr >>= 1
print(ans%mod)
|
import numpy as np
n = int(input())
arr = np.array(list(map(int, input().split())))
mod = 10 ** 9 + 7
ans = 0
for i in range(60):
c1 = np.count_nonzero(arr & 1)
ans += 2 ** i * c1 * (n - c1)
arr >>= 1
print(ans%mod)
|
[
"call.arguments.add",
"call.arguments.change"
] | 643,834
| 643,836
|
u777283665
|
python
|
p02838
|
n = int(input())
A = list(map(int, input().split()))
zero_each_dig = [0 for _ in range(60)]
one_each_dig = [0 for _ in range(60)]
for i in range(n):
for j in range(60):
if (A[i] >> j) & 1 == 1:
one_each_dig[j] += 1
else:
zero_each_dig[j] += 1
Multi = []
for k in range(n):
Multi.append(zero_each_dig[k] * one_each_dig[k] * (2**k) % (10**9 +7))
ans = sum(Multi) % (10**9 +7)
print(ans)
|
n = int(input())
A = list(map(int, input().split()))
zero_each_dig = [0 for _ in range(60)]
one_each_dig = [0 for _ in range(60)]
for i in range(n):
for j in range(60):
if (A[i] >> j) & 1 == 1:
one_each_dig[j] += 1
else:
zero_each_dig[j] += 1
Multi = []
for k in range(60):
Multi.append(zero_each_dig[k] * one_each_dig[k] * (2**k) % (10**9 +7))
ans = sum(Multi) % (10**9 +7)
print(ans)
|
[
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 643,849
| 643,850
|
u226912938
|
python
|
p02838
|
import sys
input = sys.stdin.readline()
N = int(input())
A = [int(i) for i in input().split()]
count0 = [0 for i in range(60)]
count1 = [0 for i in range(60)]
for a in A:
a_tmp = bin(a).replace("0b","")
a_tmp = a_tmp.zfill(60)
for i,b in enumerate(a_tmp):
if b == "1":
count1[i] += 1
else:
count0[i] += 1
cnt = 0
ans = 0
for c0,c1 in zip(count0[::-1],count1[::-1]):
ans += c0*c1*(2**cnt)
cnt += 1
print(ans%(10**9+7))
|
import sys
input = sys.stdin.readline
N = int(input())
A = [int(i) for i in input().split()]
count0 = [0 for i in range(60)]
count1 = [0 for i in range(60)]
for a in A:
a_tmp = bin(a).replace("0b","")
a_tmp = a_tmp.zfill(60)
for i,b in enumerate(a_tmp):
if b == "1":
count1[i] += 1
else:
count0[i] += 1
cnt = 0
ans = 0
for c0,c1 in zip(count0[::-1],count1[::-1]):
ans += c0*c1*(2**cnt)
cnt += 1
print(ans%(10**9+7))
|
[
"call.arguments.change"
] | 643,935
| 643,936
|
u255943004
|
python
|
p02838
|
def main():
n = int(input())
a = list(map(int, input().split()))
l1 = [0]*61
for i in a:
cnt = 0
k = 1
while k <= i:
if i & k == k:
l1[cnt] += 1
cnt += 1
k *= 2
l0 = [n-i for i in l1]
ans = 0
mod = 10**9+7
for i in range(len(l1)):
ans = (ans+l0[i]*l1[i]*pow(2, i, mod)) % mod
print(ans)
|
def main():
n = int(input())
a = list(map(int, input().split()))
l1 = [0]*61
for i in a:
cnt = 0
k = 1
while k <= i:
if i & k == k:
l1[cnt] += 1
cnt += 1
k *= 2
l0 = [n-i for i in l1]
ans = 0
mod = 10**9+7
for i in range(len(l1)):
ans = (ans+l0[i]*l1[i]*pow(2, i, mod)) % mod
print(ans)
main()
|
[
"call.add"
] | 643,951
| 643,952
|
u532966492
|
python
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.