Cod sursa(job #1496126)

Utilizator HealeruDaniel Guramulta Healeru Data 4 octombrie 2015 14:08:15
Problema Ciurul lui Eratosthenes Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.51 kb
#include<fstream>
#include<iostream>
#include<vector>

using namespace std;
const int MAX = 2000002;
vector<bool> V(MAX,true);
int N , K;

void ciur(){
    for(int i = 2; i < N; ++i)
       if (V[i]){
                V[i] = false;
                ++K;
          for (int j = 2; j * i < N; ++j)
            V[i * j] = false;
    }
}

int main(){
   ifstream fin("ciur.in");
   ofstream fout("ciur.out");
   fin >> N;
   ciur();
   fout << K;
   fin.close();
   fout.close();
   return 0;
}