Cod sursa(job #3273252)
Utilizator | Data | 1 februarie 2025 12:58:56 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
using namespace std;
int n, v[100001];
int main() {
cin >> n;
v[1] = 1;
for (int i = 2; i * i <= n; ++i) {
if (v[i] == 0) {
for (int j = 2; j <= n / i; ++j) {
v[i * j] = 1;
}
}
}
int cnt = 0;
for (int i = 1; i <= n; ++i) {
if (v[i] == 0) {
++cnt;
}
}
cout << cnt;
return 0;
}