Cod sursa(job #147343)

Utilizator andyciupCiupan Andrei andyciup Data 2 martie 2008 20:18:47
Problema Ciurul lui Eratosthenes Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.42 kb
#include<stdio.h>
int main(){
	freopen("ciur.in", "r", stdin);   
    freopen("ciur.out", "w", stdout);
	int n;
	scanf("%d" ,&n);
	int i,j,k, prime[1000], v[200000]={0};
	k=1;
	for(i=3; i<=n; i=i+2)
		if (v[i]==0){
			k++;
			if(k<1000)
				prime[k]=i;
			for (j=2*i; j<=n; j=j+i)
			v[j]=1;}
	
	printf("%d\n", k);
	prime[1]=2;
	for (i=1; i<=k; i++)
		printf("%d ", prime[i]);
	
		
	
	
	
	return 0;
}