Sum of Consecutive Prime Numbers （暴力+素数筛选法）

最新推荐文章于 2020-07-03 20:59:23 发布

黑脉金

最新推荐文章于 2020-07-03 20:59:23 发布

阅读量431

点赞数

分类专栏： c++面向对象期末考试题库题目 ACM 素数素数筛选法

本文链接：https://blog.csdn.net/suguoliang/article/details/81262793

版权

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 correspond