【LightOJ】1331 - Agent J（数论）

点击打开题目

1331 - Agent J

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.

用海伦公式或者余弦定理求就行了。

代码如下：

#include <cstdio>
#include <cstring>
#include <cmath>
#include <queue>
#include <map>
#include <vector>
#include <stack>
#include <algorithm>
using namespace std;
#define INF 0x3f3f3f3f
#define CLR(a,b) memset(a,b,sizeof(a))
#define LL long long
#define PI acos(-1.0)
double cal_a(double a,double b,double c)
{
	double t = (a*a+b*b-c*c) / (2*a*b);
	return acos(t);
}
int main()
{
	int u;
	int Case = 1;
	double r1,r2,r3;
	double a1,a2,a3;
	double S;
	scanf ("%d",&u);
	while (u--)
	{
		scanf ("%lf %lf %lf",&r1,&r2,&r3);
		printf ("Case %d: ",Case++);
		a1 = cal_a(r1+r3,r2+r1,r2+r3);
		a2 = cal_a(r2+r1,r2+r3,r1+r3);
		a3 = cal_a(r3+r1,r3+r2,r1+r2);
		S = 0.5*(r1+r2)*(r1+r3)*sqrt(1-pow(cos(a1),2));
		S -= r1*r1*PI/(2*PI/a1);
		S -= r2*r2*PI/(2*PI/a2);
		S -= r3*r3*PI/(2*PI/a3);
		printf ("%lf\n",S);
	}
	return 0;
}