Cod sursa(job #254159)
Utilizator | Data | 6 februarie 2009 21:12:25 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include<stdio.h>
char p[2000010];
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
int i,j;
int n=0,t=0;
scanf("%d",&n);
for(i=2;i<=n;++i)
{p[i]=1;
}
for(i=2;i<=n;i++)
if(p[i])
{ t++;
for(j=2*i;j<=n;j+=i)
p[j]=0;
}
printf("%d\n",t);
return 0;
}