POJ Sum of Consecutive Prime Numbers
2012-08-16 00:31
417 查看
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
Source
Japan 2005
打个素数表就行了
View Code
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 13861 | Accepted: 7748 |
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
打个素数表就行了
View Code
#include<stdio.h> int prime[1500] ,count = 0; void getPrime(){ int f[11000] = {0} ; for(int i=2;i<=10009;i++){ if(!f[i]){ prime[count++] = i ; for(int j=i;j<=10009;j+=i) f[j] = 1; } } } int main(){ getPrime() ; int n ; while(scanf("%d",&n) && n){ int ans = 0; for(int i=0;i<count && prime[i] <= n;i++){ int temp = n,j = i; while(prime[j] <= temp){ temp -= prime[j]; j++ ; } if(temp == 0) ans++; } printf("%d\n",ans) ; } 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(素数打表 + 暴力)
- POJ2739_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【尺取法】【筛法】