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:
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:
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
0 00 1 20
Sample Output
Yes Yes No No
题意:对于一个数,我们有两种操作:
①:改变它的任意一位,使改变后的数小于原数(eg:0,1,2,... ,x)
②:删取任意位置的零,以及它右边的所有数
问:两个人轮流玩,第一个人能不能把这个数删完?
思路:由于两个人每次都是最优的,且每个人都可以改变任意一个位置的数, 因此,必胜态和必败态是轮流的。因此我们可以枚举所有必败态,改变它 的某一位使之成为必胜态,这样的话我们就可以直接通过标记来获取结果了。
代码如下:
/*
对于一个数,我们有两种操作:
①:改变它的任意一位,使改变后的数小于原数(eg:0,1,2,... ,x)
②:删取任意位置的零,以及它右边的所有数
问:两个人轮流玩,第一个人能不能把这个数删完?
思路:由于两个人每次都是最优的,且每个人都可以改变任意一个位置的数,
因此,必胜态和必败态是轮流的。因此我们可以枚举所有必败态,改变它
的某一位使之成为必胜态。
*/
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
int book[1000010];
int len(int x)
{
int ans=0;
while(x)
{
ans++;
x/=10;
}
return ans;
}
void work(int x)
{
int l=len(x);//求这个数的长度
for(int i=l; i>=1; i--)//改变每一位的数
{
int y=x;
int pos=1;
for(int j=1; j<i; j++)//改变第 i 位上的数,因此求pos,用于下面只改变这一位的数
pos*=10;
int tmp=(x%(pos*10))/pos;//取x的第 i 位上的数
for(int j=tmp; j<9; j++)//这个[tmp,9]
{
y=y+pos;//只有一位改变
book[y]=1;//标记必胜态
}
}
if(l!=6)//长度不足6位 后面补零
{
int y=x;
int pos=1;
for(int i=l; i<6; i++)
{
y=y*10;
for(int j=0; j<pos; j++)//枚举后面的每一个数
book[y+j]=1;
pos*=10;
}
}
}
int main()
{
book[0]=1;//0为必胜态
for(int i=1; i<1000000; i++)//枚举1百万之内的所有数
if(!book[i])//必败态
work(i);
char str[10];
while(~scanf("%s",str))
{
if(str[0]=='0')
printf("Yes\n");
else
{
int sum=0;
int l=strlen(str);
for(int i=0; i<l; i++)
sum=sum*10+str[i]-'0';
if(book[sum])
printf("Yes\n");
else
printf("No\n");
}
}
}