Cod sursa(job #2428092)

Utilizator qfl1ck32Andrei qfl1ck32 Data 3 iunie 2019 19:30:51
Problema Ciurul lui Eratosthenes Scor 30
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.59 kb
#include <iostream>
#include <math.h>
#include <fstream>
#define DIMMAX 2000000
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
long int nrprime[DIMMAX];
int main()
{
    int i, j, nr = 0, N;
    fin>>N;
    for (i = 1; i <= N; i++)
        nrprime[i] = 1;
    for (i = 2; i < sqrt(N); i++)
    {
        if (nrprime[i] == 1)
            for (j = 2 * i; j <= N; j += i)
                nrprime[j] = 0;
    }
    for (i = 2; i <= N; i++)
        if (nrprime[i] == 1)
            nr++;
    fout<<nr;
    fin.close();
    fout.close();
    return 0;
}