import java.util.*;
import java.lang.Math;
public class recMul
{
public static void main(String[] args)
{
double[] rec1 = new double[4];
double[] rec2 = new double[4];
double[] rec3 = new double[4];
Scanner sc = new Scanner(System.in);
for (int i=0;i<rec1.length;i++) {
rec1[i]=sc.nextDouble();
}
for (int i=0;i<rec2.length;i++) {
rec2[i]=sc.nextDouble();
}
//保存相交区域右上角
rec3[2]=Math.min(Math.max(rec1[0],rec1[2]),Math.max(rec2[0],rec2[2]));
rec3[3]=Math.min(Math.max(rec1[1],rec1[3]),Math.max(rec2[1],rec2[3]));
//保存相交区域左下角
rec3[0]=Math.max(Math.min(rec1[0],rec1[2]),Math.min(rec2[0],rec2[2]));
rec3[1]=Math.max(Math.min(rec1[1],rec1[3]),Math.min(rec2[1],rec2[3]));
System.out.printf("%.2f",getArea(rec3));
}
public static double getArea(double[] rec3)
{
return ((rec3[2]-rec3[0])*(rec3[3]-rec3[1]));
}
}
矩形面积交---蓝桥杯
最新推荐文章于 2020-10-04 22:19:50 发布