BestCoder-四条边是否能组成四边形

最新推荐文章于 2021-10-15 13:35:05 发布

kewlgrl

最新推荐文章于 2021-10-15 13:35:05 发布

阅读量2.3k

点赞数

CC 4.0 BY-SA版权

分类专栏： ACM_计算 BestCoder 文章标签： c语言 BC

本文链接：https://blog.youkuaiyun.com/MIKASA3/article/details/51067345

ACM_计算同时被 2 个专栏收录

79 篇文章

订阅专栏

BestCoder

3 篇文章

订阅专栏

本文介绍了一个用于判断四根棍子是否可以构成四边形的算法，并提供了C++代码实现，包括输入测试用例和输出结果。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

CA Loves Stick

Accepts: 381

Submissions: 3204

Time Limit: 2000/1000 MS (Java/Others)

Memory Limit: 262144/262144 K (Java/Others)

Problem Description

CA loves to play with sticks.One day he receives four pieces of sticks, he wants to know these sticks can spell a quadrilateral.(What is quadrilateral? Click here:https://en.wikipedia.org/wiki/Quadrilateral)

Input

First line contains $T$ denoting the number of testcases. $T$ testcases follow. Each testcase contains four integers $a, b, c, d$ in a line, denoting the length of sticks. $\le T \le 1000,~0 \le a,b,c,d \le 2^{63}-1$

Output

For each testcase, if these sticks can spell a quadrilateral, output "Yes"; otherwise, output "No" (without the quotation marks).

Sample Input

2
1 1 1 1
1 1 9 2

Sample Output

Yes
No

四条边能组成四边形：最长边小于其余三条边的和

#include<iostream>
#include<cstring>
#include<cstdio>
#include<malloc.h>
#include<algorithm>
using namespace std;

int main()
{
    int ca,i;
    scanf("%d",&ca);
    unsigned long long a[4];
    while(ca--)
    {
        for(i=0; i<4; ++i)
            cin>>a[i];
        sort(a,a+4);
        if((a[0]>a[3]-a[2]-a[1])&&a[0]!=0&&a[1]!=0&&a[2]!=0&&a[3]!=0)//最大边大于剩下三边之和，注意longlong相加会超长度！！还有注意边长为0的情况！！
            printf("Yes\n");
        else printf("No\n");
    }
    return 0;
}