csu 1552(米勒拉宾素数测试+二分图匹配)

1552: Friends

Time Limit: 3 Sec  Memory Limit: 256 MB
Submit: 723  Solved: 198
[Submit][Status][Web Board]

Description

On
an alien planet, every extraterrestrial is born with a number. If the
sum of two numbers is a prime number, then two extraterrestrials can be
friends. But every extraterrestrial can only has at most one friend. You
are given all number of the extraterrestrials, please determining the
maximum number of friend pair.

Input

There are several test cases.
Each test start with positive integers N(1 ≤ N ≤ 100), which means there are N extraterrestrials on the alien planet.
The following N lines, each line contains a positive integer pi ( 2 ≤ pi
≤10^18),indicate the i-th extraterrestrial is born with pi number.
The input will finish with the end of file.

Output

For each the case, your program will output maximum number of friend pair.

Sample Input

3
2
2
3

4
2
5
3
8

Sample Output

1
2

题意:有一些外星人想要找朋友玩,每个外星人都有一个value，当另一个外星人的 value' + value 是素数时,他们就可以成为朋友,但是每个人只能有一个朋友,问最多能够有多少朋友?
题解米勒拉宾大素数判断+二分图匹配

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;
#define N 505
typedef long long LL;
//拉宾米勒测试
LL MIN;
LL mult_mod(LL a,LL b,LL n)
{
    LL s=;
    while(b)
    {
        if(b&) s=(s+a)%n;
        a=(a+a)%n;
        b>>=;
    }
    return s;
}

LL pow_mod(LL a,LL b,LL n)
{
    LL s=;
    while(b)
    {
        if(b&) s=mult_mod(s,a,n);
        a=mult_mod(a,a,n);
        b>>=;
    }
    return s;
}

bool Prime(LL n)
{
    LL u=n-,pre,x;
    int i,j,k=;
    if(n==||n==||n==||n==||n==)  return ;
    if(n==||(!(n%))||(!(n%))||(!(n%))||(!(n%))||(!(n%)))   return ;
    for(;!(u&);k++,u>>=);
    srand((LL)time());
    for(i=;i<;i++)
    {
        x=rand()%(n-)+;
        x=pow_mod(x,u,n);
        pre=x;
        for(j=;j<k;j++)
        {
            x=mult_mod(x,x,n);
            if(x==&&pre!=&&pre!=(n-))
                return ;
            pre=x;
        }
        if(x!=)  return false;
    }
    return true;
}
int n;
int graph[N][N];
int linker[N];
bool vis[N];
LL a[N];
bool dfs(int u){
    for(int i=;i<=n;i++){
        if(graph[u][i]&&!vis[i]){
            vis[i] = true;
            if(linker[i]==-||dfs(linker[i])){
                linker[i] = u;
                return true;
            }
        }
    }
    return false;
}
int main()
{
    while(scanf("%d",&n)!=EOF){
        for(int i=;i<=n;i++){
            scanf("%lld",&a[i]);
        }
        for(int i=;i<=n;i++){
            for(int j=;j<=n;j++) graph[i][j] = ;
        }
        for(int i=;i<=n;i++){
            for(int j=i+;j<=n;j++){
                if(Prime(a[i]+a[j])){
                    graph[i][j] = graph[j][i] = ;
                }
            }
        }
        int ans = ;
        memset(linker,-,sizeof(linker));
        for(int i=;i<=n;i++){
            memset(vis,false,sizeof(vis));
            if(dfs(i)) ans++;
        }
        printf("%d\n",ans/);
    }
    return ;
}