其他分享
首页 > 其他分享> > UVA10573 Geometry Paradox【计算几何】

UVA10573 Geometry Paradox【计算几何】

作者:互联网

In the picture below you can see two small circles touching each other. The larger circle touches both of them. The length of the common tangent inscribed inside the larger circle is t and the radiuses of the two smaller circles are r1 and r2. The centers of the three circles are collinear. You will be given the value of r1 and r2 or the value of t. You will have to find the area that is within the larger circle but out of the two smaller circles (marked gray in the picture). If the given data is not enough to find the gray area, print the line ‘Impossible.’ in a single line
在这里插入图片描述
Input
First line of the input file contains an integer N (N ≤ 100) which denotes how many sets of inputs are there. Each of the next N lines contain a set of input.
    Each set either contains one or two integer. If it contains one integer then it is the value of t, otherwise the two values are the values of r1 and r2. All these integers are less than 100
Output
For each line of input produce one line of output. This line contains the area of the gray part if the given information is enough to find the area of the gray part. Otherwise it contains the line ‘Impossible’. The area should have four digits after the decimal point. Assume that π = 2 ∗ cos−1(0).
Sample Input
2
10 10
15 20
Sample Output
628.3185
1884.9556

问题链接UVA10573 Geometry Paradox
问题简述:(略)
问题分析
    。
    。
程序说明:(略)
参考链接:(略)
题记:(略)

AC的C++语言程序如下:

标签:circles,gray,Paradox,area,Geometry,contains,two,UVA10573,line
来源: https://blog.csdn.net/tigerisland45/article/details/104646964