poj 2739

求连续素数的和，输出这些值能由多少种不同的连续素数的和表示

//============================================================================
// Name        : 2739.cpp
// Author      :
// Version     :
// Copyright   : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;

int prime[10010], d[2000][2000], tag[10000];
long long l[1300];
bool flag[10010];
int num, n;

int main() {
	freopen("a.txt", "r", stdin);
	memset(flag, true, sizeof(flag));
	flag[1] = false;
	for(int i = 2;i <= 10000/2;i++){
		if(flag[i]){
			for(int j = i << 1;j <= 10000;j+=i){
				flag[j] = false;
			}
		}
	}
	num = 0;
	for(int i = 1;i <= 10000;i++){
		if(flag[i]){
			prime[++num] = i;
		}
	}
	for(int i = 1;i <= num;i++){
		l[i] = l[i-1]+prime[i];
	}
	for(int i = 1;i <= num;i++){
		for(int j = 1;j <= i;j++){
			if(l[i]-l[j-1] <= 10000) d[i][j] = l[i]-l[j-1];
			if(d[i][j] <= 10000) tag[d[i][j]] ++;
		}
	}
	while(scanf("%d", &n)&&n){
		printf("%d\n", tag[n]);
	}
	return 0;
}