hdu 1848 Fibonacci again and again
2013-05-30 11:04
483 查看
// Time 0ms, Memory 236K
#include<iostream> #include<cstdio> #include<cstring> #include<cmath> using namespace std; int fb[16],sg[1001],v[1001]; int mex(int x) { if(sg[x]!=-1) return sg[x]; int i; memset(v,0,sizeof(v)); for(i=1;i<16 && x-fb[i]>=0;i++) { sg[x-fb[i]]=mex(x-fb[i]); v[sg[x-fb[i]]]=1; } for(i=0;;i++) if(!v[i]) return i; } int main() { int i,m,n,p,ans; memset(sg,-1,sizeof(sg)); sg[0]=0; fb[0]=fb[1]=1; for(i=2;i<16;i++) fb[i]=fb[i-1]+fb[i-2]; for(i=1;i<1001;i++) sg[i]=mex(i); while(scanf("%d%d%d",&n,&m,&p)!=EOF && (m || n || p)) { ans=sg[m]^sg ^sg[p]; if(ans) printf("Fibo\n"); else printf("Nacci\n"); } return 0; }
相关文章推荐
- HDU1848 Fibonacci again and again【博弈】
- HDU1848 Fibonacci again and again(SG函数)
- HDU1848----Fibonacci again and again
- hdu 1848 Fibonacci again and again(SG函数)
- HDU 1848 Fibonacci again and again【博弈:SG函数】
- HDU 1848 Fibonacci again and again(博弈)
- HDU1848-Fibonacci again and again
- hdu1848 Fibonacci again and again
- HDU 1848 Fibonacci again and again SG函数详解!
- hdu 1848 Fibonacci again and again 博弈论,求出SG函数,,什么问题都没有了
- HDU1848 Fibonacci again and again (SG函数打表模板)
- HDU 1848 Fibonacci again and again
- hdu---(1848)Fibonacci again and again
- hdu 1848 Fibonacci again and again
- HDU 1848 -Fibonacci again and again 博弈论
- hdu 1848 Fibonacci again and again
- HDU 1848 Fibonacci again and again(学习sg函数后写出来的第一个题)
- hdu(1848)Fibonacci again and again(sg函数版的尼姆博弈)
- HDU 1848 Fibonacci again and again
- hdu 1848(Fibonacci again and again)(SG博弈)