博客
关于我
强烈建议你试试无所不能的chatGPT,快点击我
hdu 2393:Higher Math(计算几何,水题)
阅读量:5149 次
发布时间:2019-06-13

本文共 2222 字,大约阅读时间需要 7 分钟。

Higher Math

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)

Total Submission(s): 2219    Accepted Submission(s): 1219

Problem Description
You are building a house. You’d prefer if all the walls have a precise right angle relative to the ground, but you have no device to measure angles. A friend says he has a great idea how you could ensure that all walls are upright: All you need to do is step away a few feet from the wall, measure how far away you are from the wall, measure the height of the wall, and the distance from the upper edge of the wall to where you stand. You friend tells you to do these measurements for all walls, then he’ll tell you how to proceed. Sadly, just as you are done, a timber falls on your friend, and an ambulance brings him to the hospital. This is too bad, because now you have to figure out what to do with your measurements yourself.
Given the three sides of a triangle, determine if the triangle is a right triangle, i.e. if one of the triangle’s angles is 90 degrees.
 

 

Input
The inputs start with a line containing a single integer n. Each of the n following lines contains one test case. Each test case consists of three integers 1 <= a, b, c <= 40000 separated by a space. The three integers are the lengths of the sides of a triangle.
 

 

Output
The output for every scenario begins with a line containing “Scenario #i:”, where i is the number of the scenario counting from 1. After that, output a single line containing either the string “yes” or the string “no”, depending on if the triangle in this test case has a right angle. Terminate each test case with an empty line.
 

 

Sample Input
2
36 77 85
40 55 69
 

 

Sample Output
Scenario #1: yes
 
Scenario #2: no
 

 

Source
 

 

Recommend
lcy   |   We have carefully selected several similar problems for you:            

 
  计算几何,水题
  题意:给你三个数,作为三角形的三边,判断这个数是不是直角三角形。
  代码:
1 #include 
2 3 using namespace std; 4 5 int main() 6 { 7 int i,a,b,c,T; 8 cin>>T; 9 for(i=1;i<=T;i++){10 cin>>a>>b>>c;11 if(a*a+b*b==c*c || b*b+c*c==a*a || a*a+c*c==b*b)12 cout<<"Scenario #"<
<<':'<
<<"yes"<

 

Freecode :

转载于:https://www.cnblogs.com/yym2013/p/3749648.html

你可能感兴趣的文章
POJ 2485(Kruskal算法)
查看>>
《20171122-构建之法:现代软件工程-阅读笔记》
查看>>
谈谈对于企业级系统架构的理解—李平
查看>>
Lambda表达式
查看>>
srm537 div1-3 最小费用最大流
查看>>
软件项目中的功能点法估算-原理
查看>>
php分享十七:http状态码
查看>>
VC++ 动态DLL模板-DllMain函数
查看>>
K3Cloud 设置分录的字段颜色
查看>>
C语言初学 俩数相除问题
查看>>
Shell文本处理 - 分割合并与过滤
查看>>
Java 按页拆分pdf
查看>>
我要翻译《Think Python》 - 开篇申明
查看>>
MS SQL Server2012中的CONCAT函数
查看>>
不一样的编辑器
查看>>
博客园安家--写给自己
查看>>
B/S和C/S架构的区别
查看>>
[Java] Java record
查看>>
jQuery - 控制元素显示、隐藏、切换、滑动的方法
查看>>
postgresql学习文档
查看>>