Michael is blamed for disregarding the social removing rules and making a danger of spreading Covid. He is currently shipped off jail. Fortunately, Michael knows precisely what the jail resembles from within, particularly since it's actual straightforward. The jail can be addressed as a square shape a×b which is separated into stomach muscle cells, each addressing a jail cell, normal sides being the dividers among cells, and sides on the border being
Correct answer will be upvoted else downvoted. Computer science.
Michael is blamed for disregarding the social removing rules and making a danger of spreading Covid. He is currently shipped off jail. Fortunately, Michael knows precisely what the jail resembles from within, particularly since it's actual straightforward.
The jail can be addressed as a square shape a×b which is separated into stomach muscle cells, each addressing a jail cell, normal sides being the dividers among cells, and sides on the border being the dividers prompting opportunity. Prior to condemning, Michael can ask his companions among the jail representatives to make (all around stowed away) openings in a portion of the dividers (counting dividers among cells and the furthest dividers). Michael needs to have the option to escape the jail after this, regardless of which cell he is set in. Be that as it may, he likewise needs to break as couple of dividers as could be expected.
Your assignment is to discover the most modest number of dividers to be broken so that there is a way to the outside from each cell after this.
Input
The primary line contains a solitary integer t (1≤t≤100) — the number of experiments.
Every one of the accompanying t lines contains two integers an and b (1≤a,b≤100), addressing a comparing experiment.
Output
For each experiment print the single integer on a different line — the response to the issue.
Step by step
Solved in 4 steps with 1 images
