poj 2739 Sum of Consecutive Prime Numbers
2011-11-22 13:07
681 查看
Sum of Consecutive Prime Numbers
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
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 12236 | Accepted: 6850 |
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; int arr[1230]; bool f[10001]; void Prime() { memset(f,true,sizeof(f)); int i,j; for(i=2;i*i<=10000;i++) { if(f[i]) for(j=i+i;j<=10000;j+=i) f[j]=false; } for(j=0,i=2;i<=10000;i++) if(f[i])arr[j++]=i; } int main() { Prime(); int ans; while(scanf("%d",&ans)&&ans) { int i,j,res=0; for(i=0;i<=1229;i++) { int tp=0; if(arr[i]>ans)break; for(j=i;j<1229;j++) { tp+=arr[j]; if(tp<ans)continue; if(tp==ans){res++;break;} if(tp>ans)break; } } printf("%d\n",res); } return 0; }
相关文章推荐
- poj-2739-Sum of Consecutive Prime Numbers
- POJ 2739 Sum of Consecutive Prime Numbers(尺取)
- POJ 2739 Sum of Consecutive Prime Numbers
- POJ-2739 Sum of Consecutive Prime Numbers
- Poj - 2739 - Sum of Consecutive Prime Numbers【尺取法+筛子】
- poj 2739 Sum of Consecutive Prime Numbers
- poj 2739 Sum of Consecutive Prime Numbers
- poj 2739 Sum of Consecutive Prime Numbers
- poj 2739 Sum of Consecutive Prime Numbers(尺取,暴力)
- POJ 2739 Sum of Consecutive Prime Numbers(素数)
- POJ 2739 Sum of Consecutive Prime Numbers
- POJ 2739 Sum of Consecutive Prime Numbers( *【素数存表】+暴力枚举 )
- poj 2739 Sum of Consecutive Prime Numbers
- poj 2739 Sum of Consecutive Prime Numbers(尺取+筛素数)
- POJ 2739 Sum of Consecutive Prime Numbers
- POJ 2739 Sum of Consecutive Prime Numbers(素数打表+素数搜索)
- POJ 2739 Sum of Consecutive Prime Numbers【素数打表】
- POJ 2739 Sum of Consecutive Prime Numbers 难度:0
- POJ - 2739 Sum of Consecutive Prime Numbers(尺取法)
- 【POJ】2739 - Sum of Consecutive Prime Numbers 尺取法+素数