kittyK's blog

XOR problem
By kittyK, history, 4 years ago, In English

For 768C - Джон Сноу и его любимое число , what is the intuition to solve it ? At first for small constraint I made brute force solution and noticed that there is a pattern , there can be two different arrays — when k is even and when k is odd.

But this is not working . Here is my code .

  • Vote: I like it
  • -8
  • Vote: I do not like it

Comments Comments (1)
| Write comment?
»
4 years ago, # |
  Vote: I like it +3 Vote: I do not like it

There is a pattern, the arrays repeat themselves after some amount of iterations. Those iterations are not dependent on k though.

→ Reply