POJ2739

Language: Default Sum of Consecutive Prime Numbers Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 19435   Accepted: 10658 Description Some positive integers can be represented by a sum of one or more consecutive prime numbers. How many such representations does a given positive integer have? For example, the integer 53 has two representations 5 + 7 + 11 + 13 + 17 and 53. The integer 41 has three representations 2+3+5+7+11+13, 11+13+17, and 41. The integer 3 has only one representation, which is 3. The integer 20 has no such representations. Note that summands must be consecutive prime  numbers, so neither 7 + 13 nor 3 + 5 + 5 + 7 is a valid representation for the integer 20.  Your mission is to write a program that reports the number of representations for the given positive integer. Input The input is a sequence of positive integers each in a separate line. The integers are between 2 and 10 000, inclusive. The end of the input is indicated by a zero. Output The output should be composed of lines each corresponding to an input line except the last zero. An output line includes the number of representations for the input integer as the sum of one or more consecutive prime numbers. No other characters should be inserted in the output. Sample Input 2 3 17 41 20 666 12 53 0 Sample Output 1 1 2 3 0 0 1 2 Source Japan 2005 #include <iostream> #include <cmath> #include <cstdio> #include <cstring> using namespace std; int isprime[10000]; int n,sum; bool flag; void prime() { int tmp=sqrt(10000+0.5); memset(isprime,0,sizeof(isprime)); for(int i=2;i<=tmp;i++) if(!isprime[i]) for(int j=i*2;j<=10000;j+=i) isprime[j]=1; } int main() { prime(); while(~scanf("%d",&n)&&n) { int cnt=0,tmp; for(int i=2;i<=n;i++) { sum=0,flag=false; tmp=i; while(sum<n) { if(!isprime[tmp]) { sum+=tmp; if(sum==n) { flag=true; break; } } tmp++; } if(flag) { cnt++; while(isprime[i]) i++; i++; } } cout<<cnt<<endl; } return 0; }