geometry
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 157 Accepted Submission(s): 117
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| .
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 .
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
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.解题思路:简单数学题,令A(a,0),B(0,b),k=b/a,那么|PA|*|PB|=x*y*(k+1/k),当k等于1时取最小。代码如下:#include<stdio.h> int main(){ int x,y,t; scanf("%d",&t); while(t--){ scanf("%d%d",&x,&y); printf("%d\n",2*x*y); } return 0; }