Cod sursa(job #2440019)
Utilizator | Alexandru Miclea TheGodFather2131 | Data | 17 iulie 2019 13:50:39 |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp-32 | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <iostream>
using namespace std;
char prime[2000002];
int main()
{
int i, j, n, cnt = 0;
FILE *in, *out;
in = fopen("ciur.in", "r");
out = fopen("ciur.out", "w");
fscanf(in, "%d", &n);
for (i = 2; i <= n; i+=2){
prime[i] = 1;
}
cnt++;
for (i = 3; i <= n; i++){
if (prime[i] == 0){
cnt++;
for (j = i*i; j <= n; j+=i){
prime[j] = 1;
}
}
}
fprintf(out, "%d", cnt);
return 0;
}