HDU5605——geometr

Problem 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≤10000.

 

Output

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

 

Sample Input

12 1

 

Sample Output

4in 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.

 

#include<stdio.h>int main(){int t,x,y;scanf("%d",&t);while(t--){scanf("%d %d",&x,&y);printf("%d\n",2*x*y);}return 0;}