← All problemsSign in

Destructive Nim

CodeChefRating 2496Open on judge ↗

Utkarsh is forced to play yet another game with Ashish. In this game there are $N$ piles, $i^{th}$ pile contains $A_i$ stones. **Utkarsh moves first**. In Utkarsh's turn, Ashish chooses a pile (which contains at least $1$ stone), then Utkarsh removes any non-zero number of stones from that pile. Similarly, in Ashish's turn, Utkarsh chooses a pile with at least $1$ stone, then Ashish removes any

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