题目1002:Grading
来源:互联网 发布:各种颜色的数据代码 编辑:程序博客网 时间:2024/05/20 10:14
题目描述:
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 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.
样例输入:
20 2 15 13 10 18
样例输出:
14.0
#include<stdio.h>#include<math.h>#include<algorithm>#include<iostream>using namespace std;int main(){ int fullMark, tolerance, grade1, grade2, grade3, gradeJudge; double finalGrade; while (scanf("%d%d%d%d%d%d", &fullMark, &tolerance, &grade1, &grade2, &grade3, &gradeJudge) != EOF){ finalGrade = 0; if (abs(grade1 - grade2) <= tolerance){ finalGrade = (double)((double)grade1 + (double)grade2) / 2.0; } else { if (abs(grade3 - grade1) <= tolerance){ if (abs(grade3 - grade2) <= tolerance){ //G3 is within the tolerance with both G1 and G2 int buf[3]; buf[0] = grade1; buf[1] = grade2; buf[2] = grade3; finalGrade = (double)*max_element(buf, buf + 3); } else{ //G3 is tolerance with grade1 finalGrade = (double)((double)grade1 + (double)grade3) / 2; } } else{ if (abs(grade3 - grade2) <= tolerance){ //G3 is tolerance with grade2 finalGrade = (double)((double)grade2 + (double)grade3) / 2; } else{ finalGrade = (double)gradeJudge; } } } printf("%.1lf\n", finalGrade); } return 0;}
0 0
- 题目1002:Grading
- 题目1002:Grading
- 题目1002:Grading
- 题目1002:Grading
- 题目1002:Grading
- 题目1002:Grading
- 题目1002:Grading
- 题目1002:Grading
- 题目1002:Grading
- 题目1002:Grading
- 题目1002:Grading
- 题目1002:Grading
- 题目1002:Grading
- 题目1002:Grading
- 题目1002:Grading
- 题目1002:Grading
- 九度 题目1002:Grading
- 【九度】题目1002:Grading
- sql server 数据库mdf与ldf文件的导入
- linux常用命令
- nyoj 63 小猴子下落(二叉树)
- linux下运行eclipse出错的解决方法
- 某公司面试block
- 题目1002:Grading
- 【USACO题库】3.3.3 Camelot亚瑟王的宫殿
- 微信分享图片变黑
- 分拣存储3-HashMap实现学生选课
- 基于JdbcTemplate的批量插入操作的讨论
- uva11584
- xcode7下多出来的告警修复
- ACM-2008 数值统计
- Git客户端TortoiseGit(Windows系统)的使用方法