题目内容:
某班有最多不超过30人(具体人数由键盘输入)参加期末考试,最多不超过6门(具体门数由键盘输入)。参考学生成绩管理系统V3.0,用二维数组作函数参数编程实现如下菜单驱动的学生成绩管理系统:
(1)录入每个学生的学号、姓名和各科考试成绩;
(2)计算每门课程的总分和平均分;
(3)计算每个学生的总分和平均分;
(4)按每个学生的总分由高到低排出名次表;
(5)按每个学生的总分由低到高排出名次表;
(6)按学号由小到大排出成绩表;
(7)按姓名的字典顺序排出成绩表;
(8)按学号查询学生排名及其各科考试成绩;
(9)按姓名查询学生排名及其各科考试成绩;
(10)按优秀(90 ~ 100)、良好(80 ~ 89)、中等(70 ~ 79)、及格(60 ~ 69)、不及格(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) ;
下面是程序运行示例:
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"
为避免出现格式错误,请直接拷贝粘贴题目中给的格式字符串和提示信息到你的程序中。
时间限制:500ms内存限制:32000kb
C
#include
#include
#include
#include
#define MAX_LEN 10 /* 字符串最大长度 */
#define STU_NUM 30 /* 最多的学生人数 */
#define COURSE_NUM 6 /* 最多的考试科目数 */
int n; //represent students number
int m; //课程数
float sum[COURSE_NUM], aver[COURSE_NUM];//每门课程的总分和成绩
typedef struct student{
long int stuID;
char name[MAX_LEN];
float score[COURSE_NUM];
float sum, aver;
}STUDENT;
STUDENT stu[STU_NUM];
//0 代表降序 1代表升序
int cmpByScore1(const void *a, const void *b){
STUDENT *s1 = (STUDENT *)a;
STUDENT *s2 = (STUDENT *)b;
return s1->sum - s2->sum;
}
int cmpByScore0(const void *a, const void *b){
STUDENT *s1 = (STUDENT *)a;
STUDENT *s2 = (STUDENT *)b;
return s2->sum - s1->sum;
}
int cmpByNumber0(const void *a, const void *b){
STUDENT *s1 = (STUDENT *)a;
STUDENT *s2 = (STUDENT *)b;
return s2->stuID - s1->stuID;
}
int cmpByNumber1(const void *a, const void *b){
STUDENT *s1 = (STUDENT *)a;
STUDENT *s2 = (STUDENT *)b;
return s1->stuID - s2->stuID;
}
int cmpByName1(const void *a, const void *b){
STUDENT *s1 = (STUDENT *)a;
STUDENT *s2 = (STUDENT *)b;
if(strcmp(s1->name, s2->name) >0 ) return 1;
else return -1;
}
int cmpByName0(const void *a, const void *b){
STUDENT *s1 = (STUDENT *)a;
STUDENT *s2 = (STUDENT *)b;
if(strcmp(s1->name, s2->name) <0 ) return 1;
else return -1;
}
void menu();
void inputRecord();
void calcStudent();
void calcCourse();
void sortByScore(int order);
void sortByNumber(int order);
void sortByName(int order);
void searchByNumber();
void searchByName();
void analysis();
void print();
void Exit();
int main()
{
printf("Input student number(n<30):\n");
scanf("%d", &n);
while(1){
menu();
}
}
void menu(){
printf("Management for Students' scores\n");
printf("1.Input record\n");
printf("2.Caculate total and average score of every course\n");
printf("3.Caculate total and average score of every student\n");
printf("4.Sort in descending order by score\n");
printf("5.Sort in ascending order by score\n");
printf("6.Sort in ascending order by number\n");
printf("7.Sort in dictionary order by name\n");
printf("8.Search by number\n");
printf("9.Search by name\n");
printf("10.Statistic analysis\n");
printf("11.List record\n");
printf("0.Exit\n");
printf("Please Input your choice:\n");
int choice;
scanf("%d", &choice);
switch(choice){
case 1: inputRecord(); break;
case 2: calcCourse(); break;
case 3: calcStudent(); break;
case 4: sortByScore(0); break;
case 5: sortByScore(1); break;
case 6: sortByNumber(1); break;
case 7: sortByName(1); break;
case 8: searchByNumber(); break;
case 9: searchByName(); break;
case 10: analysis(); break;
case 11: print(); break;
case 0: Exit();break;
default: printf("Input error!\n");
}
}
void inputRecord(){
printf("Input course number(m<=6):\n");
scanf("%d", &m);
printf("Input student's ID, name and score:\n");
int i, j;
for(i=0; i<n; ++i){
scanf("%ld%s", &stu[i].stuID, stu[i].name);
stu[i].sum=0;
for(j=0; j<m; ++j){
scanf("%f",&stu[i].score[j]);
stu[i].sum+=stu[i].score[j];
}
stu[i].aver=stu[i].sum/(float)m;
}
}
void calcCourse(){
int i, j;
for(j=0; j<m; ++j){
sum[j]=0;
for(i=0; i<n; ++i){
sum[j]+=stu[i].score[j];
}
aver[j]=sum[j]/(float)n;
printf("course %d:sum=%.0f,aver=%.0f\n",j+1, sum[j], aver[j]);
}
}
void calcStudent(){
int i;
for(i=0; i<n; ++i){
printf("student %d:sum=%.0f,aver=%.0f\n", i+1, stu[i].sum, stu[i].aver);
}
}
void sortByScore(int order){
//0 代表降序 1代表升序
if(order){
printf("Sort in ascending order by score:\n");
qsort(stu, n, sizeof(stu[0]),cmpByScore1);
} else {
printf("Sort in descending order by score:\n");
qsort(stu, n, sizeof(stu[0]),cmpByScore0);
}
print();
}
void sortByNumber(int order){
//0 代表降序 1代表升序
if(order){
printf("Sort in ascending order by number:\n");
qsort(stu, n, sizeof(stu[0]),cmpByNumber1);
} else {
printf("Sort in descending order by number:\n");
qsort(stu, n, sizeof(stu[0]),cmpByNumber0);
}
print();
}
void sortByName(int order){
//0 代表降序 1代表升序
if(order){
printf("Sort in dictionary order by name:\n");
qsort(stu, n, sizeof(stu[0]),cmpByName1);
} else {
printf("Sort in dictionary order by name:\n");
qsort(stu, n, sizeof(stu[0]),cmpByName0);
}
print();
}
void searchByNumber(){
printf("Input the number you want to search:\n");
long int id;
scanf("%ld", &id);
int i, j;
for(i=0; i<n; ++i){
if(stu[i].stuID==id){
printf("%ld\t%s\t", stu[i].stuID, stu[i].name);
for(j=0; j<m; ++j){
printf("%.0f\t", stu[i].score[j]);
}
printf("%.0f\t%.0f\n", stu[i].sum, stu[i].aver);
return;
}
}
printf("Not found!\n");
}
void searchByName(){
printf("Input the name you want to search:\n");
char name[MAX_LEN];
scanf("%s", name);
int i, j;
for(i=0; i<n; ++i){
if(strcmp(stu[i].name, name)==0){
printf("%ld\t%s\t", stu[i].stuID, stu[i].name);
for(j=0; j<m; ++j){
printf("%.0f\t", stu[i].score[j]);
}
printf("%.0f\t%.0f\n", stu[i].sum, stu[i].aver);
return;
}
}
printf("Not found!\n");
}
void analysis(){
int i, j;
for(j=0; j<m; ++j){
printf( "For course %d:\n", j+1);
int cnt[6]={0};
for(i=0; i<n; ++i){
if(stu[i].score[j]>=100) cnt[5]++;
else if(stu[i].score[j]>=90) cnt[0]++;
else if(stu[i].score[j]>=80) cnt[1]++;
else if(stu[i].score[j]>=70) cnt[2]++;
else if(stu[i].score[j]>=60) cnt[3]++;
else cnt[4]++;
}
printf("<60\t%d\t%.2f%%\n", cnt[4], 100*(float)cnt[4]/n);
printf("%d-%d\t%d\t%.2f%%\n", 60, 69, cnt[3], 100*(float)cnt[3]/n);
printf("%d-%d\t%d\t%.2f%%\n", 70, 79, cnt[2], 100*(float)cnt[2]/n);
printf("%d-%d\t%d\t%.2f%%\n", 80, 89, cnt[1], 100*(float)cnt[1]/n);
printf("%d-%d\t%d\t%.2f%%\n", 90, 99, cnt[0], 100*(float)cnt[0]/n);
printf("%d\t%d\t%.2f%%\n", 100, cnt[5], 100*(float)cnt[5]/n);
}
}
void print(){
int i, j;
for(i=0; i<n; ++i){
printf("%ld\t%s\t", stu[i].stuID, stu[i].name );
for(j=0; j<m; ++j){
printf("%.0f\t", stu[i].score[j]);
}
printf("%.0f\t%.0f\n", stu[i].sum, stu[i].aver);
}
}
void Exit(){
printf("End of program!\n");
exit(0);
}
用例测试结果 运行时间 占用内存 提示 得分
用例1通过 2ms 256kb
2
用例2通过 1ms 256kb
2
提交答案本次得分/总分:4.00/4.00分
题目内容:
下面程序的功能是用动态数组编程输入任意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
#include
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;
}
输入格式:
输入数组大小格式:"%d,%d"
输入数组元素格式:"%d"
输出格式:
输入数组大小的提示信息:“Input array size m,n:\n”
输入数组元素的提示信息:“Input %d*%d array:\n”
输出数据格式:“maxScore = %d, class = %d, number = %d\n”
为避免出现格式错误,请直接拷贝粘贴题目中给的格式字符串和提示信息到你的程序中。
时间限制:500ms内存限制:32000kb
C
#include
#include
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 ( max < p[i*n+j])
{
max = p[i*n+j];
*pRow = i; /*记录行下标*/
*pCol = j; /*记录列下标*/
}
}
}
return max;
}
用例测试结果 运行时间 占用内存 提示 得分
用例1通过 2ms 256kb
2
用例2通过 2ms 256kb
2
提交答案本次得分/总分:4.00/4.00分
题目内容:
下面程序的功能是输入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
#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]);
}
}
输入格式:
学生人数、课程数、成绩的输入格式都是: “%d”
输出格式:
输入学生人数提示信息:“How many students?\n”
输入课程数提示信息:“How many courses?\n”
输入成绩的提示信息:“Input scores:\n”
输出结果的提示信息: “Result:\n”
每个学生每门课成绩的输出格式: “%4d”
总分和平均分的输出格式: “%5d%6.1f\n”
为避免出现格式错误,请直接拷贝粘贴题目中给的格式字符串和提示信息到你的程序中。
时间限制:500ms内存限制:32000kb
C
#include
#define STUD 30 /* 最多可能的学生人数 */
#define COURSE 5 /* 最多可能的考试科目数 */
void Total(int pScore[][COURSE], int sum[], float aver[], int m, int n);
void Print(int pScore[][COURSE], 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[][COURSE], 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][j];
}
aver[i] = (float) sum[i] / n;
}
}
void Print(int pScore[][COURSE], 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][j]);
}
printf("%5d%6.1f\n", sum[i], aver[i]);
}
}
用例测试结果 运行时间 占用内存 提示 得分
用例1通过 1ms 256kb
2
用例2通过 2ms 256kb
2
提交答案本次得分/总分:4.00/4.00分
题目内容:
下面程序的功能是用二维数组的列指针作为函数实参,计算并输出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
#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");
}
}
输入格式:
矩阵大小的输入格式:"%d,%d"
矩阵元素的输入格式:"%d"
输出格式:
输入矩阵大小的提示信息:“Input m, n:\n”
输入矩阵元素的提示信息:“Input %d*%d matrix:\n”
输出转置矩阵的提示信息:“The transposed matrix is:\n”
转置后矩阵元素的输出格式:"%-5d"
为避免出现格式错误,请直接拷贝粘贴题目中给的格式字符串和提示信息到你的程序中。
时间限制:500ms内存限制:32000kb
C
#include
#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*M+i] = a[i*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", &a[i*N+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*M+j]);
}
printf("\n");
}
}
用例测试结果 运行时间 占用内存 提示 得分
用例1通过 2ms 256kb
2
用例2通过 1ms 256kb
2
提交答案本次得分/总分:4.00/4.00分
题目内容:
用函数编程实现在一个按升序排序的数组中查找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"
为避免出现格式错误,请直接拷贝粘贴题目中给的格式字符串和提示信息到你的程序中。
时间限制:500ms内存限制:32000kb
C
#include
#define MAXN 100
int main()
{
int a[MAXN], n, x, i;
printf("Input array size:\n");
scanf("%d", &n);
printf("Input array:\n");
for(i=0; i<n; ++i){
scanf("%d", &a[i]);
}
printf("Input x:\n");
scanf("%d", &x);
for(i=n-1; i>=0; --i){
if(a[i]>x) a[i+1]=a[i];
else {
a[i+1]=x;
break;
}
}
printf("After insert %d:\n", x);
for(i=0; i<n+1; ++i){
printf("%4d", a[i]);
}
}
用例测试结果 运行时间 占用内存 提示 得分
用例1通过 1ms 256kb
2
用例2通过 1ms 256kb
2
提交答案本次得分/总分:4.00/4.00分
题目内容:
在调查数据分析(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”
为避免出现格式错误,请直接拷贝粘贴题目中给的格式字符串和提示信息到你的程序中。
时间限制:500ms内存限制:32000kb
C
#include
#include
#define MAXN 100
int cmp(const void *a, const void *b){
return *(int *)a - *(int *)b;
}
int main()
{
int a[40], cnt[11]={0}, sum=0, mean, median, mode;
printf("Input the feedbacks of 40 students:\n");
for(int i=0; i<40; ++i){
scanf("%d", &a[i]);
sum+=a[i];
cnt[a[i]]++;
}
mean = sum / 40;
qsort(a, 40, sizeof(int), cmp);
cnt[0]=cnt[1];
for(int i=1; i<11; ++i){
if(cnt[0] < cnt[i]){
cnt[0] = cnt[i];
mode = i;
}
}
median = (a[20] + a[19]) / 2;
printf("Mean value=%d\n", mean);
printf("Median value=%d\n", median);
printf( "Mode value=%d\n", mode);
}
用例测试结果 运行时间 占用内存 提示 得分
用例1通过 2ms 256kb
2
用例2通过 2ms 256kb
2
提交答案本次得分/总分:4.00/4.00分