Cod sursa(job #2428098)

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