Search
⌘K

Leetcode 1025. Divisor Game

Two players alternate replacing n with n − x for any proper divisor x of n; determine whether the first player can force a win under optimal play. Key observation (provable by simple DP/induction): Alice wins iff n is even.


Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Your account is free and you can post anonymously if you choose.