Three Powers of Two

CodeChefRating 1253Open on judge ↗

Chef is given a number in form of its binary representation $S$, having length $N$. Determine if the number can be represented as a sum of **exactly** three **non-negative** powers of $2$. Please refer to samples for further explanation. Note that $S$ will **NOT** contain leading zeros. ### Input - The first line of input will contain a single integer $T$, denoting the number of test cases. - E

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