1404-Digital Deletions_用户6071057617_新浪博客

最新推荐文章于 2024-11-06 16:09:42 发布

「已注销」

最新推荐文章于 2024-11-06 16:09:42 发布

阅读量135

点赞数

CC 4.0 BY-SA版权

文章标签：算法 leetcode windows css aop

本文链接：https://blog.youkuaiyun.com/kuroko_ghh/article/details/88395026

本文介绍了一个名为“数字删除”的两人游戏。游戏的目标是通过改变数字或删除以0结尾的序列来移除所有数字。文章提供了游戏规则、示例输入输出，并分享了一段用于判断先手玩家是否能获胜的代码。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Digital deletions is a two-player game. The rule of the game is as following.

Begin by writing down a string of digits (numbers) that's as long or as short as you like. The digits can be 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 and appear in any combinations that you like. You don't have to use them all. Here is an example:

1404-Digital <wbr>Deletions

On a turn a player may either:
Change any one of the digits to a value less than the number that it is. (No negative numbers are allowed.) For example, you could change a 5 into a 4, 3, 2, 1, or 0.
Erase a zero and all the digits to the right of it.

The player who removes the last digit wins.

The game that begins with the string of numbers above could proceed like this:

1404-Digital <wbr>Deletions

Now, given a initial string, try to determine can the first player win if the two players play optimally both.

Input

The input consists of several test cases. For each case, there is a string in one line.

The length of string will be in the range of [1,6]. The string contains only digit characters.

Proceed to the end of file.

Output

Output Yes in a line if the first player can win the game, otherwise output No.

Sample Input