Alice vs Bob Faceoff
Alice and Bob have got an integer $N$. They decide to play a game. Alice and Bob make alternating moves: Alice makes the first move, Bob makes the second move, Alice makes the third one, and so on. The game continues until $N$ becomes $0$. The player who is unable to make a move loses. During each turn a player can make one of the following moves: 1. Choose an integer $X$ such that $X$ can be ex
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