Fibonacci博弈

 1 #include <iostream>
 2 #include <cstring>
 3 #include <cstdio>
 4 using namespace std;
 5 int f[20], sg[1010], Hash[1010];
 6 
 7 void getSG(int n){
 8     memset(sg, 0, sizeof(sg));
 9     for(int i = 1; i <= n; i++){
10         //cout << i << endl;
11         memset(Hash, 0, sizeof(Hash));
12         for(int j = 1; f[j] <= i; j++)
13             Hash[sg[i-f[j]]] = 1;
14         for(int j = 0; j <= n; j++){
15             if(!Hash[j]){
16                 sg[i] = j;
17                 break;
18             }
19         }
20     }
21 }
22 int main(){
23     f[0] = f[1] = 1;
24     for(int i = 2; i < 17; i++)
25         f[i] = f[i-1] + f[i-2];
26     getSG(1000);
27     int n, m, p;
28     while(cin>>n>>m>>p){
29         if(n==0&&m==0&&p==0)break;
30         if(sg[n]^sg[m]^sg[p])puts("Fibo");
31         else puts("Nacci");
32     }
33 }