数据结构上机答案.docVIP

第一章 16 void Descend(int x, int y, int z) { int t; if(xy) {t=x;x=y;y=t;} if(xz) {t=x;x=z;z=t;} if(yz) {t=y;y=z;z=t;} } 17 Status Fibonacci(int k, int m, int f) /* 求k阶斐波那契序列的第m项的值f */ { int i,j,sum,temp[20]; if(k2||m0) return ERROR; if(mk-1) f=0; else if(m==k-1) f=1; else {for(i=0;i=k-2;i++) temp[i]=0; temp[k-1]=1; for(i=k;i=m;i++) {sum=0; for(j=i-k;ji;j++) sum+=temp[j]; temp[i]=sum; } f=temp[m]; } return OK; }// Fibonacci 18 void Scores(ResultType *result, ScoreType *score) /* 求各校的男、女总分和团体总分, 并依次存入数组score */ /* 假设比赛结果已经储存在result[ ]数组中, */ /* 并以特殊记录 {, male, , , 0 }（域scorce=0）*/ /* 表示结束 */ { int i=0; char s; while(result[i].sport!=NULL) { switch(result[i].schoolname) { case A: score[0].totalscore+=result[i].score; if(result[i].gender==male) score[0].malescore+=result[i].score; else score[0].femalescore+=result[i].score; break; case B: score[1].totalscore+=result[i].score; if(result[i].gender==male) score[1].malescore+=result[i].score; else score[1].femalescore+=result[i].score; break; case C: score[2].totalscore+=result[i].score; if(result[i].gender==male) score[2].malescore+=result[i].score; else score[2].femalescore+=result[i].score; break; case D: score[3].totalscore+=result[i].score; if(result[i].gender==male) score[3].malescore+=result[i].score; else score[3].femalescore+=result[i].score; break; case E: score[4].totalscore+=result[i].score; if(result[i].gender==male) score[4].malescore+=result[i].score; else score[4].femalescore+=result[i].score; break; } i++; } for(s=A;s=E;s++) { printf(School %c:\n,s); printf(Total score of male:%d\n,score[i].malescore);