Cod sursa(job #2693949)

Utilizator raulukovCovrig Raul raulukov Data 7 ianuarie 2021 17:50:47
Problema Ciurul lui Eratosthenes Scor 20
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.59 kb
#include <fstream>
#include <iostream>

using namespace std;

bool prim[2000001];
unsigned int n, d, m, prime,i;
ifstream fin("ciur.in");
ofstream fout("ciur.out");

int main()
{
    fin >> n;
    for (d = 2; d <= n; d++)
        prim[d] = true;
    for (d = 2; d <= n; d++)
        if (prim[d]) {
            prime++;
            for(i=1;i<=n;i++)
                if(i % d == 0) {
                    prim[i] = false;
                }
        }
    fout << prime;
    return 0;
}
/*
2 3 4 5 6 7 8 9 0 1 2
t   .   .   .   .   .
  t     .     .     .
                .
*/