← All problemsSign in

Game of Divisors

CodeChefRating 2274Open on judge ↗

Mike and his friend Tom are playing a very interesting game right now. Here is the description of the game: - Initially, there is a positive integer N written on the desk, which is strictly greater than 1; - Mike makes the first move, then players make moves alternatively; - On each move the current player can either decrease the number on the desk by 1, or divide it by one of it's divisors exce

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