HDU1848 Fibonacci again and again 博弈

/*HDU1847博弈SG函數3.可選步數為一系列不連續的數，用GetSG(計算)最終結果是所有SG值異或的結果*/#include "SG.h"#include<iostream>using namespace std;int Array[MAX];int main(){int n, i, m, p, ans;Array[1] = 1;for(i = 2; ; i++){Array[i] = Array[i-1] + Array[i-2];if(Array[i] > MAX)break;}Array[0] = i - 1;GetSG(Array);while(cin>>m>>n>>p && m){ans = SG[m]^SG[n]^SG[p];if(ans == 0) cout<<"Nacci"<<endl;else cout<<"Fibo"<<endl;                 }             return 0;   }