【LightOJ 1331 】

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
3
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>
using namespace std;
int main()
{
    int T,nl=1;
    double a,b,c,r1,r2,r3,sum,ans,q1,q2,q3;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%lf%lf%lf",&r1,&r2,&r3);
        a=r1+r2;
        b=r1+r3;
        c=r2+r3;
        q1=(a*a+b*b-c*c)/(2*a*b);
        q2=(a*a+c*c-b*b)/(2*a*c);
        q3=(c*c+b*b-a*a)/(2*b*c);
        sum=sqrt(1-q1*q1);//求出 sin 值
        ans=a*b/2*sum;
        ans-=r1*r1*acos(q1)/2;//该角度是弧度制的 即之前已除过 PI ，所以只用再除以 2
        ans-=r2*r2*acos(q2)/2;
        ans-=r3*r3*acos(q3)/2;
        printf("Case %d: %.7lf\n",nl++,ans);
    }
    return 0;
}