斐波那契博弈模板题,常规做法见代码:
#include <iostream>
#include <algorithm>
#include <cmath>
#include <ctype.h>
#include <cstring>
#include <cstdio>
#include <sstream>
#include <cstdlib>
#include <iomanip>
#include <string>
#include <queue>
#include <map>
using namespace std;
typedef long long ll;
const int maxn=1000000;
const ll mod = 1e9+7;
int main(){
ll n;
while(scanf("%lld",&n)&&n)
{
int flag=0;
if(n==2||n==3)
flag=1;
ll x=2,y=3;
while(x+y<=n)
{
if(x+y==n)
flag=1;
ll t=x;
x=y;
y=t+x;
}
if(flag==1)
printf("Second win\n");
else
printf("First win\n");
}
return 0;
}