Cod sursa(job #250207)

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

void ciur(long n)
	{
   c[2]=1;
   for (i=3;i<=n;i+=2)
   	c[i]=1;
   for (i=3;i<=sqrt(n);i+=2)
   	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);
for (i=2;i<=n;i++)
	if (c[i]==1)
   	s++;
printf("%ld", s);
fcloseall();
return 0;
}