Skip to content
Permalink
Branch: master
Find file Copy path
Find file Copy path
Fetching contributors…
Cannot retrieve contributors at this time
45 lines (42 sloc) 928 Bytes
# -*- coding: utf-8 -*-
#
# @lc app=leetcode id=1025 lang=ruby
#
# [1025] Divisor Game
#
# https://leetcode.com/problems/divisor-game/description/
#
# 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 <= N <= 1000
# @param {Integer} n
# @return {Boolean}
def divisor_game(n)
n.even?
end
You can’t perform that action at this time.