Cod sursa(job #2700693)
| Utilizator | Data | 28 ianuarie 2021 15:06:49 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <fstream>
#include <bitset>
using namespace std;
const int NMAX = 2000000;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bitset<NMAX + 5> ciur;
int main()
{
ios_base::sync_with_stdio(false);
fin.tie(NULL);
int n,i,j,cnt = 0;
fin >> n;
ciur[0] = ciur[1] = 1;
for(i = 2; i * i <= NMAX; i++)
if(!ciur[i])
for(j = 2; j * i <= NMAX; j++)
ciur[i * j] = 1;
for(i = 1; i <= n; i++)
if(!ciur[i])
cnt++;
fout << cnt;
return 0;
}
