尺取--poj2739
来源:互联网 发布:java 可变参数使用 编辑:程序博客网 时间:2024/04/29 12:51
Language:
Sum of Consecutive Prime Numbers
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 17200 Accepted: 9464
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代码如下:#include<iostream>#include<cstring>#include<algorithm>#include<cstdio>using namespace std;const int MAX=10005;int n;int num=1;int sum[MAX];int prime[MAX];bool is_prime[MAX];void make(){ fill(is_prime,is_prime+10003,true); is_prime[0]=is_prime[1]=false; for(int i=2; i<=10000; i++) { if(is_prime[i]) prime[num++]=i; for(int j=2*i; j<=10000; j+=i) is_prime[j]=false; }}void solve(){ int i=0,j=1; int nsum=0; int ans=0; while(j<num) { if(prime[j]>n) break; nsum=sum[j]-sum[i]; if(nsum==n) { ans++; j++; } else if(nsum>n) { i++; } else if(nsum<n) j++; if(i==j) j++; } cout<<ans<<endl;}int main(){ //freopen("in.txt","r",stdin); make(); memset(sum,0,sizeof(sum)); for(int i=1;i<num;i++) sum[i]=sum[i-1]+prime[i]; while(cin>>n,n) { solve(); } return 0;}
- 尺取--poj2739
- poj2739(尺取模型)
- poj2739
- poj2739
- poj2739
- poj2739
- poj2739
- poj2739
- poj2739
- poj2739
- poj2739
- POJ2739
- POJ2739
- POJ2739
- poj2739
- poj2739
- POJ2739
- poj2739
- SQL Server的读操作默认隔离级别
- WinForm读取Excel文件
- poj 487-3279 (方便记忆的电话号码)
- IntelliJ IDEA使用技巧<三>
- PHP 正则表达式如何匹配img中任意属性
- 尺取--poj2739
- 【3】OMAP335X-内核BSP之hwmod(一).
- Tomcat定时重启方案
- 单点登录
- Extjs4中的Form之displayfield的使用
- android数据库sqlite的CRUD操作
- Hibernate注解映射详解
- FastCGI与CGI解释器的区别,及其工作原理
- 如何改进iOS客户端的升级提醒功能