Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1415 Accepted Submission(s): 798
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 Input
2
13
10000
0
Sample Output
Second win
Second win
First win
很耿直的斐波那契波轮博弈放一篇大佬的文章学习:
https://blog.csdn.net/dgq8211/article/details/7602807
自己的AC代码:
#include<iostream>
#define MAX 2e10
using namespace std;
int f[50];
int fun()
{
f[0]=1;
f[1]=1;
for(int i=2;i<=46;i++) //第45个已经超了int的范围了,不用再往下了
f[i]=f[i-1]+f[i-2];
}
int main()
{
fun();
int n;
while(scanf("%d",&n)&&n)
{
int i;
for( i=2;i<=46;i++)
{
if(f[i]==n)
{
printf("Second win\n");
break;
}
}
if(i==47) printf("First win\n");
}
return 0;
}