Good Number Bit

CodeChefOpen on judge ↗

A $good number$ is a number which when converted into Binary has all the bits $'0'$ except the $first$ and $last$, Example $129$ is a good number because its Binary representation is $(10000001)$which satisfies the condition You are given $N$ such numbers and for Each Good number print $'Y'$ otherwise, print $'N'$ separated by space. ###Input: - First Line contains the number of test cases - Fir

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