hdu 1536 S-Nim (sg函数)

 1#include <cstdio>
 2#include <cstring>
 3#include <iostream>
 4#include <algorithm>
 5#include <vector>
 6#include <queue>
 7#include <set>
 8#include <map>
 9#include <string>
10#include <cmath>
11#include <cstdlib>
12#include <ctime>
13#define fst first
14#define sec second
15#define lson l,m,rt<<1
16#define rson m+1,r,rt<<1|1
17#define ms(a,x) memset(a,x,sizeof(a))
18typedef long long LL;
19#define pi pair < int ,int >
20#define MP make_pair

 1using namespace std;
 2const double eps = 1E-8;
 3const int dx4[4]={1,0,0,-1};
 4const int dy4[4]={0,-1,1,0};
 5const int inf = 0x3f3f3f3f;
 6const int N=1E4+7;
 7int  sg[N];
 8bool vis[N];
 9int ok[N];
10int k,m;

1void sg_init()
2{
3    ms(sg,0);

1    for ( int i = 1; i < N ; i++)
2    {
3	ms(vis,false);
4	for ( int j = 1 ; j <= k ; j++)
5	    if (i-ok[j]>=0) vis[sg[i-ok[j]]] = true;

 1	for ( int j = 0 ;  ; j++)
 2	    if (!vis[j])
 3	    {
 4		sg[i] = j;
 5		break;
 6	    }
 7    }
 8}
 9int main()
10{
11	#ifndef  ONLINE_JUDGE 
12	freopen("code/in.txt","r",stdin);
13  #endif

 1	while (~scanf("%d",&k))
 2	{
 3	    if (k==0) break;
 4	    ms(ok,0);
 5	    for ( int i = 1 ; i <= k ; i++) scanf("%d",&ok[i]);
 6	    sg_init();
 7	    scanf("%d",&m);
 8//	    cout<<"m:"<<m<<endl;
 9	    while (m--)
10	    {
11		int num;
12		scanf("%d",&num);
13		int sum = 0 ;
14		while (num--)
15		{
16		    int x;
17		    scanf("%d",&x);
18		    sum^=sg[x];
19		}
20		if (sum==0) printf("L");
21		else printf("W");
22	    }
23	    printf("\n");
24	}

1  #ifndef ONLINE_JUDGE  
2  fclose(stdin);
3  #endif
4    return 0;
5}