| Online Judge | Online Exercise | Online Teaching | Online Contests | Exercise Author |
|
F.A.Q Hand In Hand Online Acmers |
Best Coder beta VIP | STD Contests DIY | Web-DIY beta |
geometry
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1115 Accepted Submission(s): 827
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\leq 10000$.
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
| Home | Top |
Hangzhou Dianzi University Online Judge 3.0 Copyright © 2005-2024 HDU ACM Team. All Rights Reserved. Designer & Developer : Wang Rongtao LinLe GaoJie GanLu Total 0.000000(s) query 1, Server time : 2024-05-03 15:53:01, Gzip enabled |
Administration |