Help Chef to get his goal

CodeChefOpen on judge ↗

Chef is tired of manually calculating and finding whether a given number is an **Automorph** or not . Hence, help him find the numbers by writing an algorithm that will find the numbers for him. **Note - An Automorph is a number whose square ends with itself i.e. if n is an automorph , then n^2 will yield a number which will terminate with n itself** ### Input - First line will contain $T$, numb

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