POJ2739 Sum of Consecutive Prime Numbers（AC代码 + 详解）

Defepe

于 2020-07-03 20:59:23 发布

阅读量274

点赞数 1

分类专栏：题解文章标签：算法 c++ 筛法素数超快

本文链接：https://blog.csdn.net/weixin_44494440/article/details/107111094

版权

这篇博客介绍了POJ2739编程问题，要求计算正整数由连续素数表示的方案数。文章给出了17、41等示例，并说明了20没有符合条件的表示。博主分享了通过预处理和扫描素数数组的AC解决方案，并邀请读者在评论区讨论和指正。

摘要由CSDN通过智能技术生成

Sum of Consecutive Prime Numbers

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

题目的意思是一个正整数可以由一个或者多个连续素数表示，给出一个正整数它有多少种表示呢？例如53可以由5+7+11+13+17和53两种方法表示，41有2+3+5+7+11+13和11+13+17和41表示，20没有表示的方法……当输入0时表示终止输入（大概就是这个意思，只能是由连续素数组成，不能重复出现同一素数）数据范围：2~10000
这个题先进行预处理再从左到右扫描素数数组就可AC
下面是AC代码（附注解）