Cod sursa(job #148166)

Utilizator a7893Nae Mihai a7893 Data 3 martie 2008 22:47:55
Problema Ciurul lui Eratosthenes Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.51 kb
#include<stdio.h>
#define N 2000001
int n,p[N],nr;
void ciur(int n)
{
	int i,j;
	for(i=2;i<=n;i++)
		for(j=i+i;j<=n;j+=i)
			p[j]=1;
}
int main()
{
	freopen("ciur.in","r",stdin);
	freopen("ciur.out","w",stdout);
	int i;
	scanf("%d",&n);
	p[1]=1;
	ciur(n);
	for(i=1;i<=n;i++)
		if(!p[i])
			++nr;
	printf("%d\n",nr);
	if(nr>1000)
	{
		for(i=1001;i<=n;i++)
			if(!p[i])
				printf("%d ",i);
	}
	else
	{
		for(i=1;i<=n;i++)
			if(!p[i])
				printf("%d ",i);
	}
	printf("\n");
	return 0;
}