由于这些代码也是我初学时写的代码,故其中的规范程度及简洁程度并不很好(此处我后来写的有可以参考一下->C语言代码规范),但是能很好的接近出初学者的水平,也更有参考价值!排版不易,喜欢就点个赞吧!如有问题,请勿吐槽,欢迎留言互相学习。

练兵区——编程题

1. 学生成绩管理系统V4.0

题目内容
某班有最多不超过30人(具体人数由键盘输入)参加期末考试,最多不超过6门(具体门数由键盘输入)。参考学生成绩管理系统V3.0,用二维数组作函数参数编程实现如下菜单驱动的学生成绩管理系统:
(1)录入每个学生的学号、姓名和各科考试成绩;
(2)计算每门课程的总分和平均分;
(3)计算每个学生的总分和平均分;
(4)按每个学生的总分由高到低排名名次表;
(5)按每个学生的总分由低到高排出名次表;
(6)按学号由小到大排出成绩表;
(7)按姓名的字典顺序排出成绩表;
(8)按学号查询学生排名及其各科考试成绩;
(9)按姓名查询学生排名及其各科考试成绩;
(10)按优秀(90100)、良好(8089)、中等(7079)、及格(6069)、不及格(0~59)5个类别,对每门课程分别统计每个类别的人数以及所占的百分比;
(11)输出每个学生的学号、姓名、各科考试成绩、总分、平均分,以及每门课程的总分和平均分。
要求程序运行后先显示如下菜单,并提示用户输入选项:
Management for Students’ scores
1.Input record
2.Caculate total and average score of every course
3.Caculate total and average score of every student
4.Sort in descending order by score
5.Sort in ascending order by score
6.Sort in ascending order by number
7.Sort in dictionary order by name
8.Search by number
9.Search by name
10.Statistic analysis
11.List record
0.Exit
Please Input your choice:
然后,根据用户输入的选项执行相应的操作。
请按照下面的定义及函数原型编程

