1025_divisor_game.py

# Solution 1

class Solution:
    def divisorGame(self, N: int) -> bool:
        dp = [None, False, True]
        for i in range(3, N+1):
            for j in range(1, i):
                if (i % j == 0) and (dp[i-j] == False):
                    dp.append(True)
                    break
            else:
                dp.append(False)
        return dp[N]

# Solution 2

class Solution:
    def divisorGame(self, N: int) -> bool:
        return N % 2 == 0

'''
    This is my personal record of solving Leetcode Problems. 
    If you have any questions, please discuss them in [Issues](https://github.com/mengxinayan/leetcode/issues).
    Copyright (C) 2020-2022  mengxinayan

    This program is free software: you can redistribute it and/or modify
    it under the terms of the GNU General Public License as published by
    the Free Software Foundation, either version 3 of the License, or
    (at your option) any later version.

    This program is distributed in the hope that it will be useful,
    but WITHOUT ANY WARRANTY; without even the implied warranty of
    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
    GNU General Public License for more details.

    You should have received a copy of the GNU General Public License
    along with this program.  If not, see <http://www.gnu.org/licenses/>.
'''