选数——NOIP2002普及组

#include <iostream>

using namespace std;

const int N = 25;

int n, k;
int a[N];
int cnt;

bool is_primes(int x)
{
    if (x < 2) return false;
    for (int i = 2; i <= x / i; i ++ )
        if (x % i == 0)
            return false;
    return true;
}

void dfs(int u, int sum, int last)//last用于递增枚举 
{
    if (u == k) 
    {
        if (is_primes(sum)) cnt ++ ;
        return;
    }
    
    for (int i = last; i < n; i ++ ) 
        dfs(u + 1, sum + a[i], i + 1);
}

int main()
{
    cin >> n >> k;
    for (int i = 0; i < n; i ++ ) cin >> a[i];
    
    dfs(0, 0, 0);
    
    cout << cnt << endl;
    return 0; 
}