Fast squarer

CodeChefRating 2366Open on judge ↗

A squarer is a simple and convenient device. You give it some positive integer X and it calculates its square. Leha is implementing a module of this device which is responsible for squaring the numbers consisting of multiple repetitions of one digit. But it turned out that it's not as simple as he thought. Please help him now! Input The first line contains one integer T denoting the number of

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