九度OJ:1002-Grading

时间限制:1 秒内存限制:32 兆特殊判题:否提交:24102解决:6126

题目描述:

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(

输入:

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
来源:

2011年浙江大学计算机及软件工程研究生机试真题

翻译题目:<忽略丑丑的字和翻译921329-20170627203939836-1159983789.png

九度OJ:1002-Grading_第1张图片

代码如下:

#include
#include
#include
using namespace std;

int main()
{
    int p=0,t=0,g1=0,g2=0,g3=0,g4=0;
    int a,b,max;    
    float g;
    while(scanf("%d %d %d %d %d %d",&p,&t,&g1,&g2,&g3,&g4)!=EOF){   
        if(abs(g1-g2) <= t){
            g=(float)(g1+g2)/2;
        }
        else if(abs(g1-g3)<=t || abs(g2-g3)<=t)
        {
            a=abs(g1-g3);
            b=abs(g2-g3);
            if(amax){
                    max=g2;
                }
                if(g3>max){
                    max=g3;
                }
                g=(float)max;
            }
            else if(a

结果:
921329-20170627203846289-93216954.png

  • 输出文件名: D:\DevC++\程序\two.exe
  • 输出大小: 362.3271484375 KiB
  • 编译时间: 0.45s

注意点:输入是有多组数据的。

转载于:https://www.cnblogs.com/zxcjj/p/7087028.html

你可能感兴趣的:(九度OJ:1002-Grading)