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
一个数字可以用连续的素数和表示 问有几种表示方法
这题可以直接暴力 打表找到2-10000之间的素数 将连续的素数存到一个数组里 如果循环遍历每个素数,从这个素数开始向后找看有没有符合要求的
#include <iostream>
#include<string.h>
#include<stdio.h>
#include<math.h>
#include<algorithm>
using namespace std;
int book[10010],t;
int pri1[10010];
void prime() //素数筛 强烈推荐这个形式的素数筛
{
memset(book,0,sizeof(book)); //假设都是素数 只要是素数就标记为0
t=0;
for(int i=2; i<=10000; i++)
{
if(!book[i])
{
pri1[t++]=i;
}
for(int j=i*2; j<=10000; j+=i)
{
book[j]=1;
}
}
}
int main()
{
int n;
while(~scanf("%d",&n)&&n)
{
memset(pri1,0,sizeof(pri1));
prime();
int k=0,sum;
for(int i=0; i<t; i++)
{
sum=0;
for(int j=i;j<t;j++)
{
sum+=pri1[j];
if(sum==n)
{
k++;
break;
}
}
}
printf("%d\n",k);
}
}