只要用尺取法就能轻松秒过!
#include <cstdio>
const int maxn = 10000;
int prime[maxn];
bool is_prime[maxn+1];
int sieve(int n) {
int p = 0;
for (int i = 0; i <= n; i++) {
is_prime[i] = true;
}
is_prime[0] = is_prime[1] = false;
for (int i = 2; i <= n; i++) {
if (is_prime[i]) {
prime[p++] = i;
for (int j = 2 * i; j <= n; j += i) {
is_prime[j] = false;
}
}
}
return p;
}
int main(int argc, char const *argv[]) {
int num = sieve(maxn);
int n;
while (scanf("%d", &n) == 1 && n) {
int s = 0, t = 0, sum = 0;
int ans = 0;
for ( ; ; ) {
while (t < num && sum < n) {
sum += prime[t++];
}
if (sum < n) {
break;
}
if (sum == n) {
ans++;
}
sum -= prime[s++];
}
printf("%d\n", ans);
}
return 0;
}