取石子游戏
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3207 Accepted Submission(s): 1871
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
思路:打表后发现输的全是斐波那契数。。。
AC代码如下:
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<map>
using namespace std;
typedef long long ll;
int T,t,n,m;
map<ll,int> match;
void init()
{
ll a=1,b=1,c=2;
while(c<=1e10)
{
match[c]=1;
a=b;b=c;
c=a+b;
}
}
int main()
{
int i,j,k;
init();
while(~scanf("%I64d",&n) && n>0)
{
if(match[n]==1)
printf("Second win\n");
else
printf("First win\n");
}
}