#define   MAX_LEN  10                        /* 字符串最大长度 */
#define   STU_NUM 30                       /* 最多的学生人数 */
#define   COURSE_NUM 6                     /* 最多的考试科目数 */
int   Menu(void);
void  ReadScore(long num[], char name[][MAX_LEN],
float score[][COURSE_NUM], int n, int m);
void AverSumofEveryStudent(float score[][COURSE_NUM], int n, int m,
float  sum[STU_NUM], float aver[STU_NUM]);
void AverSumofEveryCourse(float score[][COURSE_NUM], int n, int m);
void  SortbyScore(long num[], char name[][MAX_LEN],
float score[][COURSE_NUM], float  sum[], float aver[],
int n, int m, int (*compare)(float a, float b));
int   Ascending(float a, float b);
int   Descending(float a, float b);
void  SwapFloat(float *x, float *y);
void  SwapLong(long *x, long *y);
void  SwapChar(char x[], char y[]);
void  AsSortbyNum(long num[], char name[][MAX_LEN],
float score[][COURSE_NUM], float  sum[], float aver[],
int n, int m);
void  SortbyName(long num[], char name[][MAX_LEN],
float score[][COURSE_NUM], float  sum[], float aver[],
int n, int m);
void  SearchbyNum(long num[], char name[][MAX_LEN],
float score[][COURSE_NUM], float  sum[], float aver[],
int n, int m);
void  SearchbyName(long num[], char name[][MAX_LEN],
float score[][COURSE_NUM], float  sum[], float aver[],
int n, int m);
void  StatisticAnalysis(float score[][COURSE_NUM], int n, int m);
void  PrintScore(long num[], char name[][MAX_LEN],
float score[][COURSE_NUM], float  sum[], float aver[],int n, int m) ;
  1. 下面是程序运行示例:
    Input student number(n<30):
    6↙
    Management for Students’ scores
    1.Input record
    2.Caculate total and average score of every course
    3.Caculate total and average score of every student
    4.Sort in descending order by score
    5.Sort in ascending order by score
    6.Sort in ascending order by number
    7.Sort in dictionary order by name
    8.Search by number
    9.Search by name
    10.Statistic analysis
    11.List record
    0.Exit
    Please Input your choice:
    1↙
    Input course number(m<=6):
    3↙
    Input student’s ID, name and score:
    11003001↙
    lisi↙
    87↙
    82↙
    89↙
    11003005↙
    heli↙
    98↙
    92↙
    90↙
    11003003↙
    ludi↙
    75↙
    78↙
    80↙
    11003002↙
    dumo↙
    48↙
    50↙
    67↙
    11003004↙
    zuma↙
    65↙
    69↙
    72↙
    11003006↙
    suyu↙
    100↙
    95↙
    94↙
    Management for Students’ scores
    1.Input record
    2.Caculate total and average score of every course
    3.Caculate total and average score of every student
    4.Sort in descending order by score
    5.Sort in ascending order by score
    6.Sort in ascending order by number
    7.Sort in dictionary order by name
    8.Search by number
    9.Search by name
    10.Statistic analysis
    11.List record
    0.Exit
    Please Input your choice:
    2↙
    course 1:sum=473,aver=79
    course 2:sum=466,aver=78
    course 3:sum=492,aver=82
    Management for Students’ scores
    1.Input record
    2.Caculate total and average score of every course
    3.Caculate total and average score of every student
    4.Sort in descending order by score
    5.Sort in ascending order by score
    6.Sort in ascending order by number
    7.Sort in dictionary order by name
    8.Search by number
    9.Search by name
    10.Statistic analysis
    11.List record
    0.Exit
    Please Input your choice:
    3↙
    student 1:sum=258,aver=86
    student 2:sum=280,aver=93
    student 3:sum=233,aver=78
    student 4:sum=165,aver=55
    student 5:sum=206,aver=69
    student 6:sum=289,aver=96
    Management for Students’ scores
    1.Input record
    2.Caculate total and average score of every course
    3.Caculate total and average score of every student
    4.Sort in descending order by score
    5.Sort in ascending order by score
    6.Sort in ascending order by number
    7.Sort in dictionary order by name
    8.Search by number
    9.Search by name
    10.Statistic analysis
    11.List record
    0.Exit
    Please Input your choice:
    4↙
    Sort in descending order by score:
    11003006 suyu 100 95 94 289 96
    11003005 heli 98 92 90 280 93
    11003001 lisi 87 82 89 258 86
    11003003 ludi 75 78 80 233 78
    11003004 zuma 65 69 72 206 69
    11003002 dumo 48 50 67 165 55
    Management for Students’ scores
    1.Input record
    2.Caculate total and average score of every course
    3.Caculate total and average score of every student
    4.Sort in descending order by score
    5.Sort in ascending order by score
    6.Sort in ascending order by number
    7.Sort in dictionary order by name
    8.Search by number
    9.Search by name
    10.Statistic analysis
    11.List record
    0.Exit
    Please Input your choice:
    5↙
    Sort in ascending order by score:
    11003002 dumo 48 50 67 165 55
    11003004 zuma 65 69 72 206 69
    11003003 ludi 75 78 80 233 78
    11003001 lisi 87 82 89 258 86
    11003005 heli 98 92 90 280 93
    11003006 suyu 100 95 94 289 96
    Management for Students’ scores
    1.Input record
    2.Caculate total and average score of every course
    3.Caculate total and average score of every student
    4.Sort in descending order by score
    5.Sort in ascending order by score
    6.Sort in ascending order by number
    7.Sort in dictionary order by name
    8.Search by number
    9.Search by name
    10.Statistic analysis
    11.List record
    0.Exit
    Please Input your choice:
    6↙
    Sort in ascending order by number:
    11003001 lisi 87 82 89 258 86
    11003002 dumo 48 50 67 165 55
    11003003 ludi 75 78 80 233 78
    11003004 zuma 65 69 72 206 69
    11003005 heli 98 92 90 280 93
    11003006 suyu 100 95 94 289 96
    Management for Students’ scores
    1.Input record
    2.Caculate total and average score of every course
    3.Caculate total and average score of every student
    4.Sort in descending order by score
    5.Sort in ascending order by score
    6.Sort in ascending order by number
    7.Sort in dictionary order by name
    8.Search by number
    9.Search by name
    10.Statistic analysis
    11.List record
    0.Exit
    Please Input your choice:
    7↙
    Sort in dictionary order by name:
    11003002 dumo 48 50 67 165 55
    11003005 heli 98 92 90 280 93
    11003001 lisi 87 82 89 258 86
    11003003 ludi 75 78 80 233 78
    11003006 suyu 100 95 94 289 96
    11003004 zuma 65 69 72 206 69
    Management for Students’ scores
    1.Input record
    2.Caculate total and average score of every course
    3.Caculate total and average score of every student
    4.Sort in descending order by score
    5.Sort in ascending order by score
    6.Sort in ascending order by number
    7.Sort in dictionary order by name
    8.Search by number
    9.Search by name
    10.Statistic analysis
    11.List record
    0.Exit
    Please Input your choice:
    8↙
    Input the number you want to search:
    11003007↙
    Not found!
    Management for Students’ scores
    1.Input record
    2.Caculate total and average score of every course
    3.Caculate total and average score of every student
    4.Sort in descending order by score
    5.Sort in ascending order by score
    6.Sort in ascending order by number
    7.Sort in dictionary order by name
    8.Search by number
    9.Search by name
    10.Statistic analysis
    11.List record
    0.Exit
    Please Input your choice:
    8↙
    Input the number you want to search:
    11003004↙
    11003004 zuma 65 69 72 206 69
    Management for Students’ scores
    1.Input record
    2.Caculate total and average score of every course
    3.Caculate total and average score of every student
    4.Sort in descending order by score
    5.Sort in ascending order by score
    6.Sort in ascending order by number
    7.Sort in dictionary order by name
    8.Search by number
    9.Search by name
    10.Statistic analysis
    11.List record
    0.Exit
    Please Input your choice:
    9↙
    Input the name you want to search:
    lili↙
    Not found!
    Management for Students’ scores
    1.Input record
    2.Caculate total and average score of every course
    3.Caculate total and average score of every student
    4.Sort in descending order by score
    5.Sort in ascending order by score
    6.Sort in ascending order by number
    7.Sort in dictionary order by name
    8.Search by number
    9.Search by name
    10.Statistic analysis
    11.List record
    0.Exit
    Please Input your choice:
    9↙
    Input the name you want to search:
    lisi↙
    11003001 lisi 87 82 89 258 86
    Management for Students’ scores
    1.Input record
    2.Caculate total and average score of every course
    3.Caculate total and average score of every student
    4.Sort in descending order by score
    5.Sort in ascending order by score
    6.Sort in ascending order by number
    7.Sort in dictionary order by name
    8.Search by number
    9.Search by name
    10.Statistic analysis
    11.List record
    0.Exit
    Please Input your choice:
    10↙
    For course 1:
    <60 1 16.67%
    60-69 1 16.67%
    70-79 1 16.67%
    80-89 1 16.67%
    90-99 1 16.67%
    100 1 16.67%
    For course 2:
    <60 1 16.67%
    60-69 1 16.67%
    70-79 1 16.67%
    80-89 1 16.67%
    90-99 2 33.33%
    100 0 0.00%
    For course 3:
    <60 0 0.00%
    60-69 1 16.67%
    70-79 1 16.67%
    80-89 2 33.33%
    90-99 2 33.33%
    100 0 0.00%
    Management for Students’ scores
    1.Input record
    2.Caculate total and average score of every course
    3.Caculate total and average score of every student
    4.Sort in descending order by score
    5.Sort in ascending order by score
    6.Sort in ascending order by number
    7.Sort in dictionary order by name
    8.Search by number
    9.Search by name
    10.Statistic analysis
    11.List record
    0.Exit
    Please Input your choice:
    11↙
    11003002 dumo 48 50 67 165 55
    11003005 heli 98 92 90 280 93
    11003001 lisi 87 82 89 258 86
    11003003 ludi 75 78 80 233 78
    11003006 suyu 100 95 94 289 96
    11003004 zuma 65 69 72 206 69
    Management for Students’ scores
    1.Input record
    2.Caculate total and average score of every course
    3.Caculate total and average score of every student
    4.Sort in descending order by score
    5.Sort in ascending order by score
    6.Sort in ascending order by number
    7.Sort in dictionary order by name
    8.Search by number
    9.Search by name
    10.Statistic analysis
    11.List record
    0.Exit
    Please Input your choice:
    12↙
    Input error!
    Management for Students’ scores
    1.Input record
    2.Caculate total and average score of every course
    3.Caculate total and average score of every student
    4.Sort in descending order by score
    5.Sort in ascending order by score
    6.Sort in ascending order by number
    7.Sort in dictionary order by name
    8.Search by number
    9.Search by name
    10.Statistic analysis
    11.List record
    0.Exit
    Please Input your choice:
    0↙
    End of program!
    输入格式:
    ( 1 ) 录入学生的人数:
    要求输入数据格式为:"%d"
    提示信息为:“Input student number(n<30):\n”
    ( 2 )录入课程数:
    要求输入数据格式为:"%d"
    提示信息为:“Input course number(m<=%d):\n”
    ( 3 )录入每个学生的学号、姓名和考试成绩:
    要求学号、姓名的输入数据格式为:"%ld%s"
    要求考试成绩的输入数据格式为:"%f"
    提示信息为:“Input student’s ID, name and score:\n”
    输出格式:
    计算每门课程的总分和平均分:
    要求输出总分与平均分格式为:“course %d:sum=%.0f,aver=%.0f\n”
    计算每个学生的总分和平均分:
    要求输出总分与平均分格式为:“student %d:sum=%.0f,aver=%.0f\n”
    按成绩由高到低排出名次表:
    要求学号、姓名的输出格式为:"%ld\t%s\t"
    要求成绩的输出格式为:"%.0f\t"
    要求总分及平均分的输出格式为:"%.0f\t%.0f\n"
    提示信息为:“Sort in descending order by score:\n”
    按成绩由低到高排出名次表:
    要求学号、姓名的输出格式为:"%ld\t%s\t"
    要求成绩的输出格式为:"%.0f\t"
    要求总分及平均分的输出格式为:"%.0f\t%.0f\n"
    提示信息为:“Sort in ascending order by score:\n”
    按学号由小到大排出成绩表:
    要求学号、姓名的输出格式为:"%ld\t%s\t"
    要求成绩的输出格式为:"%.0f\t"
    要求总分及平均分的输出格式为:"%.0f\t%.0f\n"
    提示信息为:“Sort in ascending order by number:\n”
    按姓名的字典顺序排出成绩表
    要求学号、姓名的输出格式为:"%ld\t%s\t"
    要求成绩的输出格式为:"%.0f\t"
    要求总分及平均分的输出格式为:"%.0f\t%.0f\n"
    提示信息为:“Sort in dictionary order by name:\n”
    按学号查询学生排名及其考试成绩:
    如果未查到此学号的学生,提示信息为:“Not found!\n”;
    如果查询到该学生
    要求学号、姓名的输出格式为:"%ld\t%s\t"
    要求成绩的输出格式为:"%.0f\t"
    要求总分及平均分的输出格式为:"%.0f\t%.0f\n"
    提示信息为:“Input the number you want to search:\n”
    按姓名查询学生排名及其考试成绩;
    如果未查到此学号的学生,提示信息为:“Not found!\n”
    如果查询到该学生
    要求学号、姓名的输出格式为:"%ld\t%s\t"
    要求成绩的输出格式为:"%.0f\t"
    要求总分及平均分的输出格式为:"%.0f\t%.0f\n"
    提示信息为:“Input the name you want to search:\n”
    按优秀(90100)、良好(8089)、中等(7079)、及格(6069)、不及格(0~59)5个类别,统计每个类别的人数以及所占的百分比:
    成绩<60输出提示格式为:"<60\t%d\t%.2f%%\n";
    成绩=100输出格式为:"%d\t%d\t%.2f%%\n";
    其他要求输出百分比格式为:"%d-%d\t%d\t%.2f%%\n"
    提示信息为: “For course %d:\n”
    输出每个学生的学号、姓名、考试成绩,以及课程总分和平均分
    要求学号、姓名的输出格式为:"%ld\t%s\t"
    要求成绩的输出格式为:"%.0f\t"
    要求总分及平均分的输出格式为:"%.0f\t%.0f\n"
    选择退出(菜单项0)
    提示信息:“End of program!”
    菜单项选择错误(不在0-11之间)
    提示信息:“Input error!\n”

