← All problemsSign in

A Game of Game

CodeChefRating 2892Open on judge ↗

Lets define G(x, {A1, A2, A3, ..., Ax}) as a game played by 2 players in which we have x piles of stones with ith pile having Ai stones. Player 1 moves first. The players move alternatively. In a move a player can select a single non empty pile of stones and remove any number ( > 0 ) of stones from it. When a player cannot make a move, the player loses. Adarsh and Saharsh are playing a modificati

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