SDUT-2444 正方形

Problem Description

给出四个点，判断这四个点能否构成一个正方形。

Input

 输入的第一行包含一个整数T（T≤30）表示数据组数，每组数据只有一行，包括8个整数x1, y1, x2, y2，x3，y3，x4，y4（数据均在-1000,1000 之间）以逆时针顺序给出四个点的坐标。

 

Output

 每组数据输出一行，如果是正方形，则输出： YES， 否则，输出：NO。

 

Sample Input

2
0 0 1 0 1 1 0 1
-1 0 0 -2 1 0 2 0

Sample Output

YES
NO

import java.util.Scanner;
class Judge{
	int x1, y1, x2, y2, x3, y3, x4, y4, r;
	Judge(int x1, int y1, int x2, int y2, int x3, int y3, int x4, int y4)
	{
		this.x1 = x1;
		this.y1 = y1;
		this.x2 = x2;
		this.y2 = y2;
		this.x3 = x3;
		this.y3 = y3;
		this.x4 = x4;
		this.y4 = y4;
	}
	int Flag()
	{
		r = (x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2);
		if((x2 - x3) * (x2 - x3) + (y2 - y3) * (y2 - y3) == r && (x3 - x4) * (x3 - x4) + (y3 - y4) * (y3 - y4) == r && (x1 - x4) * (x1 - x4) + (y1 - y4) * (y1 - y4) == r && (x1 - x3) * (x1 - x3) + (y1 - y3) * (y1 - y3) == (x4 - x2) * (x4 - x2) + (y4 - y2) * (y4 - y2))
		{
			return 1;
		}
		else return 0;
	}
}
public class Main {
	public static void main(String args[]) {
		Scanner in = new Scanner(System.in);
		int t, x1, y1, x2, y2, x3, y3, x4, y4;
		t = in.nextInt();
		Judge m;
		while(t > 0)
		{
			t--;
			x1 = in.nextInt();
			y1 = in.nextInt();
			x2 = in.nextInt();
			y2 = in.nextInt();
			x3 = in.nextInt();
			y3 = in.nextInt();
			x4 = in.nextInt();
			y4 = in.nextInt();
			m = new Judge(x1, y1, x2, y2, x3, y3, x4, y4);
			if(m.Flag() == 1)System.out.println("YES");
			else System.out.println("NO");
		}
       in.close();
}
}