Short Piles
Alice and Bob play a turn‐based game using several piles of stones. There are three types of piles: - $X$ piles each containing $1$ stone, - $Y$ piles each containing $2$ stones, and - $Z$ piles each containing $3$ stones. The players take turns with **Alice moving first**. On each turn, the current player must remove exactly **one stone** from any non-empty pile. **Alice is not allowed to remo
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.
Sign in to chat with the tutor and save your progress.
Sign in to start