(1536)HDU

#include<iostream>
#include<cstdio>
#include<string.h>
#include<cstring>
#include<string>
#include<stack>
#include<set>
#include<algorithm>
#include<cmath>
#include<vector>
#include<map>

#define LOCAL
#define ll long long
#define lll unsigned long long
#define MAX 1000009
#define eps 1e-8
#define INF 0x7fffffff
#define mod 1000000007

using namespace std;
/*

题意：

想法： SG函数模板题

*/
//注意 S数组要按从小到大排序 SG函数要初始化为-1 对于每个集合只需初始化1遍
//n是集合s的大小 S[i]是定义的特殊取法规则的数组
int s[110],sg[10010],n;
int SG_dfs(int x)
{
    int i;
    if(sg[x]!=-1)
        return sg[x];
    bool vis[110];
    memset(vis,0,sizeof(vis));
    for(i=0;i<n;i++)
    {
        if(x>=s[i])
        {
            SG_dfs(x-s[i]);
            vis[sg[x-s[i]]]=1;
        }
    }
    int e;
    for(i=0;;i++)
        if(!vis[i])
        {
            e=i;
            break;
        }
    return sg[x]=e;
}
int main()
{
    //freopen("date.in","r",stdin);
    int k,m,x,t;
    char name[1000];
    while(~scanf("%d",&n)&&n)
    {
        memset(sg,-1,sizeof(sg));
        for(int i = 0; i<n; i++)
        {
            scanf("%d",&s[i]);
        }
        sort(s,s+n);
        scanf("%d",&t);
        for(int j = 1; j<=t; j++)
        {
            scanf("%d",&m);
            int ret = 0;
            for(int i = 1; i<=m; i++)
            {
                scanf("%d",&x);
                ret^=SG_dfs(x);
            }
            if(ret)
                name[j] = 'W';
            else
                name[j] = 'L';
        }
        for(int j = 1; j<=t; j++)
        {
            cout<<name[j];
        }
        cout<<endl;
    }
    return 0;
}