SPLIT With XOR Not X
For an array $A$ and a number $X$, let's define $f(A, X)$ as follows: - If it is **not possible** to split $A$ into several consecutive subarrays in such a way, that the [XOR](https://en.wikipedia.org/wiki/Bitwise_operation#XOR) of all elements in each subarray is **not equal to $X$**, $f(A, X) = 0$. - Otherwise, $f(A, X)$ is equal to the **largest** possible number of subarrays in such a split.
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.
Sign in to chat with the tutor and save your progress.
Sign in to start