Gym 100187H - Mysterious Photos

Everyone probably heard the rumours about the constellation of BermudaTriangle: any person who looks to this constellation of three stars is said todisappear completely. Though, it's not clear who then spreads these rumours.

Recently two photos have been sent to the editorial office of thenewspaper you work on. Each photo depicts three glowing points on the darkbackground. The note applied to the photos indicates that they are the photosof the constellation of the Bermuda Triangle.

Of course, the editors cannot check if it's true without the risk of thestuff. But at least it is possible to make sure that each photo depicts thesame triple of stars. Remember that photos could be taken with the differentzoom and rotation. They could also be taken with the help of a mirror in orderto decrease the risk of triggering the curse.

As a regular programmer of the newspaper you have the task to determineif these photos can depict the same triple of stars.

Input

The input consists of 6 lines. Each of the first three lines containstwo integers separated by space — the coordinates of stars onthe first photo. Each of the next three lines also contains two integers — the coordinates of stars on the second photo. Allcoordinates are between  - 10⁴ and 10⁴, inclusively. Stars on each photo don't coincide and don't lie on thesame line.

Output

Output «YES» if the photos can depict the same triple of stars and «NO» otherwise.

Sample test(s)

input

0 0
0 2
1 0
0 0
0 4
2 0

output

YES

input

0 0
0 2
1 0
0 0
0 4
3 0

output

NO

input

5 5
7 6
6 3
1 0
0 1
1 1

output

YES

 

思路：

判断两个三角形是否相似，比较是否对应边成比例

代码：
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

struct node
{
	__int64 x, y;
};

int main()
{
	node a[3];
	node b[3];
	__int64 l1[3], l2[3];

	int i;
	for (i = 0; i<3; i++)
		scanf("%I64d%I64d", &a[i].x, &a[i].y);
	for (i = 0; i<3; i++)
		scanf("%I64d%I64d", &b[i].x, &b[i].y);

	for (i = 0; i<3; i++)
	{
		int tx = a[i].x - a[(i + 1) % 3].x;
		int ty = a[i].y - a[(i + 1) % 3].y;
		l1[i] = tx*tx + ty*ty;

		tx = b[i].x - b[(i + 1) % 3].x;
		ty = b[i].y - b[(i + 1) % 3].y;
		l2[i] = tx*tx + ty*ty;
	}

	sort(l1, l1 + 3);
	sort(l2, l2 + 3);

	double temp = (double)l1[0] / l2[0];
	for (i = 1; i<3; i++)
	{
		if ((double)l1[i] / l2[i] != temp)
		{
			printf("NO\n");
			return 0;
		}
	}

	printf("YES\n");

	return 0;
}