【light-oj】-1331 - Agent J（几何，水）

1331 - Agent J

   PDF (English)StatisticsForum

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

题意：求三个相切圆中间的面积

#include<cstdio>#include<cstring>#include<cmath>#include<algorithm>using namespace std;#define CLR(a,b) memset(a,b,sizeof(a))#define INF 0x3f3f3f3f#define LL long long#define PI acos(-1.0)int main(){int u,ca=1;scanf("%d",&u);while(u--){double r1,r2,r3,a,b,c,S;double i,j,k;double s1,s2,s3;scanf("%lf%lf%lf",&r1,&r2,&r3);a=r1+r2;b=r2+r3;c=r1+r3;S=c*0.5*sqrt(b*b-((b*b+c*c-a*a)/(2*c))*((b*b+c*c-a*a)/(2*c)));i=((a*a+c*c-b*b)/(2*a*c));j=((a*a+b*b-c*c)/(2*a*b));k=((b*b+c*c-a*a)/(2*b*c));i=acos(i);j=acos(j);k=acos(k);s1=r1*r1*i/2;s2=r2*r2*j/2;s3=r3*r3*k/2;printf("Case %d: %.9lf\n",ca++,S-s1-s2-s3);}return 0;}