Cod sursa(job #3041168)
| Utilizator | Data | 31 martie 2023 09:06:20 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#include<fstream>
#include<bitset>
using namespace std;
ifstream cin("ciur.in");
ofstream cout("ciur.out");
constexpr int NMAX = 2e6 + 1;
bitset<NMAX> eratostene;
int main()
{
eratostene[1] = 1;
int n,ans = 0; cin >> n;
for(int i = 2; i * i <= n ; i++)
{
if(eratostene[i]) continue;
for(int j = 2 * i ; j <= n ; j += i) eratostene[j] = 1;
}
cout << n - eratostene.count();
}
