HDU 4156 Egypt

版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/DT_Zhangshuo/article/details/53341962

Egypt


Problem Description
A long time ago, the Egyptians figured out that a triangle with sides of length 3, 4, and 5 had a right angle as its largest angle. You must determine if other triangles have a similar property.
Input
Input represents several test cases, followed by a line containing 0 0 0. Each test case has three positive integers, less than 30,000, denoting the lengths of the sides of a triangle.
 
Output
For each test case, a line containing "right" if the triangle is a right triangle, and a line containing "wrong" if the triangle is not a right triangle.
 
Sample Input
6 8 10 25 52 60 5 12 13 0 0 0
 
Sample Output
right wrong right
题意:计算三角形是否为直角三角形。

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int main()
{
    double a,b,c;
    while(~scanf("%lf%lf%lf",&a,&b,&c)&&a+b+c)
    {
        if(a>c)
        swap(a,c);
        if(b>c)
        swap(b,c);
        if(a*a+b*b==c*c)
        printf("right\n");
        else
        printf("wrong\n");
    }
    return 0;
}


阅读更多
换一批

没有更多推荐了,返回首页