代码实现

#include <stdio.h>
#include <string.h>
#define   MAX_LEN  10                       /* 字符串最大长度 */
#define   STU_NUM 30                       /* 最多的学生人数 */
#define   COURSE_NUM 6                     /* 最多的考试科目数 */
int   Menu(void);
void  ReadScore(long num[], char name[][MAX_LEN],float score[][COURSE_NUM], int n, int m);
void AverSumofEveryStudent(float score[][COURSE_NUM], int n, int m,float  sum[STU_NUM], float aver[STU_NUM]);
void AverSumofEveryCourse(float score[][COURSE_NUM], int n, int m);
void  SortbyScore(long num[], char name[][MAX_LEN],float score[][COURSE_NUM], float  sum[], float aver[],int n, int m, int (*compare)(float a, float b));
int   Ascending(float a, float b);
int   Descending(float a, float b);
void  SwapFloat(float *x, float *y);
void  SwapLong(long *x, long *y);
void  SwapChar(char x[], char y[]);
void  AsSortbyNum(long num[], char name[][MAX_LEN],float score[][COURSE_NUM], float  sum[], float aver[],int n, int m);
void  SortbyName(long num[], char name[][MAX_LEN],float score[][COURSE_NUM], float  sum[], float aver[],int n, int m);
void  SearchbyNum(long num[], char name[][MAX_LEN],float score[][COURSE_NUM], float  sum[], float aver[],int n, int m);
void  SearchbyName(long num[], char name[][MAX_LEN],float score[][COURSE_NUM], float  sum[], float aver[],int n, int m);
void  StatisticAnalysis(float score[][COURSE_NUM], int n, int m);
void  PrintScore(long num[], char name[][MAX_LEN],float score[][COURSE_NUM], float  sum[], float aver[],int n, int m) ;
int main()
{long num[STU_NUM];char name[STU_NUM][MAX_LEN];float score[STU_NUM][COURSE_NUM],sum[STU_NUM],aver[STU_NUM];int n,m,co;printf("Input student number(n<30):\n");scanf("%d",&n);while(1){co=Menu();switch(co){case 1:printf("Input course number(m<=%d):\n",COURSE_NUM);scanf("%d",&m);ReadScore(num,name,score,n,m);break;case 2:AverSumofEveryCourse(score,n,m);break;case 3:AverSumofEveryStudent(score,n,m,sum,aver);break;case 4:SortbyScore(num,name,score,sum,aver,n,m,Descending);printf("Sort in descending order by score:\n");PrintScore(num,name,score,sum,aver,n,m);break;case 5:SortbyScore(num,name,score,sum,aver,n,m,Ascending);printf("Sort in ascending order by score:\n");PrintScore(num,name,score,sum,aver,n,m);break;case 6:AsSortbyNum(num,name,score,sum,aver,n,m);printf("Sort in ascending order by number:\n");PrintScore(num,name,score,sum,aver,n,m);break;case 7:SortbyName(num,name,score,sum,aver,n,m);printf("Sort in dictionary order by name:\n");PrintScore(num,name,score,sum,aver,n,m);break;case 8:SearchbyNum(num,name,score,sum,aver,n,m);break;case 9:SearchbyName(num,name,score,sum,aver,n,m);break;case 10:StatisticAnalysis(score,n,m);break;case 11:PrintScore(num,name,score,sum,aver,n,m);break;case 0:printf("End of program!");exit(0);default :printf("Input error!\n");}}
}
int   Menu(void)
{int co;printf("Management for Students' scores\n\
1.Input record\n\
2.Caculate total and average score of every course\n\
3.Caculate total and average score of every student\n\
4.Sort in descending order by score\n\
5.Sort in ascending order by score\n\
6.Sort in ascending order by number\n\
7.Sort in dictionary order by name\n\
8.Search by number\n\
9.Search by name\n\
10.Statistic analysis\n\
11.List record\n\
0.Exit\n\
Please Input your choice:\n");scanf("%d",&co);return co;
}
void  ReadScore(long num[], char name[][MAX_LEN],float score[][COURSE_NUM], int n, int m)
{int i,j;printf("Input student's ID, name and score:\n");for(i=0;i<n;i++){scanf("%ld%s",&num[i],name[i]);for(j=0;j<m;j++){scanf("%f",&score[i][j]);}}
}
void AverSumofEveryStudent(float score[][COURSE_NUM], int n, int m, float  sum[STU_NUM], float aver[STU_NUM])
{int i,j;for(i=0;i<n;i++){sum[i]=0;for(j=0;j<m;j++){sum[i]+=score[i][j];}aver[i]=sum[i]/m;printf("student %d:sum=%.0f,aver=%.0f\n",i+1,sum[i],aver[i]);}
}
void AverSumofEveryCourse(float score[][COURSE_NUM], int n, int m)
{float sum1[COURSE_NUM],aver1[COURSE_NUM];int i,j;for(i=0;i<m;i++){sum1[i]=0;for(j=0;j<n;j++){sum1[i]+=score[j][i];}aver1[i]=sum1[i]/n;printf("course %d:sum=%.0f,aver=%.0f\n",i+1,sum1[i],aver1[i]);}
}
void  SortbyScore(long num[], char name[][MAX_LEN],float score[][COURSE_NUM], float  sum[], float aver[],int n, int m, int (*compare)(float a, float b))
{int i,j,y,t;for(i=0;i<n-1;i++){for(j=i+1;j<n;j++){if((*compare)(sum[i],sum[j])){SwapChar(name[i],name[j]);SwapLong(&num[i],&num[j]);SwapFloat(&sum[i],&sum[j]);SwapFloat(&aver[i],&aver[j]);for(t=0;t<m;t++){SwapFloat(&score[i][t],&score[j][t]);}}}}
}
int   Ascending(float a, float b)
{return a>b;
}
int   Descending(float a, float b)
{return a<b;
}
void  SwapFloat(float *x, float *y)
{float temp;temp=*x;*x=*y;*y=temp;
}
void  SwapLong(long *x, long *y)
{long temp;temp=*x;*x=*y;*y=temp;
}
void  SwapChar(char x[], char y[])
{char temp[MAX_LEN];strcpy(temp,x);strcpy(x,y);strcpy(y,temp);
}
void  AsSortbyNum(long num[], char name[][MAX_LEN],float score[][COURSE_NUM], float  sum[], float aver[],int n, int m)
{int i, j, t;for(i=0; i<n-1; i++){for(j=i+1; j<n; j++){if(num[i]>num[j]){SwapChar(name[i],name[j]);SwapLong(&num[i],&num[j]);SwapFloat(&sum[i],&sum[j]);SwapFloat(&aver[i],&aver[j]);for(t=0;t<m;t++){SwapFloat(&score[i][t],&score[j][t]);}}}}
}
void  SortbyName(long num[], char name[][MAX_LEN],float score[][COURSE_NUM], float  sum[], float aver[],int n, int m)
{int i, j, t;for(i=0; i<n-1; i++){for(j=i+1; j<n; j++){if(strcmp(name[i],name[j])>0){SwapChar(name[i],name[j]);SwapLong(&num[i],&num[j]);SwapFloat(&sum[i],&sum[j]);SwapFloat(&aver[i],&aver[j]);for(t=0;t<m;t++){SwapFloat(&score[i][t],&score[j][t]);}}}}
}
void  SearchbyNum(long num[], char name[][MAX_LEN],float score[][COURSE_NUM], float  sum[], float aver[],int n, int m)
{long se;int i,j,t=0;printf("Input the number you want to search:\n");scanf("%ld",&se);for(i=0;i<n;i++){if(num[i]==se){printf("%ld\t%s\t",num[i],name[i]);for(j=0;j<m;j++){printf("%.0f\t",score[i][j]);}printf("%.0f\t%.0f\n",sum[i],aver[i]);t=1;}}if(t==0){printf("Not found!\n");}
}
void  SearchbyName(long num[], char name[][MAX_LEN],float score[][COURSE_NUM], float  sum[], float aver[],int n, int m)
{char se[MAX_LEN];int i,j,t=0;printf("Input the name you want to search:\n");scanf("%s",se);for(i=0;i<n;i++){if(strcmp(name[i],se)==0){printf("%ld\t%s\t",num[i],name[i]);for(j=0;j<m;j++){printf("%.0f\t",score[i][j]);}printf("%.0f\t%.0f\n",sum[i],aver[i]);t=1;}}if(t==0){printf("Not found!\n");}
}
void  StatisticAnalysis(float score[][COURSE_NUM], int n, int m)
{int d1[COURSE_NUM], d2[COURSE_NUM], d3[COURSE_NUM], d4[COURSE_NUM], d5[COURSE_NUM], d6[COURSE_NUM], i, j;for(i=0;i<m;i++){d1[i]=d2[i]=d3[i]=d4[i]=d5[i]=d6[i]=0;}for(j=0;j<m;j++){for(i=0;i<n;i++){if(score[i][j]<60){d1[j]++;}else if(score[i][j]<70){d2[j]++;}else if(score[i][j]<80){d3[j]++;}else if(score[i][j]<90){d4[j]++;}else if(score[i][j]<100){d5[j]++;}else{d6[j]++;}}printf("For course %d:\n",j+1);printf("<60\t%d\t%.2f%%\n", d1[j], 100*(float)d1[j]/n);printf("%d-%d\t%d\t%.2f%%\n", 60, 69, d2[j], 100*(float)d2[j]/n);printf("%d-%d\t%d\t%.2f%%\n", 70, 79, d3[j], 100*(float)d3[j]/n);printf("%d-%d\t%d\t%.2f%%\n", 80, 89, d4[j], 100*(float)d4[j]/n);printf("%d-%d\t%d\t%.2f%%\n", 90, 99, d5[j], 100*(float)d5[j]/n);printf("%d\t%d\t%.2f%%\n", 100, d6[j], 100*(float)d6[j]/n);}
}
void  PrintScore(long num[], char name[][MAX_LEN],float score[][COURSE_NUM], float  sum[], float aver[],int n, int m)
{int i,j,y;for(i=0;i<n;i++){printf("%ld\t%s\t",num[i],name[i]);for(j=0;j<m;j++){printf("%.0f\t",score[i][j]);}printf("%.0f\t%.0f\n",sum[i],aver[i]);}
}

