周赛
2016-08-25 17:17
197 查看
F 圆周率用acos(-1.0) 使用longlong
Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%lld & %llu
Submit Status Practice LightOJ
1331
uDebug
Description
Agent J is preparing to steal an antique diamond piece from a museum. As it is fully guarded and they are guarding it using high technologies, it's not easy to steal the piece. There are three circular laser scanners in the museum which
are the main headache for Agent J. The scanners are centered in a certain position, and they keep rotating maintaining a certain radius. And they are placed such that their coverage areas touch each other as shown in the picture
below:
Here R1, R2 and R3 are the radii of the coverage areas of the three laser scanners. The diamond is placed in the place blue shaded region as in the picture. Now your task
is to find the area of this region for Agent J, as he needs to know where he should land to steal the diamond.
Input
Input starts with an integer T (≤ 1000), denoting the number of test cases.
Each case starts with a line containing three real numbers denoting R1, R2 and R3 (0 < R1, R2, R3 ≤ 100). And no number contains more than two digits after
the decimal point.
Output
For each case, print the case number and the area of the place where the diamond piece is located. Error less than 10-6 will be ignored.
Sample Input
3
1.0 1.0 1.0
2 2 2
3 3 3
Sample Output
Case 1: 0.16125448
Case 2: 0.645017923
Case 3: 1.4512903270
Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%lld & %llu
Submit Status Practice LightOJ
1331
uDebug
Description
Agent J is preparing to steal an antique diamond piece from a museum. As it is fully guarded and they are guarding it using high technologies, it's not easy to steal the piece. There are three circular laser scanners in the museum which
are the main headache for Agent J. The scanners are centered in a certain position, and they keep rotating maintaining a certain radius. And they are placed such that their coverage areas touch each other as shown in the picture
below:
Here R1, R2 and R3 are the radii of the coverage areas of the three laser scanners. The diamond is placed in the place blue shaded region as in the picture. Now your task
is to find the area of this region for Agent J, as he needs to know where he should land to steal the diamond.
Input
Input starts with an integer T (≤ 1000), denoting the number of test cases.
Each case starts with a line containing three real numbers denoting R1, R2 and R3 (0 < R1, R2, R3 ≤ 100). And no number contains more than two digits after
the decimal point.
Output
For each case, print the case number and the area of the place where the diamond piece is located. Error less than 10-6 will be ignored.
Sample Input
3
1.0 1.0 1.0
2 2 2
3 3 3
Sample Output
Case 1: 0.16125448
Case 2: 0.645017923
Case 3: 1.4512903270
#include<cstdio> #include<cstring> #include<cmath> #include<algorithm> using namespace std; int main() { int t,cont=0; double r1,r2,r3,s0,s1,s2,s3,s; double a,b,c; double cin1,cin2,cin3,sin3; scanf("%d",&t); while(t--) { scanf("%lf%lf%lf",&r1,&r2,&r3); a=r2+r3; b=r1+r3; c=r1+r2; cin1=(b*b+c*c-a*a)/(2*b*c); cin2=(a*a+c*c-b*b)/(2*a*c); cin3=(a*a+b*b-c*c)/(2*a*b); sin3=sqrt(1-pow(cin3,2)); s0=abs(0.5*a*b*sin3); s1=abs((acos(cin1)/(2*acos(-1.0)))*(acos(-1.0)*r1*r1)); s2=abs((acos(cin2)/(2*acos(-1.0)))*(acos(-1.0)*r2*r2)); s3=abs((acos(cin3)/(2*acos(-1.0)))*(acos(-1.0)*r3*r3)); s=s0-s1-s2-s3; printf("Case %d: %.9lf\n",++cont,s); } return 0; }//FFFFFFFFFFFFFF
相关文章推荐
- 周赛(1)——素数
- SDUT 第九周周赛
- 周赛 HDU 2767 1269 1872 强连通
- 周赛A山谷
- 周赛题目 福州 最长队名
- 十八周周赛D题Prizes, Prizes, more Prizes
- 2014_3_29_周赛 倒水
- 周赛 POJ 3546 The Dragon of Loowater
- 2015 年 JXNU_ACS 算法组寒假第一次周赛 1004 盘古开天辟地
- 中大周赛15年第6场
- 周赛-Integration of Polynomial
- 周赛题目
- Integration of Polynomial (周赛1)
- 周赛 Hdoj 5146
- 周赛 大数找规律
- 周赛 4 【kMP&&回文串】
- 第0周周赛——极限手速赛(题解)之下篇
- AYIT606第七周周赛(动态规划) A - How many ways
- 周赛
- 周赛总结(11.13)