Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- int length(int l1, int r1, int l2, int r2){
- int l = max(l1, l2);
- int r = min(r1, r2);
- if (r < l) return 0; // пересечения нет
- else return r - l;
- return 0;
- }
- int main(){
- int x1,x2,x3,x4;
- int y1,y2,y3,y4;
- cin >> x1 >> y1 >> x2 >> y2;
- cin >> x3 >> y3 >> x4 >> y4;
- if (x2 < x1) swap(x1,x2);
- if (x4 < x3) swap(x3,x4);
- if (y2 < y1) swap(y1,y2);
- if (y4 < y3) swap(y3,y4);
- int w = length(x1,x2,x3,x4);
- int h = length(y1,y2,y3,y4);
- cout << w * h;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment