rescue the princess 省赛四1
来源:互联网 发布:西门子触摸屏编程手册 编辑:程序博客网 时间:2024/05/22 15:29
Time Limit: 1000MS Memory limit: 65536K
题目描述
Several days ago, a beast caught a beautiful princess and the princess was put in prison. To rescue the princess, a prince who wanted to marry the princess set out immediately. Yet, the beast set a maze. Only if the prince find out the maze’s exit can he save the princess.
Now, here comes the problem. The maze is a dimensional plane. The beast is smart, and he hidden the princess snugly. He marked two coordinates of anequilateraltriangle in the maze. The two marked coordinates are A(x1,y1) and B(x2,y2). The third coordinate C(x3,y3) is the maze’s exit. If the prince can find out the exit, he can save the princess. After the prince comes into the maze, he finds out the A(x1,y1) and B(x2,y2), but he doesn’t know where the C(x3,y3) is. The prince need your help. Can youcalculate the C(x3,y3) and tell him?
输入
The first line is an integer T(1 <= T <= 100) which is the number of test cases. T test cases follow. Each test case contains two coordinates A(x1,y1) and B(x2,y2), described by four floating-point numbers x1, y1, x2, y2 ( |x1|, |y1|, |x2|, |y2|<= 1000.0).
Please notice that A(x1,y1) and B(x2,y2) and C(x3,y3) are in an anticlockwise direction from theequilateraltriangle. And coordinates A(x1,y1) and B(x2,y2) are given by anticlockwise.
输出
示例输入
4-100.00 0.00 0.00 0.000.00 0.00 0.00 100.000.00 0.00 100.00 100.001.00 0.00 1.866 0.50
示例输出
(-50.00,86.60)(-86.60,50.00)(-36.60,136.60)(1.00,1.00)
提示
即将AB线段绕A点逆时针旋转60°后B点的位置
用到平面几何求解
x3=x1+L*cos(60°+angle);
y3=y1+L*sin(60°+angle);
angle=atan2(y2-y1,x2-x1);
60°化成弧度
const double PI=acos(-1.0);
而PI/3.0就是60°
#include <iostream>#include<cstdio>#include<cmath>using namespace std;const double PI=acos(-1.0);int main(){ int t; cin>>t; double x1,y1,x2,y2,x3,y3,angle,l; while(t--) { scanf("%lf%lf%lf%lf",&x1,&y1,&x2,&y2); angle=atan2(y2-y1,x2-x1); l=sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2)); x3=x1+l*cos(angle+PI/3.0); y3=y1+l*sin(angle+PI/3.0); printf("(%.2lf,%.2lf)\n",x3,y3); printf("%.2lf",acos(PI)); } return 0;}
- rescue the princess 省赛四1
- Rescue The Princess
- UPC2217: Rescue The Princess
- A:Rescue The Princess
- Rescue The Princess
- 2217: Rescue The Princess(UPC)
- sdjzuoj 2558:Rescue The Princess
- 第四届 Rescue The Princess
- SDUT 2603:Rescue The Princess
- 山东省赛A题:Rescue The Princess
- Rescue The Princess (数学水题)
- SDUT 2603-Rescue The Princess(几何题)
- 2013 山东省赛 || Rescue The Princess
- 山东省第四届 A Rescue The Princess
- Rescue The Princess(计算几何)
- 计算几何初步-向量的旋转 Rescue The Princess
- sdut 2603 Rescue The Princess (很水的几何题)
- 山东省第四届ACM大学生程序设计竞赛 Rescue The Princess
- 语法错误 : 缺少“;”(在“类型”的前面)
- MacBook如何用Parallels Desktop安装windows7/8
- angular 学习网址推荐(持续更新中)
- 网络:使用多线程下载文件
- 关于C/C++中的inline
- rescue the princess 省赛四1
- Oracle 中 decode 函数用法
- C#中的数组
- 图的最短路径-Dijkstra和Floyd
- iOS基础调试 console
- 关于ADB(android debug bridge)一些操作
- 网络:取消下载
- Thrift lua example
- 面向对象在javascript中的三大特征之多态