Cod sursa(job #561379)

Utilizator devill_08Buli.vlad devill_08 Data 19 martie 2011 23:45:33
Problema Ciurul lui Eratosthenes Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.33 kb
Raporteaza aceasta sursa 
#include <cstdio>

long n,i,nr,j;
char prim[2000000];

int main ()
{
	freopen("ciur.in","r",stdin);
	freopen("ciur.out","w",stdout);
	scanf("%ld", &n);
	prim[2]=1;
	for(i=3;i<=n;i+=2) prim[i]=1;
	for(i=2;i<=n/2;++i)
		if(prim[i])
		{
			++nr;
			for(j=i+i;j<=n;j+=i) prim[j]=0;
		}
	printf("%ld", nr);
	return 0;
}