poj 1254 Hansel and Grethel

#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;
}