1863185_ac_0ms_68k.c

北大大牛代码 1240道题的原代码 超级权威

# include <stdio.h>
# include <math.h>

int judge(long x)
{
 long i;
 int  n;
 n = 1;
 if(x==2||x==3) return 1;
 for(i = 2; i <= sqrt((double)x); i++)
 if(x%i==0)
 {
  n = 0;
  i = x;  
 }
 return n;
}

void main()
{
 long i, n, l, j, no, tmp;
 long a[10000];
 l = 0;
 for(i = 2; i < 10000; i++)
 if(judge(i)) a[l++] = i;
 while(scanf("%ld",&n)==1&&n)
 {
   no = 0;
   for(i = 0; a[i] <= n; i++)
    {
     tmp = a[i];
     for(j = i + 1; tmp < n; j++)
      tmp += a[j];
     if(tmp==n) {no++;continue;}
     while(tmp>n) 
     {
      tmp -= a[i];
      i++;
     }
      if(tmp==n) no++;
    }
    printf("%ld\n",no);
 }
}