Cod sursa(job #2777528)
Utilizator | Data | 23 septembrie 2021 17:12:28 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <iostream>
using namespace std;
bool ciur[50000001];
int main() {
int n, counter = 0;
cin >> n;
for (int d = 2; d <= n; ++d) {
if (ciur[d] == false) {
for (int i = 2; i <= n / d; ++i) {
ciur[i * d] = true;
}
++counter;
}
}
cout << counter;
return 0;
}