← All problemsSign in

Matches

CodeChefRating 1769Open on judge ↗

Ari and Rich are playing a pretty confusing game. Here are the rules of the game: - The game is played with two piles of matches. Initially, the first pile contains $N$ matches and the second one contains $M$ matches. - The players alternate turns; Ari plays first. - On each turn, the current player must choose one pile and remove a positive number of matches (not exceeding the current number o

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