Submission #175238

---

Source Code Expand

#!/usr/bin/python
# -*- coding: utf-8 -*-
import sys
import math
from collections import defaultdict

K,M = map(int, sys.stdin.readline().rstrip().split())
As = map(int, sys.stdin.readline().rstrip().split())
Cs = map(int, sys.stdin.readline().rstrip().split())

starti = len(As)
term = 1
for i in xrange(len(As), len(As)+100000):
    #print format(As[-1], 'b')
    restk = i % len(Cs)
    As.append(reduce(lambda x,y: x^y, [(Cs[j-1]&As[i-j]) for j in xrange(1, K+1)]))
    if i>starti+100 and As[starti+1] == As[i] and As[starti] == As[i-1]:
        term = i - starti - 1
        break

#print "term",term
#print As
print As[(M-1)%term]

exit(0)

Submission Info

Judge Result