# hdu 1848 Fibonacci again and again (sg函数)

Posted by 111qqz on Wednesday, July 20, 2016

## TOC

hdu 1848题目链接

``````/* ***********************************************
Author :111qqz
Created Time :2016年07月20日 星期三 20时08分38秒
File Name :code/hdu/1848.cpp
************************************************ */

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <cmath>
#include <cstdlib>
#include <ctime>
#define fst first
#define sec second
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define ms(a,x) memset(a,x,sizeof(a))
typedef long long LL;
#define pi pair < int ,int >
#define MP make_pair

using namespace std;
const double eps = 1E-8;
const int dx4[4]={1,0,0,-1};
const int dy4[4]={0,-1,1,0};
const int inf = 0x3f3f3f3f;
const int N=1E3+7;
bool vis[N];
int sg[N];
int f[N];
int a,b,c;
void sg_init()
{
f[1] = 1;
f[2] = 2;
ms(sg,0);
for ( int i = 3 ; i<=18 ; i++)
f[i] = f[i-1] + f[i-2];

//    cout<<"jhhhh;"<<endl;
for ( int i = 1 ; i < N ; i++)
{
ms(vis,false);
for ( int j = 1 ; f[j] <= i ; j++)
vis[sg[i-f[j]]] = true;

for ( int j = 0 ; ; j++)
if (!vis[j])
{
sg[i] = j;
break;
}
}
}
int main()
{
#ifndef  ONLINE_JUDGE
freopen("code/in.txt","r",stdin);
#endif
sg_init();

while (~scanf("%d%d%d",&a,&b,&c))
{
if (a==0&&b==0&&c==0) break;
int sum = sg[a]^sg[b]^sg[c];
if (sum==0)
{
puts("Nacci");
}
else
{
puts("Fibo");
}
}

#ifndef ONLINE_JUDGE
fclose(stdin);
#endif
return 0;
}
``````

「真诚赞赏，手留余香」