c fourth homework

6-1 Statistical student grades
1. Design ideas
(1) The first step: observe the meaning of the question to understand the meaning of each parameter and the required function in the question; the
second step: design an algorithm to write a function, and let the function of the function realize the question The function required in the
third step: run the program to check whether there is an error.
(2) Flowchart
None
2. Experimental code

#include <stdio.h>
#define MAXN 10

struct student{
    int num;
    char name[20];
    int score;
    char grade;
};

int set_grade( struct student *p, int n );

int main()
{   struct student stu[MAXN], *ptr;
    int n, i, count;

    ptr = stu;
    scanf("%d\n", &n);
    for(i = 0; i < n; i++){
       scanf("%d%s%d", &stu[i].num, stu[i].name, &stu[i].score);
    } 
   count = set_grade(ptr, n);
   printf("The count for failed (<60): %d\n", count);
   printf("The grades:\n"); 
   for(i = 0; i < n; i++)
       printf("%d %s %c\n", stu[i].num, stu[i].name, stu[i].grade);
    return 0;
}
int set_grade( struct student *p, int n )
{   int x=0,i;
    {for(i=0;i<n;i++,p++)
    if(p->score>=85&&p->score<=100)
     p->grade='A';
    else if(p->score<85&&p->score>=70)
    p->grade='B';
    else if(p->score<70&&p->score>=60)
    p->grade='C';
    else if(p->score<60&&p->score>=0)
    {p->grade='D';
    x++;}
    }
    return x;
}

3. Problems encountered in the debugging process of this question and solutions
No
gif address: https://git.coding.net/nytwasln/13131313.git
6-2 The structure array is sorted by the total score
1. Design ideas
(1) The first step : Observe the meaning of the question to understand the meaning of each parameter and the required function in the question;
Step 2: Design an algorithm to write a function, so that the function of the function realizes the function required in the question;
Step 3: Run the program to check whether there is an error.
(2) Flowchart
None
2. Experimental code

#include <stdio.h>
struct student                  
{
int num;
char name[15];
float score[3];
float sum;
};
void calc(struct student *p,int n);  
void sort(struct student *p,int n);
int main()
{
struct student stu[5];
int i,j;
float f;
for(i=0;i<5;i++)
{
    scanf("%d%s",&stu[i].num,stu[i].name);
    for(j=0;j<3;j++)
    { 
        scanf("%f",&f);
        stu[i].score[j]=f;
    }
}
calc(stu,5);
sort(stu,5);
for(i=0;i<5;i++)
{
    printf("%5d%15s",stu[i].num,stu[i].name);
    printf("  %.1f  %.1f  %.1f  %.1f\n",stu[i].score[0],stu[i].score[1],stu[i].score[2], stu[i].sum);
}
return 0;
}
void calc(struct student *p,int n)
{   int i;
    for(i=0;i<n;i++,p++)
    {
        p->sum=p->score[0]+p->score[1]+p->score[2];
    }
}
void sort(struct student *p,int n)
{   struct  student t;
    int i,j;
    for(j=0;j<n-1;j++)
    for(i=0;i<n-1-j;i++)
    if((p+i)->sum<(p+i+1)->sum)
    {t=*(p+i);
    *(p+i)=*(p+i+1);
    *(p+i+1)=t;
    }
}

gif address: https://git.coding.net/nytwasln/12121212.gitSummary
: Since this chapter is not very well studied, the topic has reference to other students, but I will read the book carefully to learn the content of this chapter more solidly

Guess you like