hdu 2516 FIB博弈

分析请看：cxlove

 #include<iostream>
 #include<cstdio>
 #include<cstring>
 #include<algorithm>
 #include<cmath>
 #include<vector>
 #include<string>
 #include<map>
 #define LL long long
 #define N 1000000
 #define inf 1<<20
 using namespace std;
 int fib[];
 int main(){
     fib[]=;fib[]=;
     for(int i=;i<;i++)
         fib[i]=fib[i-]+fib[i-];
     int n;
     while(scanf("%d",&n)!=EOF&&n){
         int i=;
         for(i=;i<;i++)
             if(fib[i]==n)
                 break;
         if(i<)
             puts("Second win");
         else
             puts("First win");
     }
     return ;
 }