Sum of Consecutive Prime Numbers

Rukio

于 2021-12-21 08:39:34 发布

阅读量131

点赞数 1

文章标签： c语言

本文链接：https://blog.csdn.net/rukio/article/details/122054229

版权

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

两种思路第一种为查找，本人不是很喜欢

#include<stdio.h>
#include<math.h>
int isprime(int n)
{
    int i;
    if(n==2)
    return 1;
    else 
    {
        for(i=2;i<=sqrt(n)+1;i++)
        {
            if(n%i==0)
            {
                return 0;
            }
        }
    }
    return 1;
}
int main()
{
    int prime[2500],len=0,i;
    for(i=2;i<10000;i++)
    {
        if(isprime(i))
        {
            prime[len++]=i;    //将所有质数放于表prime中，之后再逐项连续求和，看是否能等于n
        }
    }
    int n,cnt,j,sum;
    while(scanf("%d",&n)&&n)
    {
        cnt=0;                //cnt计数
        for(i=0;i<len;i++)    
        {
            sum=0;            //sum用于和n作比较
            for(j=i;j<len;j++)
            {
                sum+=prime[j];
                if(sum>n)
                break;
                else if(sum==n)
                cnt++;    
            }
        }
        printf("%d",cnt);
    }
    return 0;
}

既然已经想到打质数表，为啥不想着连答案表一起打了呢？

于是乎，我本人更偏向于第二种做法

#include<stdio.h>
int main()
{
    int flag[10000]={0},prime[2500],i,j,answer[10000]={0};
    int len=0;
    for(i=2;i<10000;i++)
    {
        if(flag[i]==0)
        {
            prime[len++]=i;
            for(j=2*i;j<10000;j+=i)
            {
                flag[j]=1;
            }
        }
    }
    int sum=0;
    int n;
    for(i=0;i<len;i++)
    {
        sum=0;
        for(j=i;j<len;j++)
        {
            sum+=prime[j];
			if(sum>10000)     //注意这里有个判断，如果不判断，可能造成数组溢出而崩掉
			{
				break;
			}
            answer[sum]++;
        }
    }
    while(scanf("%d",&n)&&n)
    {
        printf("%d",answer[n]);
    }
    return 0;
}