Cod sursa(job #1786474)

Utilizator GrecuDianaSorinaGrecu Diana-Sorina GrecuDianaSorina Data 22 octombrie 2016 23:59:58
Problema Ciurul lui Eratosthenes Scor 30
Compilator c Status done
Runda Arhiva educationala Marime 0.44 kb
#include <stdio.h>

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

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

	for (i = 1; 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;
}