Cod sursa(job #3121659)

Utilizator InformaticianInDevenire1Munteanu Mihnea Gabriel InformaticianInDevenire1 Data 14 aprilie 2023 17:17:14
Problema Ciurul lui Eratosthenes Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.6 kb
#include <iostream>
#include <fstream>

using namespace std;

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

int IsPrime [1000000];

void Ciur(){
    IsPrime[0] = 0;
    IsPrime[1] = 0;
    for (int i=2;i<=1000000;++i){
        IsPrime[i] = 1;
    }
    for (int i=2;i<=1000000;++i){
        for (int j=2*i;j<=1000000;j+=i){
            IsPrime[j] = 0;
        }
    }
}

int main()
{
    Ciur();
    int n;
    fin >> n;
    int Suma = 0;
    for (int i=2;i<=n;++i){
        if(IsPrime[i]==1){
            Suma += i;
        }
    }
    fout << Suma;
    return 0;
}