Cod sursa(job #3295968)
| Utilizator | Data | 10 mai 2025 11:56:18 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int main() {
int N;
fin >> N;
// toate nr prime
vector<bool> prim(N + 1, true);
prim[0] = prim[1] = false;
for (int i = 2; i * i <= N; i++) {
if (prim[i]) {
//eliminare mltiplii i
for (int j = i * i; j <= N; j += i) {
prim[j] = false;
}
}
}
int x=0;
for (int i = 2; i <= N; i++) {
if (prim[i]) {
x++;
}
}
fout << x;
return 0;
}
