POJ2739(尺取法)

import java.util.Arrays;
import java.util.Scanner;

public class Main {
    Scanner in = new Scanner(System.in);
    final int MAXN = 10005;
    int[] prime = new int[MAXN];
    boolean[] isPrime = new boolean[MAXN];
    int[] sum = new int[MAXN];
    int total;
    void table() {
        Arrays.fill(isPrime, true);
        isPrime[0] = false;
        isPrime[1] = false;
        for(int i = 2; i < MAXN; i++) {
            if(isPrime[i]) {
                prime[total++] = i;
                for(int j = i + i; j < MAXN; j += i) {
                    isPrime[j] = false;
                }
            }
        }
        sum[0] = 0;
        for(int i = 1; i < total; i++) {
            sum[i] = sum[i-1] + prime[i-1];
        }
    }
    Main() {
        int n;
        table();
        while((n = in.nextInt()) != 0) {
            int res = 0, sum = 0;
            int front = 0, rear = 0;
            while(true) {
                while(rear < total && prime[rear] <= n && sum < n) {
                    sum += prime[rear++];
                }
                if(sum == n) {
                    res++;
                }
                sum -= prime[front++];
                if(front >= total || front > rear) {
                    break;
                }
            }
            System.out.println(res);
        }
    }
    public static void main(String[] args) {
        
        new Main();
    }
}