POJ2739--Sum of Consecutive Prime Numbers
2013-02-04 15:00
651 查看
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
Sample Output
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
#include <iostream> using namespace std; bool A[10008]={0}; int B[10000]; int S[10000]; #define maxn 10000 int main() { for(int i=2;i<=maxn;i++) { if(!A[i]) { for(int j=i*i;j<=maxn;j+=i) { A[j]=1; } } } int k=0; for(int i=2;i<=maxn;i++) { if(!A[i]) { B[++k]=i; } } S[1]=2; S[0]=0; for(int i=2;i<=k;i++) { S[i]=S[i-1]+B[i]; } int n; while(cin>>n&&n) { int sum=0; for(int i=1;i<=k;i++) { for(int j=0;j<i;j++) { if(S[i]-S[j]==n) { sum++; } } } cout<<sum<<endl; } return 0; }
相关文章推荐
- POJ2739 Sum of Consecutive Prime Numbers
- POJ2739-Sum of Consecutive Prime Numbers
- POJ2739---Sum of Consecutive Prime Numbers(尺取法)
- POJ2739--Sum of Consecutive Prime Numbers(尺取法)
- POJ2739_Sum of Consecutive Prime Numbers【筛法求素数】【枚举】
- POJ2739 Sum of Consecutive Prime Numbers素数打表
- POJ2739-Sum of Consecutive Prime Numbers
- POJ2739-Sum of Consecutive Prime Numbers
- poj2739 Sum of Consecutive Prime Numbers 杂题
- poj2739 - Sum of Consecutive Prime Numbers(求素数)
- Sum of Consecutive Prime Numbers(poj2739)
- POJ2739 Sum of Consecutive Prime Numbers
- POJ2739-Sum of Consecutive Prime Numbers
- POJ2739 Sum of Consecutive Prime Numbers
- [POJ2739]Sum of Consecutive Prime Numbers
- POJ2739:Sum of Consecutive Prime Numbers(简单数论)
- POJ2739-Sum of Consecutive Prime Numbers
- UVALive3399 UVA1210 POJ2739 Sum of Consecutive Prime Numbers【素数筛选+尺取法】
- 【POJ】2739 - Sum of Consecutive Prime Numbers 尺取法+素数
- C - Sum of Consecutive Prime Numbers(1.2.2)