POJ-2739 Sum of Consecutive Prime Numbers-求一个数满足有多少组递增相加的素数等于该数
2015-08-07 19:31
447 查看
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
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 20975 | Accepted: 11513 |
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> using namespace std; const int maxp=2000,n=10000; int prime[maxp],total=0; bool isprime(int k) { int i; for(i=0; i<total; ++i) if(k%prime[i]==0) return false; return true; } int main() { int i,j,m,cnt,ans; for(i=2; i<=n; ++i)//先打表,把所有的素数枚举出来 if(isprime(i)) prime[total++]=i; prime[total]=n+1; cin>>m; while(m) { ans=0; for(i=0; m>=prime[i]; ++i) { cnt=0; for(j=i; j<total&&cnt<m; ++j) cnt+=prime[j]; if(cnt==m) ++ans; } cout<<ans<<endl; cin>>m; } return 0; }
相关文章推荐
- C++(15)STL实践与分析之Map类型
- Longest Valid Parentheses
- POJ 2752 Seek the Name, Seek the Fame
- 第一次多线程使用
- 在数组中需找连续“1”的起始位置和结束位置
- C++(14)STL分析与实践之容器适配器
- iOS8的UITextView问题
- [转]经典SQL语句大全
- 类2
- JS闭包与内存泄漏
- Oracle学习笔记章(一)
- Day1_HTML_超链接
- c++类实现二叉查找树的抽象数据结构
- A. GukiZ and Contest-Codeforces Round #307 (Div. 2)-简单水题
- POJ-2242 The Circumference of the Circle-已知三点共圆求周长
- 门面模式(Facade)解析
- 门面模式(Facade)解析
- POJ-2752-Seek the Name, Seek the Fame
- android 设置全屏,窗口透明度,待机设置,主题设置总结
- Objective-C文章中的生词