模板
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <map>
#include <list>
#include <algorithm>
#include <iostream>
using namespace std;
int len;
int canchoose[105];
int num;
int SG[10010];
int getSG(int x)
{
if(SG[x]!=-1) return SG[x];
bool flag[105];
memset(flag,false,sizeof(flag));
for(int i=0;i<len;i++)
{
if(canchoose[i]>x) break;
int tmp=x-canchoose[i];
if(SG[tmp]==-1) SG[tmp]=getSG(tmp);
flag[SG[tmp]]=true;
}
for(int i=0;;i++) if(!flag[i]) return (SG[x]=i);
}
int main() {
// freopen("in.txt","r",stdin);
while(cin>>len&&len)
{
for(int i=0;i<len;i++)
cin>>canchoose[i];
sort(canchoose,canchoose+len);
int T;
memset(SG,-1,sizeof(SG));
cin>>T;
while(T--)
{
int dui;
cin>>dui;
int ans=0;
for(int i=0;i<dui;i++)
{
cin>>num;
ans^=getSG(num);
}
cout<<(ans?'W':'L');
}
cout<<endl;
}
return 0;
}
作者:zuhiul
来源:CSDN
原文:https://blog.csdn.net/mengzhongsharen/article/details/76560156