Cod sursa(job #2253742)

Utilizator rnqftwcalina florin daniel rnqftw Data 4 octombrie 2018 12:37:35
Problema Ciurul lui Eratosthenes Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.55 kb
#include<bits/stdc++.h>

using namespace std;
int a[2000010];
vector<int> prim;
int main(){
    ifstream in("ciur.in");
    ofstream out("ciur.out");
    int n ;
    in >> n ;

    for(int i = 2 ; i <= sqrt(n) ; i ++){
        if(a[i]==0){
            a[i]++;
            prim.push_back(i);
            for(int j = i * i ; j <= n ; j += i)
                a[j]++;

        }
    }
    for(auto it : prim)
    {
        out << it << " ";
    }
    for(int i = sqrt(n)+1 ; i <= n ; i++)
        if(a[i] == 0)
            out << i << " ";

}