Crush vs Friend
Statement
Goal
HelpIt is guaranteed that a seat always exists in middle of
Input
Line 1: Two integers rb and cb, representing the row and column numbers of Bob 's seat, separated by a space.
Line 2: Two integers re and ce, representing the row and column numbers ofErica 's seat, separated by a space.
Line 2: Two integers re and ce, representing the row and column numbers of
Output
Two integers, representing the row and column numbers of Jack 's ideal seat, separated by a space.
Constraints
1≤ rb, cb, re, ce ≤ 10
Example
Input
1 3 3 1
Output
2 2
Game modes
Fastest, Shortest
Test cases
simple diagonal Test
Input
1 3
3 1
Output
2 2
diagonal simple Validator
Input
1 5
5 1
Output
3 3
big diagonal Test
Input
9 10
1 2
Output
5 6
smaller diagonal Validator
Input
5 1
1 5
Output
3 3
same row Test
Input
2 1
2 5
Output
2 3
same row again Validator
Input
5 3
5 7
Output
5 5
Tricky part Test
Input
3 1
5 3
Output
4 2
Trickier Validator
Input
2 1
6 5
Output
4 3
Solution language
Solution
Stub generator input