#include #include using namespace std; struct zuobiao {int zuo,you,shang,xia; }a[3]; int jisuan(int a1,int a2,int a3,int a4,int b1,int b2,int b3,int b4) { int heng,zong; heng=(a2-a1+b2-b1-abs(a1-b1)-abs(a2-b2))/2; zong=(a4-a3+b4-b3-abs(a3-b3)-abs(a4-b4))/2; return heng*zong; } int main() { int i; for(i=1;i<=2;i++) { cin>>a[i].zuo>>a[i].you>>a[i].shang>>a[i].xia; } if(((a[1].zuo<=a[2].you)&&(a[1].you>=a[2].zuo))&&((a[1].xia>=a[2].shang)&&(a[1].shang<=a[2].xia))) cout<<jisuan(a[1].zuo,a[1].you,a[1].shang,a[1].xia,a[2].zuo,a[2].you,a[2].shang,a[2].xia); else cout<<0; } 数学方法 相交=（1长+2长-左（上）差-右（下）差）/2