Cod sursa(job #274561)
Utilizator | Data | 9 martie 2009 20:48:41 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <stdio.h>
#define Nmax 2000001
int n,i,nr=0,j;
char prim[Nmax];
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d", &n);
for (i=2;i<=n;++i)
prim[i]=1;
for (i=2;i<=n;++i)
if (prim[i]==1)
{
nr++;
for (j=i+i;j<=n;j+=i)
prim[j]=0;
}
printf("%d", nr);
return 0;
}