POJ-2739-Sum of Consecutive Prime Numbers

#include<cstdio>
#include<cstring>
#include<iostream>
using namespace std;
const int maxn=10001;
int n,pri[maxn],cnt=0;
bool ispri[maxn];
void Init()
{
ispri[1]=1;
cnt=0;
for(int i=2;i<maxn;i++)
{
if(!ispri[i])
pri[cnt++]=i;
for(int j=2;i*j<maxn;j++)
ispri[i*j]=1;
}
}
int main()
{
Init();
while(scanf("%d",&n)&&n)
{
int ans=0,sum=0,front=0,last=0;
while(front<=last&&last<cnt)
{
if(pri[last]>n)
break;
sum+=pri[last++];
while(sum>n)
sum-=pri[front++];
if(sum==n)
ans++;
}
printf("%d\n",ans);
}
return 0;
}