There is an endless 2-dimensional framework. The robot remains in cell (0,0) and needs to arrive at cell (x,y). Here is a rundown of potential orders the robot can execute: move north from cell (i,j) to (i,j+1); move east from cell (i,j) to (i+1,j); move south from cell (i,j
Correct answer will be upvoted else Multiple Downvoted. Computer science.
There is an endless 2-dimensional framework. The robot remains in cell (0,0) and needs to arrive at cell (x,y). Here is a rundown of potential orders the robot can execute:
move north from cell (i,j) to (i,j+1);
move east from cell (i,j) to (i+1,j);
move south from cell (i,j) to (i,j−1);
move west from cell (i,j) to (i−1,j);
stay in cell (i,j).
The robot needs to arrive at cell (x,y) in as couple of orders as could really be expected. In any case, he can't execute a similar order at least twice in succession.
What is the base number of orders needed to reach (x,y) from (0,0)?
Input
The main line contains a solitary integer t (1≤t≤100) — the number of testcases.
Every one of the following t lines contains two integers x and y (0≤x,y≤104) — the objective directions of the robot.
Output
For each testcase print a solitary integer — the base number of orders needed for the robot to reach (x,y) from (0,0) if no order is permitted to be executed at least twice in succession.
Step by step
Solved in 4 steps with 1 images
