当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器:

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

2099:Fool's Day

题目描述
In a rectangular 2D world everything is rectangular. Rectangular people live in rectangular houses, drive rectangular cars and work in rectangular offices. The only day of a year when everything is not rectangular is April 1st --- the Fool's Day. On that day people send each other postcards with jokes and these postcards have a form of parallelograms. To support this tradition the rectangular world industry produces different parallelogram postcards and envelopes.
Mr. Rect Squarowski wants to start a new business. He would like to provide a web service that determines whether a Fool's Day postcard fits Fool's Day envelope. Help Mr. Squarowski to earn his next billion of money rects.
输入解释
The first line of the input file contains integer number n (1 <= n <= 1 000) --- the number of test cases. Each test case consists of six integer numbers. The first three numbers describe an envelope, the last three --- a postcard.
Three numbers describing each parallelogram are the lengths of its adjacent sides and its diagonal re-spectively. Specified lengths will not be greater than 1 000.
It is guaranteed that the corresponding parallelogram exists and it is not degenerate.
输出解释
For each test case output a single line. Print "Yes" if a postcard fits an envelope or "No" if it doesn't.
输入样例
3
3 4 6 4 3 6
6 6 7 5 5 8
11 11 11 10 10 2
输出样例
Yes
Yes
No
来自北京大学POJ的附加信息
Case time limit(单组数据时间限制) 2000MS

该题目是Virtual Judge题目,来自 北京大学POJ

源链接: POJ-2099

最后修改于 2020-10-29T06:23:23+00:00 由爬虫自动更新

共提交 0

通过率 --%
时间上限 内存上限
10000 64000