Cod sursa(job #2751823)

Utilizator matei.balaur2009Matei Balaur12 matei.balaur2009 Data 15 mai 2021 21:28:29
Problema Ciurul lui Eratosthenes Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.34 kb
Raporteaza aceasta sursa 
#include<iostream>
#include <fstream>
#include <bitset>
using namespace std;
#define MAXN 2000000
int n;
bitset<MAXN> b;
int main() {
    ifstream fin("ciur.in");
    ofstream fout("ciur.out");
    fin>>n;
    int i,j;
    for (i=3; i*i<=n; i+=2)
        if (!b[i])for (j=i*i; j<=n; j+=2*i)b[j]=1;
    fout<<(n+1)/2-b.count();
}