Cod sursa(job #1840943)

Utilizator radu.bRadu Brumariu radu.b Data 4 ianuarie 2017 23:45:51
Problema Ciurul lui Eratosthenes Scor 0
Compilator c Status done
Runda Arhiva educationala Marime 0.46 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 = 0; i<N;i++){
        numbers[i] = true;
    }

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

    printf("%d", primes);
}