![JAR search and dependency download from the Maven repository](/logo.png)
g3301_3400.s3360_stone_removal_game.readme.md Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java Show documentation
Show all versions of leetcode-in-java Show documentation
Java-based LeetCode algorithm problem solutions, regularly updated
The newest version!
3360\. Stone Removal Game
Easy
Alice and Bob are playing a game where they take turns removing stones from a pile, with _Alice going first_.
* Alice starts by removing **exactly** 10 stones on her first turn.
* For each subsequent turn, each player removes **exactly** 1 fewer stone than the previous opponent.
The player who cannot make a move loses the game.
Given a positive integer `n`, return `true` if Alice wins the game and `false` otherwise.
**Example 1:**
**Input:** n = 12
**Output:** true
**Explanation:**
* Alice removes 10 stones on her first turn, leaving 2 stones for Bob.
* Bob cannot remove 9 stones, so Alice wins.
**Example 2:**
**Input:** n = 1
**Output:** false
**Explanation:**
* Alice cannot remove 10 stones, so Alice loses.
**Constraints:**
* `1 <= n <= 50`
© 2015 - 2025 Weber Informatics LLC | Privacy Policy