nim博弈论

 具体的证明还是有一点没有看懂

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 0x3f3f3f
const int maxn=1000+10;
int n,a[maxn];
int main()
{
	int T;
	cin >> T;
	while(T--)
	{
		cin >> n;
		int i,j,k;
		for(i=0;i<n;i++){
			scanf("%d",&a[i]);
		}
		int t=a[0];
		for(i=1;i<n;i++){
			t^=a[i];
		}
		if(0==t) printf("Liu_B is not sure to win.\n");
		else  printf("Liu_B is sure to win.\n");
	}
	return 0;
}