2022年C語(yǔ)言大作業(yè)-學(xué)生成績(jī)管理系統(tǒng)v2.0

1、/成績(jī)管理系統(tǒng)v2.0#include #include #define N 30void Input (long num,int score,int n);void Totalave (int score,int n);void Scoredes (long num,int score,int n,int (*compare)(int a,int b);int Ascending (int a,int b);void Numas (long num,int score,int n);void Search (long num,int score,int n,int x);void stati

2、stis (long num,int score,int n);void List (long num,int score,int n);int main() int n,scoreN,c,x,i; long numN; printf(輸入學(xué)生人數(shù)); scanf(%d,&n); printf(1.Input recordn); printf(2.Caculate totel and average score of coursen); printf(3.Sort in descending order by scoren); printf(4.Sort in ascending order

3、by numbern); printf(5.Search by numbern); printf(6.Statistic analysisn); printf(7.List recordn); printf(0.Exitn); printf(Please enter your choice:n); printf(n); for(;) scanf(%d,&c); switch(c) case 1: Input (num,score,n); printf(Please enter your choice:n); break; case 2: Totalave (score,n); printf(P

4、lease enter your choice:n); break; case 3: Scoredes (num,score,n,Ascending); for(i=0;in;i+) printf(ID:%10ld,score:%dn,numi,scorei);/以長(zhǎng)整形打印用%ld printf(Please enter your choice:n); break; case 4: Numas (num,score,n); printf(Please enter your choice:n); break; case 5: printf(請(qǐng)輸入查找學(xué)號(hào)n); scanf(%d,&x); Se

5、arch (num,score,n,x); printf(Please enter your choice:n); break; case 6: statistis (num,score,n); printf(Please enter your choice:n); break; case 7: List (num,score,n); Totalave (score,n); printf(Please enter your choice:n); break; case 0: exit(0); return 0;void Input (long num,int score,int n) int

6、i; for(i=0;in;i+) printf(Input students ID and score); scanf(%ld%d,&numi,&scorei); void Totalave (int score,int n) int i,sum=0; double ave; for(i=0;in;i+) sum=sum+scorei; ave=(double)sum/n; printf(Caculate total=%d,average score of course=%fn,sum,ave);void Scoredes (long num,int score,int n,int(*com

7、pare)(int a,int b) int i,j,k,t,h; for(i=0;in;i+) k=i; for(j=i+1;jn;j+) if (*compare)(scorej,scorek) k=j; if(i!=k) t=scorek,h=numk; scorek=scorei,numk=numi; scorei=t,numi=h; int Ascending (int a,int b) return ab;void Numas (long num,int score,int n) int i,j,k,t,h; for(i=0;in;i+) k=i; for(j=i+1;jn;j+)

8、 if (numjnumk) k=j; if(i!=k) t=scorek,h=numk; scorek=scorei,numk=numi; scorei=t,numi=h; for(i=0;in;i+) printf(ID:%10ld,score:%dn,numi,scorei);/以長(zhǎng)整形打印用%ldvoid Search (long num,int score,int n,int x) int high=n-1,low=0,mid,c=0,pos,find=0,i,j,k,t,h; for(i=0;in;i+) k=i; for(j=i+1;jn;j+) if (numjnumk) k=

9、j; if(i!=k) t=scorek,h=numk; scorek=scorei,numk=numi; scorei=t,numi=h; while(find=0&lownummid) low=mid+1; else if(xnummid) high=mid-1; else pos=mid; find=1; if(find=0) printf(not findn); else for(i=0;iscorepos) c+; printf(ID:%10ld，order:%d,score:%dn,numpos,c+1,scorepos); void statistis (long num,int

10、 score,int n) int a=0,b=0,c=0,d=0,e=0,i; double A,B,C,D,E; for(i=0;i=90) a+; else if(scorei=80) b+; else if(scorei=70) c+; else if(scorei=60) d+; else e+; A=(double)a/n*100; B=(double)b/n*100; C=(double)c/n*100; D=(double)d/n*100; E=(double)e/n*100; printf(優(yōu)秀人數(shù)%d,比例:%f%n,a,A); printf(良好人數(shù)%d,比例:%f%n,b,B); printf(中檔人數(shù)%d,比例:%f%n,c