學(xué)生成績管理系統(tǒng)(數(shù)據(jù)結(jié)構(gòu)C語言版源代碼)

勇者，必以決斗之勇氣與五張?jiān)嚲硪粵Q雌雄；懦夫，概以鼠目之寸光量人生此戰(zhàn)必輸無疑！#include<stdio.h>#include<string.h>#include<stdlib.h>structstudents{ charSex[3];/*字符型學(xué)生性別*/ doubleEnglish;/*雙精度實(shí)型英語成績*/ doubleJava;/*雙精度實(shí)型Java成績*/ doubleSjjg;/*雙精度實(shí)數(shù)據(jù)結(jié)構(gòu)*/ doubleSzdl;/*雙精度實(shí)型數(shù)字電路*/ doubleJsj;/*計(jì)算機(jī)組成原理*/ structstudents*next;/*用與構(gòu)建連表指向下一結(jié)點(diǎn)*/}; FILE*fp;/*定義全局變量fp*/voidRevisemenu();/*修改菜單*/voidSortmenu();/*排序菜單*/voidmenu();/*主菜單*/voidsecret();/*安全驗(yàn)證*/structstudents*Input();/*新建學(xué)生信息*/voidfprint(structstudents*head);/*將信息導(dǎo)入文件可追加*/voidfprint_(structstudents*head);/*將信息導(dǎo)入文件并覆蓋*/voidBrowse(structstudents*head);/*瀏覽全部學(xué)生信息*/structstudents*create(structstudents*headint*n);/*從tushu_list中讀取數(shù)據(jù)構(gòu)建鏈表*/voidSortEnglish(structstudents*head);/*按英語成績排序*/voidSortJava(structstudents*head);/*按Java成績排序*/voidSortSjjg(structstudents*head);/*按數(shù)據(jù)結(jié)構(gòu)成績排序*/voidSortSzdl(structstudents*head);/*按數(shù)字邏輯電路成績排序*/voidSortJsj(structstudents*head);/*按計(jì)算機(jī)組成原理成績排序*/structstudents*Delete(structstudents*headstructstudents*Revise();/*修改學(xué)生信息（按編號修改）*//*主菜單*/voidmenu(){ printf("\n\n"); printf("***************************************************\n"); printf("學(xué)生成績管理系統(tǒng)\n"); printf("1-添加新同學(xué)2-瀏覽學(xué)生信息\n"); printf("5-按成績排序6-修改學(xué)生信息\n"); printf("7-刪除學(xué)生信息0-退出系統(tǒng)\n"); printf("___________________________________________________\n");}/*排序菜單*/voidSortmenu(){ printf("\n\n"); printf("***************************************************\n"); printf("按成績排序\n"); printf("1-大學(xué)英語2-JAVA編程\n"); printf("3-數(shù)據(jù)結(jié)構(gòu)4-數(shù)字邏輯電路\n"); printf("5-計(jì)算機(jī)組成原理0-返回上級菜單\n"); printf("***************************************************\n");}/*修改菜單*/voidRevisemenu(){ printf("\n~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\n");printf("3--修改學(xué)生性別4--修改英語成績\n");printf("5--修改JAVA成績6--修改數(shù)據(jù)結(jié)構(gòu)\n");printf("7--修改數(shù)字電路8--修改計(jì)算計(jì)\n"); printf("0--返回上級菜單\n");printf("\n~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\n");}/*安全驗(yàn)證*/voidsecret(){ chara[20]; printf("**歡迎來到學(xué)生信息管理系統(tǒng)進(jìn)入系統(tǒng)前請先進(jìn)行密碼驗(yàn)證---"); printf(""); do{ gets(a);/*輸入密碼*/ system("cls");/*調(diào)用庫函數(shù)清屏*/ printf("對不起！您輸入的密碼有誤請重新輸入---"); }while(strcmp(a"0605")!=0);/*單一密碼"0605"*/ system("cls");}/*新建學(xué)生信息*/structstudents*Input(){ structstudents*p1*p2*head; /*建立輔助結(jié)點(diǎn)及頭結(jié)點(diǎn)*/ charName; intn=0x; printf("\n請按對應(yīng)項(xiàng)輸入學(xué)生信息以#結(jié)束：\n"); p1=(structstudents*)malloc(sizeof(structstudents)); head=p2=p1; do{/*使用dowhile語句輸入學(xué)生信息*/ scanf("%s"&p1->Name); if(strcmp(p1->Name"#")==0)break;/*判斷結(jié)束符*/ else scanf("%s%s%lf%lf%lf%lf%lf" p1->Nump1->Sex&p1->English&p1->Java&p1->Sjjg&p1->Szdl&p1->Jsj); Name='#'; p1=(structstudents*)malloc(sizeof(structstudents)); p2->next=p1; p2=p1; n++; }while(1); p1->next=NULL; printf("學(xué)生信息輸入結(jié)束！\n"); getchar(); printf("是否保存學(xué)生信息？（1.是/2.否）："); scanf("%d"&x); if(x==1) fprint(head);/*調(diào)用函數(shù)保存至文件*/ else printf("\n文件沒有被保存！\n"); returnhead;/*返回頭指針*/}/*將信息導(dǎo)入文件可追加*/voidfprint(structstudents*head){ structstudents*p1; if((fp=fopen("students_list.txt""a"))==NULL) { printf("Fileopenerror!\n"); exit(0); } for(p1=head;p1->next!=NULL;p1=p1->next)/*遍歷*/ fprintf(fp"%s\t%s\t%s\t%.1lf\t%.1lf\t%.1lf\t%.1lf\t%.1lf\n" p1->Namep1->Nump1->Sexp1->Englishp1->Javap1->Sjjgp1->Szdlp1->Jsj);/*將學(xué)生信息寫入文件*/ fclose(fp);/*關(guān)閉文件*/ printf("\n學(xué)生信息已成功保存到文件students_list.txt中！\n"); getchar();}/*將信息導(dǎo)入文件并覆蓋*/voidfprint_(structstudents*head){ structstudents*p1; if((fp=fopen("students_list.txt""w"))==NULL) { printf("Fileopenerror!\n"); exit(0); } for(p1=head;p1!=NULL;p1=p1->next)/*遍歷*/ fprintf(fp"%s\t%s\t%s\t%.1lf\t%.1lf\t%.1lf\t%.1lf\t%.1lf\n" p1->Namep1->Nump1->Sexp1->Englishp1->Javap1->Sjjgp1->Szdlp1->Jsj);/*將學(xué)生信息寫入文件*/ fclose(fp);/*關(guān)閉文件*/; getchar();}/*瀏覽全部學(xué)生信息*/voidBrowse(structstudents*head){ charSex[3];/*字符型學(xué)生性別*/ doubleEnglish;/*雙精度實(shí)型英語成績*/ doubleJava;/*雙精度實(shí)型Java成績*/ doubleSjjg;/*雙精度實(shí)數(shù)據(jù)結(jié)構(gòu)*/ doubleSzdl;/*雙精度實(shí)型數(shù)字電路*/ doubleJsj;/*計(jì)算機(jī)組成原理*/ if((fp=fopen("students_list.txt""a+"))==NULL) { printf("Fileopenerror!\n"); exit(0); } while(!feof(fp))/*讀取并輸出*/{ fscanf(fp"%s%s%s%lf%lf%lf%lf%lf"NameNumSex&English&Java&Sjjg&Szdl&Jsj); printf("%s\t%s\t%s\t%.1lf\t%.1lf\t%.1lf\t%.1lf\t%.1lf\n" NameNumSexEnglishJavaSjjgSzdlJsj); }; if(fclose(fp)) { printf("Cannotclosethefile!\n"); exit(0); }}/*從tushu_list中讀取數(shù)據(jù)構(gòu)建鏈表*/structstudents*create(structstudents*headint*n){ FILE*fp; structstudents*p*p1*p2; if((fp=fopen("students_list.txt""a+"))==NULL) { printf("Fileopenerror!\n"); exit(0); } while(!feof(fp)) { (*n)++;p=(structstudents*)malloc(sizeof(structstudents)); fscanf(fp"%s%s%s%lf%lf%lf%lf%lf" p->Namep->Nump->Sex&p->English&p->Java&p->Sjjg&p->Szdl&p->Jsj); if(head==NULL) { head=p; p1=p; } else { p1->next=p; p2=p1; p1=p; } }p2->next=NULL; free(p); (*n)--; fclose(fp); returnhead;}voidFindofName(structstudents*head){ inti=0n=0; charb[20]; structstudents*p; head=create(head&n); p=head; scanf("%s"b); while(p!=NULL){ if(strcmp(p->Nameb)==0){ printf("%s\t%s\t%s\t%.1lf\t%.1lf\t%.1lf\t%.1lf\t%.1lf\n" p->Namep->Nump->Sexp->Englishp->Javap->Sjjgp->Szdlp->Jsj); i++; } p=p->next; } if(i==0) printf("\n對不起！沒有找到名為"%s"的學(xué)生信息！\n"b);}voidFindofNum(structstudents*head){ inti=0n; charb[20]; structstudents*p; head=create(head&n); p=head; scanf("%s"b); while(p!=NULL){ if(strcmp(p->Numb)==0){ printf("%s\t%s\t%s\t%.1lf\t%.1lf\t%.1lf\t%.1lf\t%.1lf\n" p->Namep->Nump->Sexp->Englishp->Javap->Sjjgp->Szdlp->Jsj); i++; } p=p->next; } if(i==0)b);}/*按英語成績排序*/voidSortEnglish(structstudents*head){ structstudents*p*tail;/*定義中間變量*/ intn; doubleEnglish; p=(structstudents*)malloc(sizeof(structstudents)); head=create(head&n); while(head->next!=NULL)/*利用選擇法排序*/ { tail=NULL; p=head; English=p->English;/*將鏈表中第一個(gè)成績賦給English*/ while(p!=NULL) { if((p->English)>English)/*比較*/ English=p->English; tail=p; p=p->next; } tail=NULL; p=head; while(p->next!=NULL) { if(p->English==English){ printf("%s\t%s\t%s\t%.1lf\t%.1lf\t%.1lf\t%.1lf\t%.1lf\n" p->Namep->Nump->Sexp->Englishp->Javap->Sjjgp->Szdlp->Jsj); if(p==head) head=head->next; else tail->next=p->next; } tail=p; p=p->next; } if(p->English==English){ /*分?jǐn)?shù)相同時(shí)無需比較*/ printf("%s\t%s\t%s\t%.1lf\t%.1lf\t%.1lf\t%.1lf\t%.1lf\n" p->Namep->Nump->Sexp->Englishp->Javap->Sjjgp->Szdlp->Jsj); tail->next=NULL; } } p=head;/*將鏈表賦給結(jié)構(gòu)體指針*/ printf("%s\t%s\t%s\t%.1lf\t%.1lf\t%.1lf\t%.1lf\t%.1lf\n" p->Namep->Nump->Sexp->Englishp->Javap->Sjjgp->Szdlp->Jsj);/*瀏覽排序后的信息*/ printf("按英語成績排序后輸出如上（注：此過程不保存至文件）：\n"); return;}/*按JAVA成績排序*/voidSortJava(structstudents*head){ structstudents*p*tail;/*定義中間變量*/ intn; doubleJava; p=(structstudents*)malloc(sizeof(structstudents)); head=create(head&n); while(head->next!=NULL)/*利用選擇法排序*/ { tail=NULL; p=head; Java=p->Java;/*將鏈表中第一個(gè)成績賦給Java*/ while(p!=NULL) { if((p->Java)>Java)/*比較*/ Java=p->Java; tail=p; p=p->next; } tail=NULL; p=head; while(p->next!=NULL) { if(p->Java==Java){ printf("%s\t%s\t%s\t%.1lf\t%.1lf\t%.1lf\t%.1lf\t%.1lf\n" p->Namep->Nump->Sexp->Englishp->Javap->Sjjgp->Szdlp->Jsj); if(p==head) head=head->next; else tail->next=p->next; } tail=p; p=p->next; } if(p->Java==Java){ /*成績相同時(shí)無需比較*/ printf("%s\t%s\t%s\t%.1lf\t%.1lf\t%.1lf\t%.1lf\t%.1lf\n" p->Namep->Nump->Sexp->Englishp->Javap->Sjjgp->Szdlp->Jsj); tail->next=NULL; } } p=head;/*將鏈表賦給結(jié)構(gòu)體指針*/ printf("%s\t%s\t%s\t%.1lf\t%.1lf\t%.1lf\t%.1lf\t%.1lf\n" p->Namep->Nump->Sexp->Englishp->Javap->Sjjgp->Szdlp->Jsj);/*瀏覽排序后的信息*/ printf("按Java成績排序后輸出如上（注：此過程不保存至文件）：\n"); return;}/*按數(shù)據(jù)結(jié)構(gòu)排序*/voidSortSjjg(structstudents*head){ structstudents*p*tail;/*定義中間變量*/ intn; doubleSjjg; p=(structstudents*)malloc(sizeof(structstudents)); head=create(head&n); while(head->next!=NULL)/*利用選擇法排序*/ { tail=NULL; p=head; Sjjg=p->Sjjg;/*將鏈表中第一個(gè)成績賦給Sjjg*/ while(p!=NULL) { if((p->Sjjg)>Sjjg)/*比較*/ Sjjg=p->Sjjg; tail=p; p=p->next; } tail=NULL; p=head; while(p->next!=NULL) { if(p->Sjjg==Sjjg){ printf("%s\t%s\t%s\t%.1lf\t%.1lf\t%.1lf\t%.1lf\t%.1lf\n" p->Namep->Nump->Sexp->Englishp->Javap->Sjjgp->Szdlp->Jsj); if(p==head) head=head->next; else tail->next=p->next; } tail=p; p=p->next; } if(p->Sjjg==Sjjg){ /*成績相同時(shí)無需比較*/ printf("%s\t%s\t%s\t%.1lf\t%.1lf\t%.1lf\t%.1lf\t%.1lf\n" p->Namep->Nump->Sexp->Englishp->Javap->Sjjgp->Szdlp->Jsj); tail->next=NULL; } } p=head;/*將鏈表賦給結(jié)構(gòu)體指針*/ printf("%s\t%s\t%s\t%.1lf\t%.1lf\t%.1lf\t%.1lf\t%.1lf\n" p->Namep->Nump->Sexp->Englishp->Javap->Sjjgp->Szdlp->Jsj);/*瀏覽排序后的信息*/ printf("按數(shù)據(jù)結(jié)構(gòu)成績排序后輸出如上（注：此過程不保存至文件）：\n"); return;}/*按數(shù)字電路排序*/voidSortSzdl(structstudents*head){ structstudents*p*tail;/*定義中間變量*/ intn; doubleSzdl; p=(structstudents*)malloc(sizeof(structstudents)); head=create(head&n); while(head->next!=NULL)/*利用選擇法排序*/ { tail=NULL; p=head; Szdl=p->Szdl;/*將鏈表中第一個(gè)成績賦給Szdl*/ while(p!=NULL) { if((p->Szdl)>Szdl)/*比較*/ Szdl=p->Szdl; tail=p; p=p->next; } tail=NULL; p=head; while(p->next!=NULL) { if(p->Szdl==Szdl){ printf("%s\t%s\t%s\t%.1lf\t%.1lf\t%.1lf\t%.1lf\t%.1lf\n" p->Namep->Nump->Sexp->Englishp->Javap->Sjjgp->Szdlp->Jsj); if(p==head) head=head->next; else tail->next=p->next; } tail=p; p=p->next; } if(p->Szdl==Szdl){ /*成績相同時(shí)無需比較*/ printf("%s\t%s\t%s\t%.1lf\t%.1lf\t%.1lf\t%.1lf\t%.1lf\n" p->Namep->Nump->Sexp->Englishp->Javap->Sjjgp->Szdlp->Jsj); tail->next=NULL; } } p=head;/*將鏈表賦給結(jié)構(gòu)體指針*/ printf("%s\t%s\t%s\t%.1lf\t%.1lf\t%.1lf\t%.1lf\t%.1lf\n" p->Namep->Nump->Sexp->Englishp->Javap->Sjjgp->Szdlp->Jsj);/*瀏覽排序后的信息*/ printf("按數(shù)字電路成績排序后輸出如上（注：此過程不保存至文件）：\n"); return;}/*按計(jì)算機(jī)組成原理排序*/voidSortJsj(structstudents*head){ structstudents*p*tail;/*定義中間變量*/ intn; doubleJsj; p=(structstudents*)malloc(sizeof(structstudents)); head=create(head&n); while(head->next!=NULL)/*利用選擇法排序*/ { tail=NULL; p=head; Jsj=p->Jsj;/*將鏈表中第一個(gè)成績賦給Jsj*/ while(p!=NULL) { if((p->Jsj)>Jsj)/*比較*/ Jsj=p->Jsj; tail=p; p=p->next; } tail=NULL; p=head; while(p->next!=NULL) { if(p->Jsj==Jsj){ printf("%s\t%s\t%s\t%.1lf\t%.1lf\t%.1lf\t%.1lf\t%.1lf\n" p->Namep->Nump->Sexp->Englishp->Javap->Sjjgp->Szdlp->Jsj); if(p==head) head=head->next; else tail->next=p->next; } tail=p; p=p->next; } if(p->Jsj==Jsj){ /*成績相同時(shí)無需比較*/ printf("%s\t%s\t%s\t%.1lf\t%.1lf\t%.1lf\t%.1lf\t%.1lf\n" p->Namep->Nump->Sexp->Englishp->Javap->Sjjgp->Szdlp->Jsj); tail->next=NULL; } } p=head;/*將鏈表賦給結(jié)構(gòu)體指針*/ printf("%s\t%s\t%s\t%.1lf\t%.1lf\t%.1lf\t%.1lf\t%.1lf\n" p->Namep->Nump->Sexp->Englishp->Javap->Sjjgp->Szdlp->Jsj);/*瀏覽排序后的信息*/ printf("按計(jì)算機(jī)組成原理成績排序后輸出如上（注：此過程不保存至文件）：\n"); return;}structstudents*Delete(structstudents*headcharm[15]){ structstudents*ptr1*ptr2; intn;printf("\n所有學(xué)生信息如下：\n"); Browse(head); scanf("%s"m); head=create(head&n); if(head==NULL){ printf("無學(xué)生信息！\n"); returnhead; } if((strcmp(head->Numm)==0)&&head!=NULL) { ptr2=head; head=head->next; free(ptr2); } if(strcmp(head->Numm)!=0){ ptr1=head; ptr2=head->next; while(ptr2!=NULL){ if(strcmp(ptr2->Numm)==0){ ptr1->next=ptr2->next; free(ptr2); } else ptr1=ptr2; ptr2=ptr1->next; } } fprint_(head);并保存至文件！\n"m); returnhead;}/*修改學(xué)生信息（按編號修改）*/structstudents*Revise(){ intn=0t;charnum[10]; charSex[3];/*字符型學(xué)生性別*/ doubleEnglish;/*雙精度實(shí)型英語成績*/ doubleJava;/*雙精度實(shí)型Java成績*/ doubleSjjg;/*雙精度實(shí)數(shù)據(jù)結(jié)構(gòu)*/ doubleSzdl;/*雙精度實(shí)型數(shù)字電路*/ doubleJsj;/*計(jì)算機(jī)組成原理*/structstudents*head=NULL;structstudents*p;printf("\n所有學(xué)生信息如下：\n"); Browse(head); head=create(head&n); scanf("%s"num); p=head; while(head!=NULL) { if(strcmp(p->Numnum)==0) { system("cls"); Revisemenu(); printf("編號為%s的學(xué)生信息如下:\n"num); printf("%s\t%s\t%s\t%.1lf\t%.1lf\t%.1lf\t%.1lf\t%.1lf\n" p->Namep->Nump->Sexp->Englishp->Javap->Sjjgp->Szdlp->Jsj); while(1){ printf("請選擇需要修改的信息:"); scanf("%d"&t); switch(t){ case1: scanf("%s"Name); strcpy(p->NameName); break; case2: scanf("%s"&Num); strcpy(p->NumNum); break; case3: printf("請輸入新性別:"); scanf("%s"Sex); strcpy(p->SexSex); break; case4: printf("請輸入新英語成績:"); scanf("%lf"&English); p->English=English; break; case5: printf("請輸入新Java成績:"); scanf("%lf"&Java); p->Java=Java; break; case6: printf("請輸入新數(shù)據(jù)結(jié)構(gòu)成績:"); scanf("%lf"&Sjjg); p->Sjjg=Sjjg; break; case7: printf("請輸入新數(shù)字電路成績:"); scanf("%lf"&Szdl); p->S