2739. Sum of Consecutive Prime Numbers
来源:互联网 发布:java逆序输出语法 编辑:程序博客网 时间:2024/05/18 17:24
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
2
3
17
41
20
666
12
53
0
Sample Output
1
1
2
3
0
0
1
2
思路
简单的打表题:先统计出10000以内的素数,填进一个数组,之后遍历数组。
代码
#include <iostream>#include <math.h>using namespace std;bool isprime(int a){ int i = 0; for (i = 2; i <= sqrt(a*1.0); i++) //sqrt(a)函数中a不能为整数,否则Compiling error { if (a % i == 0) return false; } return true;}int main(){ int prime[10000] = { 0 }; int a = 2,i = 0,n = 0; int count = 0; int sum = 0; for (a = 2; a <= 10000; a++) { if (isprime(a)) { prime[i] = a; i++; } } cin >> n; while (n) { count = 0; for (int k = 0; k < i; k++) { sum = 0; for (int j = k; j < i ; j++) { sum += prime[j]; if (sum >= n) break; } if (sum == n) count++; } cout << count << endl; cin >> n; } return 0;}
- 2739. Sum of Consecutive Prime Numbers
- Sum of Consecutive Prime Numbers
- Sum of Consecutive Prime Numbers
- Sum of Consecutive Prime Numbers
- Sum of Consecutive Prime Numbers
- Sum of Consecutive Prime Numbers
- Sum of Consecutive Prime Numbers
- Sum of Consecutive Prime Numbers
- POJ 刷题系列:2739. Sum of Consecutive Prime Numbers
- POJ 2739 Sum of Consecutive Prime Numbers
- Sum of Consecutive Prime Numbers pku 2739
- POJ2739 Sum of Consecutive Prime Numbers
- poj 2739 Sum of Consecutive Prime Numbers
- 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
- 02-SAMBA文件共享服务
- 利用FFmpeg玩转Android视频录制与压缩(一)章
- 数组的运用
- POJ2185 Milking Grid
- Linux 用户和管理员设置密码相关
- 2739. Sum of Consecutive Prime Numbers
- 构造/析构函数
- 7.18只读对象和const 的应用 专访陈抒:C++至今不可替代
- Http在线加载图片用llistview显示(post)
- 直播阿里云从裸机到部署项目绑定域名
- 基础母函数1002
- leetcode一些题的想法
- 将查出来的多个DataTable 合并成一个
- document.referrer已经可以用于统计搜索来源