Cod sursa(job #1810855)

Utilizator AlleeexCristina.Gn Alleeex Data 20 noiembrie 2016 17:10:43
Problema Ciurul lui Eratosthenes Scor 100
Compilator c Status done
Runda Arhiva educationala Marime 0.46 kb

#include <stdio.h>

int N, count;
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])
        {
            ++count;
            for (j = i+i; j <= N; j += i)
                prim[j] = 0;
        }

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

    return 0;
}