int a[300],bb[300],cnt=0;
jsValue()
{

}

main()
{
int i;
readDat();
jsValue();
wrteDat();
for (i=0;i<cnt;i++) printf("b[%d]=%d\n",i,bb[i]);
}

readDat()
{
FILE *fp;
int i;
fp=fopen("in.dat","r");
printf("cnt=%d\n",cnt);
for (i=0;i<300;i++) fscanf(fp, "%d,",&a[i]);
fclose(fp);
}

wrteDat()
{
FILE *fp;
int i;
fp=fopen("out.dat","w");
fprintf(fp, "%d\n",cnt);
for (i=0;i<cnt;i++) fprintf(fp, "%d\n",bb[i]);
fclose(fp);
}

/* 注：对bb的排序本题采用了冒泡法。*/
jsValue()
{
int q,b,s,g,i,j;
for(i=0;i<300;i++)
{q=a[i]/1000;
b=a[i]/100%10;
s=a[i]/10%10;
g=a[i]%10;
if(q-b-s-g>0)
bb[cnt++]=a[i];
}
for(i=0;i<cnt-1;i++)
for(j=i+1;j<cnt;j++)
if(bb[i]>bb[j])
{q=bb[i];
bb[i]=bb[j];
bb[j]=q;
}
}

返回南开百题目录