hdu-5120（两圆相交面积）

Intersection

Time Limit: 4000/4000 MS (Java/Others)    Memory Limit: 512000/512000 K (Java/Others)
Total Submission(s): 1857    Accepted Submission(s): 708

Problem Description

Matt is a big fan of logo design. Recently he falls in love with logo made up by rings. The following figures are some famous examples you may know.


A ring is a 2-D figure bounded by two circles sharing the common center. The radius for these circles are denoted by r and R (r < R). For more details, refer to the gray part in the illustration below.


Matt just designed a new logo consisting of two rings with the same size in the 2-D plane. For his interests, Matt would like to know the area of the intersection of these two rings.

 

Input

The first line contains only one integer T (T ≤ 10 ⁵), which indicates the number of test cases. For each test case, the first line contains two integers r, R (0 ≤ r < R ≤ 10).

Each of the following two lines contains two integers x _i, y _i (0 ≤ x _i, y _i ≤ 20) indicating the coordinates of the center of each ring.

 

Output

For each test case, output a single line “Case #x: y”, where x is the case number (starting from 1) and y is the area of intersection rounded to 6 decimal places.

 

Sample Input

  
  

   
   2
2 3
0 0
0 0
2 3
0 0
5 0
  
  

 

Sample Output

  
  

   
   Case #1: 15.707963

   
   
Case #2: 2.250778
   
   


   
   
解体思路：其实就是一道恨水的数学题，比赛时竟然没写出来。比赛输得真惨
   
   


   
   
代码如下：
   
   

   
   
#include<stdio.h>
#include<string.h>
#include<cmath>
#define pi acos(-1.0)
double slove(int r1,int r2,double d){//r1==r2||r1<r2
	double a1,a2,S1,S2,S3,S;
	if(r1+r2<=d) return 0;
	if(r2-r1>=d) return pi*r1*r1;
	a1=acos((r1*r1+d*d-r2*r2)/(2*r1*d));
	S1=r1*r1*a1;
	a2=acos((r2*r2+d*d-r1*r1)/(2*r2*d));
	S2=r2*r2*a2;
	S3=r2*d*sin(a2);
	S=S1+S2-S3;
	return S;
}
int main(){
	int t,r,R,x1,x2,y1,y2;
	int cas=1;
	scanf("%d",&t);
	while(t--){
		scanf("%d%d",&r,&R);
		scanf("%d%d",&x1,&y1);
		scanf("%d%d",&x2,&y2);
		double d;
		d=sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));
		double s1=slove(R,R,d);//两个大圆 
		double s2=slove(r,R,d);//一小一大 
		double s3=slove(r,r,d);//两个小圆 
        double s=s1-2*s2+s3;
        printf("Case #%d: %lf\n",cas++,s);
	}
	return 0;
}