Problem Description
给出四个点,判断这四个点能否构成一个正方形。
Input
输入的第一行包含一个整数T(T≤30)表示数据组数,每组数据只有一行,包括8个整数x1, y1, x2, y2,x3,y3,x4,y4(数据均在-1000,1000 之间)以逆时针顺序给出四个点的坐标。
Output
每组数据输出一行,如果是正方形,则输出: YES, 否则,输出:NO。
Sample Input
20 0 1 0 1 1 0 1-1 0 0 -2 1 0 2 0
Sample Output
YESNO
code:
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner reader = new Scanner(System.in);
int t;
t = reader.nextInt();
while(t-->0)
{
Point p1 = new Point(reader.nextInt(), reader.nextInt());
Point p2 = new Point(reader.nextInt(), reader.nextInt());
Point p3 = new Point(reader.nextInt(), reader.nextInt());
Point p4 = new Point(reader.nextInt(), reader.nextInt());
double a, b, c, d;
a = p1.length(p2);
b = p2.length(p3);
c = p3.length(p4);
d = p4.length(p1);
if(a == b&&b == c&&c == d)//菱形成立
{
double e = p2.length(p4);
if(a+d == e)//证明有直角,正方形成立
{
System.out.println("YES");
}
else
{
System.out.println("NO");
}
}
else
{
System.out.println("NO");
}
}
}
}
class Point
{
int x, y;
public Point(int x, int y)
{
this.x = x;
this.y = y;
}
public double length(Point p1)
{
return (x-p1.x)*(x-p1.x)+(y-p1.y)*(y-p1.y);
}
}