Problem Description
1堆石子有n个,两人轮流取.先取者第1次可以取任意多个,但不能全部取完.以后每次取的石子数不能超过上次取子数的2倍。取完者胜.先取者负输出"Second win".先取者胜输出"First win".
Input
输入有多组.每组第1行是2<=n<2^31. n=0退出.
Output
先取者负输出"Second win". 先取者胜输出"First win".
参看Sample Output.
参看Sample Output.
Sample Input
2 13 10000 0
Sample Output
Second win Second win First win
Source
Recommend
lcy
#include <iostream>
#include <cstdio>
using namespace std;
int main()
{
int f[45]={1,2};//当n==1时貌似没有判断;
for(int i=2;i<45;i++)
f[i]=f[i-1]+f[i-2];
//printf("%d\n",f[44]);
int n,i;
while(scanf("%d",&n)&&n)
{
for(i=0;i<45;i++)//满足斐波那契数列即为Second win
if(n==f[i])
break;
if(i==45)
printf("First win\n");
else
printf("Second win\n");
}
return 0;
}