← All problemsSign in

Take Not Less

CodeChefRating 1432Open on judge ↗

Zenyk and Marichka are playing a game taking turns alternatively. They have $N$ piles of stones. In the $i^{th}$ pile, there are $A_i$ stones initially. Marichka goes first, and removes any **non-zero** number of stones from any pile. After that, in one move, a player can take any number of stones from any pile, **but not less** than the number of stones taken by the opponent in the previous m

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

Sign in to chat with the tutor and save your progress.

Sign in to start