Cod sursa(job #702060)
Utilizator | Data | 1 martie 2012 19:20:52 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <cstdio>
int n, count;
bool non[2000000];
int main() {
FILE * in = fopen("ciur.in", "rt");
FILE * out = fopen("ciur.out", "wt");
fscanf(in, "%d", &n);
for (int i = 2; i < n; ++i) {
if (!non[i]) {
++count;
for (int j = i; j < n; j += i) {
non[j] = 1;
}
}
}
fprintf(out, "%d\n", count);
fclose(in);
fclose(out);
}