In program contests, the ability of discovering easy problems from 8-10 problems is very important. Easy problems may have either a long description or a short description, so it’s hard to discover an easy problem just by looking at the problem description. But a tricky way is by looking at the problem name and the sample input/output. Look at the sample input/output of this problem. Yes! This is the easiest problem of this practice contest. But you have to guess what I want you do from the sample input/output.
Input starts with a number n, denoting the number of test cases. Following are n lines, with each line containing two integers x and y.
For each test case, output the answer on a line by itself.
5 1 2 -2 3 5 100 2 7 -100 -3
2 3 100 7 -3
Migrated from old NTUJ.
| No. | Testdata Range | Score |
|---|