Cod sursa(job #2303629)

Utilizator Salamandra01Felmeri Zsolt Salamandra01 Data 16 decembrie 2018 17:31:01
Problema Ciurul lui Eratosthenes Scor 30
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.52 kb
#include <iostream>
#include <fstream>

#define N 2000001

using namespace std;
bool L[N];

int main()
{
    freopen("ciur.in", "r", stdin);
    freopen("ciur.out", "w", stdout);
    int n, db = 0;
    scanf("%d", &n);

    for(int i = 2; i < n; ++i){
        L[i] = true;
    }

    for(int i = 2; i < n; ++i){
        if(L[i]){
            db++;
            for(int j = i*i; j < n; j = j + i){
                L[j] = false;
            }
        }
    }

    printf("%d\n", db);

    return 0;
}