Cod sursa(job #2683085)
| Utilizator | Data | 10 decembrie 2020 14:04:54 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <iostream>
#include <fstream>
using namespace std;
bool v[2000001];
int counter;
int main() {
int n;
cin >> n;
v[0] = v[1] = true;
for (int i = 4; i <= n; i += 2) {
v[i] = true;
}
for (int i = 3; i * i <= n; i += 2) {
if(!v[i]) {
for (int j = i * i; j <= n; j = j + 2 * i) {
v[j] = true;
}
}
}
for (int i = 1; i <= n; ++i) {
if (!v[i])
++counter;;
}
cout << counter;
return 0;
}
