Special Square Number

CodeChefOpen on judge ↗

A special square number is a number containing the digits 0-9 such that 0 can occur any number of times while the other digits 1-9 must occur squared times. E.g. 1 must occur 1x1 times, 2 must occur 2x2 times… 9 must occur 9x9 times. The digits may be ordered in any way and it need not be the case that the all same digits be consecutive. Some examples of special square numbers are 1, 12222, and 30

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