HelpAnkush

CodeChefOpen on judge ↗

Ankush runs Apple selling business with his uncle ,in which they pack the $N$ apples to as many packets as possible ,with each packet containing $X$ number of apples. Ankush eats remaining leftover apples. Help Ankush in determining the size of each box such that he can eat maximum leftover apples. If multiple package sizes will result in the same number of maximum leftover apples, print the lar

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