deepak_prakash's blog

By deepak_prakash, history, 6 months ago, In English

Hey, I recently got this problem in an online assessment.

Count number of subarrays such that, xor of first and last element of subarray should be equal to xor of remaining elements in the subarray. And the minimum size of subarray in consideration would be greater than equal to 3.

Thanks

Full text and comments »

  • Vote: I like it
  • +3
  • Vote: I do not like it

By deepak_prakash, history, 6 years ago, In English

I recently tried to solve Div 3 D problem and keep on getting Runtime error on 5th case. Not able to figure out the reason behind it.

https://codeforces.com/contest/999/submission/39512943 (link for the submission)

https://codeforces.com/contest/999/problem/D (link for the problem)

Full text and comments »

  • Vote: I like it
  • 0
  • Vote: I do not like it