Cod sursa(job #2239160)
| Utilizator | Data | 9 septembrie 2018 17:51:17 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.44 kb |
#include <bits/stdc++.h>
using namespace std;
int ciur(int n) {
vector<bool> used(n + 1);
int nr = 0;
for (int i = 2; i <= n; ++i) {
if (!used[i]) {
++nr;
} else if (used[i]) {
continue;
}
for (int j = i + i; j <= n; j += i) {
used[j] = true;
}
}
return nr;
}
int main() {
ifstream cin("ciur.in");
ofstream cout("ciur.out");
int n;
cin >> n;
cout << ciur(n) << '\n';
return 0;
}
