hdu 1536 S-Nim (sg函数)
题意:还是若干堆石子,但是每次取的个数只能是集合S中有的数。。问是否必赢。。。
思路:sg函数。。。1A
1/* ***********************************************
2Author :111qqz
3Created Time :2016年07月20日 星期三 23时32分48秒
4File Name :code/hdu/1536.cpp
5************************************************ */
6
7#include <cstdio>
8#include <cstring>
9#include <iostream>
10#include <algorithm>
11#include <vector>
12#include <queue>
13#include <set>
14#include <map>
15#include <string>
16#include <cmath>
17#include <cstdlib>
18#include <ctime>
19#define fst first
20#define sec second
21#define lson l,m,rt<<1
22#define rson m+1,r,rt<<1|1
23#define ms(a,x) memset(a,x,sizeof(a))
24typedef long long LL;
25#define pi pair < int ,int >
26#define MP make_pair
27
28using namespace std;
29const double eps = 1E-8;
30const int dx4[4]={1,0,0,-1};
31const int dy4[4]={0,-1,1,0};
32const int inf = 0x3f3f3f3f;
33const int N=1E4+7;
34int sg[N];
35bool vis[N];
36int ok[N];
37int k,m;
38
39void sg_init()
40{
41 ms(sg,0);
42
43 for ( int i = 1; i < N ; i++)
44 {
45 ms(vis,false);
46 for ( int j = 1 ; j <= k ; j++)
47 if (i-ok[j]>=0) vis[sg[i-ok[j]]] = true;
48
49 for ( int j = 0 ; ; j++)
50 if (!vis[j])
51 {
52 sg[i] = j;
53 break;
54 }
55 }
56}
57int main()
58{
59 #ifndef ONLINE_JUDGE
60 freopen("code/in.txt","r",stdin);
61 #endif
62
63 while (~scanf("%d",&k))
64 {
65 if (k==0) break;
66 ms(ok,0);
67 for ( int i = 1 ; i <= k ; i++) scanf("%d",&ok[i]);
68 sg_init();
69 scanf("%d",&m);
70// cout<<"m:"<<m<<endl;
71 while (m--)
72 {
73 int num;
74 scanf("%d",&num);
75 int sum = 0 ;
76 while (num--)
77 {
78 int x;
79 scanf("%d",&x);
80 sum^=sg[x];
81 }
82 if (sum==0) printf("L");
83 else printf("W");
84 }
85 printf("\n");
86 }
87
88 #ifndef ONLINE_JUDGE
89 fclose(stdin);
90 #endif
91 return 0;
92}