2283: Prime Sums

2283: Prime Sums

---

Result	TIME Limit	MEMORY Limit	Run Times	AC Times	JUDGE
	3s	8192K	396	115	Standard

There is a set S = {x1, x2, ..., xN} and a integer K, can you tell me how many sums of K integers in S which the sums are all primes?

Input

There are several case in the input. For each case there are two lines, the first line consist of a integer N(1 <= N <= 20) and the integer K(1 <= K <= N), the second line is N integers x1, x2, ..., xN (1 <= xi <= 5000000).

Output

Please output the number of the sums which are all primes in a single line for each case.

Sample Input

3 2
7 6 5

Sample Output

2

 

Problem Source: windsbu

 

---

This problem is used for contest: 43  153 

 

 

#include<stdio.h>
#include<math.h>
int num[30],ans[30];
int n,k;
int count;
bool prime(int l)
{
    //if(l==2) return true;
    //if(l%2==0) return true;
    int i; double k=sqrt(l*1.0);
    for(i=2;i<=k;i++)
    {
        if(l%i==0) return false ;
    }
    return true;
}
void dfs(int x,int step)
{
    int i;
    if(step==k)
    {
        int sum=0;
        for(i=0;i<k;i++) sum+=num[i];
        if(prime(sum)) count++;
       // printf("%d   ..%d    /n",sum,prime(sum));
        return ;
    }
    if(x==n) return ;
    num[step]=ans[x];
    dfs(x+1,step+1);
    dfs(x+1,step);
}
int main()
{
    int i;
    while(scanf("%d%d",&n,&k)==2)
    {
        for(i=0;i<n;i++) scanf("%d",&ans[i]);
        count=0;
        dfs(0,0);
        printf("%d/n",count);
    }
    return 0;
}