Cod sursa(job #1277149)

Utilizator tudorcomanTudor Coman tudorcoman Data 27 noiembrie 2014 11:03:20
Problema Ciurul lui Eratosthenes Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.44 kb
#include <cstdio>

int n, nr;
char prim[2000005];

int main(void)
{
    int i, j;

    freopen("ciur.in", "r", stdin);
    freopen("ciur.out", "w", stdout);
    scanf("%d", &n);
    for (i = 2; i <= n; ++i)
        prim[i] = 1;
    for (i = 2; i <= n; ++i)
        if (prim[i])
        {
            ++nr;
            for (j = i+i; j <= n; j += i)
                prim[j] = 0;
        }

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

    return 0;
}