UVa11542 Square

/*by SilverN*/
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<cmath>
#define LL long long
using namespace std;
const int mxn=1200;
int read(){
    int x=0,f=1;char ch=getchar();
    while(ch<'0' || ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0' && ch<='9'){x=x*10+ch-'0';ch=getchar();}
    return x*f;
}
LL read1(){
    LL x=0,f=1;char ch=getchar();
    while(ch<'0' || ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0' && ch<='9'){x=x*10+ch-'0';ch=getchar();}
    return x*f;
}
int pri[mxn],cnt=0;
bool vis[mxn];
void Pri(){
    for(int i=2;i<mxn;i++){
        if(!vis[i])pri[++cnt]=i;
        for(int j=1;j<=cnt && pri[j]*i<mxn;j++){
            vis[pri[j]*i]=1;
            if(i%pri[j]==0)break;
        }
    }
    return;
}
int T,n,m;
int a[120][120];
void solve(){
    int i=0,j=0;
    while(i<=m && j<n){
        int p=i;
        for(int k=i;k<=m;k++)
            if(a[k][j]){p=k;break;}
        if(a[p][j]){
            if(p!=i){
                for(int k=0;k<=n;k++)
                    swap(a[i][k],a[p][k]);
            }
            for(int l=i+1;l<=m;l++){
                if(a[l][j]){
                    for(int c=i;c<=n;c++)
                        a[l][c]^=a[i][c];
                }
            }
            i++;
        }
        j++;
    }
    LL ans=(1LL<<(n-i))-1;
    printf("%lld
",ans);
    return;
}
int main(){
    int i,j;
    Pri();
    T=read();
    LL x;
    while(T--){
        memset(a,0,sizeof a);m=0;
        //
        n=read();
        for(i=0;i<n;i++){
            x=read1();
            for(j=1;i<=cnt && x>1;j++){
                if(x%pri[j]==0){
                    m=max(m,j);//方程组数量 
                    while(x%pri[j]==0){
                        a[j-1][i]^=1;
                        x/=pri[j];
                    }
                }
            }
        }
        solve();
    }
    return 0;
}