Cod sursa(job #2839388)

Utilizator BalasaRaduBalasa Radu BalasaRadu Data 25 ianuarie 2022 20:53:06
Problema Ciurul lui Eratosthenes Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.58 kb
#include <bits/stdc++.h>
using namespace std;

ifstream fin("ciur.in");
ofstream fout("ciur.out");

const int dim=2000009;

vector<int>prime;

bool ciur[dim];

void Eratosthenes(int MAX){
    ciur[0]=ciur[1]=1;
    for(int i=4;i<=MAX;i+=2){
        ciur[i]=1;
    }
    for(int i=3;i*i<=MAX;i+=2){
        for(int j=i*i;j<=MAX;j+=i){
            ciur[j]=1;
        }
    }
    for(int i=2;i<=MAX;i++){
        if(!ciur[i]){
            prime.push_back(i);
        }
    }
}

signed main(){
    int n;
    fin>>n;
    Eratosthenes(n);
    fout<<prime.size();
}