C語(yǔ)言寫(xiě)的學(xué)生成績(jī)管理系統(tǒng)

1、#in clude<stdio.h>#in clude<stri ng.h>#in clude<stdlib.h>struct studlong num;char n ame20;float sx;float dx;float ts;float dl;float cx;float zf;float pj;struct studcodestruct stud stude nt;struct studcode *n ext;void menu();void in put(struct studcode *);void output(struct studcode

2、 *);void bin search(struct studcode *);void in sert(struct studcode *);void delet(struct studcode *);void good(struct studcode *);void fail(struct studcode *);void sort(struct studcode *);void back();void mai n()char choose;int flag=1;struct studcode *head;head=NULL;printf("請(qǐng)先錄入學(xué)生成績(jī)信息n");p

3、rin tf("輸入學(xué)生學(xué)號(hào)高數(shù)、英語(yǔ)讀寫(xiě)、英語(yǔ)聽(tīng)說(shuō)、計(jì)算機(jī)導(dǎo)論和程序設(shè)計(jì)的成績(jī)n");in put (&head);while (flag)system("cls");menu();printf("請(qǐng)選擇:”);getchar();choose=getchar();switch(choose)case '1':output(head);back();break;case 2:bin search(head);back();break;case 3:in sert (&head);output(head);bac

4、k();break;case '4':delet(&head);output(head);back();break;case '5':good(head);back();break;case '6':fail(head);back();break;case '7':sort(head);output(head);back();break;case 'O':flag=0;prin tf("n* The End! *n");# n");prin tf("n #感使用，歡迎

5、再次登錄，拜拜!break;default: prin tf("n Wrong Selectio n !(選擇錯(cuò)誤，請(qǐng)重選)n")back();void menu()printf(” nprintf(” nprintf(" n1.printf(" n 2.printf(" n3.printf(" n4.printf(" n5.printf(" n6.printf(" n7.printf(" n0.學(xué)生成績(jī)統(tǒng)計(jì)與分析系統(tǒng)n");菜 單 nn");顯示所有學(xué)生的信息n"

6、);查找某學(xué)號(hào)的學(xué)生信息n");插入某學(xué)生的信息n");刪除某學(xué)號(hào)學(xué)生的信息n");統(tǒng)計(jì)各門(mén)課程成績(jī)?cè)?90分以上學(xué)生所占百分比 統(tǒng)計(jì)各門(mén)課程成績(jī)?cè)?60分以下學(xué)生所占百分比 按總分降序排序，依高低排出名次n");退出 nn”);n");n");void back()int x;prin tf("n");doprintf(”按1返回菜單界面：”);scan f("%d"，& x);while(x!=1);void in put(struct studcode *headp)struct

7、studcode *p;while(1)p=(struct studcode *)malloc(sizeof(struct studcode); scan f("%ld",&p->stude nt. nu m);if(p->stude nt. num=0) break;scan f("%s%f%f%f%f%f",&p->stude nt.n ame,&p->stude nt.sx,&p->stude nt.dx,&p->stu den t.ts,&p->stude

8、nt.dl,&p->stude nt.cx);p->stude nt.zf=p->stude nt.sx+p->stude nt.dx+p->stude nt.ts+p->stude nt.dl+p->st ude nt.cx;p->stude nt.pj=p->stude nt.zf/5;p->n ext=*headp;*headp=p; void output(struct studcode *head)struct studcode *p;p=head;printf(" 學(xué)號(hào)tt 高數(shù)t讀寫(xiě)t聽(tīng)說(shuō)t導(dǎo)論t程序t

9、總分t平均分n"); while(p!=NULL)n ”,p->stude nt.nu m,p->stude nt. name,p->stude nt.sx,p->stude nt.dx,p->stude nt.ts,p-> stude nt.dl,p->stude nt.cx,p->stude nt.zf,p->stude nt.pj);p=p->n ext;prin tf("n"); void bin search(struct studcode *head)struct studcode *p;in

10、t k=1;long x;p=head;printf("請(qǐng)輸入需要查找的學(xué)生的學(xué)號(hào)：");scan f("%ld", &x);prin tf("n ”);while(p!=NULL)if(p->stude nt. num=x)printf("該學(xué)生信息如下：n");printf("學(xué)號(hào)tt 高數(shù)t讀寫(xiě)t聽(tīng)說(shuō)t導(dǎo)論t程序t總分t平均分n"); prin tf("%-ldt%-4st%-0.2ft%-0.2ft%-0.2ft%-0.2ft%-0.2ft%-0.2ft%-0.2fn&qu

11、ot;,p->stude nt. nu m,p->stude nt.n ame,p->stude nt.sx,p->stude nt.dx,p->stude nt.ts,p->stud en t.dl,p->stude nt.cx,p->stude nt.zf,p->stude nt.pj);k=0;break;p=p->n ext;if(k) pri ntf("沒(méi)有此學(xué)生的信息n"); void in sert(struct studcode *headp)struct studcode *p;p=(struct

12、 studcode *)malloc(sizeof (struct studcode);printf(”請(qǐng)輸入你想插入的學(xué)生的信息n");scan f("%ld%s%f%f%f%f%f",&p->stude nt.num,&p->stude nt.n ame,&p->stude nt.sx,&p->stude nt.dx，&p->stude nt.ts，&p->stude nt.dl,&p->stude nt.cx);p->stude nt.zf=p->s

13、tude nt.sx+p->stude nt.dx+p->stude nt.ts+p->stude nt.dl+p->stude nt.cx;p->stude nt.pj=p->stude nt.zf/5;p->n ext=*headp;*headp=p;printf("*插入成功 *n"); void delet(struct studcode *headp)struct studcode *p,*last;long x;p=*headp;printf(”請(qǐng)輸入你要?jiǎng)h除的學(xué)生的學(xué)號(hào)：");scan f("%ld

14、", &x);while(p->stude nt.n um!=x&&p->n ext!=NULL) last=p;p=p->n ext;if(p->stude nt. num=x)if(p=*headp)*headp=p->n ext;elselast- >n ext=p->n ext;free(p);printf("n*刪除成功 *n");else prin tf("n*刪除失敗，無(wú)該學(xué)生信息*n"); void good(struct studcode *head)struc

15、t studcode *p;int x1,x2,x3,x4,x5,k;float y1,y2,y3,y4,y5;x1=x2=x3=x4=x5=k=0;p=head; while(p!=NULL) k+;if(p->student.sx>=90) x1+;if(p->student.dx>=90) x2+;if(p->student.ts>=90) x3+;if(p->student.dl>=90) x4+;if(p->stude nt.cx>=90) x5+; p=p->n ext;y1=(float)x1/k;y2=(floa

16、t)x2/k;y3=(float)x3/k;y4=(float)x4/k;y5=(float)x5/k;printf(" 高數(shù)t讀寫(xiě)t聽(tīng)說(shuō)t導(dǎo)論t程序n");prin tf("%-0.2ft%-0.2ft%-0.2ft%-0.2ft%-0.2fn",y1,y2,y3,y4,y5); void fail(struct studcode *head)struct studcode *p;int x1,x2,x3,x4,x5,k;float y1,y2,y3,y4,y5;x1=x2=x3=x4=x5=k=0;p=head;while(p!=NULL)k+;if

17、(p->student.sx<60) x1+;if(p->student.dx<60) x2+;if(p->student.ts<60) x3+;if(p->student.dl<60) x4+;if(p->stude nt.cx<60) x5+;p=p->n ext;y1=(float)x1/k;y2=(float)x2/k;y3=(float)x3/k;y4=(float)x4/k;y5=(float)x5/k;printf(" 高數(shù)t讀寫(xiě)t聽(tīng)說(shuō)t導(dǎo)論t程序n");prin tf("%-0.2ft%-0.2ft%-0.2ft%-0.2ft%-0.2fn",y1,y2,y3,y4,y5); void sort(struct studcode *head) struct stud temp;int i,j,n;struct studcode *p,*p1,*p2; n=0;p=head; while(