Cod sursa(job #2543005)

Utilizator tudorcioc5Cioc Tudor tudorcioc5 Data 10 februarie 2020 19:33:45
Problema Ciurul lui Eratosthenes Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.45 kb
#include <fstream>
#include <vector>
using namespace std;

ifstream fin;
ofstream fout;

vector <bool> prime (2000002 , 1);
int n, i, m, suma;


int main (void){
    fin.open("ciur.in");
    fin>>n;
    fin.close();

    for (i=2; i<=(n/2); i++)
        if (prime[i]){
            for (int j=i+i; j<=(n/2); j+=i)
                prime[j] = false;

            suma++;
        }

    fout.open("ciur.out");
    fout<<suma<<"\n";
    fout.close();

    return 0;
}