fork download 
  1. # your code goes here
  2. n = int(input())
  3. a = list(map(int, input().split()))
  4. K = int(input())
  5. p = [0] * n
  6. p[0] = a[0]
  7. for i in range(1, n):
  8.     p[i] = p[i - 1] ^ a[i]
  9. max_l = 0
  10. mp = {0: -1}
  11. for j in range(n):
  12.     RHS = p[j] ^ K
  13.     if RHS in mp:
  14.         i = mp[RHS] + 1
  15.         length = j - i + 1
  16.         max_l = max(max_l, length)
  17.     if p[j] not in mp:
  18.         mp[p[j]] = j
  19. print(max_l)
Success #stdin #stdout 0.07s 14176KB
comments (?)
stdin 
5
4 2 2 6 4
6
stdout 
5
https://ideone.com/vwR6hg
language:
Python 3 (python  3.12)
created:
2 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!