[Solution] Change Row and Column Both CodeChef Solution

[Solution] Change Row and Column Both CodeChef Solution

There is a 10×10$10\times 10$ grid with rows numbered 1$1$ to 10$10$ from top to bottom, and columns 1$1$ to 10$10$ from left to right. Each cell is identified by a pair (r, c)$(r,\hspace{0.17em}c)$ which means that the cell is located at row r$r$ and column c$c$.

If Chef's current location is (a,b)$(a,b)$, then in one move Chef can go to (c,d)$(c,d)$ if both of the following are satisfied:

• a≠c$a\ne c$
• b≠d$b\ne d$

Solution Click Below:-  👉CLICK HERE👈

👇👇👇👇👇

Determine the minimum number of moves required to go from (sx,sy)$(s_x,s_y)$ to (ex,ey)$(e_x,e_y)$.

Input Format

• The first line contains a single integer T$T$ — the number of test cases. Then the test cases follow.
• The first and only line of each test case contains four integer sx$s_x$, sy$s_y$, ex$e_x$, ey$e_y$ — the coordinates of

Best of Two CodeChef Solution

Chef and his Apps CodeChef Solution

Change Row and Column Both CodeChef Solution

Adjacent Sum Parity CodeChef Solution

Retrieve the Array CodeChef Solution

Even Equal Odd CodeChef Solution

Xor and Multiply CodeChef Solution

KBG and GN-Theory CodeChef Solution

•  the starting and ending cells.

Output Format

For each testcase, output the minimum number of moves required to go from (sx,sy)$(s_x,s_y)$ to (ex,ey)$(e_x,e_y)$.

Constraints

• 1≤T≤1000$1\le T\le 1000$
• 1≤sx,sy,ex,ey≤10$1\le s_x,s_y,e_x,e_y\le 10$
• (sx,sy)≠(ex,ey)