Cod sursa(job #144775)

Utilizator mithyPopovici Adrian mithy Data 27 februarie 2008 22:36:35
Problema Ciurul lui Eratosthenes Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.5 kb
#include <stdio.h>
#include <vector>
#define NMax 2000005

long n, lg;
char ciur[NMax];
long prime[1024];

int main()
{
	long i, j, nr;

	freopen( "ciur.in", "rt", stdin );
	freopen( "ciur.out", "wt", stdout );

	scanf( "%ld", &n );

	for (i=2; i<=n; i++)
	{
		if ( !ciur[i] )
		{
			for (j=i; j<=n; j+=i)
				if ( j % i == 0 )
					ciur[j] = 1;
			prime[lg++] = i;
		}
	}
	
	printf( "%ld\n", lg );
	for (i=0; i<lg; i++)
		printf( "%ld ", prime[i] );
	printf( "\n" );

	return 0;
}