hdu 2393 Higher Math

发布时间:2016-12-7 1:57:02 编辑:www.fx114.net 分享查询网我要评论
本篇文章主要介绍了"hdu 2393 Higher Math",主要涉及到hdu 2393 Higher Math方面的内容,对于hdu 2393 Higher Math感兴趣的同学可以参考一下。

Higher Math Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 903    Accepted Submission(s): 516 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   很简单的!!!!!! #include<stdio.h> __int64 a,b,c,temp; int main() {     int i,t,flag;     scanf("%d",&t);     for(i=1;i<=t;i++)     {         scanf("%I64d%I64d%I64d",&a,&b,&c);         flag=0;         if(a>b)         {             temp=a;             a=b;             b=temp;         }         if(b>c)         {             temp=c;             c=b;             b=temp;         }         if(a*a+b*b==c*c)         {             flag=1;         }         printf("Scenario #%d:\n",i);         if(flag)         {             printf("yes\n");         }         else         {             printf("no\n");         }         printf("\n");          }     return 0; }

上一篇:定长度结构体数组、不定长度结构体指针初始化
下一篇:Filthy&nbsp;Rich(动态规划)

相关文章

相关评论