2. 寻找最高分成绩的学生

题目内容
下面程序的功能是用动态数组编程输入任意m个班学生(每班n个学生)的某门课的成绩,计算最高分,并指出具有该最高分成绩的学生是第几个班的第几个学生。其中,m和n的值由用户从键盘任意输入(不限定m和n的上限值)。程序的运行结果如下所示:
Input array size m,n:
3,4↙
Input 3*4 array:
80 82 63 74↙
60 81 75 68↙
87 91 78 92↙
maxScore = 92, class = 3, number = 4
按要求在空白处填写适当的表达式或语句,使程序完整并符合题目要求。

#include  <stdio.h>
#include  <stdlib.h>
void InputScore(int *p, int m, int n);
int  FindMax(int *p, int m, int n, int *pRow, int *pCol);
int main()
{ int  *pScore, m, n, maxScore, row, col;printf("Input array size m,n:\n");scanf("%d,%d", &m, &n);  ___________________; /* 申请动态内存 */if (pScore == NULL) {printf("No enough memory!\n");exit(0); }InputScore(pScore, m, n);maxScore = FindMax(________________);printf("maxScore = %d, class = %d, number = %d\n", maxScore, row+1, col+1);                              free(pScore);                                      /* 释放动态内存 */return 0;
}/* 函数功能:输入m行n列二维数组的值 */
void InputScore(_______, int m, int n)
{int i, j;printf("Input %d*%d array:\n", m, n);for (i=0; i<m; i++){for (j=0; j<n; j++){scanf("%d", _________); }}
}
/*  函数功能:计算任意m行n列二维数组中元素的最大值,并指出其所在行列下标值 */
int  FindMax(int *p, int m, int n, int *pRow, int *pCol)
{int  i, j, max = p[0];__________; __________;                   for (i=0; i<m; i++){for (j=0; j<n; j++){if (___________)        {max = p[i*n+j];*pRow = i;       /*记录行下标*/*pCol = j;             /*记录列下标*/} }  }  return max;
}
  1. 输入格式:
    输入数组大小格式:"%d,%d"
    输入数组元素格式:"%d"
    输出格式
    输入数组大小的提示信息:“Input array size m,n:\n”
    输入数组元素的提示信息:“Input %d*%d array:\n”
    输出数据格式:“maxScore = %d, class = %d, number = %d\n”

