2039

最新推荐文章于 2024-01-23 19:52:58 发布

徐小六

最新推荐文章于 2024-01-23 19:52:58 发布

阅读量314

点赞数

分类专栏： HDOJ

本文链接：https://blog.csdn.net/qq_14809723/article/details/63390853

版权

HDOJ 专栏收录该内容

32 篇文章 0 订阅

订阅专栏

三角形

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 86850 Accepted Submission(s): 28803

Problem Description

给定三条边，请你判断一下能不能组成一个三角形。

Input

输入数据第一行包含一个数M，接下有M行，每行一个实例，包含三个正数A,B,C。其中A,B,C <1000;

Output

对于每个测试实例，如果三条边长A,B,C能组成三角形的话，输出YES，否则NO。

Sample Input

Sample Output

  
  
   
   NO
YES

Author

linle

Source

2005实验班短学期考试

Recommend

lcy | We have carefully selected several similar problems for you: 2033 2032 2042 2034 2035

View Code

Problem : 2039 ( 三角形 ) Judge Status : Accepted
RunId : 20118288 Language : C Author : 837274600
Code Render Status : Rendered By HDOJ C Code Render Version 0.01 Beta

#include<stdio.h>
#include<string.h>
#include<math.h>

int main()
{
    int n;
    scanf("%d", &n);
    {
        while (n--)
        {
            int  flag = 1;
            double a, b, c, temp1, temp2;
            scanf("%lf %lf %lf", &a, &b, &c);
            temp1 = a + b;
            temp2 = fabsl(a - b);
            if (temp1<=c || temp2>c)
                flag = 0;
            temp1 = a + c;
            temp2 = fabsl(a - c);
            if (!a && !b && !c)
                flag = 0;
            if (temp1<=b || temp2>=b)
                flag = 0;
            temp1 = c + b;
            temp2 = fabsl(c - b);
            if (temp1<=a || temp2>=a)
                flag = 0;
            if (flag)
                printf("YES\n");
            else
                printf("NO\n");
        }
    }
    return 0;
}