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
Output
YES
NO
Hint
import java.util.*;
class square {
int x1, x2, x3, x4, y1, y2, y3, y4;
public void judge() {
int f = 0;
if (Math.pow(x1 - x2, 2) + Math.pow(y1 - y2, 2) != Math.pow(x1 - x4, 2) + Math.pow(y1 - y4, 2)
|| Math.pow(x3 - x2, 2) + Math.pow(y3 - y2, 2) != Math.pow(x3 - x4, 2) + Math.pow(y3 - y4, 2)
|| Math.pow(x4 - x2, 2) + Math.pow(y4 - y2, 2) != Math.pow(x1 - x3, 2) + Math.pow(y1 - y3, 2)) {
f = 1;
}
if (f == 1) {
System.out.println("NO");
} else {
System.out.println("YES");
}
}
}
public class Main {
public static void main(String[] args) {
Scanner reader = new Scanner(System.in);
int a = reader.nextInt();
while (a-- > 0) {
square b = new square();
b.x1 = reader.nextInt();
b.y1 = reader.nextInt();
b.x2 = reader.nextInt();
b.y2 = reader.nextInt();
b.x3 = reader.nextInt();
b.y3 = reader.nextInt();
b.x4 = reader.nextInt();
b.y4 = reader.nextInt();
b.judge();
}
reader.close();
}
}