Cod sursa(job #2175205)

Utilizator gabiluciuLuciu Gabriel gabiluciu Data 16 martie 2018 15:55:41
Problema Ciurul lui Eratosthenes Scor 30
Compilator cpp Status done
Runda Arhiva educationala Marime 0.43 kb
#include <cstdio>
int n, nr;
char prim[2000005];
int main()
{
    freopen("ciur.in", "r", stdin);
    freopen("ciur.out", "w", stdout);
    scanf("%d", &n);
    for (int i = 2; i <= n; ++i)
        prim[i] = 1;

    for (int i = 2; i <= n; ++i)
        if (prim[i])
        {
            ++nr;
            for (int j = i*i; j <= n; j += i)
                prim[j] = 0;
        }

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

    return 0;
}