stone-removal-game

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

Alice and Bob are playing a game where they take turns removing stones from a pile, with Alice going first.

<ul>
	<li>Alice starts by removing exactly 10 stones on her first turn.</li>
	<li>For each subsequent turn, each player removes exactly 1 fewer stone than the previous opponent.</li>
</ul>

The player who cannot make a move loses the game.

Given a positive integer <code>n</code>, return <code>true</code> if Alice wins the game and <code>false</code> otherwise.

&nbsp;
Example 1:

<div class="example-block">
Input: n = 12

Output: true

Explanation:

<ul>
	<li>Alice removes 10 stones on her first turn, leaving 2 stones for Bob.</li>
	<li>Bob cannot remove 9 stones, so Alice wins.</li>
</ul>
</div>

Example 2:

<div class="example-block">
Input: n = 1

Output: false

Explanation:

<ul>
	<li>Alice cannot remove 10 stones, so Alice loses.</li>
</ul>
</div>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= n &lt;= 50</code></li>
</ul>

canAliceWin

Stone Removal Game

Stone Game IV

stone-game-iv

石子游戏 IV

Math

Simulation

Alice 和 Bob 在玩一个游戏，他们俩轮流从一堆石头中移除石头，Alice 先进行操作。

<ul>
	<li>Alice 在第一次操作中移除 恰好&nbsp;10 个石头。</li>
	<li>接下来的每次操作中，每位玩家移除的石头数 恰好&nbsp;为另一位玩家上一次操作的石头数减 1 。</li>
</ul>

第一位没法进行操作的玩家输掉这个游戏。

给你一个正整数&nbsp;<code>n</code>&nbsp;表示一开始石头的数目，如果 Alice 赢下这个游戏，请你返回&nbsp;<code>true</code>&nbsp;，否则返回 <code>false</code>&nbsp;。

&nbsp;

示例 1：

<div class="example-block">
输入：n = 12

输出：true

解释：

<ul>
	<li>Alice 第一次操作中移除 10 个石头，剩下 2 个石头给 Bob 。</li>
	<li>Bob 无法移除 9 个石头，所以 Alice 赢下游戏。</li>
</ul>
</div>

示例 2：

<div class="example-block">
输入：n = 1

输出：false

解释：

<ul>
	<li>Alice 无法移除 10 个石头，所以 Alice 输掉游戏。</li>
</ul>
</div>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= n &lt;= 50</code></li>
</ul>