poj2739 Sum of Consecutive Prime Numbers

Description 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 53 has two
representations 5 + 7 + 11 + 13 + 17 and 53. The integer 41 has three
representations 2+3+5+7+11+13, 11+13+17, and 41. The integer 3 has
only one representation, which is 3. The integer 20 has no such
representations. Note that summands must be consecutive prime numbers,
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 given positive integer.

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

筛出素数，O(n^2)枚举。

#include<cstdio>
#include<cstring>
int prm[10010],tot,ans[10010];
bool have[10010];
int main()
{
    int i,j,k,m,n,p,q,x=0,y,z;
    for (i=2;i<=10000;i++)
    {
        if (!have[i]) prm[++tot]=i;
        for (j=1;j<=tot&&i*prm[j]<=10000;j++)
        {
            have[i*prm[j]]=1;
            if (i%prm[j]==0) break;
        }
    }
    for (i=1;i<=tot;i++,x=0)
      for (j=i;j<=tot&&x+prm[j]<=10000;j++)
        ans[x+=prm[j]]++;
    while (scanf("%d",&n)&&n) printf("%d\n",ans[n]);
}