【BestCoder】 HDOJ 5088

无脑高斯消元，详见莫涛的论文。。。

#include <iostream>
#include <queue> 
#include <stack> 
#include <map> 
#include <set> 
#include <bitset> 
#include <cstdio> 
#include <algorithm> 
#include <cstring> 
#include <climits>
#include <cstdlib>
#include <cmath>
#include <time.h>
#define maxn 2000005
#define maxm 1005
#define eps 1e-10
#define mod 1000000007
#define INF 999999999
#define lowbit(x) (x&(-x))
#define mp make_pair
#define ls o<<1
#define rs o<<1 | 1
#define lson o<<1, L, mid 
#define rson o<<1 | 1, mid+1, R
#pragma comment(linker, "/STACK:16777216")
typedef long long LL;
typedef unsigned long long ULL;
//typedef int LL;
using namespace std;
LL qpow(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base;base=base*base;b/=2;}return res;}
LL powmod(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base%mod;base=base*base%mod;b/=2;}return res;}
void scanf(int &__x){__x=0;char __ch=getchar();while(__ch==' '||__ch=='\n')__ch=getchar();while(__ch>='0'&&__ch<='9')__x=__x*10+__ch-'0',__ch = getchar();}
LL gcd(LL _a, LL _b){if(!_b) return _a;else return gcd(_b, _a%_b);}
// head

bitset<1005> bs[60];
LL a[maxn];
int n;

void read(void)
{
	scanf("%d", &n);
	for(int i = 0; i < n; i++) scanf("%I64d", &a[i]);
}

void gauss(void)
{
	int cnt = 0, r;
	for(int i = 0; i < 60 && i < n; i++) {
		r = -1;
		for(int j = i; j < 60; j++) if(bs[j][i] == 1) r = j;
		if(r == -1) continue;
		cnt++;
		swap(bs[r], bs[i]);
		for(int j = i+1; j < 60; j++) if(bs[j][i] == 1) bs[j] ^= bs[i];
	}
	//printf("%d\n", cnt);
	if(cnt == n) printf("No\n");
	else printf("Yes\n");
}

void work(void)
{
	for(int i = 0; i < 60; i++) bs[i] = 0;
	for(int i = 0; i < 60; i++)
		for(int j = 0; j < n; j++) {
			if(a[j] & (1LL << i)) bs[i][j] = 1;
			else bs[i][j] = 0;
		}
	gauss();
}

int main(void)
{
	int _;
	while(scanf("%d", &_)!=EOF) {
		while(_--) {
			read();
			work();
		}
	}

	return 0;
}