Cod sursa(job #1494769)

Utilizator Burbon13Burbon13 Burbon13 Data 1 octombrie 2015 21:00:59
Problema Ciurul lui Eratosthenes Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.42 kb
#include <cstdio>
#define nmx 2000002
using namespace std;

bool viz[nmx];

int main() {
    freopen("ciur.in", "r", stdin);
    freopen("ciur.out", "w", stdout);

    int nr,sum = 0;
    scanf("%d", &nr);

    for(int i = 2; i <= nr; ++i)
        if(not viz[i]) {
            ++sum;
            for(int j = 2*i; j <= nr; j += i)
                viz[j] = 1;
        }

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

    return 0;
}