Cod sursa(job #3145425)
Utilizator | Data | 15 august 2023 14:55:17 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bitset<2000005> fr;
int n, nr;
int main()
{
int i, j;
fin >> n;
fr[0] = fr[1] = 1;
for(i=2; i*i<=n; i++)
if(fr[i] == 0)
for(j=2; j*i<=n; j++)
fr[j * i] = 1;
for(i=1; i<=n; i++)
if(fr[i] == 0) nr++;
fout << nr;
fin.close();
fout.close();
return 0;
}