Cod sursa(job #1786475)

Utilizator GrecuDianaSorinaGrecu Diana-Sorina GrecuDianaSorina Data 23 octombrie 2016 00:08:02
Problema Ciurul lui Eratosthenes Scor 30
Compilator c Status done
Runda Arhiva educationala Marime 0.48 kb
#include <stdio.h>
typedef enum { false, true } bool;

int main () {
	int n, k, i, j;
	bool c[2000001];

	FILE *inp, *outp;
	inp = fopen("ciur.in", "r");
	fscanf(inp,"%d", &n);
	fclose(inp);

	for (i = 2; i <= n; i ++) {
		c[i] = 1;
	}
	for( i = 2; i <= n; i ++) {
		if (c[i] == 1) {
			for (j = 2; j * i <= n; j ++) {
				c[i * j] = 0;
			}
		}
	}
	for (i = 2; i <= n; i ++) {
		if (c[i] == 1) k++;
	}

	outp = fopen("ciur.out", "w");
	fprintf(outp, "%d", k);
	fclose(outp);

	return 0;
}