← All problemsSign in

Count the Ones

CodeChefRating 2529Open on judge ↗

Alice recently converted all the positive integers from $1$ to $2^N - 1$ (both inclusive) into binary strings and stored them in an array $S$. Note that the binary strings **do not have leading zeroes**. While she was out, Bob **sorted** all the elements of $S$ in lexicographical increasing order. Let $S_i$ denotes the $i^{th}$ string in the **sorted array**. Alice defined a function $F$ suc

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