KY120 Grading

描述:
Grading hundreds of thousands of Graduate Entrance Exams is a hard work. It is even harder to design a process to make the results as fair as possible. One way is to assign each exam problem to 3 independent experts. If they do not agree to each other, a judge is invited to make the final decision. Now you are asked to write a program to help this process. For each problem, there is a full-mark P and a tolerance T(<P) given. The grading rules are: • A problem will first be assigned to 2 experts, to obtain G1 and G2. If the difference is within the tolerance, that is, if |G1 - G2| ≤ T, this problem’s grade will be the average of G1 and G2. • If the difference exceeds T, the 3rd expert will give G3. • If G3 is within the tolerance with either G1 or G2, but NOT both, then this problem’s grade will be the average of G3 and the closest grade. • If G3 is within the tolerance with both G1 and G2, then this problem’s grade will be the maximum of the three grades. • If G3 is within the tolerance with neither G1 nor G2, a judge will give the final grade GJ.
输入描述：
Each input file may contain more than one test case. Each case occupies a line containing six positive integers: P, T, G1, G2, G3, and GJ, as described in the problem. It is guaranteed that all the grades are valid, that is, in the interval [0, P].
输出描述：
For each test case you should output the final grade of the problem in a line. The answer must be accurate to 1 decimal place.
示例1

输入：
20 2 15 13 10 18

输出：
14.0

题目大意：
给成千上万的研究生入学考试评分是一项艰苦的工作。设计一个程序使结果尽可能公平就更难了。一种方法是将每个考题分配给3个独立的专家。如果双方意见不一致，就请一名法官作出最后裁决。现在你被要求写一个程序来帮助这个过程。对于每个问题，给出一个满分P和一个公差T(<P)。评分规则为:•一个问题先分配给2位专家，分别获得G1和G2。如果差值在公差范围内，即|G1 - G2|≤T，则该问题的等级为G1和G2的平均值。•如果差值超过T，第三位专家给出G3。•如果G3在G1或G2的公差范围内，但不是两者都在，那么这个问题的分数将是G3和最接近的分数的平均值。•如果G3在G1和G2的公差范围内，则该问题的等级将是三个等级中的最大值。•如果G3与G1和G2均不在公差范围内，裁判将给出最终评分GJ。
输入：
每个输入文件可能包含一个以上的测试用例。每种情况占用一行，一行包含6个正整数:P、T、G1、G2、G3、GJ，如题中所示。保证所有等级都有效，即在[0,P]区间内有效。
输出：
对于每个测试用例，您应该在一行中输出问题的最终等级。答案必须精确到小数点后一位。
知识点： 暴力揭发 模拟 其他模拟
AC代码：

#include <stdio.h>

int abs(int n) {
    if(n > 0)
        return n;
    else
        return -n;
}

int max(int a, int b, int c) {
    int m;
    if(a > b)
        m = a;
    else
        m = b;
    if(c > m)
        m = c;
    
    return m;
}

int main() {
    int P, T, G1, G2, G3, GJ;
    while(scanf("%d %d %d %d %d %d", &P, &T, &G1, &G2, &G3, &GJ) != EOF) {
        float result;
        if(abs(G1 - G2) <= T)
            result = (G1 + G2) * 1.0 /2;
        else {
            if(abs(G3 - G1) <= T && abs(G3 - G2) > T)
                result = (G1 + G3) * 1.0 /2;
            else if(abs(G3 - G2) <= T  && abs(G3 - G1) > T)
                result = (G2 + G3) * 1.0 /2;
            else if(abs(G3 - G1) <= T && abs(G3 - G2) <= T)
                result = max(G1, G2, G3);
            else
                result = GJ;
        }
        printf("%.1f", result);
    }

    return 0;
}