Cod sursa(job #545739)
Utilizator | Data | 3 martie 2011 21:03:49 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.28 kb |
#include <cstdio>
int v[600000];
int main()
{
long long n,i,j,pr=0;
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%lld", &n);
for(i=2; i<=n; ++i)
{
if(not v[i])
{
pr++;
for(j=2; j<=n/i; ++j)
v[i*j]=1;
}
}
printf("%lld",pr);
return 0;
}