UVa 1210 - Sum of Consecutive Prime Numbers

#include <bits/stdc++.h>
using namespace std;

const int maxn = 10001;
bool isp[maxn];
int cnt, p[2000], sum[2000], res[100000];

void init()
{
memset(isp, true, sizeof(isp));
isp[0] = isp[1] = false;
const int max1 = sqrt(maxn + 0.5);
for(int i = 2; i <= max1; i++)
if(isp[i])
for(int j = i * i; j < maxn; j += i)
isp[j] = false;
for(int i = 0; i < maxn; ++i)
if(isp[i])
p[++cnt] = i;
for(int i = 1; i <= cnt; ++i)
sum[i] = sum[i-1] + p[i];
for(int i = 1; i <= cnt; ++i)
for(int j = i; j <= cnt; ++j)
if(sum[j]-sum[i-1] <= 10000)
++res[sum[j]-sum[i-1]];
}

int main ()
{
init(); int n;
while(cin >> n, n) cout << res
<< endl;
return 0;
}