hdu 1536 NIM博弈 （模板）

推荐文章

博弈论初步：http://www.cnblogs.com/Knuth/archive/2009/09/05/1561002.html

博弈解决思想：http://www.cnblogs.com/Knuth/archive/2009/09/05/1561005.html

NIM游戏：http://www.cnblogs.com/Knuth/archive/2009/09/05/1561008.html

关于SG函数:http://www.cnblogs.com/Knuth/archive/2009/09/05/1561007.html

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<string>
#include<queue>
#include<algorithm>
#include<map>
#include<iomanip>
#include<climits>
#include<string.h>
#include<stdlib.h>
#define INF 1e11
#define MAXN 60
using namespace std;

int k, a[100], f[10001];
int mex(int p)
{
    int i, t;
    bool g[101] = { 0 };
    for (i = 0; i<k; i++)
    {
        t = p - a[i];
        if (t<0)    break;
        if (f[t] == -1)
            f[t] = mex(t);
        g[f[t]] = 1;
    }
    for (i = 0;; i++)
    {
        if (!g[i])
            return i;
    }
}

int main()
{ 
    int n, i, m, t, s;
    while (scanf("%d", &k), k) {
        for (i = 0; i<k; i++)
            scanf("%d", &a[i]);
        sort(a, a + k);
        memset(f, -1, sizeof(f));
        f[0] = 0;
        scanf("%d", &n);
        while (n--){
            scanf("%d", &m);
            s = 0;
            while (m--) {
                scanf("%d", &t);
                if (f[t] == -1)  f[t] = mex(t);
                s = s^f[t]; 
            }
            if (s == 0)
                printf("L");
            else
                printf("W"); 
        }
        printf("
");
    }
    return 0;
}

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<string>
#include<queue>
#include<algorithm>
#include<map>
#include<iomanip>
#include<climits>
#include<string.h>
#include<stdlib.h>
#define INF 1e11
#define MAXN 60
using namespace std;



int sg[10010];
int k, knum[110];
int flag[110];


int met(int n)
{
    int i, ans = 0;
    memset(flag, 0, sizeof(flag));
    for (i = 0; i < k; i++)
        if (n - knum[i] >= 0)
            flag[sg[n - knum[i]]] = 1;
    for (i = 0; i <= 101; i++)
        if (flag[i] == 0) return i;
}


void Sprague_Grundy()
{
    int i;
    for (i = 1; i <= 10000; i++)
        sg[i] = met(i);
}


int main()
{
    int i, n, l, num, ans;
    while (~scanf("%d", &k) && k)
    {
        for (i = 0; i < k; i++)
            scanf("%d", &knum[i]);
        Sprague_Grundy();
        scanf("%d", &n);
        while (n--)
        {
            ans = 0;
            scanf("%d", &l);
            while (l--)
            {
                scanf("%d", &num);
                ans ^= sg[num];
            }
            printf(ans == 0 ? "L" : "W");
        }
        printf("
");
    }
    return 0;
}