Cod sursa(job #1840963)

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

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

    int N;
    int primes = 0;
    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;
}