POJ 2739Sum of Consecutive Prime Numbers【素数判断+尺取法】

Sum of Consecutive Prime Numbers

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 28491		Accepted: 15275

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

题意：求连续素数和等于n的组合数

思路：素数打表，尺取法模拟

 

代码：

#include<cstdio>
#include<cstring>
#include<iostream>
using namespace  std;
const int maxn=10008;
long long s[maxn],isprime[maxn];
void prime()///素数打表
{
    long long i,k,j;
    k=1;
    memset(isprime,1,sizeof(isprime));///初始化都认为是素数
    isprime[0]=0;
    isprime[1]=0;///0和1不是素数
    for(i=2; i<=maxn; i++)
    {
        if(isprime[i])
        {
            s[k++]=i;///保存素数
        }
        for(j=i*2; j<=maxn; j+=i)
        {
            isprime[j]=0;///素数的倍数都不是素数
        }
    }
}
int main()
{
    int n,time,sum,i,j;
    prime();
    while(scanf("%d",&n)!=EOF)
    {
        time=0;
        sum=0;
        i=0;
        j=1;
        if(n==0)
            break;
        while(1)//尺取法
        {
            while(sum<n&&n>=s[i+1])//扩展右端点
            {
                sum+=s[++i];

            }//选取可扩展序列，之后扩展左端点
            if(sum<n)
            {
                break;
            }
            else if(sum>n)
            {
                sum-=s[j];
                j++;
            }
            else if(sum==n)
            {

                time++;
                sum-=s[j];
                j++;
            }

        }
        printf("%d\n",time);
    }
    return 0;
}