← All problemsSign in

One Pile

CodeChefRating 3549Open on judge ↗

### Read problems statements in [Russian](https://www.codechef.com/download/translated/COOK133/russian/ONEPILE.pdf). Utkarsh is forced to play another game with Ashish. In this game there are $N$ piles, $i^{th}$ pile contains $A_i$ stones. **Utkarsh moves first**. In his turn a player can choose any pile with non-zero stones and remove exactly one stone from that pile. The game ends when there

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