LightOJ 1331（数学计算几何）

Description
Agent J is preparing to steal an antique diamond piece from a museum. As it is fully guarded and they are guarding it using high technologies, it’s not easy to steal the piece. There are three circular laser scanners in the museum which are the main headache for Agent J. The scanners are centered in a certain position, and they keep rotating maintaining a certain radius. And they are placed such that their coverage areas touch each other as shown in the picture below:

Here R1, R2 and R3 are the radii of the coverage areas of the three laser scanners. The diamond is placed in the place blue shaded region as in the picture. Now your task is to find the area of this region for Agent J, as he needs to know where he should land to steal the diamond.

Input
Input starts with an integer T (≤ 1000), denoting the number of test cases.

Each case starts with a line containing three real numbers denoting R1, R2 and R3 (0 < R1, R2, R3 ≤ 100). And no number contains more than two digits after the decimal point.

Output
For each case, print the case number and the area of the place where the diamond piece is located. Error less than 10-6 will be ignored.

Sample Input

1.0 1.0 1.0
2 2 2
3 3 3
Sample Output
Case 1: 0.16125448
Case 2: 0.645017923
Case 3: 1.4512903270

#include<cstdio>
#include<cmath>
#define PI acos(-1.0)
int main()
{
int t,flag=1;
scanf("%d",&t);
while(t--)
{
double r1,r2,r3;
scanf("%lf%lf%lf",&r1,&r2,&r3);
double a,b,c,cosa,cosb,cosc;
a=r1+r2;
b=r2+r3;
c=r3+r1;
double p=(a+b+c)/2.0;
double s=sqrt(p*(p-a)*(p-b)*(p-c));
cosa=(b*b+c*c-a*a)/(2.0*b*c);//求余弦
cosb=(a*a+c*c-b*b)/(2.0*a*c);
cosc=(b*b+a*a-c*c)/(2.0*b*a);
double s1=r3*r3*acos(cosa)/2.0+r2*r2*acos(cosc)/2.0+r1*r1*acos(cosb)/2.0;
printf("Case %d: %lf\n",flag++,s-s1);
}
return 0;
}

• 本文已收录于以下专栏：

100道动态规划——4 UVA 1331 Maximum Triangulation DP 计算几何

• Good_night_Sion_
• 2016年10月28日 12:01
• 250

LightOJ 1331 - Agent J （计算几何）

1331 - Agent J     PDF (English) Statistics Forum Time Limit: 1 second(...
• yao1373446012
• 2016年09月05日 20:35
• 172

Lightoj 1098【数学/玄学】

• KEYboarderQQ
• 2016年11月17日 01:37
• 352

【LightOJ 1331 】

LightOJ 1331 Description Agent J is preparing to steal an antique diamond piece from a museum. A...
• WYK1823376647
• 2016年08月26日 08:58
• 437

Lightoj 1331

• chengqian1125
• 2016年09月05日 17:16
• 65

我的计算几何 总结

• baidu_33153085
• 2016年08月07日 20:29
• 205

【LightOJ】1109 - False Ordering（打表）

• wyg1997
• 2016年09月05日 15:56
• 152

LightOJ 1331 Agent J

• whyorwhnt
• 2012年12月07日 19:27
• 629

LightOJ 1331：求面积

Description Agent J is preparing to steal an antique diamond piece from a museum. As it is fully ...
• KingJordon
• 2016年08月25日 17:40
• 138

uva 1331——Minimax Triangulation

• bobodem
• 2015年12月06日 22:28
• 382

举报原因： 您举报文章：LightOJ 1331（数学计算几何） 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)