1025 Divisor Game

1 题目

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

2 尝试解

2.1 分析

从数字N开始，A和B轮流从剩余数字中取出小于它的一个因子，直到一方无法取出时，即判定此方失败。双方都以最优策略进行游戏，问给定数字N，A是否会赢。

假设F(n)(n<k)都已知，F(k+1) = sum(!F(i) for i = 1 to k && (k+1)%i == 0)，即当A取出一个因子i后，该问题就转化为了，B从k+1-i中取出一个因子，无论怎么取都会输，只要有一种i的取值，使得B一定会输即可。

2.2 代码

class Solution {
public:
    bool divisorGame(int N) {
        vector<bool> saver(N+1,false);
        saver[2] = true;
        saver[1] = false;
        for(int i = 3; i <= N; i++){
            for(int j = 1; !saver[i] && j < i; j++){
                if(i % j == 0)
                    saver[i] = !saver[i-j];
            }
        }
        return saver[N];
    }
};

奇怪的是，下面这种解法也对

class Solution {
public:
    bool divisorGame(int N) {
        vector<bool> saver(N+1,false);
        saver[2] = true;
        saver[1] = false;
        for(int i = 3; i <= N; i++){
            for(int j = 2; !saver[i] && j <= sqrt(i); j++){
                if(i % j == 0)
                    saver[i] = saver[j];
            }
        }
        return saver[N];
    }
};

3 标准解

class Solution {
public:
    bool divisorGame(int N) {
        return N % 2 == 0;
    }
};