LightOJ 1331(数学计算几何)

原创 2016年08月28日 21:06:55

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 

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

题意:给出3个圆的半径,让你求阴影部分的面积。

可以连接三个圆的圆心,可以构成一个三角形,并且三角形的三条边都知道了,这是三角形的面积也就有了,利用p=(a+b+c)/2,可求。

知道三边也就知道

#include<cstdio>
#include<cmath>
#define PI acos(-1.0)
int main()
{
	int t,flag=1;
	scanf("%d",&t);
	while(t--)
	{
		double r1,r2,r3;
		scanf("%lf%lf%lf",&r1,&r2,&r3);
		double a,b,c,cosa,cosb,cosc;
		a=r1+r2;
		b=r2+r3;
		c=r3+r1;
		double p=(a+b+c)/2.0;
		double s=sqrt(p*(p-a)*(p-b)*(p-c)); 
       	cosa=(b*b+c*c-a*a)/(2.0*b*c);//求余弦 
		cosb=(a*a+c*c-b*b)/(2.0*a*c);
		cosc=(b*b+a*a-c*c)/(2.0*b*a);
		double s1=r3*r3*acos(cosa)/2.0+r2*r2*acos(cosc)/2.0+r1*r1*acos(cosb)/2.0;
		printf("Case %d: %lf\n",flag++,s-s1);	
	} 
	return 0;
}

定理,就知道角度了,acos(余弦)就ok了。


【lightoj1331】Agent J【计算几何】

F - F 圆周率用acos(-1.0) 使用longlong Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%lld...

LightOJ 1331-Agent J【计算几何】

1331 - Agent J     PDF (English) Statistics Forum Time Limit: 1 second(...

LightOJ - 1058 Parallelogram Counting (数学几何&技巧)给n个点求组成平行四边形个数

LightOJ - 1058 Parallelogram Counting Time Limit: 2000MS Memory Limit: 32768KB 64bit IO ...

100道动态规划——4 UVA 1331 Maximum Triangulation DP 计算几何

好吧,这道题在练练DP的同时顺便抄了一下刘汝佳dalao的板子,

python用于数学计算的工具介绍:scipy和numpy

SciPy入门指南 这个教程是为了帮助初学者掌握scipy并且肯能快地实际使用。 什么是scipy、numpy、matplotlib?它们是用来干什么的?如何使用scipy工作学习使用sc...

数学计算软件(Matlab、Mathematica)网页版

有时候会用到Matlab及Mathematica软件的数值计算或者符号计算功能,但是去安装一下太麻烦,而且毕竟不是常用,...

HDU1868 Consecutive sum【数学计算+枚举】

Consecutive sum Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) ...

python数学计算的工具:scipy和numpy

什么是scipy、numpy、matplotlib? Python是一种通用语言。它被解释运行,是动态类型语言,并且非常适合交互工作和快速实现原型,然而又足够强大用来写大型应用。 NumP...

shell 中数学计算总结

1、错误方法举例  a)  var=1+1  echo $var  输出的结果是1+1,悲剧,呵呵  b)  var=1  var=$var+1  echo $var  输出结果是1...

数学计算相关算法

http://blog.csdn.net/pipisorry/article/details/46008603欧几里德算法欧几里德算法又称辗转相除法,用于计算两个整数a,b的最大公约数。计算原理定理:...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:LightOJ 1331(数学计算几何)
举报原因:
原因补充:

(最多只允许输入30个字)