Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 4600 Accepted Submission(s): 2778
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
斐波那契博弈,若n遵循斐波那契数列规律,则输出Second win。
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38
#include<stdio.h>
#include<iostream>
#include<string.h>
using namespace std;
int main()
{
int a[45];
a[0]=2;
a[1]=3;
for(int i=2;i<44;i++)
{
a[i]=a[i-1]+a[i-2];
//cout<<a[i]<<endl;
}
int m;
while(~scanf("%d",&m))
{
if(m==0)
break;
int flag=0;
for(int i=0;i<45;i++)
{
if(a[i]==m)
{
flag=1;
break;
}
}
if(flag==1)
printf("Second win\n");
else
printf("First win\n");
}
return 0;
}