A - Sum of Consecutive Prime Numbers

题意：有多组数据，n在2到10000之间，求有多少组连续的质数的和等于n
思路：由于n较小，暴力即可

#include <iostream>
#include <cstdio>
#include <algorithm>

using namespace std;
int prime[10010], cnt[10010];
int main() {
	int m = 0;
	prime[++m] = 2;
	for(int i = 3; i <= 10000; i++) {
		bool flag = 1;
		for(int j = 2; j <= i / j; j++) {
			if(i % j == 0) {
				flag = 0;
				break;
			}
		}
		if(flag) prime[++m] = i;
	}
	for(int i = 1; i <= m; i++) {
		int sum = 0;
		for(int j = i; j <= m; j++) {
			sum += prime[j];
			if(sum > 10000) break;
			cnt[sum]++;
		}
	}
	int n;
	while(cin >> n) {
		if(!n) break;
		printf("%d\n", cnt[n]);
	}
	return 0;
}