一个ACm/ICPC问题
给你一个三角形的三边,一个圆的半径。两个图形放在平面上,可以移动,求最大公共面积!
期待高手
Problem C: Circle and Triangle
Time Limit: 1 sec
Description
LMY and YY are geometry lovers. They enjoy challenging each other with interesting geometry problems. One day, LMY puts a circle and a triangle on a plane. Then YY moves them. They find that the overlapping area of the circle and the triangle varies as the relative position between the two changes. LMY and YY want to find out the largest common area.
The Input
Input consists of one or more lines. For each line, there are four integers describing one test case: the lengths of three sides of a triangle a, b, c; and the radius of a circle r; where 1≤a≤b≤c≤100, 1≤r≤100, and a+b>c.End of input is indicated by a line consisting four zeros.
The Output
For each test case, output a single line showing the largest overlapping area of the circle and the triangle. The precision should be 10-2.
Sample Input
3 4 5 1 (分别为三角形 三边 和半径)
5 5 8 4
0 0 0 0
Sample Output
3.14
12.00
期待高手
Problem C: Circle and Triangle
Time Limit: 1 sec
Description
LMY and YY are geometry lovers. They enjoy challenging each other with interesting geometry problems. One day, LMY puts a circle and a triangle on a plane. Then YY moves them. They find that the overlapping area of the circle and the triangle varies as the relative position between the two changes. LMY and YY want to find out the largest common area.
The Input
Input consists of one or more lines. For each line, there are four integers describing one test case: the lengths of three sides of a triangle a, b, c; and the radius of a circle r; where 1≤a≤b≤c≤100, 1≤r≤100, and a+b>c.End of input is indicated by a line consisting four zeros.
The Output
For each test case, output a single line showing the largest overlapping area of the circle and the triangle. The precision should be 10-2.
Sample Input
3 4 5 1 (分别为三角形 三边 和半径)
5 5 8 4
0 0 0 0
Sample Output
3.14
12.00
...全文
相关推荐
ACM-ICPC/CCPC/XCPC算法竞赛资料限定距离的子树问题
ACM-ICPC/CCPC/XCPC算法竞赛资料限定距离的子树问题
【最大流问题 dinic算法】Internet Bandwidth, ACM/ICPC World Finals 2000, UVa820
#include #include #include #include #include #include using namespace std; int n,s,t,m; const int MAXM = 160000; const int MAXN = 400; const int INF = 0x3f3f3f3f; struct edge{ int to,cap,next; }
Beijing.zip_2014 ACM_ACM Beijing_acm icpc _beijing_icpc
The 2014 ACM-ICPC Asia Beijing Regional Contest
ACM/ICPC题集
吉林大学计算机科学学院2005年制作的ACMICPC代码库
最小生成树(MST)问题——北京大学暑期课《ACM/ICPC竞赛训练》
最小生成树(MST)问题


