Cod sursa(job #2640446)
Utilizator | Data | 6 august 2020 14:36:55 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll nmax = 2000001;
bitset<nmax> reached;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int main()
{
int n;
fin >> n;
int cnt = 0;
for (int i = 2; i <= n; i++)
{
if(!reached[i])
{ cnt++;
for (int j = i * i; j <= n; j += i)
reached[j] = 1;
}
}
fout << cnt;
}