Submission #3764889

---

Source Code Expand

def i1():
 return int(input())
def i2():
 return [int(i) for i in input().split()]
import math
import bisect
n=i1()
a=i2()
b=i2()
if max(max(a),max(b)):
 K=18
 j=0
 for k in range(K+1):
  bb=[]
  for i in range(len(b)):
   bb.append(b[i]%(2**(k+1)))
  bb.sort()
  jj=0
  for i in a:
   x=i%(2**(k+1))
   jj+=(bisect.bisect_left(bb, 2**(k+1)-x)-bisect.bisect_left(bb, 2**k-x))
   jj+=(bisect.bisect_left(bb, (2**k)*4-x)-bisect.bisect_left(bb, (2**k)*3-x))
  
  j+=(jj%2)*(2**k)
 print(j)
else:
 print(0)

Submission Info

Judge Result