Lightoj1433——Minimum Arc Distance (求弧长)
来源:互联网 发布:宏盟媒体集团 知乎 编辑:程序博客网 时间:2024/06/08 17:31
You all probably know how to calculate the distance between two points in two dimensional cartesian plane. But in this problem you have to find the minimum arc distance between two points and they are on a circle centered at another point.
You will be given the co-ordinates of the points A and B and co-ordinate of the center O. You just have to calculate the minimum arc distance between A and B. In the picture, you have to calculate the length of arc ACB. You can assume that A and B will always be on the circle centered at O.
Input
Input starts with an integer T (≤ 100), denoting the number of test cases.
Each case starts with a line containing six integers Ox, Oy, Ax, Ay, Bx, By where (Ox, Oy) indicates the co-ordinate of O, (Ax, Ay) denote the co-ordinate of A and (Bx, By) denote the co-ordinate of B. All the integers will lie in the range [1, 10000].
Output
For each case, print the case number and the minimum arc distance. Errors less than 10-3 will be ignored.
Sample Input
5
5711 3044 477 2186 3257 7746
3233 31 3336 1489 1775 134
453 4480 1137 6678 2395 5716
8757 2995 4807 8660 2294 5429
4439 4272 1366 8741 6820 9145
Output for Sample Input
Case 1: 6641.81699183
Case 2: 2295.92880
Case 3: 1616.690325
Case 4: 4155.64159340
Case 5: 5732.01250253
弧长公式为圆心角弧度*半径
#include<stdio.h>#include<string.h>#include<cmath>#include<algorithm>using namespace std;int main(){ int t,tt=0; scanf("%d",&t); while(t--) { double ox,oy,x1,y1,x2,y2; scanf("%lf%lf%lf%lf%lf%lf",&ox,&oy,&x1,&y1,&x2,&y2); printf("Case %d: ",++tt); double l1,l2; l1=sqrt((ox-x1)*(ox-x1)+(oy-y1)*(oy-y1)); l2=sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2)); l2=(double)l2/2; double a=asin(l2/l1); a=a*2.0; printf("%.10lf\n",a*l1); } return 0;}
- Lightoj1433——Minimum Arc Distance (求弧长)
- LightOJ 1433 Minimum Arc Distance
- LightOJ 1433 - Minimum Arc Distance
- LightOJ 1433-Minimum Arc Distance【几何】
- LightOJ - 1433 Minimum Arc Distance (数学几何)求圆上两点间的弧长
- Light oj 1433 - Minimum Arc Distance【计算几何(坑精度!)】
- Minimum edit distance(levenshtein distance)(最小编辑距离)初探
- “最小编辑距离(Minimum Edit Distance)”
- 最小编辑距离(Minimum edit distance)
- 编辑距离(Minimum Edit Distance)
- Minimum Distance in a Star Graph(南宁网络赛)
- 自然语言处理-Minimum edit distance
- Minimum distance of three points
- iOS学习笔记——ARC两三事(strong、weak详解,ARC与非ARC混编)
- Xcode—ARC
- 最短编译距离(Minimum Edit Distance)算法及java实现
- stanford NLP第三课“最小编辑距离(Minimum Edit Distance)”
- 2017 ACM-ICPC南宁网络赛: J. Minimum Distance in a Star Graph(BFS)
- 续上
- 大端模式和小端模式
- java的重载和重写机制
- 11章课后习题6
- ionic+angularjs开发的app自动升级
- Lightoj1433——Minimum Arc Distance (求弧长)
- 157.Unique Characters-判断字符串是否没有重复字符(容易题)
- 多线程Demo
- css样式基础之样式的引入
- Mantle简介
- JavaScript正则表达式
- 尺取法模板题 poj 3061 Subsequence
- java练习---AutoLion
- 兼容IE6+、Chrome、FireFox的固定浮动css代码