代码实现

#include  <stdio.h>
#include  <stdlib.h>
void InputScore(int *p, int m, int n);
int  FindMax(int *p, int m, int n, int *pRow, int *pCol);
int main()
{int  *pScore, m, n, maxScore, row, col;printf("Input array size m,n:\n");scanf("%d,%d", &m, &n);pScore=(int*)malloc(m*n*sizeof(int)); /* 申请动态内存 */if (pScore == NULL){printf("No enough memory!\n");exit(0);}InputScore(pScore, m, n);maxScore = FindMax(pScore,m,n,&row,&col);printf("maxScore = %d, class = %d, number = %d\n", maxScore, row+1, col+1);free(pScore);                                      /* 释放动态内存 */return 0;
}/* 函数功能:输入m行n列二维数组的值 */
void InputScore(int *p, int m, int n)
{int i, j;printf("Input %d*%d array:\n", m, n);for (i=0; i<m; i++){for (j=0; j<n; j++){scanf("%d",p+i*n+j);}}
}
/*  函数功能:计算任意m行n列二维数组中元素的最大值,并指出其所在行列下标值 */
int  FindMax(int *p, int m, int n, int *pRow, int *pCol)
{int  i, j, max = p[0];*pRow=0;*pCol=0;for (i=0; i<m; i++){for (j=0; j<n; j++){if (p[i*n+j]>max){max = p[i*n+j];*pRow = i;       /*记录行下标*/*pCol = j;             /*记录列下标*/}}}return max;
}

