UVA - 10250 The Other Two Trees

最新推荐文章于 2020-09-14 06:26:50 发布

苏摩夜

最新推荐文章于 2020-09-14 06:26:50 发布

阅读量415

点赞数

分类专栏：几何文章标签： uva UVA - 10250 The Othe

本文链接：https://blog.csdn.net/zz_FreeSky/article/details/38515935

版权

几何专栏收录该内容

5 篇文章

订阅专栏

Problem E

The Other Two Trees

Input: standard input

Output: standard output

Time Limit: 2 seconds

You have a quadrilateral shaped land whose opposite fences are of equal length. You have four neighbors whose lands are exactly adjacent to your four fences, that means you have a common fence with all of them. For example if you have a fence of length d in one side, this fence of length d is also the fence of the adjacent neighbor on that side. The adjacent neighbors have no fence in common among themselves and their lands also don’t intersect. The main difference between their land and your land is that their lands are all square shaped. All your neighbors have a tree at the center of their lands. Given the Cartesian coordinates of trees of two opposite neighbors, you will have to find the Cartesian coordinates of the other two trees.

Input

The input file contains several lines of input. Each line contains four floating point or integer numbers x1, y1, x2, y2, where (x1, y1), (x2, y2) are the coordinates of the trees of two opposite neighbors. Input is terminated by end of file.

Output

For each line of input produce one line of output which contains the line “Impossible.” without the quotes, if you cannot determine the coordinates of the other two trees. Otherwise, print four floating point numbers separated by a single space with ten digits after the decimal point ax1, ay1, ax2, ay2, where (ax1, ay1) and (ax2, ay2) are the coordinates of the other two trees. The output will be checked with special judge program, so don’t worry about the ordering of the points or small precision errors. The sample output will make it clear.

Sample Input

10 0 -10 0

Sample Output

0.0000000000 10.0000000000 0.0000000000 -10.0000000000

0.0000000000 10.0000000000 -0.0000000000 -10.0000000000

0.0000000000 -10.0000000000 0.0000000000 10.0000000000

题意：

已知两点，旋转90度之后的两个端点的坐标的值；

利用中点以及sin 和cos进行相关转化就可求出；

还有一种使用向量方法进行；

#include<stdio.h>
#include<math.h>
#include<iostream>
using namespace std;

int main(){
	double x1,x2;
	double y1,y2;
	double sin,cos;

	while(scanf("%lf%lf%lf%lf",&x1,&y1,&x2,&y2) != EOF)
	{
		double x = (x1 + x2) / 2;
		double y = (y1 + y2) / 2;
		double d = sqrt ((x1-x2)*(x1- x2) + (y1 - y2)*(y1-y2));
		sin =( y2 - y1 ) / d;
		cos =( x2 - x1 ) / d;
		double x3 = x - d * sin * 0.5;
		double y3 = y + d * cos * 0.5;
		double x4 = x + d * sin * 0.5;
		double y4 = y - d * cos * 0.5;
		printf("%.10lf %.10lf %.10lf %.10lf\n",x3,y3,x4,y4);	
	
	
	}
	return 0;
}