← All problemsSign in

Number Game Revisited

CodeChefRating 1316Open on judge ↗

Alice and Bob play the following game.They choose a number N to play with.The runs are as follows : 1.Bob plays first and the two players alternate. 2.In his/her turn ,a player can subtract from N any prime number(including 1) less than N.The number thus obtained is the new N. 3.The person who cannot make a move in his/her turn loses the game. Assuming both play optimally,who wins the game ?

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