AOJ 4981 - geometry

geometry

Time Limit: 1000ms

Memory Limit: 65536KB

This problem will be judged on HDU. Original ID: 5605
64-bit integer IO format: %I64d Java class name: Main

Submit Status Statistics

Font Size:

Description

There is a point $P$ at coordinate $(x,y)$.
A line goes through the point, and intersects with the postive part of $X,Y$ axes at point $A,B$.
Please calculate the minimum possible value of $|PA|*|PB|$.

Input

the first line contains a positive integer T,means the numbers of the test cases.

the next T lines there are two positive integers X,Y,means the coordinates of P.

$T=500$,$0< X,Y\leq 10000$.

Output

T lines,each line contains a number,means the answer to each test case.

Sample Input

1
2 1

Sample Output

4

in the sample $P(2,1)$,we make the line $y=-x+3$,which intersects the positive axis of $X,Y$ at (3,0),(0,3).$|PA|=\sqrt{2},|PB|=2\sqrt{2},|PA|*|PB|=4$,the answer is checked to be the best answer.

Source

BestCoder Round #68 (div.2)