Cod sursa(job #247144)

Utilizator zlatebogdanZlate Bogdan zlatebogdan Data 22 ianuarie 2009 10:50:46
Problema Ciurul lui Eratosthenes Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.33 kb
#include<stdio.h>
#define N 2000005
int a[N],nr;
void rezolvare()
{
	int i,j,n;
	scanf("%d",&n);
	for (i=2;i<=n;++i)
		for (j=i+i;j<=n;j+=i)
			a[j]=1;
	for(i=2;i<=n;++i)
		if (a[i]==0)
			++nr;
	printf("%d",nr);
}
int main()
{
	freopen("ciur.in","r",stdin);
	freopen("ciur.out","w",stdout);
	rezolvare();
	return 0;
}