← All problemsSign in

Easy Grid Game

CodeChefRating 2428Open on judge ↗

Alice and Bob are playing a game on a $2 \times 2$ grid. Each cell $(i, j)$ initially contains a non-negative number of stones $A_{ij}$. - Alice moves first. - On each move, the current player must remove exactly one stone from one cell that lies in the same row or the same column as the cell used in the immediately previous move. - On the first move, there is no restriction — Alice may remove

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