【正文】 p){Polyn q1,q2。//項(xiàng)數(shù)計(jì)數(shù)器if(!q)//若多項(xiàng)式為空，輸出0{putchar(39。+39。else if(qexpn)printf(“X^%d”,qexpn)。}if(qcoef==1){if(!qexpn)printf(“1”)。b){if(!b||aexpnbexpn)return 1。Polyn qb=pbnext。qa=qanext。qcexpn=qbexpn。} //求解并建立多項(xiàng)式ab，返回其頭指針 Polyn Subtract(Polyn pa,Polyn pb){Polyn h=pb。p=pnext)//恢復(fù)pb的系數(shù)pcoef*=1。qa。}//求解并建立多項(xiàng)式a/b，返回其頭指針 void Device(Polyn pa,Polyn pb){Polyn hf,pf,temp1,temp2。temp1next=NULL。temp2nextexpn=(qaexpn)(qbexpn)。Print(hf)。scanf(“%d”,amp。printf(“n”)。printf(”tt “)。Print(pa)。Destroy(pc)。printf(“多項(xiàng)式A(x)*B(x):”)。} }Destroy(pa)。typedef char * * HCode。fclose(fp)。w)。for(k=n+1。w1=HT[j].Weight。HT[p2].Parent=k。39。fp!=0。printf(“%c%sn”,HT[k].ch,HC[k])。ifread(amp。for(k=1。char a[10]。while(a[j]!=39。//回到根結(jié)點(diǎn)}j++。HTNode HT[N]。scanf(“%d”,amp。break。Coding_H(n,HT)。case 7:system(“cls”)。char English[20]。printf(“ |%6s”,)。//輸出學(xué)生信息和成績(jī)信息pNodeScore=pNodeScorenext。scanf(“%s”,pNodeScore)。headScore=pNodeScore。} int Delete(){ p_node_score pNodeScore,p1。pNodeScore=p1。pNodeScore=pNodeScorenext。scanf(“%s”,EditNumber)。printf(“高數(shù)新成績(jī):”)。if(pNodeScore==NULL){printf(“成績(jī)表中沒(méi)有數(shù)據(jù)！請(qǐng)先添加數(shù)據(jù)！n”)。return 0。printf(“nttt 學(xué)生成績(jī)管理系統(tǒng) ttt”)。Input()。case 4:system(“cls”)。break。(包括基本操作和其他算法的時(shí)間復(fù)雜度和空間復(fù)雜度的分析)和 改進(jìn)設(shè)想。二．基本功能1)圖書(shū)管理(增加圖書(shū)、查詢圖書(shū)、刪除圖書(shū)、圖書(shū)借閱、還書(shū))； 2)會(huì)員管理(增加會(huì)員、查詢會(huì)員、刪除會(huì)員、借書(shū)信息)； 3)系統(tǒng)管理（初始化、載入數(shù)據(jù)、保存數(shù)據(jù)、退出程序）；三．程序設(shè)計(jì)include include includedefine NULL 0typedef struct BookInfo{ /////圖書(shū)結(jié)構(gòu)int b_Code。////會(huì)員名字int l_Codes[6]。System* InitSystem()。////刪除會(huì)員MemberInfo* SearchMember(System*,int)。amp。case 4:BrrowBook(S)。case 8:SearchMember(S,1)。}System* InitSystem(){System* S=(System*)malloc(sizeof(System))。}void AddBook(System* S){ int Tempcode。mb_Total+=num。SBookTotal++。}BookInfo* SearchBook(System* S,int code){BookInfo* bi=SBInextbook。}void DelBook(System* S){BookInfo* bi。memi=SMInextmember。il_Codes[0]。}coutcinsel。BookInfo* p。mp=SearchMember(S,memcode)。){coutreturn。char sel。}while(il_Codes[0]){mpl_Codes[i]=mpl_Codes[i+1]。){coutreturn。tm_Code=Tempcode。n39。if(code==1){coutcinmembercode。}void DelMember(System* S){MemberInfo* bi。coutcintempcode。i++){if(!(book=SearchBook(S,bil_Codes[i]))){cout}else{bookb_Out。){coutreturn。bi=binextbook。if(!(fp=fopen(“BookSys”,“rb”))){coutexit(0)。fread(tempbi,sizeof(BookInfo),1,fp)。for(i=1。}void ExitSystem(){char select。n39。通過(guò)進(jìn)行圖書(shū)借閱管理系統(tǒng)的設(shè)計(jì)，進(jìn)一步明確了研制一個(gè)管理信息系統(tǒng)的方法和思路，將系統(tǒng)開(kāi)發(fā)的各階段的基本活動(dòng)貫穿起來(lái)，使我更加形象、具體的了解了管理信息系統(tǒng)。那時(shí)，我終于可以上上的舒一口氣了。在做系統(tǒng)的過(guò)程中，我遇到的最大的困難是調(diào)程序方面的。}四．心得體會(huì)歷經(jīng)大半個(gè)學(xué)期的努力，我的圖書(shū)管理系統(tǒng)終于如期完成了。||select==39。minextmember=tempmi。MemberInfo* mi=SMI。(SBookTotal),sizeof(int),1,fp)。while(mi){fwrite(mi,sizeof(MemberInfo),1,fp)。if(!(fp=fopen(“BookSys”,“wb”))){coutexit(0)。if(sel==39。}if(!bi)coutelse{plnextmember=binextmember。int i。bim_Code!=membercode)bi=binextmember。}}while(1)。pnextmember=t。MemberInfo* p=SMI。if(sel==39。if(!(mp=SearchMember(S,membercode)))coutelse{pb_Out。MemberInfo* mp。if(sel==39。int tempcode。n39。i++)memil_Codes[i]=memil_Codes[i+1]。bi=binextbook。int tempcode。while(biamp。||sel==39。coutcintb_Total。BookInfo* m。SMI=(MemberInfo*)malloc(sizeof(MemberInfo))。case 10:StoreData(S)。case 6:AddMember(S)。case 2:SearchBook(S,1)。void main(){ System* S=InitSystem()。/////刪除圖書(shū)void BrrowBook(System*)。MemberInfo* MI。///借出數(shù) BookInfo* nextbook。（3）圖書(shū)查詢讀者按照?qǐng)D書(shū)編號(hào)查詢圖書(shū)基本信息，并可以得知現(xiàn)還有幾冊(cè)可以借閱。return 0。Delete()。break。printf(“nnttt請(qǐng)選擇:”)。headScore=NULL。scanf(“%s”,FindNumber)。}pNodeScore=pNodeScorenext。printf(“語(yǔ)文新成績(jī):”)。if(pNodeScore==NULL){printf(“成績(jī)表中沒(méi)有數(shù)據(jù)！請(qǐng)先添加數(shù)據(jù)！n”)。while(pNodeScore!=NULL){if(strcmp(pNodeScore,DeleteNumber)==0){p1next=pNodeScorenext。} char DeleteNumber[20]。n)。scanf(“%s”,pNodeScore)。scanf(“%s”,pNodeScore)。} void View()//輸出函數(shù) {p_node_score pNodeScore。struct node_score *next。}運(yùn)行界面如下：（鏈表實(shí)現(xiàn)）要求：實(shí)現(xiàn)如下功能：增加、查找、刪除、輸出、退出。break。case 3:system(“cls”)。scanf(“%d”,amp。printf(“nntt*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=ntt”)。a[j]!=39。)i=HT[i].Lchild。printf(“輸入發(fā)送的編碼，以‘2’結(jié)束:”)。printf(“%d”,HT[k].Lchild)。fclose(fp)。FILE * fp。139。k{sp=n1。HCode HC。}}} HT[k].Lchild=p1。w2=32767。HT[k].Weight=w。char c。return。代碼如下：include include include include define N 200typedef struct HTNode//結(jié)構(gòu)體 { int Weight。case 5:Device(pa,pb)。Print(pd)。break。while(choose){printf(”執(zhí)行操作:“)。printf(“*多項(xiàng)式操作菜單printf(”**********************************************n“)。//建立多項(xiàng)式A printf(“n”)。int m,n,flag=0。temp2next=NULL。while(qa!=NULLamp。//建立頭結(jié)點(diǎn),存儲(chǔ)商hfnext=NULL。pfcoef=qacoef*qbcoef。Polyn qb=pbnext。p=pnext。hcnext=qc。qa=qanext。headc=hc。amp。flag++。else if(qexpn==1)putchar(39。qcoef!=1)//系數(shù)非1或1的普通情況{printf(“%g”,qcoef)。return。q1=q2。pcoef,amp。}//指數(shù)為新時(shí)將結(jié)點(diǎn)插入} 7} //建立一個(gè)頭指針為head、項(xiàng)數(shù)為m的一元多項(xiàng)式 Polyn Create(Polyn head,int m){int i。}if(q2amp。//Polyn為結(jié)點(diǎn)指針類型 void Insert(Polyn p,Polyn h){if(pcoef==0)free(p)。最后是，前期分析不足開(kāi)始急于寫(xiě)