zoukankan      html  css  js  c++  java
  • HDU 1798 Tell me the area

    http://acm.hdu.edu.cn/showproblem.php?pid=1798

    Problem Description
        There are two circles in the plane (shown in the below picture), there is a common area between the two circles. The problem is easy that you just tell me the common area.
     
    Input
    There are many cases. In each case, there are two lines. Each line has three numbers: the coordinates (X and Y) of the centre of a circle, and the radius of the circle.
     
    Output
    For each case, you just print the common area which is rounded to three digits after the decimal point. For more details, just look at the sample.
     
    Sample Input
    0 0 2
    2 2 1
     
    Sample Output
    0.108

    代码:

    #include <bits/stdc++.h>
    using namespace std;
    
    int main() {
        double x1, y1, r1, x2, y2, r2, minr, maxr, d, ans;
        while(~scanf("%lf%lf%lf", &x1, &y1, &r1)) {
            scanf("%lf%lf%lf", &x2, &y2, &r2);
            d = sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
            minr = min(r1, r2);
            maxr = max(r1, r2);
            if(d <= maxr - minr)
                ans = acos(-1.0) * minr * minr;
            else if(d >= r1 + r2)
                ans = 0;
            else {
                double a1, a2;
                double p;
                p = (r1 + r2 + d) / 2;
                a1 = acos((r1 * r1 + d * d - r2 * r2) / (2 * r1 * d));
                a2 = acos((r2 * r2 + d * d - r1 * r1) / (2 * r2 * d));
                ans = a1 * r1 * r1 + a2 * r2 * r2 - 2 * sqrt(p * (p - r1) * (p - r2) * (p - d));
            }
            printf("%.3f
    ", ans);
        }
        return 0;
    }
    

      

  • 相关阅读:
    iOS 添加微信分享
    IOS学习笔记——ViewController生命周期详解
    UI之CALayer详解(转)
    iOS CALayer讲解
    [leetcode] Minimum Path Sum
    [leetcode]Binary Tree Maximum Path Sum
    我是真的想去google啊
    C++ string 用法详解
    继续存博客
    bash中 2>&1 & 的解释
  • 原文地址:https://www.cnblogs.com/zlrrrr/p/9688159.html
Copyright © 2011-2022 走看看