Pagini recente » Cod sursa (job #2422269) | Monitorul de evaluare | Diferente pentru problema/esir intre reviziile 3 si 2 | Cod sursa (job #3139446) | Cod sursa (job #2127914)
#include <stdio.h>
char prim[2000000];
int main() {
int n, i, j, count = 0;
FILE* input = fopen("ciur.in", "r");
FILE* output = fopen("ciur.out", "w");
fscanf(input, "%d", &n);
for (i = 2; i <= n; i++) {
if (prim[i] == 0) {
count++;
for (j = 2 * i; j <= n; j += i) {
prim[j] = 1;
}
}
}
fprintf(output, "%d\n", count);
fclose(input);
fclose(output);
return 0;
}