HDU1848 Fibonacci again and again 博弈 SG函数

题意：三堆石子，每次能拿走斐波那契数个石子，先取完石子胜，问先手胜还是后手胜  石子个数<=1000 多组数据

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1848

 #include<iostream>
 #include<cstdio>
 #include<algorithm>
 #include<cmath>
 #include<cstring>
 #include<vector>

 using namespace std;

 const int MAXN = ;
 int n, m, p, lx;
 int f[MAXN], sg[MAXN];
 bool tf[MAXN];

 template <typename tn> void read (tn & a) {
     tn x = , f = ;
     char c = getchar();
     while (c < '' || c > ''){ if (c == '-') f = -; c = getchar(); }
     while (c >= '' && c <= ''){ x = x *  + c - ''; c = getchar(); }
     a = f ==  ? x : -x;
 }

 int get_f() {
     f[] = ;
     f[] = ;
     f[] = ;
     int i;
     for (i = ; f[i - ] <= ; ++i) f[i] = f[i - ] + f[i - ];
     return i - ;
 }

 void get_() {
     sg[] = ;
     sg[] = ;
     for (int i = ; i <= ; ++i) {
         for (int j = ; j <= ; ++j) tf[j] = ;
         for (int j = ; j <= lx && f[j] <= i; ++j) {
             tf[sg[i - f[j]]] = ;
         }
         int j = ;
         while (!tf[j] && j <= ) ++j;
         sg[i] = j;
     }
 }

 int main() {
     lx = get_f();
     get_();
     read(n);
     read(m);
     read(p);
     while (n !=  || m !=  || p != ) {
         if (sg[n] ^ sg[m] ^ sg[p]) printf("Fibo\n"); else printf("Nacci\n");
         read(n);
         read(m);
         read(p);
     }
     return ;
 }