博弈代码（题目在贴吧）

http://tieba.baidu.com/p/4862551837?pid=100261920188&cid=0#100261920188
//贴吧网址
【博弈练习】NIM模型

#include<cstdio>  
#include<cstring>  
#include<iostream>  
#include<algorithm>  
using namespace std;  
int n;  
bool Calculate()  
{  
    int i,x,sum=0;  
    bool flag=1;  
    cin>>n;  
    for(i=1;i<=n;i++)  
    {  
        scanf("%d",&x);  
        if(x^1) flag=0;  
        sum^=x;  
    }  
    if(flag)  
        return !sum;  
    else  
        return sum;  
}  
int main()  
{  
    int T,i;  
    for(cin>>T;T;T--)  
    {  
        if( Calculate() )  
            puts("John");  
        else  
            puts("Brother");  
    }  
    return 0;
}  

【博弈练习】取石子游戏—威佐夫博奕

#include <cstdio>  
#include<iostream>
#include <cmath>  
using namespace std;  
int main()  
{
    double a = (1.0 + sqrt(5.0)) / 2.0;  
    double b = (3.0 + sqrt(5.0)) / 2.0;  
    int big,small,n, temp1, temp2,w;  
    cin>>w;
    for(int i=1;i<=w;i++)
    {  
            cin>>big>>small;
        if(big < small)  
        {
            big=big^small;small=big^small;big=big^small;
        }  
        n = ceil(big / b);  
        temp1 = a * n;  
        temp2 = b * n;  
        if(small == temp1 && big == temp2)  
            cout<<0<<endl; 
        else cout<<1<<endl;   
    }  
    return 0;  
} 

【博弈】Fibonacci again and again

#include <iostream>
#include <cstdio>
using namespace std;
const int N = 1005;
int sg[N], hash[21];
int f[17];
void fib(){//斐波那契数列的建立
    f[1] = 1; f[2] = 2;
    for(int i = 3; i <= 16; i++){
        f[i] = f[i-1] + f[i-2];
    }
}

void getsg(){
    fib();//算出斐波那契
    int i, j;
    sg[0] = 0; sg[1] = 1;
    for(i = 2; i <= N; i++){
        for(j = 0; j <= 20; j++)    hash[j] = 0;//hash数组作为标记，标记sg

        for(j = 1; f[j] <= i; j++){
            hash[sg[i-f[j]]] = 1;
        }
        for(j = 0; j <= 20; j++){
            if(!hash[j]){
                sg[i] = j;
                break;
            }
        }
    }
}

int main(){
    getsg();
    int n, m, p, zong;
    /*
    while(~scanf("%d%d%d", &n, &m, &p)){
        if(!n && !m && !p)    break;
        如果不给几组数据的话要这么干。
        */
        cin>>zong;
      for(int i=1;i<=zong;i++)
       {
        cin>>n>>m>>p;
        if(sg[n]^sg[m]^sg[p])//位运算
            printf("Fibo\n");
        else
            printf("Nacci\n");
    }
    return 0;
}