2005 TCO Online Round 1 - RectangleError

 #

RectangleError #

Problem's Link#

Problem Statement

     You want to draw a rectangle on a piece of paper. Unfortunately, you are not a perfect draftsman. The lines you make, although straight, do not always have the correct lengths. The top edge has length in the inclusive range [topMin,topMax], the left edge in the inclusive range [leftMin,leftMax], and the right edge in the inclusive range [rightMin,rightMax]. Fortunately, the left, top and right edges are at right angles to each other and meet (where applicable) at their ends. The bottom edge is made by connecting the bottom end of the left edge to the bottom end of the right edge. Return the maximum length the bottom edge could be minus the minimum length the bottom edge could be.

Definition

-Class: RectangleError

-Method: bottomRange

-Parameters: double, double, double, double, double, double

-Returns: double

-Method signature: double bottomRange(double topMin, double topMax, double leftMin, double leftMax, double rightMin, double rightMax)

-(be sure your method is public)

Notes

- Your return value must have an absolute or relative error less than 1e-9.

Constraints

- Each input will be between 5 and 100 inclusive.

- topMin will not be greater than topMax.

- leftMin will not be greater than leftMax.

- rightMin will not be greater than rightMax.

----------------------------------------------------------------------------

Mean: 

给定一个矩形的顶边、左边、右边的长度范围,求连接左边和右边下顶点的斜边长的最大可能长度与最小可能长度的差.

analyse:

Time complexity: O(1)

 

view code

复制代码
#include <bits/stdc++.h>
using namespace std;

class RectangleError
{
public:
   double bottomRange(double topMin, double topMax, double leftMin, double leftMax, double rightMin, double rightMax)
   {

       double Max = max(hypot(topMax, leftMin-rightMax) , hypot(topMax, leftMax-rightMin));

       double y;
       if(rightMin >= leftMax)
           y = rightMin - leftMax;
       else if(leftMin >= rightMax)
           y = rightMax - leftMin;
       else
           y = 0;

       double Min = hypot(topMin, y);
       return Max-Min;
   }
};

int main()
{
    double topMin,topMax,leftMin, leftMax, rightMin,rightMax;
    while(cin>>topMin>>topMax>>leftMin>>leftMax>>rightMin>>rightMax)
    {
        RectangleError rectangleError;
        double ans=rectangleError.bottomRange(topMin,topMax,leftMin,leftMax,rightMin,rightMax);
        printf("%f\n",ans);
    }
    return 0;
}
/*

*/
复制代码
posted @   北岛知寒  阅读(464)  评论(0编辑  收藏  举报
编辑推荐:
· 如何编写易于单元测试的代码
· 10年+ .NET Coder 心语,封装的思维:从隐藏、稳定开始理解其本质意义
· .NET Core 中如何实现缓存的预热?
· 从 HTTP 原因短语缺失研究 HTTP/2 和 HTTP/3 的设计差异
· AI与.NET技术实操系列:向量存储与相似性搜索在 .NET 中的实现
阅读排行:
· 周边上新:园子的第一款马克杯温暖上架
· Open-Sora 2.0 重磅开源!
· 分享 3 个 .NET 开源的文件压缩处理库,助力快速实现文件压缩解压功能!
· Ollama——大语言模型本地部署的极速利器
· DeepSeek如何颠覆传统软件测试?测试工程师会被淘汰吗?
历史上的今天:
2015-05-21 组合数(Lucas定理) + 快速幂 --- HDU 5226 Tom and matrix
2014-05-21 模拟 --- 简单括号匹配
点击右上角即可分享
微信分享提示
主题色彩