Square Factor Sum

CodeChefOpen on judge ↗

Given a positive integer $N$, an integer $K$ is said to be a beautiful Divisor if $K$ divides $N$ and $K$ is a perfect square. Can you find the sum of all such beautiful divisors? ###Input: - The first line of input consists of a single integer $T$ denoting the number of test cases. Then the test cases follow. - Each test case consists of a single integer $N$. ###Output: For each test case,

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