HDU 5533 Dancing Stars on Me

题意

思路

代码

#include <iostream>
#include <algorithm>
using namespace std;
struct dot{
int x,y;
}dots[101];
int askSideLength(struct dot a, struct dot b){
return (a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y);
}
int sides[100000001];
int main(int argc, char *argv[])
{
int t,n;
cin>>t;
while(t--){
cin>>n;
int flag=1;
for(int i=0;i<n;i++){
cin>>dots[i].x>>dots[i].y;
}
int answer=0;
for(int i=0;i<n;i++){
for(int j=i+1;j<n;j++){
sides[answer++]=askSideLength(dots[i],dots[j]);
}
}
sort(sides,sides+answer);
if(sides[0]==sides[n-1]){
flag=0;
}
if(flag==0){
cout<<"YES"<<endl;
}else{
cout<<"NO"<<endl;
}
}
return 0;
}