选数

#include<bits/stdc++.h>
using namespace std;
long long n,k,b[50];
bool book[50];
long long c[17] = {1,561,1105,1729,2465,2821,6601,8911,10585,15841,29341,41041,46657,52633,62745,63973,75361};
long long f(long long b, long long n, long long MOD)
{
    for(long long s = b, t = b = 1; n; n >>= 1)
        b = (n&1 ? b*s : b)%MOD, s = s*s%MOD;
    return b;
}
bool Prime_Check(long long x)
{
    srand(time(NULL));
    if(x == 2 || x == 3)
        return 1;
    //1. No Carmichael Number
    if(binary_search(c,c+17,n))
        return 0;
    //2. Fermat Theory
    int q = 0;
    for(int i = 0, b; i < 100; i++)
    {
        b = rand();
        if(f(b,x-1,x)%x - 1)
            q--;
        else
            q++;
    }
    //3. Second Check
    return (q >= 0 && ((x-1)*(x-1)%x == 1));
}
long long DFS(long long dfn, long long s, int p)
{
    if(dfn == k)
        return Prime_Check(s);
    long long ans = 0;
    for(int i = p; i < n; i++)
        if(!book[i])
        {
            book[i] = 1;
            ans += DFS(dfn+1,s+b[i],i+1);
            book[i] = 0;
        }
    return ans;
}
int main()
{
    scanf("%lld%lld",&n,&k);
    for(int i = 0; i < n; i++)
        scanf("%lld",b+i);
    printf("%lld",DFS(0,0,0));
    return 0;
}