Cod sursa(job #641172)

Utilizator alexandrapAlexandra Podiuc alexandrap Data 27 noiembrie 2011 15:01:46
Problema Ciurul lui Eratosthenes Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.58 kb
#include<stdio.h>
#include<unistd.h>
#include<math.h>

int is_prime(int n){
	int i, c = 0;
	for(i = 2; i <= sqrt(n); i++){
		if(n%i == 0)
			c++;
	}
	if(c == 0)
		return 1;
	return 0;
}

int easy_sol(int N){
	int i, c = 0;
	for (i = 2; i < N ; i++){
		if (is_prime(i))
			c++;
	}
	return c;
}

int main(){
	int N, M;
	FILE* fin = fopen("ciur.in","r");
	FILE* fout = fopen("ciur.out", "w");
    fscanf(fin, "%d", &N);
	//printf("N = %d\n ", N);
	M = easy_sol(N);
	//printf("M = %d\n", M);
	fprintf(fout,"%d", M);
	fclose(fin);
	fclose(fout);
	return 1;
}