task4
程序源码
#include<stdio.h> #include<string.h> #include<stdlib.h> #define N 100 typedef struct{ char num[10]; int s1; int s2; double sum; char level[10]; }STU; int fun(STU a[],int n, STU h[]); int main(){ STU s[N]={{"GA05",85,76}, {"GA03",76,90}, {"GA02",69,90}, {"GA04",85,56}, {"GA01",91,95}, {"GA07",72,80}, {"GA08",64,45}, {"GA06",87,98}, {"GA015",85,86}, {"GA013",91,97}}; STU h[N]; int i,k,n=10; k=fun(s,n,h); printf("There are :\n"); for(i=0;i<k;i++) printf("%s %d %d %.2f %s\n", h[i].num,h[i].s1,h[i].s2,h[i].sum,h[i].level); system("pause"); return 0; } int fun(STU a[],int n,STU h[]){ int i,k=0; double averge=0,sum=0; for(i=0;i<n;i++) {a[i].sum =0.7*(a[i].s1 )+(a[i].s2)*0.3; } for(i=0;i<n;i++) sum=a[i].sum+sum; averge=sum/n; for(i=0;i<n;i++) { if((a[i].sum )>averge) { strcpy(h[k].num,a[i].num); h[k].s1 =a[i].s1 ; h[k].s2=a[i].s2; h[k].sum=a[i].sum; strcpy(h[k].level,"均分以上"); k++;}} return k;}
实验截图
task5
程序源码
#include <stdio.h> #include <string.h> #include<stdlib.h> #define N 5 typedef struct student { char name[10]; int num; int maths; int computer; int english; int sum; char level[10]; } STU; void fun(STU a[], int n); // 函数声明 int main() { STU s[6*N]={ {"A001", 1, 34, 67, 80}, {"B003", 3, 78, 87, 90}, {"A002", 2, 90, 98, 99}, {"B002", 4, 56, 78, 98}, {"A005", 5, 35, 67, 79} }; int i; fun(s, N); for(i = 0; i < N; i++) printf("%s %d %d %d %d %d %s\n", s[i].name, s[i].num, s[i].maths, s[i].computer, s[i].english, s[i].sum, s[i].level); system("pause"); return 0; } void fun(STU a[], int n) { int j,high,low; for(j=0;j<n;j++) { a[j].sum=a[j].maths+a[j].computer+a[j].english;} high=a[0].sum; low=a[0].sum; for(j=0;j<n;j++) {if(a[j].sum>high) {high=a[j].sum;} if(a[j].sum <=low) {low=a[j].sum;} } for(j=0;j<n;j++) {if(a[j].sum==high) strcpy(a[j].level,"优秀"); if(a[j].sum==low) strcpy(a[j].level,"不及格"); if((a[j].sum<high)&&(a[j].sum>low)) strcpy(a[j].level,"合格");}}
实验截图
task6
程序源码
#include <stdio.h> #include<string.h> #include<stdlib.h> #define N 5 // 定义结构体类型struct student, 并定义STU为其别名 typedef struct student { long no; char name[20]; int score; } STU; // 函数声明 void input(STU s[], int n); int find_min_list(STU s[], STU t[], int n); void output(STU s[], int n); int main() { STU stu[N], min_list[N]; int count; printf("录入%d个学生信息\n", N); input(stu, N); printf("\n统计最低分人数和学生信息...\n"); count = find_min_list(stu, min_list, N); printf("\n一共有%d个最低分,信息如下:\n", count); output(min_list, count); system("pause"); return 0; } // 输入n个学生信息,存放在结构体数组s中 void input(STU s[], int n) { int i; for(i=0;i<n;i++) scanf("%d %s %d",&s[i].no,&s[i].name,&s[i].score); } // 输出结构体s中n个元素信息 void output(STU s[], int n) { int i; for(i=0;i<n;i++) printf("%d %s %d \n",s[i].no,s[i].name,s[i].score); } // 在结构体数组s中,查找最低分学生的记录,将其存入结构体数组t中 // 形参n是结构体数组s中元素个数 // 函数返回最低分的学生人数 int find_min_list(STU s[], STU t[], int n) { int j,k,low; low=s[0].score; for(j=0;j<n;j++) {if(s[j].score<low) {low=s[j].score;}} for(j=0,k=0;j<n;j++) { if(s[j].score==low) {t[k].no=s[j].no; strcpy(t[k].name,s[j].name); t[k].score=s[j].score; k++; }} return k; }
实验截图
标签:,10,int,sum,STU,include,void From: https://www.cnblogs.com/dmdshuangxu/p/17444757.html