3. 程序改错

题目内容
下面程序的功能是输入m个学生(最多为30人)n门课程(最多为5门)的成绩,然后计算并打印每个学生各门课的总分和平均分。其中,m和n的值由用户从键盘输入。希望的运行结果为:
程序运行结果如下:
How many students?
4↙
How many courses?
3↙
Input scores:
60 60 60↙
70 70 70↙
80 80 80↙
90 90 90↙
Result:
60 60 60 180 60.0
70 70 70 210 70.0
80 80 80 240 80.0
90 90 90 270 90.0
目前程序存在错误,请找出错误所在并加以改正。

#include  <stdio.h>
#define STUD   30      /* 最多可能的学生人数 */
#define COURSE 5       /* 最多可能的考试科目数 */
void  Total(int *pScore, int sum[], float aver[], int m, int n);
void  Print(int *pScore, int sum[], float aver[], int m, int n);
int main()
{int     i, j, m, n, score[STUD][COURSE], sum[STUD];float   aver[STUD];printf("How many students?");scanf("%d", &m);printf("How many courses?");scanf("%d", &n);printf("Input scores:\n");for (i=0; i<m; i++){for (j=0; j<n; j++){scanf("%d", &score[i][j]);}}Total(*score, sum, aver, m, n);Print(*score, sum, aver, m, n);return 0;
}
void  Total(int *pScore, int sum[], float aver[], int m, int n)
{int  i, j;for (i=0; i<m; i++){sum[i] = 0;for (j=0; j<n; j++){sum[i] = sum[i] + pScore[i*n+j];}aver[i] = (float) sum[i] / n;}
}
void  Print(int *pScore, int sum[], float aver[], int m, int n)
{int  i, j;printf("Result:\n");for (i=0; i<m; i++){for (j=0; j<n; j++){printf("%4d\t", pScore[i*n+j]);}printf("%5d\t%6.1f\n", sum[i], aver[i]);}
}
  1. 输入格式:
    学生人数、课程数、成绩的输入格式都是: “%d”
    输出格式
    输入学生人数提示信息:“How many students?\n”
    输入课程数提示信息:“How many courses?\n”
    输入成绩的提示信息:“Input scores:\n”
    输出结果的提示信息: “Result:\n”
    每个学生每门课成绩的输出格式: “%4d”
    总分和平均分的输出格式: “%5d%6.1f\n”

代码实现

#include  <stdio.h>
#define STUD   30      /* 最多可能的学生人数 */
#define COURSE 5       /* 最多可能的考试科目数 */
void  Total(int *pScore, int sum[], float aver[], int m, int n);
void  Print(int *pScore, int sum[], float aver[], int m, int n);
int main()
{int     i, j, m, n, score[STUD][COURSE], sum[STUD];float   aver[STUD];printf("How many students?\n");scanf("%d", &m);printf("How many courses?\n");scanf("%d", &n);printf("Input scores:\n");for (i=0; i<m; i++){for (j=0; j<n; j++){scanf("%d", &score[i][j]);}}Total(*score, sum, aver, m, n);Print(*score, sum, aver, m, n);return 0;
}
void  Total(int *pScore, int sum[], float aver[], int m, int n)
{int  i, j;for (i=0; i<m; i++){sum[i] = 0;for (j=0; j<n; j++){sum[i] = sum[i] + pScore[i*COURSE+j];}aver[i] = (float) sum[i] / n;}
}
void  Print(int *pScore, int sum[], float aver[], int m, int n)
{int  i, j;printf("Result:\n");for (i=0; i<m; i++){for (j=0; j<n; j++){printf("%4d", pScore[i*COURSE+j]);}printf("%5d%6.1f\n", sum[i], aver[i]);}
}

4. 矩阵转置

题目内容
下面程序的功能是用二维数组的列指针作为函数实参,计算并输出m×n阶矩阵的转置矩阵。其中,m和n的值由用户从键盘输入。已知m和n的值都不超过10。程序的运行结果如下所示:
Input m, n:
4,5↙
Input 4*5 matrix:
45 89 90 26 65↙
21 34 56 77 99↙
31 25 62 50 46↙
78 69 84 73 15↙
The transposed matrix is:
45 21 31 78
89 34 25 69
90 56 62 84
26 77 50 73
65 99 46 15
按要求在空白处填写适当的表达式或语句,使程序完整并符合题目要求。

