Cod sursa(job #3274153)
Utilizator | Data | 5 februarie 2025 16:03:11 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
int n;
bool v[2000005];
ifstream cin ("ciur.in");
ofstream cout ("ciur.out");
int main() {
cin >> n;
v[1] = true;
int cnt = 0;
for (int i = 2; i <= n; ++i) {
if (v[i] == 0) {
++cnt;
for (int j = i + i; j <= n; j += i) {
v[j] = true;
}
}
}
cout << cnt;
return 0;
}