1025.md

// dp
const divisorGame = function (N) {
  let dp = new Array(N + 1).fill(false);
  dp[2] = true;
  for (let i = 4; i <= N; i++) {
    for (let j = 1; j < i; j++) {
      if (i % j === 0 && !dp[i - j]) {
        dp[i] = true;
        break;
      }
    }
  }
  return dp[N];
};

const divisorGame = function (N) {
  // https://leetcode.com/problems/divisor-game/discuss/274566/just-return-N-2-0-(proof)
  return N % 2 === 0;
};