Cod sursa(job #409888)
Utilizator | Data | 3 martie 2010 21:56:43 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include<stdio.h>
int main()
{
int n,prim[2000001],contor=0;
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d",&n);
for(int i=2; i<=n; ++i)
prim[i]=1;
for(int i=2; i<=n;++i)
if(prim[i])
{
++contor;
for(int j=i*i;j<=n;j+=i)
prim[j]=0;
}
printf("%d",contor);
return 0;
}