#include <stdio.h>
#define M 10
#define N 10
void Transpose(int *a, int *at, int m, int n);
void InputMatrix(int *a, int m, int n);
void PrintMatrix(int *at, int n, int m);
int main()
{int s[M][N], st[N][M], m, n;printf("Input m, n:");scanf("%d,%d", &m, &n);InputMatrix(____, m, n);Transpose(______________);printf("The transposed matrix is:\n");PrintMatrix(*st, n,  m); return 0;
}
/* 函数功能:计算m*n矩阵a的转置矩阵at */
void Transpose(int *a, int *at, int m, int n)
{ int i, j;for (i=0; i<m; i++){for (j=0; j<n; j++){_____________;}}
}
/* 函数功能:输入m*n矩阵a的值 */
void InputMatrix(int *a, int m, int n)
{int i, j;printf("Input %d*%d matrix:\n", m, n);for (i=0; i<m; i++){for (j=0; j<n; j++){scanf("%d", ____________); }}
}
/* 函数功能:输出n*m矩阵at的值 */
void PrintMatrix(int *at, int n, int m)
{int i, j;for (i=0; i<n; i++){for (j=0; j<m; j++){printf("%-5d", ____________);}printf("\n");}
}
  1. 输入格式:
    矩阵大小的输入格式:"%d,%d"
    矩阵元素的输入格式:"%d"
    输出格式:
    输入矩阵大小的提示信息:“Input m, n:\n”
    输入矩阵元素的提示信息:“Input %d*%d matrix:\n”
    输出转置矩阵的提示信息:“The transposed matrix is:\n”
    转置后矩阵元素的输出格式:"%-5d"

代码实现

#include <stdio.h>
#define M 10
#define N 10
void Transpose(int *a, int *at, int m, int n);
void InputMatrix(int *a, int m, int n);
void PrintMatrix(int *at, int n, int m);
int main()
{int s[M][N], st[N][M], m, n;printf("Input m, n:\n");scanf("%d,%d", &m, &n);InputMatrix(*s, m, n);Transpose(*s, *st, m, n);printf("The transposed matrix is:\n");PrintMatrix(*st, n,  m);return 0;
}
/* 函数功能:计算m*n矩阵a的转置矩阵at */
void Transpose(int *a, int *at, int m, int n)
{int i, j;for (i=0; i<m; i++){for (j=0; j<n; j++){*(at+j*N+i)=*(a+i*M+j);}}
}
/* 函数功能:输入m*n矩阵a的值 */
void InputMatrix(int *a, int m, int n)
{int i, j;printf("Input %d*%d matrix:\n", m, n);for (i=0; i<m; i++){for (j=0; j<n; j++){scanf("%d",a+i*M+j);}}
}
/* 函数功能:输出n*m矩阵at的值 */
void PrintMatrix(int *at, int n, int m)
{int i, j;for (i=0; i<n; i++){for (j=0; j<m; j++){printf("%-5d",*(at+i*N+j));}printf("\n");}
}

5. 在升序排序的数组中插入一个元素

题目内容
用函数编程实现在一个按升序排序的数组中查找x应插入的位置,将x插入数组中,使数组元素仍按升序排列。
提示:插入(Insertion)是数组的基本操作之一。插入法排序算法的关键在于要找到正确的插入位置,然后依次移动插入位置及其后的所有元素,腾出这个位置放入待插入的元素。插入排序的原理如图所示:
程序运行结果示例:
Input array size:
5↙
Input array:
1 3 5 7 9↙
Input x:
4↙
After insert 4:
1 3 4 5 7 9
输入格式:
插入前数组元素个数、数组元素、待插入的元素x的输入格式都是:"%d"
输出格式:
输入插入前数组元素个数提示信息:“Input array size:\n”
输入插入前已按升序排序的数组元素提示信息:“Input array:\n”
输入待插入的元素x提示信息:“Input x:\n”
输出插入x后的数组元素提示信息:“After insert %d:\n”
数组元素输出格式:"%4d"

代码实现

#include <stdio.h>
#include <string.h>
int FF(int a[], int x, int n);
int main()
{int i, n;printf("Input array size:\n");scanf("%d",&n);int a[n+1], x, t;printf("Input array:\n");for(i = 0; i < n; i++){scanf("%d", &a[i]);}printf("Input x:\n");scanf("%d",&x);t = FF(a,x,n);for(i=n;i>t;i--){a[i]=a[i-1];}a[t] = x;printf("After insert %d:\n");for(i=0;i<n+1;i++){printf("%4d",a[i]);}
}
int FF(int a[], int x, int n)
{int i;for(i = 0; i < n-1; i++){if(x < a[0])return 0;if(x > a[n-1])return n-1;for(i = 0; i < n-1; i++){if(x<a[i+1] && x>a[i])return i+1;}}
}

6. 计算平均数、中位数和众数

题目内容
在调查数据分析(Survey data analysis)中经常需要计算平均数、中位数和众数。用函数编程计算40个输入数据(是取值1—10之间的任意整数)的平均数(Mean)、中位数(Median)和众数(Mode)。中位数指的是排列在数组中间的数。众数是数组中出现次数最多的那个数(不考虑两个或两个以上的输入数据出现次数相同的情况)。
提示:计算中位数时,首先要调用排序函数对数组按升序进行排序,然后取出排序后数组中间位置的元素answer[n/2] ,就得到了中位数。如果数组元素的个数是偶数,那么中位数就等于数组中间那两个元素的算术平均值。众数就是40个输入数据中出现次数最多的那个数。计算众数时,首先要统计不同取值的输入数据出现的次数,然后找出出现次数最多的那个数据,这个数据就是众数(这里没有考虑两个或者两个以上的输入数据出现次数相同的情况)。
程序运行结果示例:
Input the feedbacks of 40 students:
10 9 10 8 7 6 5 10 9 8↙
8 9 7 6 10 9 8 8 7 7↙
6 6 8 8 9 9 10 8 7 7↙
9 8 7 9 7 6 5 9 8 7↙
Mean value=7
Median value=8
Mode value=8
输入格式: “%d”
输出格式
输入数据的提示信息:“Input the feedbacks of 40 students:\n”
平均数输出:“Mean value=%d\n”
中位数输出:“Median value=%d\n”
众数输出: “Mode value=%d\n”

代码实现

