Cod sursa(job #2753302)
| Utilizator | Data | 22 mai 2021 12:45:54 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 70 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int result[2000005];
int ciur(int N) {
int counter = 0;
for (int i = 2; i * i <= N; ++i) {
if (result[i] == 0) {
for (int d = i * i; d <= N; d += i) {
result[d] = -1;
}
}
}
for (int i = 2; i <= N; ++i) {
if (result[i] == 0) {
++counter;
}
}
return counter;
}
int main() {
int N;
fin >> N;
fout << ciur(N);
return 0;
}
