Cod sursa(job #3123199)
Utilizator | Data | 22 aprilie 2023 14:07:15 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
//#include <iostream>
#include <fstream>
using namespace std;
ifstream cin("ciur.in");
ofstream cout("ciur.out");
const int N = 2e6 +5;
bitset <N> erat;
int main()
{
int cnt = 0;
int n;
cin >> n;
for(int i = 2; i * i <= n; i++)
{
if(erat[i])
{
continue;
}
for(int j = 2 * i; j <= n; j += i)
{
erat[j] = 1;
}
}
cout << n - erat.count();
return 0;
}