Cod sursa(job #2422934)
Utilizator | Data | 20 mai 2019 13:50:32 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include<stdio.h>
int N, c;
char prim[2000005];
int main() {
int i, j;
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]) {
++c;
for (j = i * 2; j <= N; j += i) {
prim[j] = 0;
}
}
}
printf("%d", c);
return 0;
}