Cod sursa(job #2961300)
| Utilizator | Data | 6 ianuarie 2023 09:00:20 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 30 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
const int MAX_SIZE = 2000000;
long long n, ciur[MAX_SIZE + 1];
int eratosthenes_chiur(int n) {
int counter = 0;
for (int i = 2; i <= n; ++i) {
ciur[i] = 1;
}
for (int i = 2; i <= n; ++i) {
if (ciur[i]) {
++counter;
for (int j = i + i; j <= n; j += i) {
ciur[j] = 0;
}
}
}
return counter;
}
int main() {
fin >> n;
fout << eratosthenes_chiur(n);
return 0;
}
