Possible or Not

CodeChefRating 1578Open on judge ↗

Om has an array $A$ of size $N$ and an integer $B$. He wants to find whether there exists a **non-empty** [subsequence](https://en.wikipedia.org/wiki/Subsequence) of $A$ such that the [bitwise AND](https://en.wikipedia.org/wiki/Bitwise_operation#AND) of all elements in the subsequence is equal to $B$. ### Input - The first line of input will contain a single integer $T$, denoting the number 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