week12之该好好学习了-_-! 不厌其烦地打完了老师的程序

最新推荐文章于 2023-05-11 21:00:45 发布

-好好先生

最新推荐文章于 2023-05-11 21:00:45 发布

阅读量530

点赞数

该系统提供了一个用户友好的界面，用于输入、输出和查找学生成绩。包括输入学生信息、查看所有学生分数、查找最高分学生等功能。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

/* Note:Your choice is C IDE */
#include "stdio.h"
#define N 45
int inputss(char names[][20],int score[],int num);
void printss(char names[][20],int score[],int num);
void getmax(char names[][20],int score[],int num);
void main()
{
    char names[N][20];
    int score[N];
    int num=0;
    int choose;
    printf("what   do you want to   do:INPUT(1),OUTPUT(2),MAX(3),EXIT(0):" );
    scanf("%d",&choose);
    do{
    switch(choose){
      case 1:
      num=inputss(names,score,num);
      break;
      case 2:
      printss(names,score,num);
      break;
      case 3:
      getmax(names,score,num);
      break;
    }
    printf("\nwhat do you want to do:INPUT(1),OUTPUT(2),MAX(3),EXIT(0):");
    scanf("%d",&choose);
    }while(choose!=0);
    }

    int inputss(char names[][20],int score[],int num){
    int n,i;
    printf("\nThis Time, How many students do you want to input :");
    scanf("%d",&n);
    if((n+num)>N||n<1){
      printf("not vaild sum\n");
      return -1;
    }
    printf("now input as (name score):\n");
    for (i=0;i<n;i++){
      printf("%d",i);
      scanf("%s %d",&names[i+num],&score[i+num]);
    }
    printf("this time ,input is over\n");
    return num+n;}
    void printss(char names[][20],int score[],int num){
    int i;
    if(num==0){
      printf("no student now\n");
      return;
    }

    printf("\nnow the students scores as follows\n");
    for (i=0;i<num;i++)
    printf("%2d.            score:%3d\n",i,names[i],score[i]);
    }
    void getmax(char names[][20],int score[],int num){
    int i,max_index,max_score;
    if(num==0){
    printf("no student now \n");
    return;
    }
    max_index=0;
    max_score=score[0];

    for (i=1;i<num;i++)
    if(score[i]>max_score){
    max_score=score[i];
    max_index=i;
    }
    printf("the top score is %d by %s\n"
    ,score[max_index],names[max_index]);
    }