3 Ball Story

CodeChefOpen on judge ↗

You probably know the game where two players in turns take 1 to 3 balls from a pile. Looses the one who takes the last ball. We'll generalize this well known game. Assume that both of the players can take not 1, 2 or 3 balls, but k1, k2, …, km ones. Again we'll be interested in one question: who wins in the perfect game. It is guaranteed that it is possible to make next move irrespective to alread

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