CA Loves Stick
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)
Total Submission(s): 642 Accepted Submission(s): 226
Problem HDU-5655 CA Loves Stick
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
if((a[1]-a[0]-a[2]>=a[3])
|| (a[2]-a[0]-a[1]>=a[3])
|| (a[3]-a[0]-a[1]>=a[2])
|| (a[0]-a[1]-a[2]>=a[3]))
cout<<"No"<<endl;//已排除了为0情况
#include"iostream"
#include"algorithm"
using namespace std;
int main(){
int t,i;
long long a[10];
cin>>t;
while(t--){
for(i=0; i<4; i++){
cin>>a[i];
}
sort(a,a+4);
if(!a[0]||!a[1]||!a[2]||!a[3]) {
cout<<"No"<<endl;
continue;
}
if(a[3]-a[0]-a[1]>=a[2])
cout<<"No"<<endl;
else
cout<<"Yes"<<endl;
}
return 0;
}