PAT (Advanced Level) Practise 1036

本文介绍了一个编程问题的解决方法,该问题是关于PAT高级水平竞赛中男性与女性学生最低与最高分数之间的差异计算。通过输入学生的姓名、性别、课程及分数,程序能够找出分数最高的女性学生和分数最低的男性学生,并计算两者分数之差。

PAT (Advanced Level) Practise 1036

1036. Boys vs Girls (25)

This time you are asked to tell the difference between the lowest grade of all the male students and the highest grade of all the female students.

Input Specification:

Each input file contains one test case. Each case contains a positive integer N, followed by N lines of student information. Each line contains a student’s name, gender, ID and grade, separated by a space, where name and ID are strings of no more than 10 characters with no space, gender is either F (female) or M (male), and grade is an integer between 0 and 100. It is guaranteed that all the grades are distinct.

Output Specification:

For each test case, output in 3 lines. The first line gives the name and ID of the female student with the highest grade, and the second line gives that of the male student with the lowest grade. The third line gives the difference gradeF-gradeM. If one such kind of student is missing, output “Absent” in the corresponding line, and output “NA” in the third line instead.

Sample Input 1:

3
Joe M Math990112 89
Mike M CS991301 100
Mary F EE990830 95
Sample Output 1:
Mary EE990830
Joe Math990112
6
Sample Input 2:
1
Jean M AA980920 60
Sample Output 2:
Absent
Jean AA980920
NA

编程实现

#include <stdio.h>
#include <string.h>

typedef struct {
    char name[12];
    char gender;
    char course[12];
    int grade;
} Student;

void copy_record(Student *s1, Student *s2) 
{
    strcpy(s1->name, s2->name);
    strcpy(s1->course, s2->course);
    s1->gender = s2->gender;
    s1->grade = s2->grade;
}

int main(void)
{
    Student highest_female, lowest_male, input;
    int has_lowest_male = 0, has_highest_female = 0;
    int n;

    scanf("%d", &n);
    while ( n-- ) {
        scanf("%s %c %s %d", input.name, 
            &input.gender, input.course, 
            &input.grade);
        if ( (!has_highest_female && input.gender == 'F') || 
            (has_highest_female && input.gender == 'F' && 
                 input.grade > highest_female.grade) ) {
            copy_record(&highest_female, &input);
            has_highest_female = 1;
        }
        else if ( (!has_lowest_male && input.gender == 'M') ||
            (has_lowest_male && input.gender == 'M' &&
                input.grade < lowest_male.grade) )  {   
            copy_record(&lowest_male, &input);
            has_lowest_male = 1;
        }
    }
    if ( has_highest_female && has_lowest_male ) {
        printf("%s %s\n", highest_female.name, highest_female.course);
        printf("%s %s\n", lowest_male.name, lowest_male.course);
        printf("%d\n", highest_female.grade - lowest_male.grade);
    } else if ( has_highest_female ) {
        printf("%s %s\n", highest_female.name, highest_female.course);
        printf("Absent\n");
        printf("NA\n");
    } else {
        printf("Absent\n");
        printf("%s %s\n", lowest_male.name, lowest_male.course);
        printf("NA\n");
    }
    return 0;
}
多源动态最优潮流的分布鲁棒优化方法(IEEE118节点)(Matlab代码实现)内容概要:本文介绍了基于Matlab代码实现的多源动态最优潮流的分布鲁棒优化方法,适用于IEEE118节点电力系统。该方法结合两阶段鲁棒模型与确定性模型,旨在应对电力系统中多源输入(如可再生能源)的确定性,提升系统运行的安全性与经济性。文中详细阐述了分布鲁棒优化的建模思路,包括确定性集合的构建、目标函数的设计以及约束条件的处理,并通过Matlab编程实现算法求解,提供了完整的仿真流程与结果分析。此外,文档还列举了大量相关电力系统优化研究案例,涵盖微电网调度、电动汽车集群并网、需求响应、储能配置等多个方向,展示了其在实际工程中的广泛应用价值。; 适合人群:具备一定电力系统基础知识和Matlab编程能力的研究生、科研人员及从事能源系统优化工作的工程师。; 使用场景及目标:①用于研究高比例可再生能源接入背景下电力系统的动态最优潮流问题;②支撑科研工作中对分布鲁棒优化模型的复现与改进;③为电力系统调度、规划及运行决策提供理论支持与仿真工具。; 阅读建议:建议读者结合提供的Matlab代码与IEEE118节点系统参数进行实操演练,深入理解分布鲁棒优化的建模逻辑与求解过程,同时可参考文中提及的其他优化案例拓展研究思路。
评论
成就一亿技术人!
拼手气红包6.0元
还能输入1000个字符
 
红包 添加红包
表情包 插入表情
 条评论被折叠 查看
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值