Guess the Number

CodeChefOpen on judge ↗

Given an integer $N$, find the largest integer $F$ such that $0 \lt F \lt N$ and $N$ is divisible by $F$. **Note:** Problem has large test data, use fast input/output methods to avoid TLE. ###Input - First line contains a single integer $T$, the number of testcases. - Each testcase is described by a single line containing the value of $N$. ###Output For each testcase, print a single li

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