HDOJ 5655-CA Loves Stick【思维题】

叁歲伎倆 2022-07-14 11:59 183阅读 0赞

# CA Loves Stick #

**Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)  
Total Submission(s): 2323 Accepted Submission(s): 666**

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![Image 1][] denoting the number of testcases.  
 T![Image 1][] testcases follow. Each testcase contains four integers  a,b,c,d![Image 1][] in a line, denoting the length of sticks.  
 1≤T≤1000,0≤a,b,c,d≤2![Image 1][]63![Image 1][]−1![Image 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) ][BestCoder Round _78 _div.2_]

解题思路：

题目的意思就是给你四个长度，看看是否能够摆成矩形。方法就是任意三边之和大于第四边，注意三边只和会大于ll。还有零的情况。

#include<stdio.h>
    #include<string.h>
    #include<algorithm>
    using namespace std;
    int main(){
    	int n;
    	scanf("%d",&n);
    	while(n--){
    		bool xx=0;
    		long long x[4];
    		for(int i=0;i<4;i++){
    			scanf("%lld",&x[i]);
    			if(x[i]==0)
    			xx=1;
    		}
    		if(xx){
    			printf("No\n");
    			continue;
    		}
    		sort(x,x+4);
    		if(x[0]>(x[3]-x[2]-x[1]))
    		printf("Yes\n");
    		else
    		printf("No\n");
    	}
    	return 0;
    }

[Image 1]: 
[BestCoder Round _78 _div.2_]: http://acm.hdu.edu.cn/search.php?field=problem&key=BestCoder+Round+%2378+%28div.2%29&source=1&searchmode=source