几何 两元相交的面积计算问题 HDU 5120 Intersection（几何模板）

这道题只要是知道两圆相交的面积怎么算，就能很快a出来，几何模板。

#include<cstdio>
#include<algorithm>
#include<cmath>
#define PI acos(-1.0) //这里的π 的表示方法可以学一下
using namespace std;

double area(double x1, double y1, double r1, double x2, double y2, double r2)
{
    double d=(x1-x2)*(x1-x2)+(y1-y2)*(y1-y2);
    if(d>=(r1+r2)*(r1+r2)) return 0;
    if(d<=(r1-r2)*(r1-r2)) return r1<r2 ? PI * r1 * r1 : PI * r2 *r2;

    d=sqrt(d);
    double a1=acos((r1*r1+d*d-r2*r2)/(2.0*r1*d));
    double a2=acos((r2*r2+d*d-r1*r1)/(2.0*r2*d));
    double s1=a1*r1*r1;
    double s2=a2*r2*r2;
    double t=(r1+r2+d)/2.0;
    t=2.0*sqrt(t*(t-r1)*(t-r2)*(t-d));
    return s1+s2-t;
}

int main()
{
    int t;
    double r1,r2,x1,y1,x2,y2;
    scanf("%d",&t);
    for(int l = 1;l <= t;l++) {
        scanf("%lf%lf",&r1,&r2);
        scanf("%lf%lf%lf%lf",&x1,&y1,&x2,&y2);
        double ans;
        ans = area(x1,y1,r2,x2,y2,r2) - area(x1,y1,r1,x2,y2,r2) - area(x1,y1,r2,x2,y2,r1) + area(x1,y1,r1,x2,y2,r1);
        printf("Case #%d: %.6f\n",l,ans);
    }
}

两圆相交面积的函数

double area(double x1, double y1, double r1, double x2, double y2, double r2)
{
    double d=(x1-x2)*(x1-x2)+(y1-y2)*(y1-y2);
    if(d>=(r1+r2)*(r1+r2)) return 0;
    if(d<=(r1-r2)*(r1-r2)) return r1<r2 ? PI * r1 * r1 : PI * r2 *r2;

    d=sqrt(d);
    double a1=acos((r1*r1+d*d-r2*r2)/(2.0*r1*d));
    double a2=acos((r2*r2+d*d-r1*r1)/(2.0*r2*d));
    double s1=a1*r1*r1;
    double s2=a2*r2*r2;
    double t=(r1+r2+d)/2.0;
    t=2.0*sqrt(t*(t-r1)*(t-r2)*(t-d));
    return s1+s2-t;
}

多刷提吧，加油！！

基础要掌握勒