zoukankan      html  css  js  c++  java
  • HDU

    Description

    Given two rectangles and the coordinates of two points on the diagonals of each rectangle,you have to calculate the area of the intersected part of two rectangles. its sides are parallel to OX and OY .
     

    Input

    Input The first line of input is 8 positive numbers which indicate the coordinates of four points that must be on each diagonal.The 8 numbers are x1,y1,x2,y2,x3,y3,x4,y4.That means the two points on the first rectangle are(x1,y1),(x2,y2);the other two points on the second rectangle are (x3,y3),(x4,y4).
     

    Output

    Output For each case output the area of their intersected part in a single line.accurate up to 2 decimal places.
     

    Sample Input

    1.00 1.00 3.00 3.00 2.00 2.00 4.00 4.00 5.00 5.00 13.00 13.00 4.00 4.00 12.50 12.50
     

    Sample Output

    1.00 56.25





    #include <iostream>
    #include <cstdio>
    #include <cmath>
    #include <algorithm>
    using namespace std;
    
    int main()
    {
        double x[4];
        double y[4];
        while(cin>>x[0]>>y[0]>>x[1]>>y[1]>>x[2]>>y[2]>>x[3]>>y[3])
        {
            double l = fabs(x[1]-x[0])+fabs(x[3]-x[2])-(*max_element(x,x+4)-*min_element(x,x+4));
            double h = fabs(y[1]-y[0])+fabs(y[3]-y[2])-(*max_element(y,y+4)-*min_element(y,y+4));
            if(l<=0 || h<=0) printf("0.00
    ");
            else printf("%.2lf
    ", l * h);
        }
        return 0;
    }


  • 相关阅读:
    IDEA快捷方式
    JVM调优总结
    log4g详细配置
    大前端完整学习路线(详解)
    Tomcat工作原理
    Oracle
    Servlet知识
    lmap
    常见博客API
    PL/SQL入门理解(一)
  • 原文地址:https://www.cnblogs.com/kunsoft/p/5312756.html
Copyright © 2011-2022 走看看