###### 田益铭

Problem Description
One day the little Jack is playing a game with four crabsticks. The game is simple, he want to make all the four crabsticks to be a quadrilateral, which has the biggest area in all the possible ways. But Jack’s math is so bad, he doesn’t know how to do it, can you help him using your excellent programming skills?

Input
The first line contains an integer N (1 <= N <= 10000) which indicates the number of test cases. The next N lines contain 4 integers a, b, c, d, indicating the length of the crabsticks.(1 <= a, b, c, d <= 1000)

Output
For each test case, please output a line “Case X: Y”. X indicating the number of test cases, and Y indicating the area of the quadrilateral Jack want to make. Accurate to 6 digits after the decimal point. If there is no such quadrilateral, print “-1” instead.

Sample Input
2 1 1 1 1 1 2 3 4

Sample Output
Case 1: 1.000000 Case 2: 4.898979

Author
WHU

Source

PS：

L = (A+B+C+D)/2；

AREA = sqrt((L-A) * (L-B)*(L-C)*(L-D));

#include <cstdio>
#include <cmath>
#include <algorithm>
using namespace std;
int main()
{
int t;
int cas = 0;
scanf("%d",&t);
while(t--)
{
int a[4];
for(int i = 0; i < 4; i++)
{
scanf("%d",&a[i]);
}
sort(a,a+4);
int sum = a[0]+a[1]+a[2];
if(sum <= a[3])
{
printf("Case %d: -1\n",++cas);
continue;
}
double p = (a[0]+a[1]+a[2]+a[3])/2.0;
double area = sqrt((p-a[0])*(p-a[1])*(p-a[2])*(p-a[3]));
printf("Case %d: %.6lf\n",++cas,area);

}
return 0;
}

2013-08-28 16:35:08

2014-09-10 09:38:04

2012-10-03 21:03:40

2012-08-21 18:37:53

#### HDU4357(数学思维题)

2013-07-20 14:41:01

#### hdu5358 数学题

2015-08-06 19:53:27

#### HDU 4386（计算几何+婆罗摩笈多公式一般形式)

2017-09-05 08:28:08

#### BZOJ4386: [POI2015]Wycieczki

2016-05-10 10:06:06

#### bzoj 4386: [POI2015]Wycieczki 矩阵乘法&倍增

2016-04-01 16:42:52

#### HDU 1405 The Last Practice 数学水题

2014-01-20 22:12:00