← All problemsSign in

ALIEN-OR

CodeChefRating 1639Open on judge ↗

You are given: - positive integers $N$ and $K$ $(K \le N)$. - an array $A$ of size $N$, where each element of the array is a **binary** string of length $K$; For each $1\le j\lt 2^K$, your task is to find whether there exists a set of indices $\{i_1, i_2, \ldots, i_m\}$ $(1\le i_j, m \le N)$ such that: - The decimal value of $(A_{i_1}$ $|$ $A_{i_2}$ $|$ $A_{i_3}$ $|$ $\ldots$ $|$ $A_{i_m})$ equa

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

Sign in to chat with the tutor and save your progress.

Sign in to start