POJ 2739 - Sum of Consecutive Prome Numbers
来源:互联网 发布:淘宝企业店铺入驻通道 编辑:程序博客网 时间:2024/06/04 20:13
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 18169 Accepted: 9982
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.
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
2317412066612530
Sample Output
11230012
Source
Japan 2005
#include <iostream>using namespace std;int prime[2000],num=0;bool isprime(int a){for(int i=0;i<num;i++)if(a%prime[i]==0)return 0;return 1;}int main(){for(int i=2;i<=10000;i++)if(isprime(i))prime[num++]=i;prime[num]=10001;int n;cin>>n;while(n){int sum=0;for(int i=0;n>=prime[i];i++){int psum=0;for(int j=i;j<num&&psum<n;j++){psum+=prime[j];}if(psum==n)sum++;}cout<<sum<<endl; cin>>n;}return 0;}
0 0
- POJ 2739 - Sum of Consecutive Prome 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
- POJ 1005 - I Think I Need a Houseboat
- 泽熙等多机构调研紫光股份,核心关注云计算机产品
- POJ 1552 - Doubles
- linux下从源代码编译安装软件的一般步骤
- 黑马程序员-转换流的字符编码学习日记
- POJ 2739 - Sum of Consecutive Prome Numbers
- UPNP端口映射全过称
- hdu4738 求桥
- Android界面开发推荐颜色
- ios 远程推送和本地推送
- POJ 3299 - Humidex
- eclipse启动报错,让查看.metadata/.log日志
- 【索引】Codeforces RCC 2014 Warmup (Div. 2)
- umbrello学习笔记(一)----类图