LeetCode/DP1 1025. Divisor Game 난이도: Easy 문제 설명 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 th.. 2019. 9. 19. 이전 1 다음