task4
源代码
#include <stdio.h> #include<string.h> #include<stdlib.h> #define N 100 typedef struct { char num[10];/*学号*/ int s1;/*期末成绩*/ int s2;/*平时成绩*/ float sum; /*总评*/ char level[10]; /*等级*/ } STU; int fun (STU a[],int n,STU h[]) { int i,num=0,k=0; double sum1=0.,sum2=0,sum; for(i=0;i<n;i++) { sum1=sum1+a[i].s1; sum2=sum2+a[i].s2; } sum=sum1/10*0.3+sum2/10*0.7; for(i=0;i<n;i++) { a[i].sum=a[i].s1*0.3+a[i].s2*0.7; if(a[i].sum>=sum) { strcpy(a[i].level,"均分以上"); h[k]=a[i]; k++; } } return k; } 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}},h[N]; int i,k,n=10; FILE *out,*in; 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); /******************************/ in=fopen("in70.dat","r"); out=fopen("out70.dat","w"); i=0; while(!feof(in)) { fscanf(in,"%s %d %d",s[i].num,&s[i].s1,&s[i].s2); i++; } n=i; k=fun(s,n,h); for(i=0;i<k;i++) fprintf(out,"%s %d %d %.2f %s\n",h[i].num,h[i].s1,h[i].s2,h[i].sum,h[i].level); fclose(out); fclose(in); system("pause"); return 0; }
运行结果截图
task5
源代码
#include <stdio.h> #include <string.h> #define N 5 #include<stdlib.h> 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 i,max=0,min=0; for(i=0;i<n;i++) { a[i].sum= a[i].maths+a[i].computer+ a[i].english; } for(i=0;i<n;i++) { if(a[i].sum>=a[max].sum) max=i; if(a[i].sum<=a[min].sum) min=i; } for(i=0;i<n;i++) { if(a[i].sum==a[max].sum) strcpy(a[i].level, "优秀"); else if(a[i].sum==a[min].sum) strcpy(a[i].level, "不及格"); else strcpy(a[i].level, "合格"); } }
运行结果截图
task6
源代码
#include <stdio.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); return 0; } // 输入n个学生信息,存放在结构体数组s中 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); } // 输出结构体s中n个元素信息 void output(STU s[], int n) { int i; for (i=0;i<n;i++) printf("%ld %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 min=s[0].score; int i,j=0; for (i=0;i<n;i++) { if (min>s[i].score) min=s[i].score; } for (i=0;i<n;i++) { if (s[i].score == min) { t[j]=s[i]; j++; } } return j; }
运行结果截图
标签:min,int,sum,STU,实验,include,void From: https://www.cnblogs.com/qiuyp/p/17448239.html