Cod sursa(job #250205)

Utilizator shnakoVlad Schnakovszki shnako Data 30 ianuarie 2009 12:50:24
Problema Ciurul lui Eratosthenes Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.43 kb
#include <stdio.h>
#include <math.h>
#define dim 2000001
long i, j, n;
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++)
   	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)
   	printf("%ld ", i);
fcloseall();
return 0;
}