HDU 5605 geometry

Problem Description

There is a point  at coordinate . A line goes through the point, and intersects with the postive part of  axes at point . Please calculate the minimum possible value of .

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.

,.

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)P(2,1),we make the line y=-x+3y=−x+3,which intersects the positive axis of X,YX,Y at (3,0),(0,3).|PA|=\sqrt{2},|PB|=2\sqrt{2},|PA|*|PB|=4∣PA∣=√2,∣PB∣=2√2,∣PA∣∗∣PB∣=4,the answer is checked to be the best answer.

数学题

#include<map>
#include<stack>
#include<queue>
#include<cmath>
#include<string>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<functional>
using namespace std;
typedef long long LL;
const int maxn = 1e5 + 10;
int T, x, y;

int main()
{
    scanf("%d", &T);
    while (T--)
    {
        scanf("%d%d", &x, &y);
        printf("%d\n", 2 * x*y);
    }
    return 0;
}