Description

Input

Output

Sample Input

2
3
17
41
20
666
12
53
0

Sample Output

1
1
2
3
0
0
1
2

 1 /**
 2  * 2739 Sum of Consecutive Prime Numbers
 3  * http://poj.org/problem?id=2739
 4  */
 5 #include<cstdio>
 6 #include<iostream>
 7 #include<vector>
 8 using namespace std;
 9 //zhicheng
10 //Jul.31,2018
11 vector<int> a;
12 bool is_Prim(int n)
13 {
14     if(n<=1) return false;
15     for(int i=2;i<=n/i;i++) if(n%i==0) return false;
16     return true;
17 }
18 
19 int sum_prime(int n)
20 {
21     int ans=0;
22     for(int i=0;a[i]<=n/2;i++)
23     {
24         int sum=0,cnt=i;
25         while(sum<n)
26         {
27             sum+=a[cnt++];
28             if(sum==n) ans++;
29         }
30     }
31     return ans;
32 }
33 int main()
34 {
35     for(int i=2;i<=10000;i++) if(is_Prim(i)) a.push_back(i);
36     int n;
37     while(~scanf("%d",&n)&&n) printf("%d\n",sum_prime(n)+(is_Prim(n)?1:0));
38     return 0;
39 }

[POJ] 2739 Sum of Consecutive Prime Numbers