#include <iostream>
#include <iomanip>
#include <cmath>
#include <algorithm>
using namespace std;
int main()
{
double x1, y1, x2, y2, x3, y3, x4, y4, x[4], y[4], length, width;
while (cin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3 >> x4 >> y4) {
x[0] = x1;
x[1] = x2;
x[2] = x3;
x[3] = x4;
y[0] = y1;
y[1] = y2;
y[2] = y3;
y[3] = y4;
sort(x, x + 4);
sort(y, y + 4);
// 重合部分的长等于两个矩形长的和减去四个横坐标中最大与最小的差
length = fabs(x1 - x2) + fabs(x3 - x4) - (x[3] - x[0]);
width = fabs(y1 - y2) + fabs(y3 - y4) - (y[3] - y[0]);
if (length < 0 || width < 0) {
cout << "0.00" << endl;
}
else {
cout << setiosflags(ios::fixed) << setprecision(2) << length * width << endl;
}
}
return 0;
}
因篇幅问题不能全部显示,请点此查看更多更全内容
Copyright © 2019- haog.cn 版权所有 赣ICP备2024042798号-2
违法及侵权请联系:TEL:199 1889 7713 E-MAIL:2724546146@qq.com
本站由北京市万商天勤律师事务所王兴未律师提供法律服务