toj2010 Sum of Consecutive Prime Numbers

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 53has two representations 5 + 7 + 11 + 13 + 17 and 53. The integer 41 has three representations2+3+5+7+11+13, 11+13+17, and 41. The integer 3 has only one representation, which is3. The integer 20 has no such representations. Note that summands must be consecutive primenumbers, 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 givenpositive integer.

Input

The input is a sequence of positive integers each in a separate line. The integers are between 2and 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 oneor more consecutive prime numbers. No other characters should be inserted in the output.

Sample Input

2
3
17
41
20
666
12
53
0

Output for the Sample Input

1
1
2
3
0
0
1
2

Source: Japan 2005 - Tokyo Onsite

---

/*
 * 思路:先筛一下1万以内的素数,线性筛法即可
 * 然后直接暴力,把[l,r]区间和(即第l个素数到第r个素数连续和)
 * 对应的数加一即可,表示该对应的数可以用区间[l,r]的和表示,为
 * 一种方案.直接暴力的话O(n^2),有一个剪枝就是,我是固定左端点l,
 * 然后右端点r不断递增的,所以一旦某个[l,r]和大于1万,那么可以
 * 知道[l,r+1],[l,r+2]...都一定是大于的,就没必要继续了,直接break
 * 掉.否则的话1300*1300的计算量还是达到百万级别了的...程序最后
 * 0秒表示很惊奇....
 */
#include <cstdio>
#include <cmath>
#include <cstring>
#include <vector>
#include <map>
using namespace std;
vector<int> prime;

const int LEN = 10001;
const int MAX = 1300;
bool ok[LEN];
int fuck[LEN];

inline int sum(int l, int r) {
	int s = 0;
	for (int i = l; i <= r; ++i) s += prime[i];
	return s;
}

int main() {
	memset(ok, true, sizeof(ok));
	for (int i = 2; i*i < LEN; ++i)
		for (int j = i*i; j < LEN; j += i)
			ok[j] = false;
	for (int i = 2; i < LEN; ++i)
		if (ok[i]) prime.push_back(i);
	
	int s;
	memset(fuck, 0, sizeof(fuck));
	for (int i = 0; i < prime.size(); ++i) {
		for (int j = 0; j < prime.size(); ++j) {
			s = sum(i, j);		
			if (s < LEN) ++fuck[sum(i,j)];
			else break;
		}
	}

	int n;
	while (~scanf(" %d", &n) && n) {
		printf("%d\n", fuck[n]);
	}
	return 0;
}