九度 题目1002:Grading
2015-02-02 11:16
218 查看
模拟题。代码:
#include <cstdio>
#include <cmath>
#include <iostream>
using namespace std;
int main()
{
float p, t, g1, g2, g3, gj;
while (cin >> p >> t >> g1 >> g2 >> g3 >> gj)
{
if (abs(g1-g2) <= t)
{
printf("%.1f\n", (g1+g2)/2.0);
} else if (abs(g1-g3)<=t && abs(g2-g3)<=t)
{
printf("%.1f\n", max(max(g1,g2), g3));
} else if (abs(g1-g3)<=t || abs(g2-g3)<=t)
{
if (abs(g1-g3) < abs(g2-g3))
{
printf("%.1f\n", (g1+g3)/2.0);
} else
{
printf("%.1f\n", (g2+g3)/2.0);
}
} else
{
printf("%.1f\n", gj);
}
}
return 0;
}
#include <cstdio>
#include <cmath>
#include <iostream>
using namespace std;
int main()
{
float p, t, g1, g2, g3, gj;
while (cin >> p >> t >> g1 >> g2 >> g3 >> gj)
{
if (abs(g1-g2) <= t)
{
printf("%.1f\n", (g1+g2)/2.0);
} else if (abs(g1-g3)<=t && abs(g2-g3)<=t)
{
printf("%.1f\n", max(max(g1,g2), g3));
} else if (abs(g1-g3)<=t || abs(g2-g3)<=t)
{
if (abs(g1-g3) < abs(g2-g3))
{
printf("%.1f\n", (g1+g3)/2.0);
} else
{
printf("%.1f\n", (g2+g3)/2.0);
}
} else
{
printf("%.1f\n", gj);
}
}
return 0;
}
相关文章推荐
- 【九度】题目1002:Grading
- 九度 题目1002:Grading
- 九度OJ题目1002:Grading
- 九度题目1002:Grading
- 九度OJ 题目1002:Grading
- 九度oj题目1002:Grading
- 九度——题目1002:Grading
- 九度OJ 题目1002:Grading
- 题目1002:Grading
- 题目1002:Grading(题目背景基于高考打分的简单判断)
- 九度oj-1002-Grading
- 题目1002:Grading
- 九度oj 题目1002:Grading 【ZJU2011考研机试题2】
- 九度OnlineJudge之1002:Grading
- 题目1002:Grading
- 九度 OJ 1002:Grading
- 题目1002:Grading
- 题目1002:Grading
- 九度OJ 1002 Grading
- 题目1002:Grading