← All problemsSign in

Palindromic Binary Numbers

CodeChefRating 1991Open on judge ↗

We call a non-negative number $x$ good if its binary representation is palindromic. For example, $107$ is good because its binary representation is $1101011$ which is palindromic while $10$ is not good because its binary representation is $1010$ which is not palindromic. Recall that, a string is said to be palindromic if it reads the same backward as forward. You are given a number $n$. You have

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