取石子游戏
1堆石子有n个,两人轮流取.先取者第1次可以取任意多个,但不能全部取完.以后每次取的石子数不能超过上次取子数的2倍。取完者胜.先取者负输出"Second win".先取者胜输出"First win".
参看Sample Output.
2 13 10000 0
Second win Second win First win
斐波那契博弈(Fibonacci Nim)
http://blog.csdn.net/dgq8211/article/details/7602807
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
using namespace std;
int main()
{
long long int digit[100];
digit[0]=2;
digit[1]=3;
for(int i=2;i<=50;i++)
digit[i]=digit[i-1]+digit[i-2];
int a;
while(cin>>a&&a)
{
int i;
for(i=0;i<=50;i++)
if(a==digit[i])
{
printf("Second win\n");
break;
}
if(i==51)printf("First win\n");
}
return 0;
}