Zhu and 772002
很标准的异或板子,我们的方程式横着表示,每个数是否存在因子为素数的因子,存在的奇数还是偶数,如果是偶数则不进行处理,奇数则去进行处理,最后输出2的自由元个数次幂-1就是结果
#include<iostream>
#include<string>
#include<algorithm>
#include<cstdlib>
#include<cstdio>
#include<set>
#include<map>
#include<vector>
#include<cstring>
#include<stack>
#include<cmath>
#include<queue>
#define eps 1e-9
#define MOD 1000000007
using namespace std;
int T,n,tot,f[2005];
int F[310][310];//用于记录第i个数,分解质因数之后,素数的奇偶性
bool prime[2005];
long long ksm(long long a,long long b)
{
long long ans = 1ll;
while(b)
{
if(b & 1) ans = ans * a % MOD;
a = a * a % MOD;
b >>= 1;
}
return ans;
}
signed main()
{
memset(prime,true,sizeof(prime));
prime[2] = true;
for(int i = 2; i <= 2000; i++)
if(prime[i])
for(int j = i*i; j <= 2000; j += i)
prime[j] = false;
for(int i = 2; i <= 2000; i++)
if(prime[i])
f[i] = ++tot;
cin>>T;
for(int t = 1; t <= T; t++)
{
int zy = 0;
memset(F,0,sizeof(F));
cin>>n;
for(int i = 1; i <= n; i++)
{
long long x;
cin>>x;
for(int k = 2; k <= sqrt(x); k++)
while(x % k == 0)//如果第i个数有素数
{
F[f[k]][i] = (F[f[k]][i] + 1) % 2;
x /= k;
}
if(x != 1)
F[f[x]][i] = 1;
}
int now = 0;
for(int i = 1; i <= n; i++)
{
int k = ++now;
while(F[k][i] == 0 && k < tot)
k++;
if(F[k][i] == 0)
{
zy++;
now--;
continue;
}
if(k != now)
swap(F[now],F[k]);
for(int j = now+1; j <= tot; j++)
if(F[j][i] != 0)
{
for(int k = 1; k <= n; k++)
F[j][k] ^= F[now][k];
}
}
printf("Case #%d:\n%I64d\n",t,(ksm(2,zy)-1LL+MOD)%MOD);
}
}