Count Arrays

CodeChefRating 2009Open on judge ↗

Suppose you have an array $B$ consisting of $M$ non-negative integers. $B$ is called **good** if you can make all elements of $B$ equal to $0$ by performing the following operation any (possibly $0$) number of times: - Select two indices $i$ and $j$ $(1 \leq i \lt j \leq M)$; - Let $X = B_i$ $|$ $B_j$, where $|$ denotes [bitwise OR](https://en.wikipedia.org/wiki/Bitwise_operation#OR); - Replace

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