HDU-5655 CA Loves Stick（数学）

CA Loves Stick

                                                                          Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others)
                                                                                                  Total Submission(s): 2905    Accepted Submission(s): 809

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.
1≤T≤1000, 0≤a,b,c,d≤263−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
  
  

 

Source

BestCoder Round #78 (div.2)

 

Recommend

wange2014

 

Statistic |  Submit |  Discuss |  Not
题意：给边长分别为a,b,c,d的四条边，求能否构成四边形；

           构成四边形的条件 a,b,c,d从小到大排，a+b+c>d;

           但是题目中给的a,b,c,d太大三个相加可能超过long long 范围，所以就用d-b-c<a,解决；

代码：

#include<stdio.h>
#include<algorithm>
using namespace std;

int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        __int64 a[5];
        int i,sum=0;
        for(i=0;i<4;i++)
            scanf("%I64d",&a[i]);
        sort(a,a+4);
        for(i=0;i<4;i++)
            if(a[i]==0)
                sum ++;
        if(sum!=0)
        {
            printf("No\n");
            continue;
        }
        if(a[3] - a[1] - a[2] < a[0] )
           printf("Yes\n");
        else
           printf("No\n");
    }
    return 0;
}