SGU 200. Cracking RSA （高斯消元求自由变元个数）

题目链接：http://acm.sgu.ru/problem.php?contest=0&problem=200

200. Cracking RSA

time limit per test: 0.25 sec.
memory limit per test: 65536 KB

input: standard
output: standard

The following problem is somehow related to the final stage of many famous integer factorization algorithms involved in some cryptoanalytical problems, for example cracking well-known RSA public key system. 

The most powerful of such algorithms, so called quadratic sieve descendant algorithms, utilize the fact that if n = pq where p and q are large unknown primes needed to be found out, then if v²=w² (mod n), u ≠ v (mod n) and u ≠ -v (mod n), then gcd(v + w, n) is a factor of n (either p or q). 

Not getting further in the details of these algorithms, let us consider our problem. Given m integer numbers b₁, b₂, ..., b_m such that all their prime factors are from the set of first t primes, the task is to find such a subset S of {1, 2, ..., m} that product of b_i for i from S is a perfect square i.e. equal to u² for some integer u. Given such S we get one pair for testing (product of S elements stands for v when w is known from other steps of algorithms which are of no interest to us, testing performed is checking whether pair is nontrivial, i.e. u ≠ v (mod n) and u ≠ -v (mod n)). Since we want to factor n with maximum possible probability, we would like to get as many such sets as possible. So the interesting problem could be to calculate the number of all such sets. This is exactly your task. 

Input

The first line of the input file contains two integers t and m (1 ≤ t ≤ 100, 1 ≤ m ≤ 100). The second line of the input file contains m integer numbers b_i such that all their prime factors are from t first primes (for example, if t = 3 all their prime factors are from the set {2, 3, 5}). 1 ≤ b_i ≤ 10⁹ for all i. 

Output

Output the number of non-empty subsets of the given set {b_i}, the product of numbers from which is a perfect square 

Sample test(s)

Input

 

 

3 4 
9 20 500 3 

 

 

Output

 

 

3 

 

 

 

 

这题就是给出了m个数，这m个数的质因子都是前t个质数构成的。

问有多少个这m个数的子集，使得他们的乘积是完全平方数。

完全平方数就是要求每个质因子的指数是偶数次。

对每个质因子建立一个方程。 变成模2的线性方程组。

求解这个方程组有多少个自由变元，答案就是 2^ret - 1 ,去掉空集的情况！

/* ***********************************************
Author        :kuangbin
Created Time  :2014-1-20 9:19:03
File Name     :E:2014ACMSGUSGU200.cpp
************************************************ */

#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <math.h>
using namespace std;

//高精度加法
void add(char a[],char b[],char c[])
{
    int len1 = strlen(a);
    int len2 = strlen(b);
    int len = max(len1,len2);
    int up = 0;
    for(int i = 0;i < len;i++)
    {
        int tmp = 0;
        if(i < len1) tmp += a[i] - '0';
        if(i < len2) tmp += b[i] - '0';
        tmp += up;
        c[i] = tmp%10 + '0';
        up = tmp/10;
    }
    if(up)
        c[len++] = up + '0';
    c[len] = 0;
}
void SUB_ONE(char a[])
{
    int id = 0;
    while(a[id] == '0')id++;
    a[id]--;
    for(int i = 0;i < id;i++)
        a[i] = '9';
    int len = strlen(a);
    while(len > 1 && a[len-1] == '0')len--;
    a[len] = 0;
}

int equ,var;
int a[110][110];
int x[110];
int free_x[110];
int free_num;

//返回值为-1表示无解，为0是唯一解，否则返回自由变元个数
int Gauss()
{
    int max_r, col, k;
    free_num = 0;
    for(k = 0, col = 0; k < equ && col < var; k++, col++)
    {
        max_r = k;
        for(int i = k+1 ; i < equ; i++)
            if(abs(a[i][col]) > abs(a[max_r][col]))
                max_r = i;
        if(a[max_r][col] == 0)
        {
            k--;
            free_x[free_num++] = col; //自由变元
            continue;
        }
        if(max_r != k)
        {
            for(int j = col; j < var+1; j++)
                swap(a[k][j],a[max_r][j]);
        }
        for(int i = k+1; i < equ;i++)
            if(a[i][col] != 0)
                for(int j = col; j < var+1;j++)
                    a[i][j] ^= a[k][j];
    }
    for(int i = k;i < equ;i++)
        if(a[i][col] != 0)
            return -1;
    if(k < var)return var-k;
    for(int i = var-1; i >= 0;i--)
    {
        x[i] = a[i][var];
        for(int j = i+1; j < var;j++)
            x[i] ^= (a[i][j] && x[j]);
    }
    return 0;
}

const int MAXN = 1000;
int prime[MAXN+1];
void getPrime()
{
    memset(prime,0,sizeof(prime));
    for(int i = 2;i <= MAXN;i++)
    {
        if(!prime[i])prime[++prime[0]] = i;
        for(int j = 1;j <= prime[0] && prime[j] <= MAXN/i;j++)
        {
            prime[prime[j]*i] = 1;
            if(i%prime[j] == 0)break;
        }
    }
}

int b[110];
char str1[110],str2[110];

int main()
{
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    getPrime();
    int t,m;
    while(scanf("%d%d",&t,&m) != EOF)
    {
        for(int i = 0;i < m;i++)
            scanf("%d",&b[i]);
        equ = t;
        var = m;
        for(int i = 0;i < t;i++)
            for(int j = 0;j < m;j++)
            {
                int cnt = 0;
                while(b[j]%prime[i+1] == 0)
                {
                    cnt++;
                    b[j] /= prime[i+1];
                }
                a[i][j] = (cnt&1);
            }
        for(int i = 0;i < t;i++)
            a[i][m] = 0;
        int ret = Gauss();
        strcpy(str1,"1");
        for(int i = 0;i < ret;i++)
        {
            add(str1,str1,str2);
            strcpy(str1,str2);
        }
        SUB_ONE(str1);
        int len = strlen(str1);
        for(int i = len-1;i >= 0;i--)
            printf("%c",str1[i]);
        printf("
");
    }
    return 0;
}