匈牙利算法（素数伴侣（HW1112））

#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<vector>
#include<string>
#include<stdio.h>
#include<stdlib.h>
using namespace std;

const int N = ;
bool isSushu(int n)
{
    if (n %  ==  || n %  == ) return false;
    else{
        for (int i = ; i*i <= n; i += )
            if (n%i ==  || n % (i + ) == ) return false;
        return true;
    }
}
int n1, n2, ans;
int result[N];
bool state[N];
bool map[N][N];

bool find(int x)
{
    for (int i = ; i <= n2; ++i){
        if (map[x][i] && !state[i]){
            state[i] = true;
            if (result[i] ==  || find(result[i])){
                result[i] = x;
                return true;
            }
        }
    }
    return false;
}
int hungary()
{
    for (int i = ; i <= n1; ++i){
        memset(state, , sizeof(state));
        if (find(i)) ++ans;
    }
    return ans;
}

class xx{
    string &name;
};
int main()
{
    int n, val;
    vector<int> odd, even;
    scanf("%d", &n);
    for (int i = ; i < n; ++i){
        scanf("%d", &val);
        if (val %  == ) even.push_back(val);
        else odd.push_back(val);
    }
    memset(map, , sizeof(map));

    for (int i = ; i < odd.size(); ++i){
        for (int j = ; j < even.size(); ++j){
            if (isSushu(odd[i] + even[j])) map[i + ][j + ] = true;
        }
    }

    memset(result, , sizeof(result));
    n1 = odd.size(); n2 = even.size(); ans = ;
    cout << hungary() << endl;
}