Cod sursa(job #2342635)
| Utilizator | Data | 12 februarie 2019 23:18:18 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <fstream>
#include <bitset>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
const int NMax = 2000000;
bitset <NMax + 5> A;
int N, Sol;
void Ciur()
{
for(int i = 2; i * i <= N; i++)
if(!A[i])
{
for(int j = i * i; j <= N; j += i)
A[j] = true;
}
}
int main()
{
fin >> N; Ciur();
for(int i = 2; i <= N; i++)
Sol += !A[i];
fout << Sol << '\n';
fin.close();
fout.close();
return 0;
}
