Pagini recente » Cod sursa (job #2521669) | Cod sursa (job #2850960) | Cod sursa (job #1310421) | Cod sursa (job #1564511) | Cod sursa (job #147341)
Cod sursa(job #147341)
#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[20000]={0};
k=1;
for(i=3; i<=n; i=i+2)
if (v[i]==0){
k++;
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;
}