Cod sursa(job #280960)
Utilizator | Data | 13 martie 2009 18:07:49 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include<stdio.h>
long n,e;
char p[2000001];
int main()
{ freopen("ciur.in","r",stdio);
freopen("ciur.out","w",stdout);
scanf("%l",&n);
for(long i=2;i<=n;i++)
p[i]=1;
for(long i=2;i<=n;i++)
if(p[i])
{ e++;
for(long j=i+i;j<=n;j+=i)
p[j]=0;
}
printf("%l",e);
return 0;
}