Cod sursa(job #3263030)
| Utilizator | Data | 12 decembrie 2024 20:38:37 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.64 kb |
#include <fstream>
#include <bitset>
using namespace std;
const int N = 2e6;
int main()
{
ifstream in("ciur.in");
ofstream out("ciur.out");
bitset <N+1> c;
int n;
in >> n;
for (int d = 2; d * d <= n; d++)
{
if (!c[d])///daca d este prim (nu e marcat ca fiind compus)
{
for (int m = d * d; m <= n; m += d)
{
c[m] = 1;
}
}
}
int nrp = 0;
for (int i = 2; i <= n; i++)
{
if (!c[i])
{
nrp++;
}
}
out << nrp;
in.close();
out.close();
return 0;
}
