Rescue The Princess(数学)

题目描述

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 an equilateral triangle 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 you calculate 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 the equilateral triangle. And coordinates A(x1,y1) and B(x2,y2) are given by anticlockwise.

输出

For each test case, you should output the coordinate of C(x3,y3), the result should be rounded to 2 decimal places in a line.

样例输入

4
-100.00 0.00 0.00 0.00
0.00 0.00 0.00 100.00
0.00 0.00 100.00 100.00
1.00 0.00 1.866 0.50

样例输出

(-50.00,86.60)
(-86.60,50.00)
(-36.60,136.60)
(1.00,1.00)

思路

平面上一点 （ x1 , y1） , 绕平面上另一点（ x2 , y2 ）顺时针旋转θ角度 ，旋转后的（ x1 , y1）对应的坐标（ x ，y ）
x = ( x1 - x2 ) * cosθ - ( y1 - y2 ) * sinθ + x2；
y = ( y1 - y2 ) * cosθ + ( x1 - x2 ) * sinθ + y2；

代码

#include<iostream>
#include<string>
#include<map>
#include<set>
//#include<unordered_map>
#include<queue>
#include<cstdio>
#include<vector>
#include<cstring>
#include<algorithm>
#include<iomanip>
#include<stack>
#include<cmath>
#include<fstream>
#define X first
#define Y second
#define best 131 
#define INF 0x3f3f3f3f
#define P pair<int,int>
#define ls p<<1
#define rs p<<1|1
//#define int long long
//#define int long long
//const ll lnf=0x3f3f3f3f3f3f3f3f;
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const double eps=1e-5;
const double pai=acos(-1.0);
const int N=2e5+10;
const int maxn=1e6+10;
const int mod=1000000007;
int main( )
{
    double tmp=sqrt(3);
    int t;
    scanf("%d",&t);
    while(t--)
    {
        double x1,x2,y1,y2,x,y;
        scanf("%lf%lf%lf%lf",&x1,&y1,&x2,&y2);
        x=x2-x1;
        y=y2-y1;
        double x3=x/2-y*tmp/2+x1;
        double y3=y/2+x*tmp/2+y1;
        printf("(%.2f,%.2f)\n",x3,y3);
    }
    return 0;
}

最后附上大佬的公式证明：https://www.cnblogs.com/fangsmile/p/8622421.html