题目地址:http://www.tsinsen.com/A1035
//清橙OJ A1035 素数之和
//http://www.tsinsen.com/A1035
//复习一下那个标记素数的过程。
#include <stdio.h>
#include<string.h>
#define MAXS 1002
int mark[MAXS]={0};
int prime[MAXS],count=0;
int main()
{
int n,i,j;
long long sum;
mark[0]=mark[1]=1;
memset(prime,1,MAXS*sizeof(int));
for(i=2;i<MAXS;i++)
{
if(mark[i])continue;
else
{
prime[count++]=i;
for(j=i*i;j<MAXS;j+=i)mark[j]=1;
}
}
while(~scanf("%d",&n)&&n)
{
for(i=sum=0;prime[i]<=n;i++)
{
sum+=prime[i];
}
printf("%lld\n",sum);
}
return 0;
}