Cod sursa(job #2928754)
| Utilizator | Data | 23 octombrie 2022 20:06:36 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
#define MAX_SIZE 2000001
bool sieve[MAX_SIZE] = {false};
int main() {
std::ifstream input("ciur.in");
std::ofstream output("ciur.out");
int n;
input >> n;
sieve[0] = sieve[1] = true;
int cnt = 0;
for (int i = 2; i <= n; ++i) {
if (!sieve[i]) {
cnt++;
for (int j = 2; j * i <= n; ++j) {
sieve[i * j] = true;
}
}
}
output << cnt;
return 0;
}
