Cod sursa(job #3304472)
| Utilizator | Data | 23 iulie 2025 23:19:42 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 30 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
#include <iostream>
#include <vector>
using namespace std;
fstream fin("ciur.in");
ofstream fout("ciur.out");
vector<int> ciur;
int main() {
int n, cnt = 0;
fin >> n;
ciur.resize(n + 1, 1);
for (int i = 2; i <= n; i++) {
if (ciur[i]) {
++cnt;
for (int j = i * i; j <= n; j += i)
ciur[j] = 0;
}
}
fout << cnt << '\n';
}
