题意:
给出N个数,问从中选出一些数,使得它们的乘积为完全平方数的选择方案数
分析:
若一个数为完全平方数,则它每个质因子的个数一定为偶数,对于第i个数要么选,要么不选,设为xi(0/1),则对于每个质因子:
P1 : P1_a1*X1 + P1_a2*X2 + ...... + P1_an*Xn = 0 (mod 2)
P2 : P2_a1*X1 + P2_a2*X2 + ...... + P2_an*Xn = 0 (mod 2)
......
Pm : Pm_a1*X1 + Pm_a2*X2 + ...... + Pm_an*Xn = 0 (mod 2)
(Pm为质因子,Pm_ai为ai中质因子Pm的个数)
高斯消元后,对于自由变量都可以选择或者不选两种情况,所以答案为 2^(自由变量的数量) - 1(全不选的解)
代码:
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int maxn = 2e3+23;
const int mod = 1e9+7;
LL T,n,b[500],prime[500],a[maxn][500],len,equ,var;
void getprime(){
len = 0;
for(int i = 2;i < maxn; ++i){
bool flag = true;
for(int j = 2;j*j <= i; ++j){
if(i%j == 0) {
flag = false;
break;
}
}
if(flag) prime[len++] = i;
}
}
LL qpow(LL a,LL x,LL MOD){
LL res = 1;
while(x){
if(x & 1) res = res * a % MOD;
a = a * a % MOD;
x >>= 1;
}
return res;
}
int num[310][maxn],vis[maxn];
void init(){
memset(vis,0,sizeof(vis));
memset(num,0,sizeof(num));
for(int i = 1; i <= n; ++i){
for(int j = 0;j < len; ++j){
while(b[i]%prime[j]==0){
num[i][j]++;
vis[j]++;
b[i] /= prime[j];
}
}
}
equ = 0,var = n;
for(int i = 0;i < len; ++i){
if(vis[i]){
for(int j = 1;j <= n; ++j){
a[equ][j-1] = num[j][i]%2;
}
equ++;
}
}
}
int Guass(){
int r = 0,c = 0;
for(;r < equ && c < var; ++r,++c){
int maxr = r;
for(int i = r+1;i < equ; ++i){
if(a[i][c] > a[maxr][c]) maxr = i;
}
if(a[maxr][c] == 0){
r--;
continue;
}
if(maxr != r){
for(int i = c;i <= var; ++i) swap(a[r][i],a[maxr][i]);
}
for(int i = r+1;i < equ; ++i){
if(!a[i][c]) continue;
for(int j = c; j <= var; ++j)
a[i][j] ^= a[r][j]; //模2的高斯消元可以这样写
}
}
for(int i = r;i < equ; ++i){
if(a[i][c]) return -1;
}
return var - r; //自由变量的数量
}
int main(){
getprime();
cin >> T;
for(int Case = 1; Case <= T; ++Case){
cin >> n;
for(int i = 1;i <= n; ++i) cin >> b[i];
init();
int x = Guass();
printf("Case #%d:\n",Case);
if(x == -1) cout << 0 << '\n';
else cout << (qpow(2,x,mod)-1+mod)%mod << '\n';
}
return 0;
}