Cod sursa(job #1840964)

Utilizator radu.bRadu Brumariu radu.b Data 5 ianuarie 2017 00:09:34
Problema Ciurul lui Eratosthenes Scor 0
Compilator c Status done
Runda Arhiva educationala Marime 0.52 kb
#include<stdio.h>
#include<stdbool.h>

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

    int N;
    int primes = 0;
    int res = scanf("%d", &N);
    bool numbers[N];
    for(int i = 2; i <= N; i++){
        numbers[i] = true;
    }

    for(int i = 2; i <= N; i++) {
        if(numbers[i]) {
            ++primes;
            for(int j = i+i; j < N; j = j+i) {
                numbers[j] = false;
            }
        }
    }

    printf("%d\n", primes);
    return 0;
}