Append for OR

CodeChefRating 1201Open on judge ↗

Chef has an array $A$ of length $N$. Chef wants to append a **non-negative** integer $X$ to the array $A$ such that the [bitwise OR](https://en.wikipedia.org/wiki/Bitwise_operation#OR) of the entire array becomes $= Y$ i.e. $(A_1 \ | \ A_2 \ | \ \ldots \ | \ A_N \ | \ X) = Y$. (Here, $|$ denotes the bitwise OR operation) Determine the **minimum** possible value of $X$. If no possible value of

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