Square Subtractions

CodeChefOpen on judge ↗

Given a number $N$, your task is to find the number of times the following operation can be performed: Find the largest square number less than or equal to $N$ and subtract it from $N$. Repeat this process until $N$ becomes 0. View Sample testcases and Explanation for further clarification. ###Input: - First line will contain $T$, number of testcases. Then the testcases follow. - Ea

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