HDU1848 Fibonacci again and again 博弈
2012-01-09 14:39
357 查看
/*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 ^SG[p]; if(ans == 0) cout<<"Nacci"<<endl; else cout<<"Fibo"<<endl; } return 0; }
相关文章推荐
- hdu_1848_Fibonacci again and again(博弈sg函数)
- 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(nim博弈)
- (step8.2.6)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函数】
- (step8.2.6)hdu 1848(Fibonacci again and again——组合博弈)
- [ACM] hdu 1848 Fibonacci again and again(Nim博弈 SG函数)
- [ACM] hdu 1848 Fibonacci again and again(Nim博弈 SG函数)
- hdu 1848 Fibonacci again and again (博弈)
- [ACM] hdu 1848 Fibonacci again and again(Nim博弈 SG函数)
- HDU 1848 Fibonacci again and again (博弈,SG函数)
- 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运用)
- hdu1848 Fibonacci again and again(博弈)