Rakhi Gift to Ankush

CodeChefOpen on judge ↗

Ankush wants to celebrate Raksha Bandhan with his sister. To celebrate, they play a game where there is a pile of $N$ rakhis. In one move, a player can remove rakhis in the range of 1-10 from the pile. The player who cannot take a rakhi from the pile because of empty pile loses. Both Ankush and his sister are very intelligent. If both players always make the best move, who wins ? Ankush

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