Cod sursa(job #2865515)
| Utilizator | Data | 8 martie 2022 21:31:05 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include <iostream>
#include <fstream>
#define NMAX 2000005
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bool ciur[NMAX];
int getPrimesNumber(int N) {
for (int i = 2; i <= N; ++i) {
if (ciur[i] == false) {
if (long(i) * i <= N) {
for (int j = i * i; j <= N; j += i) {
ciur[j] = true;
}
}
}
}
int con = 0;
for (int i = 2; i <= N; ++i) {
if (!ciur[i]) {
++con;
}
}
return con;
}
int main()
{
int n;
fin >> n;
fout << getPrimesNumber(n);
return 0;
}
