Cod sursa(job #2932862)
| Utilizator | Data | 4 noiembrie 2022 07:36:51 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.64 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int main() {
int n, a[2000005];
fin >> n;
for (int i = 2; i <= n; ++i) {
a[i] = 1;
}
for (int i = 2; i * i <= n; ++i) {
int ok = 0;
if (i % 2 == 0 && i != 2 || i % 3 == 0 && i != 3) {
++ok;
}
if (ok == 0) {
for (int j = i; j * i <= n; ++j) {
a[i * j] = 0;
}
}
}
int counter = 0;
for (int i = 2; i <= n; ++i) {
counter += a[i];
}
fout << counter;
return 0;
}
