#include <stdio.h> #include<string.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; // 调用fun对学生成绩记录进行处理 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); return 0; }
// 函数定义 // 功能:对包含n条学生成绩记录的数组a进行处理: // 计算总评成绩,统计等级为"均分以上"的学生记录保存到数组h中,并返回其人数 int fun (STU a[], int n, STU h[]) { int i, j = 0; double av = 0.0; for (i = 0; i < n; i++) { a[i].sum = 0.7 * a[i].s1 + 0.3 * a[i].s2; } for (i = 0; i < n; i++) { av = av + a[i].sum; } av = av / n; for (i = 0; i < n; i++) if (a[i].sum > av) { strcpy(a[i].level, "均分以上"); h[j] = a[i]; j++; } return j; }
![](/i/l/?n=23&i=blog/3004217/202212/3004217-20221224110935119-966793778.jpg)
#include <stdio.h> #include <string.h> #define N 10 #define M 80 typedef struct { char name[M]; // 书名 char author[M]; // 作者 } Book; int main() { Book x[N] = { {"《一九八四》", "乔治.奥威尔"}, {"《美丽新世界》", "赫胥黎"}, {"《昨日的世界》", "斯蒂芬.茨威格"}, {"《万历十五年》", "黄仁宇"}, {"《一只特立独行的猪》", "王小波"}, {"《百年孤独》", "马尔克斯"}, {"《情人》", "玛格丽特.杜拉斯"}, {"《只是孩子》", "帕蒂.史密斯"}, {"《刀锋》", "毛姆"}, {"《沉默的大多数》", "王小波"} }; Book *ptr; int i; char author[M]; // 使用指针遍历结构体数组 printf("所有图书信息: \n"); for(ptr = x; ptr < x + N; ++ptr) printf("%-30s%-30s\n", ptr->name, ptr->author); // 查找指定作者的图书 printf("\n输入作者名: "); gets(author); for(ptr = x; ptr < x + N; ++ptr) if(strcmp(ptr->author, author) == 0) { printf("%-30s%-30s\n", ptr->name, ptr->author); } return 0; }
![](/i/l/?n=23&i=blog/3004217/202212/3004217-20221224111536299-455322556.jpg)
#include <stdio.h> #include <string.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); return 0; } void fun(STU a[], int n) { int i,max,min; STU *ptr; for(ptr = a;ptr<a+n;ptr++) ptr->sum = ptr->computer + ptr->english + ptr->maths; ptr = a; max = min = ptr->sum; for(ptr = a+1;ptr<a+n;ptr++) { if(ptr->sum>max) max = ptr->sum; if(ptr->sum<min) min = ptr->sum; } for(ptr = a;ptr<a+n;ptr++) { if(ptr->sum==max) strcpy(ptr->level,"优秀"); else if(ptr->sum==min) strcpy(ptr->level,"不及格");
else strcpy(ptr->level,"及格"); } }
![](/i/l/?n=23&i=blog/3004217/202212/3004217-20221224112046755-738600849.png)
#include <stdio.h> #define N 5 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); return 0; } void input(STU s[], int n) { int i; for(i=0;i<n;i++) scanf("%ld%s%d",&s[i].no,s[i].name,&s[i].score); } void output(STU s[], int n) { int i; for(i=0;i<n;i++) printf("%-6ld%-8s%-4d\n",s[i].no,s[i].name,s[i].score); } int find_min_list(STU s[], STU t[], int n) { int i; int min = s[0].score; STU *ptr; for(ptr = s+1;ptr<s+n;++ptr) if(ptr->score < min) min = ptr->score; for(ptr = s,i = 0;ptr<s+n;++ptr) if(ptr->score==min) { t[i] = *ptr; i++; } return i; }
![](/i/l/?n=23&i=blog/3004217/202212/3004217-20221224112805574-1433546937.jpg)
#include <stdio.h> #define N 5 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); return 0; } void input(STU s[], int n) { int i; for(i=0;i<n;i++) scanf("%ld%s%d",&s[i].no,s[i].name,&s[i].score); } void output(STU s[], int n) { int i; for(i=0;i<n;i++) printf("%-6ld%-8s%-4d\n",s[i].no,s[i].name,s[i].score); } int find_min_list(STU s[], STU t[], int n) { int i; int min = s[0].score; STU *ptr; for(ptr = s+1;ptr<s+n;++ptr) if(ptr->score < min) min = ptr->score; for(ptr = s,i = 0;ptr<s+n;++ptr) if(ptr->score==min) { t[i] = *ptr; i++; } return i; }
![](/i/l/?n=23&i=blog/3004217/202212/3004217-20221224113209799-1102364852.png)
标签:min,int,list,STU,实验,printf,ptr From: https://www.cnblogs.com/yuure/p/17002540.html