Cod sursa(job #2077636)

Utilizator AlexPop28Pop Alex-Nicolae AlexPop28 Data 28 noiembrie 2017 12:57:30
Problema Ciurul lui Eratosthenes Scor 30
Compilator cpp Status done
Runda Arhiva educationala Marime 0.43 kb
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
const int  N = 2e6;
int nr;
int n, v[N];
int main()
{
    fin >> n;
    for(int i=2; i<=n; i++)
        if(v[i]==0)
            for(int j=i+i; j<=n; j+=i)
                v[j] = 1;
    for(int i=2; i<=n; i++)
        if(v[i]==0)
            nr++;
    fout << nr;
    fin.close();
    fout.close();
}