Adjacent Xors

CodeChefRating 1827Open on judge ↗

JJ has an array $A$ of length $N$ and an integer $X$. JJ can perform the following operation **at most once**: - Select a [subsequence](https://en.wikipedia.org/wiki/Subsequence) of $A$ and add $X$ to all the elements of that subsequence. For example, if $A = [2, 1, 6, 3, 5]$ and $X = 7$, we can select the subsequence $[2, 3, 5]$ and add $X$ to all the elements. Now the array $A$ becomes $[2 + 7,

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI