Kaprekar Number

CodeChefOpen on judge ↗

A positive whole number ‘n’ that has ‘d’ digits is square and split into two piece, a right hand that has ‘d’ digit and a left hand piece that has ‘remaining d’ or ‘d-1’ digits. If the sum of the sum of the two pieces is equal to the number, then ‘n’ is the Kapreker number. ### Input - The first line of input will contain a single integer $T$, denoting the number of test cases. - Each test case c

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