Cod sursa(job #3312261)
| Utilizator | Data | 27 septembrie 2025 11:17:13 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
#include <iostream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int main() {
int n;
int i, cnt = 0, j;
bool prim[2000025];
fin >> n;
for (i = 2; i <= n; i++) {
prim[i] = 1;
}
for (i = 2; i <= n; i++) {
if (prim[i]) {
cnt++;
for (j = i + i; j <= n; j += i)
prim[j] = 0;
}
}
fout << cnt;
}