Cod sursa(job #2788197)
| Utilizator | Data | 25 octombrie 2021 11:34:59 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include <fstream>
#include <bitset>
using namespace std;
const int NMAX = 2e6;
bitset <1+NMAX> c;
//bool c[1+NMAX];
int main()
{
ifstream in("ciur.in");
ofstream out("ciur.out");
int n;
in >> n;
in.close();
for (int i = 2; i * i <= n; i++)
{
if (!c[i])
{
for (int j = i * i; j <= n; j += i)
{
c[j] = true;
}
}
}
int nr = 0;
for (int i = 2; i <= n; i++)
{
if (!c[i])
{
nr++;
}
}
out << nr;
out.close();
return 0;
}
