1025. Divisor Game

Alice and Bob take turns playing a game, with Alice starting first.

Initially, there is a number N on the chalkboard.  On each player's turn, that player makes a move consisting of:

• Choosing any x with 0 < x < N and N % x == 0.
• Replacing the number N on the chalkboard with N - x.

Also, if a player cannot make a move, they lose the game.

Return True if and only if Alice wins the game, assuming both players play optimally.

 

Example 1:

Input: 2
Output: true
Explanation: Alice chooses 1, and Bob has no more moves.

Example 2:

Input: 3
Output: false
Explanation: Alice chooses 1, Bob chooses 1, and Alice has no more moves.

 

Note:

1. 1 <= N <= 1000

思路：博弈

class Solution(object):
    def divisorGame(self, N):
        """
        :type N: int
        :rtype: bool
        """
        memo = {}
        
        def Alice(n):
            if n==1: return False
            if n in memo: return memo[n]
            for i in range(1,n):
                if n%i==0:
                    if not Bob(n-i):
                        memo[n] = True
                        return True
            memo[n] = False
            return False
        
        def Bob(n):
            if n==1: return False
            if n in memo: return memo[n]
            for i in range(1,n):
                if n%i==0:
                    if not Alice(n-i):
                        memo[n] = True
                        return True
            memo[n] = False
            return False
        
        return Alice(N)