Reach Zero

CodeChefOpen on judge ↗

Given an integer $N$. Chef has to perform the following operation on $N$, in one move: - Choose an integer $K$, $1 \lt K \lt N$. - Make $N = N - K$. If it is not possible to get $N = 0$ then print $"-1"$ else print the maximum number of moves to achieve this. ### Input - First line will contain $T$, number of testcases. Then the testcases follow. - Each

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