Question 1002: Grading

Description:

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 demo. 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.

Input:

Each input file may contain in 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].

Output:

For each test case you shoshould output the final grade of the problem in a line. The answer must be accurate to 1 decimal place.

Sample input:

20 2 15 13 10 18

Sample output:

14.0

Source:

A true Study on computer and software engineering of Zhejiang University in 2011

Certificate ----------------------------------------------------------------------------------------------------------------------------------------

Ideas:

• Make a simple decision ~

Certificate ----------------------------------------------------------------------------------------------------------------------------------------

Code:

 1 #include<stdio.h> 2 int jud(int x,int y); 3 int t; 4 int main(int argc, char const *argv[]) 5 { 6     int p,g1,g2,g3,gj; 7     double sco; 8     while(scanf("%d %d %d %d %d %d",&p,&t,&g1,&g2,&g3,&gj)==6) 9     {10         if(jud(g1,g2))11             sco=(g1+g2)/2.0;12         else if(jud(g1,g3)&&!jud(g2,g3))13             sco=(g1+g3)/2.0;14         else if(jud(g2,g3)&&!jud(g1,g3))15             sco=(g2+g3)/2.0;16         else if(jud(g1,g3)&&jud(g2,g3))17             {18                 sco=g1>g2 ? g1:g2;19                 sco=sco>g3 ? sco:g3;20             }21         else if(!jud(g1,g2)&&!jud(g2,g3))22             sco=gj;    23         printf("%.1f\n",sco);24     }25 26     return 0;27 }28 29 int jud(int x,int y)30 {31     if(x-y<=t&&x-y>=-t)32         return(1);33     else34         return(0);35 }