HDU 5655 CA Loves Stick(思维题目)【bestcoder】
2016-07-22 16:39
405 查看
CA Loves Stick
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 2130 Accepted Submission(s): 615
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
本题的题意就是给你四根木棒,然后问你能不能组成四边形,四边形的定义上面已经给出。
很明显需要满足最小的三条边之和大于第四条边,而且最小的边不能为0 。
直接加的话会爆long long ,所以我们需要转换一下思路,就是最小的边大于最长的边减去另外两条边的长度。
下面是AC代码:
#include<cstdio> #include<cstring> #include<algorithm> using namespace std; #define ll long long ll a[4]; int main() { int t; scanf("%d",&t); while(t--) { scanf("%I64d %I64d %I64d %I64d",&a[0],&a[1],&a[2],&a[3]); sort(a,a+4); if(a[0]==0) { printf("No\n"); continue; } if(a[0]>a[3]-a[2]-a[1]) { printf("Yes\n"); } else { printf("No\n"); } } return 0; }
相关文章推荐
- 【HDU 5366】The mook jong 详解
- 【HDU 2136】Largest prime factor 详细图解
- 【HDU 1568】Fibonacci 数学公式 详解
- HDU 1568
- HDU1290
- HDU1568(Fobonacci公式)
- HDU ACM Step 2.2.2 Joseph(约瑟夫环问题)
- HDU 1405
- HDU 1297
- hdu 1205
- hdu 2087
- hdu 1016
- HDU 4898 The Revenge of the Princess’ Knight ( 2014 Multi-University Training Contest 4 )
- HDU 5592 ZYB's Premutation 线段树(查找动态区间第K大)
- HDU 5240 Exam (好水的题)
- HDU5237 Base64 大模拟
- HDU 1000
- HDU 1001
- HDU 1016 Prime Ring Problem
- HDU 1017 A Mathematical Curiosity