Pagini recente » Cod sursa (job #1156515) | Cod sursa (job #1448065) | Cod sursa (job #1403916) | Cod sursa (job #1580785) | Cod sursa (job #149683)
Cod sursa(job #149683)
#include <stdio.h>
#include <math.h>
int main()
{FILE *f;
int n,i,j,nr=1,k;
char a[2000000];
f=fopen("ciur.in","r");
fscanf(f,"%d",&n);
fclose(f);
for (i=2;i<=n;i++)
if (i%2) a[i]=1;
else a[i]=0;
j=3;
while (j<=sqrt(n))
{ if (a[j]) {for (i=2;i<=n/j;i++) a[i*j]=0;
nr++;
}
j=j+2;
}
for (i=sqrt(n)+1;i<=n;i++)
if (a[i]) nr++;
f=fopen("ciur.out","w");
if (n<=1000) {fprintf(f,"%d\n",nr);
fprintf(f,"2 ");
for (i=3;i<=n;i++)
if (a[i]) fprintf(f,"%d ",i);
}
else {fprintf(f,"%d\n",nr);
i=n;k=0;
while (nr-k>1000)
{if (a[i]) {fprintf(f,"%d ",i);
k++;
}
i--;
}
}
/*f=fopen("ciur.out","w");
k=0;
for (i=n;i>=3;i--)
if (a[i]) */
fclose(f);
return 0;
}