SDUT 2603:Rescue The Princess

284人阅读 评论(0) 收藏 举报
分类:

Rescue The Princess

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 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)

提示

 

来源

2013年山东省第四届ACM大学生程序设计竞赛


题意:按逆时针顺序给出两点坐标,求第三点坐标。使这三点构成一个等边三角形!
#include<stdio.h>
#include<math.h>
#define PI acos(-1.0)
int main()
{
    int n;
    scanf("%d",&n);
    while(n--)
    {
        double x1,x2,y1,y2;
        scanf("%lf%lf%lf%lf",&x1,&y1,&x2,&y2);
        double t=atan2(y2-y1,x2-x1)+PI/3.0;
        double zz=sqrt(pow(x1-x2,2)+pow(y1-y2,2));
        double x=zz*cos(t)+x1,y=zz*sin(t)+y1;
        printf("(%.2lf,%.2lf)\n",x,y);
    }
    return 0;
}


查看评论

山东省第四届ACM大学生程序设计竞赛 Rescue The Princess

Rescue The Princess Time Limit: 1000MS Memory limit: 65536K 题目描述     Several days ago, ...
  • zp___waj
  • zp___waj
  • 2016-04-09 10:18:48
  • 321

Rescue The Princess

Rescue The Princess Time Limit: 1000ms   Memory limit: 65536K  有疑问?点这里^_^ 题目描述     Severa...
  • u011471397
  • u011471397
  • 2014-04-10 17:16:54
  • 979

sdut 2603 Rescue The Princess (很水的几何题)

给出等边三角形的两个点,求另外一个点。画一个图,直接乱搞下。 #include #include #include #include #include #include #include #incl...
  • My_ACM_Dream
  • My_ACM_Dream
  • 2015-04-07 16:28:23
  • 305

山东省赛A题:Rescue The Princess

http://acm.sdibt.edu.cn/JudgeOnline/problem.php?id=3230 Description Several days ago, a beast caugh...
  • libin56842
  • libin56842
  • 2013-08-14 23:02:04
  • 2497

山东省第四届 A Rescue The Princess

题目描述     Several days ago, a beast caught a beautiful princess and the princess was put in prison...
  • ljd939952281
  • ljd939952281
  • 2016-04-09 11:43:08
  • 703

第四届 山东省ACM Rescue The Princess(计算几何)

Rescue ThePrincess Time Limit:1000ms   Memory limit: 65536K  有疑问?点这里^_^ 题目描述     Several daysago, a ...
  • u014665013
  • u014665013
  • 2017-04-13 09:27:03
  • 553

2013年山东省第四届ACM大学生程序设计竞赛 Problem A Rescue The Princess 向量法 水题

Rescue The Princess Time Limit: 1000MS Memory limit: 65536K 题目描述     Several days ago, a beast ca...
  • qdbszsj
  • qdbszsj
  • 2016-04-26 12:31:16
  • 423

SDUTRescue The Princess(数学问题)

题目描述     Several days ago, a beast caught a beautiful princess and the princess was put in pris...
  • u010372095
  • u010372095
  • 2013-08-13 21:40:52
  • 876

rescue the princess 省赛四1

Rescue The Princess Time Limit: 1000MS Memory limit: 65536K 题目描述     Several days ago, a beast ...
  • a716121
  • a716121
  • 2016-04-19 16:04:15
  • 201

Sdut-Ver5.2.0

  • 2012年10月26日 18:53
  • 2.12MB
  • 下载
    个人资料
    专栏达人 持之以恒
    等级:
    访问量: 37万+
    积分: 1万+
    排名: 1992
    寻找 Qianqian 遇见 就是幸运
    博客专栏
    最新评论