POJ 2739 Sum of Consecutive Prime Numbers
来源:互联网 发布:ui设计网站知乎 编辑:程序博客网 时间:2024/06/16 04:08
Sum of Consecutive Prime Numbers
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 25167 Accepted: 13722
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
题目大意:
给定一个10000以内的数字,判断这个数字是否可以由几个连续的素数(例如:2,3,5,7...)相加得到,并且给出这个数可以有几组这样的解。
比如41 = 2+3+5+7+11+13, 41 = 11+13+17, 41 = 41
输入:每行一个数字,0为退出
输出:每行一个数字,对应输入的每个数字的解的组数。
解题思路:
可以优化解题思路,减少时间。10000以内素数总共有1229个。可以先打表将所有素数存到数组中,然后再设置两个变量i,j,分别指向这个连续素数串的头和尾,不停的移动寻找解即可。下面是AC代码:
#include<iostream>#include<cmath>using namespace std;int is_prime(int num ){ int i; if(num==2) return 1; for(i=2; i<(int)sqrt((double)num); i++) { if(num%i==0) break; } if(num%i==0) return 0; else return 1;}int main(){ ios::sync_with_stdio(false); int i,j=0; int n; int a[10000]; for(i=2; i<10000; i++) { if(is_prime(i)==1) a[j++]=i; } while(cin>>n&&n) { int num=0; for(i=0; i<2000; i++) { int sum=0; for(j=i; j<2000; j++) { sum+=a[j]; if(sum>n) break; else if(sum==n) { num++; break; } } } cout<<num<<endl; } return 0;}
阅读全文
0 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
- 欢迎使用CSDN-markdown编辑器
- tensorflow使用range_input_producer多线程读取数据
- ZooKeeper实战应用之【统一配置管理】
- imx6ul之OpenWRT中使用mpd作为音频Server及其使用
- 扩展欧几里德总结
- POJ 2739 Sum of Consecutive Prime Numbers
- spring 源码阅读学习
- 关于Recyclerview删除item后的数据乱跳问题
- Manacher算法总结
- Android Art Hook 技术方案
- 【源码分析】Elastic-Job源码分析之AbstractElasticJobExecutor分析
- lua 函数
- python基础操作mongodb
- 应用进程与系统进程的通信(IActivityManager & IApplicationThread)