← All problemsSign in

Chocolate Trouble

For performing well in exams, Bhoojho and Paheli are awarded some chocolates, but instead of eating them they decide to play a game with the chocolates. The winner of the game gets to keep all the chocolates The game is as follows, There are a total of $N$ chocolates. In each turn a person removes 1,2 or 3 chocolates from the total chocolates left. The person who takes the last chocolate wins t

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