Cod sursa(job #2722037)
Utilizator | Data | 12 martie 2021 16:02:43 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <vector>
#include <fstream>
#include <bitset>
using namespace std;
ifstream cin("ciur.in");
ofstream cout("ciur.out");
const int maxn = 2000005;
int n;
bitset <maxn> used;
int main() {
cin >> n;
int cnt = 1;
for(int i=3 ; i<=n ; i+=2) {
if(used[i])
continue;
++cnt;
for(int j=i+i; j<=n; j+=i)
used[j] = 1;
}
cout << cnt << '\n';
}