Cod sursa(job #2502736)
Utilizator | Data | 1 decembrie 2019 14:57:07 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
# include <iostream>
# include <fstream>
# include <bitset>
using namespace std;
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
int n, s;
bitset <2000005> E;
int main ()
{
fin >> n;
E[0] = 1;
E[1] = 1;
for ( int i = 2; i <= n; ++i)
if (E[i] == 0) {
++s;
for ( int j = i + i; j <= n; j += i)
E[j] = 1;
}
fout << s;
return 0;
}