poj 1254 Hansel and Grethel
2011-07-22 22:28
423 查看
#include<iostream> //求两直线交点,交点是存在的 #include<stdio.h> #include<cmath> using namespace std; #define pi acos(-1.0) int main() { int cases; double x1,y1,d1,x2,y2,d2,k1,k2,x,y; cin>>cases; while(cases--) { cin>>x1>>y1>>d1>>x2>>y2>>d2; k1=tan((450-d1)*pi/180);k2=tan((450-d2)*pi/180); //角度 0 = North, 90 = East, x=(y2-k2*x2-(y1-k1*x1))/(k1-k2); y=(k1*k2*x1-k1*k2*x2+k1*y2-k2*y1)/(k1-k2); //如果写成 y=k1*x+y1-k1*x1 是会WA,可能是因为x本身有误差 printf("%.4f %.4f\n",x,y); } return 0; }
相关文章推荐
- poj 1254 Hansel and Grethel
- POJ 1254 Hansel and Grethel 笔记
- poj 1254 Hansel and Grethel 直线求交
- 1254 Hansel and Grethel
- zoj 1560 Hansel and Grethel(求两条直线的交点)
- sicily 1070. Hansel and Grethel
- 1070[Hansel and Grethel]
- [sicily online]1070. Hansel and Grethel
- B - Ignatius and the Princess IV——POJ
- poj1028--动态规划--Ignatius and the Princess III
- poj 1028 Ignatius and the Princess III 等于价值为M的有多少种情况
- poj1028--动态规划--Ignatius and the Princess III
- poj 1912 A highway and the seven dwarfs
- POJ 2422 The Wolves and the Sheep 笔记
- POJ1912_A highway and the seven dwarfs_判断凸包与直线是否相交
- POJ 4489 The King’s Ups and Downs (区间DP)
- POJ 3083 Children of theCandy Corn(DFS and BFS)
- POJ 3312 Mahershalalhashbaz, Nebuchadnezzar, and Billy Bob Benjamin Go to the Regionals (水题,贪心)
- POJThe Doors AND NYIST 有趣的问题
- poj 2567 zzu10395 nyoj1254 Code the Tree(Prufer数列)