Cod sursa(job #681160)
Utilizator | Data | 16 februarie 2012 18:16:25 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <stdio.h>
int N, cnt,i,j;
char prim[2000005];
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]){
++cnt;
for (j = i+i; j <= N; j += i)
prim[j] = 0;
}
printf("%d\n",cnt);
return (0);
}