Cod sursa(job #1803948)

Utilizator AkrielAkriel Akriel Data 12 noiembrie 2016 01:20:07
Problema Ciurul lui Eratosthenes Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.61 kb
#include <iostream>
#include <fstream>
#include <vector>

#define N 2000005

using namespace std;

ifstream f ("ciur.in");
ofstream g ("ciur.out");

vector <bool> prim(N, true);

int number;

int ciurEratosthenes()
{
    int counter = 0;
    for ( int index = 2 ; index <= number ; index++ )
    {
        if ( prim[index] == true )
        {
            counter ++;
            for ( int multiples = index; multiples <= number; multiples += index )
                prim[multiples] = false;
        }
    }
    return counter;
}

int main()
{
    f >> number;
    g << ciurEratosthenes();
}