《精通C程序设计教程》第十十一章部分习题答案.docVIP

《精通C程序设计教程》第十、十一章部分习题答案 第十章 10.2 read=0, green=1, yellow=5, white=6, black=7 10.6 42, 1 10.8 #include stdio.h typedef struct student { long xh;char xm[21];int s1,s2,s3; } STU; #define N 5 void inp_stu(STU a[N]) { int i; printf(Input %d students data\n,N); printf(xh xm s1 s2 s3\n); for(i=0;iN;i++) scanf(%ld%s%d%d%d,a[i].xh,a[i].xm,a[i].s1,a[i].s2,a[i].s3); } void out_stu(STU a[N],int p[N]) { int i; for(i=0;iN;i++) printf(%ld %s %d %d %d\n, \ a[p[i]].xh,a[p[i]].xm,a[p[i]].s1,a[p[i]].s2,a[p[i]].s3); } #define SUM(a,i) (a[i].s1+a[i].s2+a[i].s3) void Sort(STU a[N],int p[N]) /* 索引冒泡排序 */ { int i,j,t; for(i=0;iN;i++) p[i]=i; for(i=1;iN;i++) for(j=0;jN-i;j++) if(SUM(a,p[j])SUM(a,p[j+1])) { t=p[j];p[j]=p[j+1];p[j+1]=t; } } void main() { STU a[N];int p[N]; inp_stu(a); Sort(a,p); out_stu(a,p); } 10.10 #include stdio.h #include math.h typedef struct { int y,m,d; } DATE; long days(DATE *p) { long m,n=(p-y-1)*365+(p-y-1)/4-(p-y-1)/100+(p-y-1)/400; for(m=1;mp-m-1;m++) switch(m) { case 4:case 6:case 9:case 11:n+=30;break; case 2:n+=28+(p-y%4==0p-y%100!=0||p-y%400==0);break; default:n+=31; } return n; } void main() { DATE a1,a2;long n; while(1) { printf(Input date 1(y m d):);scanf(%d%d%d,a1.y,a1.m,a1.d); if(a1.y=0) break; printf(Input date 2(y m d):);scanf(%d%d%d,a2.y,a2.m,a2.d); n=labs(days(a1)-days(a2)); printf(The difference days=%ld\n,n); } } 10.11 #include stdio.h #include conio.h typedef struct { int h,m,s; } TIME; void inc_time(TIME *p) { int cy=1; p-s+=cy; cy=p-s/60;p-s%=60; p-m+=cy; cy=p-m/60;p-m%=60; p-h+=cy; } void dec_time(TIME *p) { int cy=1; p-s-=cy; cy=p-s0;p-s=(p-s%60+60)%60; p-m-=cy; cy=p-m0;p-m=(p-m%60+60)%60; p-h-=cy; } void main() { char ch;TIME t; printf(Input a time(h m s):);scanf(%d%d%d,t.h,t.m,t.s); while(1) { ch=getche(); if(ch==+) inc_time(t); if(ch==-) dec_time(t); if(ch==Q||ch==q) break; printf(\r%d:%d:%d\n,t.h,t.m,t.s); } } 10.14 #include stdio.h /