Cod sursa(job #2662151)

Utilizator proflaurianPanaete Adrian proflaurian Data 23 octombrie 2020 16:39:33
Problema Ciurul lui Eratosthenes Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.38 kb
#include <bits/stdc++.h>

using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
const int N = 2000010;
bitset<N> p;
int n,cnt;
int main()
{
    //f>>n;
    cin>>n;
    p.flip();
    for(int i=2; i*i<=n; i++)
        if(p[i])
            for(int j=i*i; j<=n; j+=i)
                p[j]=0;
    cnt=p.count()-N+n-1;
    cout<<cnt;
    //g<<cnt;
    return 0;
}