必败态构成斐波那契数列
#include<iostream> #include<cstdio> #include<cstring> #include<algorithm> #include<cmath> using namespace std; typedef long long ll; const int MA=1e6+5; int a[MA]; void dabiao() { memset(a,0,sizeof(a)); a[0]=1; a[1]=1; for(int i=2;a[i]<MA;++i){ a[i]=a[i-1]+a[i-2]; } } int main() { int n; dabiao(); int flag=0; while(~scanf("%d",&n)&&n){ flag=0; for(int i=0;a[i];i++){ if(a[i]==n){ flag=1; break; } } if(flag)printf("Second win\n"); else printf("First win\n"); } return 0; }