Light oj 1331 - Agent J【计算】

1331 - Agent J

PDF (English)

Statistics

Forum

Time Limit: 1 second(s)

Memory Limit: 32 MB

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 R₁, R₂ and R₃ 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 R₁, R₂ and R₃ (0 < R₁, R₂, R₃ ≤ 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	Output for Sample Input
3 1.0 1.0 1.0 2 2 2 3 3 3	Case 1: 0.16125448 Case 2: 0.645017923 Case 3: 1.4512903270

题意：

给出如图所示两两外切的圆，求三个圆所围成的图形的面积

题解：

比较简单的计算几何题目，只需要用三个圆心构成的三角形减去每个圆心和切点围城的扇形（一共三个）的面积，即为所求

/*
http://blog.csdn.net/liuke19950717
*/
#include<cstdio>
#include<cstring>
#include<cmath>
using namespace std;
double sum(double a,double b,double c)
{
	double p=(a+b+c)/2.0;
	return sqrt(p*(p-a)*(p-b)*(p-c));
}
double cal(double a,double b,double c)//计算角度 
{
	return acos((a*a+b*b-c*c)/(2*a*b));
}
int main()
{
	int t;
	scanf("%d",&t);
	for(int k=1;k<=t;++k)
	{
		double r1,r2,r3;
		scanf("%lf%lf%lf",&r1,&r2,&r3);
		double ans=sum(r1+r2,r2+r3,r3+r1);
		ans=ans-r1*r1*cal(r1+r3,r1+r2,r2+r3)/2;
		ans=ans-r2*r2*cal(r2+r1,r2+r3,r1+r3)/2;
		ans=ans-r3*r3*cal(r3+r1,r3+r2,r1+r2)/2;
		printf("Case %d: %.8lf\n",k,ans);
	}
	return 0;    
}