链接:
http://acm.hdu.edu.cn/showproblem.php?pid=5533
题意:
给出n个点,坐标全是整数,问能否构成一个正多边形。
思路:
看了题解才发现自己想多了。坐标是整数的正多边形其实只有正方形。
以前的思路是,对于所有点,找距离它最远的点,只要最远的距离全部一样,就是正多边形,这个应该是个广泛的特点。
自己的做法:
#include <bits/stdc++.h>
using namespace std;
int a[107];
int t,n;
struct Node
{
int x,y;
} node[107];
int dis(Node a,Node b)
{
return (a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y);
}
int main()
{
for(cin>>t; t--;)
{
cin>>n;
int maxlen = 0;
int flag = 1;
int isfirst = 1;
for(int i = 0; i < n; i++)
{
cin>>node[i].x>>node[i].y;
}
for(int i = 0; i < n ; i++)
{
int maxn = 0;
for(int j = 0; j < n; j++)
{
maxn = max(maxn, dis(node[i],node[j]));
}
if(isfirst)
{
isfirst = 0;
maxlen =maxn;
}
else if(maxlen != maxn)
{
flag = 0;
break;
}
}
if(flag)
cout<<"YES"<<endl;
else
cout<<"NO"<<endl;
}
return 0;
}
找正方形的做法:(四个边相等,两条对角线相等)
#include <bits/stdc++.h>
using namespace std;
int x[107],y[107],dis[6];
int t,n;
struct Node
{
int x,y;
} node[4];
int diss(Node a,Node b)
{
return (a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y);
}
bool judge()
{
dis[0] = diss(node[0],node[1]);
dis[1] = diss(node[1],node[2]);
dis[2] = diss(node[2],node[3]);
dis[3] = diss(node[3],node[0]);
dis[4] = diss(node[0],node[2]);
dis[5] = diss(node[1],node[3]);
sort(dis,dis+6);
if(dis[0] == dis[1] && dis[1] == dis[2] && dis[2] == dis[3] && dis[4] == dis[5])
return true;
return false;
}
int main()
{
for(cin>>t; t--;)
{
cin>>n;
int maxlen = 0;
int flag = 1;
int isfirst = 1;
for(int i = 0; i < n; i++)
{
cin>>x[i]>>y[i];
}
if(n != 4)
{
cout<<"NO"<<endl;
continue;
}
for(int i = 0 ; i < 4; i++)
{
node[i].x = x[i];
node[i].y = y[i];
}
if(judge())
{
cout<<"YES"<<endl;
}
else
{
cout<<"NO"<<endl;
}
}
return 0;
}