Cod sursa(job #801247)

Utilizator vlad060297Benchea Vlad vlad060297 Data 23 octombrie 2012 19:54:54
Problema Ciurul lui Eratosthenes Scor 0
Compilator c Status done
Runda Arhiva educationala Marime 0.35 kb
#include <stdio.h>
const int NMax = 10000;
int main(void)
{
	int N,i,j,nr=0,ciur[NMax];
	freopen("ciur.in", "r", stdin);
	freopen("ciur.out", "w", stdout);
	scanf("%d", &N);
	for(i=2;i<=N;i++)
		ciur[i]=1;
	for(i=2;i*i<N;i++)
		if(ciur[i])
			for(j=2;j*i<=N;j++)
				ciur[i*j]=0;
	for(i=2;i<=N;i++)
		if(ciur[i])
			nr++;
	printf("%d",nr);
}