Pagini recente » Cod sursa (job #58473) | Cod sursa (job #591833) | Cod sursa (job #2647965) | Cod sursa (job #2825315) | Cod sursa (job #149055)
Cod sursa(job #149055)
#include <stdio.h>
long n,i,j,m,w=1;
char prim[2000030];
int main()
{
FILE *f=fopen("ciur.in","r");
fscanf(f,"%d",&n);
fclose(f);
for (i=2;i<=n;i++)
prim[i]=1;
for (i=2;i<=n;i++)
if (prim[i]==1)
{
m++;
for (j=2*i;j<=n;j=j+i)
prim[j]=0;
}
FILE *g=fopen("ciur.out","w");
fprintf(g,"%d",m);
fclose(g);
if (n>1002)
{while (w<=1000)
i=n;
if (prim[i]==1)
//g<<i<<" ";
fprintf(g,"%d ",i);
i--;w++;}
else {for (i=2;i<=n;i++)
if (prim[i]==1)
//g<<i<<" ";
fprintf(g,"%d ",i);
}
fclose(g);
return 0;
}