Cod sursa(job #2514401)

Utilizator Ovidiu-AntonioOvidiu-Antonio Matei Ovidiu-Antonio Data 25 decembrie 2019 17:22:01
Problema Ciurul lui Eratosthenes Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.49 kb
#include <iostream>
#include <fstream>
#include <cmath>

using namespace std;

int main()
{
    ifstream fin("ciur.in");
    ofstream fout("ciur.out");
    long long int N, v[200000], i, j, nr;
    fin>>N;
    for(i=0;i<=N;i++)
        v[i]=1;
    nr=0;
    v[0]=0;
    v[1]=0;
    for(i=2;i<=sqrt(N);i++)
        if(v[i]==1)
            {
                nr++;
                for(j=2;j<=(N/i);j++)
                    v[j*i]=0;
            }
    fout<<nr;
    return 0;
}