Cod sursa(job #761892)

Utilizator ioana26Ioana Andronescu ioana26 Data 27 iunie 2012 19:55:08
Problema Ciurul lui Eratosthenes Scor 10
Compilator c Status done
Runda Arhiva educationala Marime 0.57 kb
#include <stdio.h>

int ciur_eratostene (int numar) {
    int prime = 1;
    int prim[numar];
    int i, j;

    for (i = 2; i <= numar; i++) {
        if (prim[i]) {
            prime++;
            j = 2 * i;
            while (j <= numar) {
                prim[j] = 0;
                j += i;
            }
        }
    }  
    return prime;
}

int main () {
	int numar;

    FILE *f_in = fopen("ciur.in", "r");
    FILE *f_out = fopen("ciur.out", "w");

    fscanf(f_in, "%d", &numar);
    int prime = ciur_eratostene(numar);
    fprintf(f_out, "%d\n", prime);
    
    return 0;
}