hdu 2516 取石子游戏

取石子游戏

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 2816    Accepted Submission(s): 1626

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

 找规律，斐波那契数列

#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<queue>
#include<stack>
#include<set>
#include<algorithm>
#include<cstring>
#include<stdlib.h>
#include<math.h>
using namespace std;
#define ll __int64
set<ll>ko;
int main(){
   double mm=pow(2,31);
    ll a=2,b=3;
    ko.insert(2);ko.insert(3);
    while(a+b<mm){
        ko.insert(a+b);
        ll tt=b;
        b=a+b;
        a=tt;
    }
    int n;
    while(cin>>n,n){
        if(ko.count(n)) cout<<"Second win"<<endl;
        else cout<<"First win"<<endl;
    }
}