Problems > The Rook's Trip

The Rook's Trip

Difficulty: 800 2000 ms 128 MB

math

A rook moves any distance along a row or column. Minimum moves from (r1, c1) to (r2, c2)?

Input: one line with four integers r1 c1 r2 c2.

Output: 0, 1 or 2.

Constraints:

  • |coordinates| ≤ 109

Sample Tests

Input 1
1 5 1 9
Output 1
1
Input 2
2 2 5 7
Output 2
2

Read the Editorial

Discussion (opens after you solve — no spoilers before)

No comments yet.

Submit Your Solution

Log in or create a free account to run and submit code.