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

 

就是一个sg函数的模板

#include<bits/stdc++.h>
using namespace std;

#define ll long long
const int maxn = 1000 * 100  + 10;
const ll mod = 1e9 + 7;
int n, m, q,sg[1010],f[100];

void init() {
	memset(sg,-1,sizeof(sg));
	sg[0] = 0;
	f[1] = 1; f[2] = 2;
	for (int i = 3; i <= 100; i++)f[i] = f[i - 1] + f[i - 2];
}
 int get_sg(int x) {
	 if (sg[x] != -1)return sg[x];
	 set<int>s;
	 for (int i = 1; i <= 20; i++) {
		 if (f[i] > x)break;
		 s.insert(get_sg(x-f[i]));
	 }

	 int cnt = 0; 
	 while (s.count(cnt))cnt++;

	 return sg[x]=cnt;
}

int main() {

	ios::sync_with_stdio(false);
	init();

	while (cin >> n >> m >> q && n + m + q) {
		if (get_sg(n) ^ get_sg(m) ^ get_sg(q))cout << "Fibo" << endl;
		else
			cout << "Nacci" << endl;
	}

	return 0;
}