Cod sursa(job #154480)
Utilizator | Popovici Adrian mithy | Data | 11 martie 2008 11:13:45 |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <stdio.h>
#define NMax 2000005
int N, n, sol[1024], cnt;
char prim[NMax];
int main()
{
int i, j;
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
scanf("%d", &N);
for (i=2; i<=N; ++i)
if ( !prim[i] )
{
++n;
for (j=i+i; j<=N; j+=i)
prim[j] = 1;
}
printf("%d\n", n);
return 0;
}