Splendid Number

CodeChefOpen on judge ↗

A number is said to be a Splendid if it's binary equivalent contains equal number of 0's and 1's. Given N numbers help Chef in finding the splendid numbers. Input The first line contains T number of test cases. Then t test cases follow. Each test case consists a number N. Output Each T lines prints output "Yes" if given number N is Splendid otherwise "NO" Constraints Should contain all th

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