#include <iostream>
#include <string.h>
#include <cstdio>
#include <algorithm>
using namespace std;
#define MAXN 10000 + 10
const int INF = (~0U >> 1);
int temp[MAXN], sg[MAXN];
void getsg()
{
sg[0] = 0;
for (int i = 1; i <= 10000; i++)
{
bool vis[101];
memset(vis, false ,sizeof(vis));
for (int j = 0; temp[j] <= i; j++)
{
vis[sg[i - temp[j]]] = true;
}
for (int j = 0; j < 101; j++)
{
if (vis[j] == false)
{
sg[i] = j;
break;
}
}
}
}
void input()
{
int s, n, m;
while (cin >> s, s)
{
for (int i = 0; i < s; i++)
{
scanf("%d", &temp[i]);
}
sort(temp, temp + s);
temp[s] = INF;
getsg();
cin >> m;
while (m--)
{
cin >> n;
int sum = 0, x;
for (int i = 0; i < n; i++)
{
cin >> x;
sum ^= sg[x];
}
cout << (sum ? 'W' : 'L');
}
cout << endl;
}
}
int main()
{
input();
return 0;
}
hdu1536
最新推荐文章于 2021-08-04 15:34:32 发布