正方形
Time Limit: 1000MS Memory Limit: 65536KB
Problem Description
给出四个点,判断这四个点能否构成一个正方形。
Input
输入的第一行包含一个整数T(T≤30)表示数据组数,每组数据只有一行,包括8个整数x1, y1, x2, y2,x3,y3,x4,y4(数据均在-1000,1000 之间)以逆时针顺序给出四个点的坐标。
Output
每组数据输出一行,如果是正方形,则输出: YES, 否则,输出:NO。
Example Input
20 0 1 0 1 1 0 1-1 0 0 -2 1 0 2 0
Example Output
YESNO
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner (System.in);
while( in.hasNext() ){
int t = in.nextInt();
while( t-->0 ){
Square s1 = new Square(in.nextInt(), in.nextInt());
Square s2 = new Square(in.nextInt(), in.nextInt());
Square s3 = new Square(in.nextInt(), in.nextInt());
Square s4 = new Square(in.nextInt(), in.nextInt());
if( s1.distance(s2)==s1.distance(s4) && s1.distance(s4)==s3.distance(s4)
&& s3.distance(s4)== s3.distance(s2) && s1.distance(s3)==s2.distance(s4) )
System.out.println("YES");
else
System.out.println("NO");
}
}
in.close();
}
}
class Square{
int x, y;
public Square( int x, int y ){
this.x = x;
this.y = y;
}
public double distance( Square s ){
return Math.pow((x-s.x),2)+Math.pow((y-s.y),2);
}
}