实验六

#include <stdio.h>

const int N = 5;

typedef struct student {
    long no;
    char name[20];
    int score;
}STU;

void input(STU s[], int n);
int findminlist(STU s[], STU t[], int n);
void output(STU s[], int n);

int main() {
    STU stu[N], minlist[N];
    int count;

    printf("录入%d个学生信息\n", N);
    input(stu, N);

    printf("\n统计最低分人数和学生信息...\n");
    count = findminlist(stu, minlist, N);

    printf("\n一共有%d个最低分,信息如下:\n", count);
    output(minlist, count);

    return 0;
}

void input(STU s[], int n) {
    int i;
    for (i = 0; i < n; i++)
        scanf_s("%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("%ld %s %d\n", s[i].no, s[i].name, s[i].score);
}

int findminlist(STU s[], STU t[], int n) {
    int i, j, k = 0;
    j = s[0].score;
    for (i = 1; i < n; i++)
        if (s[i].score < j)
            j = s[i].score;
    for (i = 1; i < n; i++)
        if (s[i].score == j)
            t[k++] = s[i];
    return k;
}

#include<stdio.h>
#include<stdlib.h>
#include<string.h> 
#define N 3 

typedef struct student {
    int id;
    char name[20];
    char subject[20];
    float perf;
    float mid;
    float final;
    float total;
    char level[10];
} STU;

void input(STU[], int);
void calc(STU[], int);
int fail(STU[], STU[], int);
void sort(STU[], int);
void print(STU[], int);

int main() {
    STU st[N], fst[N];
    int k;

    printf("录入学生成绩信息:\n");
    input(st, N);

    printf("\n成绩处理...\n");
    calc(st, N);

    k = fail(st, fst, N);
    sort(st, N);
    printf("\n学生成绩排名情况:\n");
    print(st, N);

    printf("\n不及格学生信息:\n");
    print(fst, k);

    return 0;
}

void input(STU s[], int n) {
    int i;
    for (i = 0; i < n; i++)
        scanf_s("%d %s %s %f %f %f", &s[i].id, s[i].name, s[i].subject, &s[i].perf, &s[i].mid, &s[i].final);
}

void calc(STU s[], int n) {
    int i;
    for (i = 0; i < n; i++) {
        s[i].total = s[i].perf * 0.2 + s[i].mid * 0.2 + s[i].final * 0.6;

        if (s[i].total >= 90)
            strcpy_s(s[i].level, "");
        else if (s[i].total >= 80 && s[i].total < 90)
            strcpy_s(s[i].level, "");
        else if (s[i].total >= 70 && s[i].total < 80)
            strcpy_s(s[i].level, "");
        else if (s[i].total >= 60 && s[i].total < 70)
            strcpy_s(s[i].level, "及格");
        else
            strcpy_s(s[i].level, "不及格");
    }
}
int fail(STU s[], STU t[], int n) {
    int i, k = 0;

    for (i = 0; i < n; i++)
        if (s[i].total < 60)
            t[k++] = s[i];

    return k;
}

void sort(STU s[], int n) {
    int i, j;
    STU temp;

    for (i = 0; i < n - 1; i++)
        for (j = 0; j < n - 1 - i; j++)
            if (s[j].total < s[j + 1].total) {
                temp = s[j];
                s[j] = s[j + 1];
                s[j + 1] = temp;
            }
}

void print(STU s[], int n) {
    int i;

    printf("-----------------\n");
    printf("学号 姓名 考试科目 平时成绩 期中成绩  期末成绩 总评成绩  成绩等级\n");
    for (i = 0; i < n; i++)
        printf("%5d %10s%20s %5.1f %5.1f %5.1f %5.1f %10s\n", s[i].id, s[i].name, s[i].subject, s[i].perf, s[i].mid, s[i].final, s[i].total, s[i].level);
}

#include <stdio.h>
#include <string.h>
const int N = 10;

typedef struct student {
    long int id;
    char name[20];
    float objective;
    float subjective;
    float sum;
    char level[10];
}STU;

void input(STU s[], int n);
void output(STU s[], int n);
void process(STU s[], int n);

int main() {
    STU stu[N];

    printf("录入%d个考生信息:准考证号,姓名,客观题得分(<=40),操作题得分(<=60)\n", N);
    input(stu, N);

    printf("\n对考生信息进行处理:计算总分,确定等级\n");
    process(stu, N);

    printf("\n打印考生完整信息:准考证号,姓名,客观题得分,操作题得分,总分,等级\n");
    output(stu, N);

    return 0;
}

void input(STU s[], int n) {
    int i;
    for (i = 0; i < n; i++)
        scanf_s("%ld %s %f %f", &s[i].id, s[i].name, &s[i].objective, &s[i].subjective);
}

void output(STU s[], int n) {
    printf("\n");
    int i;
    printf("准考证号    姓名     客观题得分     操作题得分    总分    等级");
    printf("\n");
    for (i = 0; i < n; i++)
        printf("%-11ld %-8s %-14.1f %-13.1f %-7.1f %s\n", s[i].id, s[i].name, s[i].objective, s[i].subjective, s[i].sum, s[i].level);
}

void process(STU s[], int n) {
    int i, j;
    STU temp;
    for (i = 0; i < n; i++) {
        s[i].sum = s[i].objective + s[i].subjective;
        if (s[i].sum > 95)
            strcpy_s(s[i].level, "优秀");
        else if (s[i].sum > 90)
            strcpy_s(s[i].level, "合格");
        else
            strcpy_s(s[i].level, "不合格");
    }
    for (i = 0; i < n - 1; i++)
        for (j = 0; j < n - 1 - i; j++)
            if (s[j].sum < s[j + 1].sum) {
                temp = s[j];
                s[j] = s[j + 1];
                s[j + 1] = temp;
            }
}



 

posted @ 2020-12-24 21:40  sfasafasf  阅读(33)  评论(0编辑  收藏  举报