HDoj.5655 CA Loves Stick【基础】 2016/04/04

CA Loves Stick

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others)

Total Submission(s): 636    Accepted Submission(s): 224

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) 

四边形：最长边小于其余三边之和。

#include<iostream>
#include<cstdio>
#include<cstring>
#define LL __int64

using namespace std;

int main(){
    LL a,b,c,d;
    int t;
    scanf("%d",&t);
    while( t-- ){
        scanf("%I64d%I64d%I64d%I64d",&a,&b,&c,&d);
        if( !a || !b || !c || !d ){
            printf("No\n");
            continue;
        }
        LL t;
        if( a < b ){
            t = a;
            a = b;
            b = t;
        }
        if( a < c ){
            t = a;
            a = c;
            c = t;
        }
        if( a < d ){
            t = a;
            a = d;
            d = t;
        }
        if( d>a-b-c )
            printf("Yes\n");
        else printf("No\n");
    }
    return 0;
}