Cod sursa(job #250199)

Utilizator shnakoVlad Schnakovszki shnako Data 30 ianuarie 2009 12:47:53
Problema Ciurul lui Eratosthenes Scor 50
Compilator cpp Status done
Runda Arhiva educationala Marime 0.44 kb
#include <stdio.h>
#include <math.h>
#define dim 2000001
long i, j, n, s;
bool c[dim];

void ciur(long n)
	{
   for (i=2;i<=n;i++)
   	c[i]=1;
   for (i=2;i<=sqrt(n);i++)
   	for (j=i;j<=n/i;j++)
      	c[i*j]=0;
   }
int main(void)
{
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
scanf("%ld", &n);
ciur(n);
s=0;
for (i=2;i<=n;i++)
	if (c[i]==1)
   	s++;
printf("%ld", s);
fcloseall();
return 0;
}