题目
题目
代码
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<cctype>
#include<ctime>
#include<iostream>
#include<string>
#include<map>
#include<queue>
#include<stack>
#include<set>
#include<vector>
#include<iomanip>
#include<list>
#include<bitset>
#include<sstream>
#include<fstream>
#include<complex>
#include<algorithm>
#if __cplusplus >= 201103L
#include <unordered_map>
#include <unordered_set>
#endif
#define ll long long
using namespace std;
const int INF = 0x3f3f3f3f;
const int N = 1010;
int f[N],SG[N],S[N];
void getSG(int n){
f[0]=1,f[0]=1;
for(int i=2;i<=n;i++){
f[i]=f[i-1]+f[i-2];
}
int i,j;
memset(SG,-1,sizeof(SG));
SG[0]=0;
for(i = 1; i <= n; i++){
memset(S,0,sizeof(S));
for(j = 0; f[j] <= i && j <= N; j++)
S[SG[i-f[j]]] = 1;
for(j = 0;; j++) if(!S[j]){
SG[i] = j;
break;
}
}
}
int main(){
ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int n,m,p;
getSG(1000);
while(cin>>n>>m>>p){
if(m==0&&n==0&&p==0) break;
if(SG[n]^SG[m]^SG[p]){
cout<<"Fibo"<<endl;
}
else cout<<"Nacci"<<endl;
}
return 0;
}