Divisor Game
Easy
Game Theory
Alice and Bob alternate turns starting with Alice on a number n. A move picks x with 0 < x < n and n % x == 0 and replaces n with n - x. The player who cannot move loses. Print true if Alice wins.
Constraints
1 <= n <= 1000
Discussion
No discussions yet.
Shalyam Support
Hi! Ask us anything — we'll reply on WhatsApp or Telegram within 24 hours.