Light OJ:1331 Agent J(水题+数学)

1331 - Agent J
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 R1R2 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

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

 


PROBLEM SETTER: JANE ALAM JAN


题目大意:给了你三个圆的半径,求出蓝色部分面积。

解题思路:

求出三角形面积,再减去黄色扇形面积即可,用到了余弦定理和三角形面积公式。

代码如下:

#include <cstdio>
#include <cmath>
#define PI acos(-1.0)
int main()
{
	int t;
	scanf("%d",&t);
	int kcase=1;
	while(t--)
	{
		double r1,r2,r3;
		scanf("%lf%lf%lf",&r1,&r2,&r3);
		double a=r1+r2;
		double b=r1+r3;
		double c=r2+r3;
		double ctaa=acos((b*b+c*c-a*a)/(2*b*c));//a的角度 
		double ctab=acos((a*a+c*c-b*b)/(2*a*c));
		double ctac=acos((a*a+b*b-c*c)/(2*a*b));
		double s=a*b*sin(ctac)/2;//计算三角形面积 
		double s1=PI*r1*r1;
		double s2=PI*r2*r2;
		double s3=PI*r3*r3;
		s1=s1*ctac/(2.0*PI);//计算扇形面积 
		s2=s2*ctab/(2.0*PI);
		s3=s3*ctaa/(2.0*PI);
		s=s-s1-s2-s3;
		printf("Case %d: %.6lf\n",kcase++,s);
	}
	return 0;
}


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值