Cod sursa(job #489154)
Utilizator | Data | 1 octombrie 2010 15:36:34 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include<cstdio>
bool m[2000001];
int main()
{
int n,i,j,nr=0;
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d",&n);
for(i=2;i*i<=n;++i)
{
if(!m[i])
for(j=i*i;j<=n;j+=i)
m[j]=true;
}
for(i=2;i<=n;++i)
if(!m[i])
nr++;
printf("%d\n",nr);
return 0;
}