Cod sursa(job #2740605)
Utilizator | Data | 13 aprilie 2021 17:03:58 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
int ciur(int n) {
if (n <= 1)
return 0;
int ret = n - 1;
int i, j;
for (i = 4; i <= n; i += 2)
--ret;
for (i = 3; i * i <= n; i += 2) {
for (j = i * i; j <= n; j += i << 1)
--ret;
}
return ret;
}
int main() {
std::ifstream fin("ciur.in");
std::ofstream fout("ciur.out");
int N;
fin >> N;
fout << ciur(N);
fin.close();
fout.close();
return 0;
}