#include<stdio.h>
#include<stdlib.h>
int cmp(const void* a,const void* b)
{const int *x = (const int*)a;const int *y = (const int*)b;if(*x -*y == 0)return 0;else if(*x - *y > 0)return 1;elsereturn -1;
}
int Mean(int a[], int n);
int Median(int a[], int n);
int Mode(int a[], int n);
int main()
{int stu[40] = {0};int mean,med,mode;printf("Input the feedbacks of 40 students:\n");for(int i = 0; i < 40; i++)scanf("%d",&stu[i]);mean = Mean(stu,40);med = Median(stu,40);mode = Mode(stu,40);printf("Mean value=%d\n",mean);printf("Median value=%d\n",med);printf("Mode value=%d\n",mode);return 0;
}int Mean(int a[], int n)
{int i,sum = 0;for(i = 0; i < n; i++)sum += a[i];return sum / n;
}int Median(int a[], int n)
{qsort(a,n,sizeof(int),cmp);return a[n/2];
}int Mode(int a[], int n)
{int num[11] = {0};int max = 0;int pos = 1;for(int i = 0; i < n; i++)num[a[i]]++;for(int i = 1; i <= 10; i++){if(num[i] > max){max = num[i];pos = i;}}return pos;
}

哈工大C语言程序设计精髓第十三周相关推荐

  1. 哈工大C语言程序设计精髓 第十一周编程题

    C语言程序设计精髓 第十一周 指针的孪生兄弟 从这一章开始难度才算是真正开始加大了,前面可以说都在过家家. 练兵区--编程题--不计入总分 1找出按字典顺序排在最前面的国名(4分) 题目内容: 输入5 ...

  2. 哈工大C语言程序设计精髓第三周

    由于这些代码也是我初学时写的代码,故其中的规范程度及简洁程度并不很好(此处我后来写的有可以参考一下->C语言代码规范),但是能很好的接近出初学者的水平,也更有参考价值!排版不易,喜欢就点个赞吧! ...

  3. 哈工大C语言程序设计精髓第六周

    由于这些代码也是我初学时写的代码,故其中的规范程度及简洁程度并不很好(此处我后来写的有可以参考一下->C语言代码规范),但是能很好的接近出初学者的水平,也更有参考价值!排版不易,喜欢就点个赞吧! ...

  4. 哈工大C语言程序设计精髓第五周

    由于这些代码也是我初学时写的代码,故其中的规范程度及简洁程度并不很好(此处我后来写的有可以参考一下->C语言代码规范),但是能很好的接近出初学者的水平,也更有参考价值!排版不易,喜欢就点个赞吧! ...

  5. 哈工大c语言编程题中国大学mooc第四周,中国大学MOOC哈工大C语言程序设计精髓第六周编程题答案.doc...

    下面代码的功能是将百分制成绩转换为 5 分制成绩,具体功能是: 如果用户输入的是 非法 字符或者不在合理区间内的数据 (例如输入的是 a,或者 102 ,或-45 等),则程序输出 Input err ...

  6. 哈工大C语言程序设计精髓MOOC 第十三周编程题

    第13周--原来内存也可以这么玩,我是指针我怕谁 练兵区--编程题--不计入总分 2寻找最高分成绩的学生(4分) 题目内容: 下面程序的功能是用动态数组编程输入任意m个班学生(每班n个学生)的某门课的 ...

  7. 中国大学(慕课)哈工大C语言程序设计精髓练兵区第二周

    这是第二周的 难度区别于第一周 1 输出逆序数 题目内容: 从键盘任意输入一个3位整数,编程计算并输出它的逆序数(忽略整数前的正负号).例如,输入-123,则忽略负号,由123分离出其百位1.十位2. ...

  8. MOOC哈工大2020C语言程序设计精髓练兵区编程题第九周

    1 二分法求根(4分) 题目内容: 用二分法求下面的一元三次方程在区间[-10, 10]上误差不大于的根. 用二分法求方程的根的基本原理是:若函数有实根,则函数曲线应当在根x*这一点上与x轴有一个交点 ...

  9. MOOC哈工大2020C语言程序设计精髓编程题在线测试第五周

    1 马克思手稿中的趣味数学题(4分) 题目内容: 编程求解马克思手稿中的趣味数学题:有30个人,其中有男人.女人和小孩,在一家饭馆里吃饭共花了50先令,每个男人各花3先令,每个女人各花2先令,每个小孩 ...

最新文章

  1. POJ-1724 深搜剪枝
  2. Fragment 生命周期的详情
  3. 2022年全球及中国光纤馈通件行业发展建议与十四五规划动向展望报告
  4. linux实验四文件安全,西北农林科技大学Linux实验四 用户和文件安全
  5. Java 多线程 —— 死锁与锁的错误用法
  6. RPMB原理介绍【转】
  7. 每日一程-4. PyQt5-实现显示和业务逻辑分离
  8. 100w条数据插入Mysql 数据库,耗时仅10s
  9. word 转换pdf 插件
  10. 一次搞定各种数据库 SQL 执行计划:MySQL、Oracle、SQL Server、PostgreSQL 以及 SQLite
  11. c#控制台应用程序读取 config
  12. 腾讯力作!iOS 9 人机界面指南(5):图标与图形设计
  13. linux那些事之copy on write(COW)
  14. 九个实用的Word转PDF的方法,为你解决格式转换的问题
  15. 软考c语言题库,【中级】软考题库每日一练|4.4
  16. 苹果蓝牙耳机使用说明_苹果蓝牙耳机怎么用
  17. Objective-C学习笔记(二)——OC基本语法概述
  18. Linux显示2015年日历表
  19. 几个维度带你了解什么是聚合支付
  20. 戴尔服务器r510怎么系统,DELLR510服务器上安系统.docx

热门文章

  1. 基于51单片机和物联网的智能家居系统(ESP8266物联网模块)
  2. 节俭生活-如何让机票打两折
  3. Keyword Spotting (KWS) | Deep Spoken Keyword Spotting: An Overview
  4. PLG SaaS 案例:如何实践外链自动增长策略?
  5. Collections、Set、Map、斗地主排序
  6. EPOCH、INTERATION、BATCH_SIZE的区别
  7. 如何教机器学会原研哉(小米新LOGO)的设计理念
  8. 数据库相关基础知识总结
  9. mysql多线程复制crash_MySQL 并行复制(MTS) 从库发生异常crash分析
  10. 无人驾驶带动激光雷达降价,考古学家“拖了千年的作业”有指望了