poj2739（尺取法）

链接:https://vjudge.net/problem/POJ-2739

问的是一个数字可以由多少个连续的质数相加而得

#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<cmath>
using namespace std;
bool is_primes[10005];
int primes[10005];
int prime_count;

void GetPrimes(int n){
    int k = 0;
    memset(is_primes, true, sizeof(is_primes));
    for (int i = 2; i <= n; i++){
        if (!is_primes[i])
            continue;
        primes[k++] = i;
        for (int m = 1; m*i <= n; m++)
            is_primes[m*i] = false;
    }
    prime_count = k;
}
int main(){
    int n;
    GetPrimes(10000);   
 
    while (scanf("%d", &n) && n){
        int sum = 0;
        int s = 0, t = 0;
        int count = 0;
        //尺取法
        for (;;){
            while (primes[t] <= n && sum < n){   
                sum += primes[t++];
            }
            if (sum == n)  
                count++;
             
            sum -= primes[s++];
             
            if (sum <= 0)   
                break;
        }
        printf("%d\n", count);
    }
    return 0;
}