BJFU 质数相关

 /*
  BJFU  质数相关
  http://101.200.220.237/contest/19/problem/116/
  二分图
  按质因数奇偶性建立二分图
  *
  *
  */
 #include <cstdio>
 #include <algorithm>
 #include <cstring>
 #include <cmath>
 #include <vector>
 #include <queue>
 //#define test
 using namespace std;
 const int Nmax=;
 int n;
 int num[Nmax];
 int s1[Nmax];
 int s2[Nmax];
 int cnt1;
 int cnt2;
 int match[Nmax];
 int book[Nmax];
 int is_prime[Nmax];
 int prime[Nmax];
 int prime_cnt;
 vector<int> v1[Nmax],v2[Nmax];
 int is(int n)
 {
     int ans=;
     for(int i=;i<=prime_cnt;i++)
     {
         if(prime[i]>n)
             break;
         if(n%prime[i]==)
         {
             while(n%prime[i]==)
             {
                 ans++;
                 n/=prime[i];
             }
         }
     }

     //if(is_prime[n])
         //return 1;
     //for(int i=2;i*i<=n;i++)
     //{
         //while(n%i==0)
         //{
             //ans++;
             //n/=i;
         //}
     //}
     return ans&;
 }

 int dfs(int v)
 {
    for(int i=;i<v1[v].size();i++)
    {
        int u=v1[v][i];
        if(book[u])
            continue;
        book[u]=;
        if(match[u]==- || dfs(match[u]))
        {
            match[u]=v;
            return ;
        }
    }
    return ;
 }

 void init()
 {
     for(int i=;i<=cnt1;i++)
         v1[i].clear();
     for(int i=;i<=cnt2;i++)
         v2[i].clear();
     for(int i=;i<=cnt1;i++)
     {
         for(int j=;j<=cnt2;j++)
         {
             if(s1[i]%s2[j]== && is_prime[s1[i]/s2[j]])
             {
                 v1[i].push_back(j);
                 v2[j].push_back(i);
             }
             else if(s2[j]%s1[i]== && is_prime[s2[j]/s1[i]])
             {
                 v1[i].push_back(j);
                 v2[j].push_back(i);
             }
         }
     }
     for(int i=;i<=cnt2;i++)
         match[i]=-;
 }

 void get_prime()
 {
     for(int i=;i<Nmax;i++)
         is_prime[i]=;
     for(int i=;i<Nmax;i++)
         if(is_prime[i])
         {
             prime[++prime_cnt]=i;
             for(int j=;j*i<Nmax;j++)
                 is_prime[i*j]=;
         }
 }

 int main()
 {
     #ifdef test
     freopen("6.test.in","r",stdin);
     #endif
     int t;
     scanf("%d",&t);
     get_prime();
     for(int ttt=;ttt<=t;ttt++)
     {
         printf("Case #%d: ",ttt);
         scanf("%d",&n);
         cnt1=cnt2=;
         for(int i=;i<=n;i++)
         {
             scanf("%d",&num[i]);
             if(num[i]==)
             {
                 s2[++cnt2]=num[i];
                 continue;
             }
             if(is(num[i]))
                 s1[++cnt1]=num[i];
             else
                 s2[++cnt2]=num[i];
         }
 #ifdef tesst
         for(int i=;i<=cnt1;i++)
             printf("%d ",s1[i]);
         printf("\n");
         for(int j=;j<=cnt2;j++)
             printf("%d ",s2[j]);
         printf("\n");
 #endif
         init();
         int ans=;
         for(int i=;i<=cnt1;i++)
         {
             for(int j=;j<=cnt2;j++)
                 book[j]=;
             if(dfs(i))
                 ans++;
         }
         printf("%d\n",n-ans);
     }
     return ;
 }