Cod sursa(job #3362859)
| Utilizator | Data | 12 august 2026 18:07:42 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int main() {
int n;
fin >> n;
bool ciur[n + 1];
for (int i = 1; i <= n; i++) {
ciur[i] = true;
}
ciur[0] = false;
ciur[1] = false;
for (int i = 2; i <= n; i++) {
if (ciur[i] == true) {
for (int j = 2 * i; j <= n; j += i) {
ciur[j] = false;
}
}
}
int nrp = 0;
for (int i = 2; i <= n; i++) {
if (ciur[i]) {
nrp++;
}
}
fout << nrp << endl;
return 0;
}
