# Clarke and five-pointed star

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 468    Accepted Submission(s): 247

Problem Description
Clarke is a patient with multiple personality disorder. One day, Clarke turned into a learner of geometric.
When he did a research with polygons, he found he has to judge if the polygon is a five-pointed star at many times. There are 5 points on a plane, he wants to know if a five-pointed star existed with 5 points given.

Input
The first line contains an integer T(1T10), the number of the test cases.
For each test case, 5 lines follow. Each line contains 2 real numbers xi,yi(109xi,yi109), denoting the coordinate of this point.

Output
Two numbers are equal if and only if the difference between them is less than 104
For each test case, print Yes if they can compose a five-pointed star. Otherwise, print No. (If 5 points are the same, print Yes. )

Sample Input
2 3.0000000 0.0000000 0.9270509 2.8531695 0.9270509 -2.8531695 -2.4270509 1.7633557 -2.4270509 -1.7633557 3.0000000 1.0000000 0.9270509 2.8531695 0.9270509 -2.8531695 -2.4270509 1.7633557 -2.4270509 -1.7633557

Sample Output
Yes No

AC代码:

#include "iostream"
#include "cstdio"
#include "cstring"
#include "algorithm"
#include "cmath"
#include "utility"
#include "map"
#include "set"
#include "vector"
using namespace std;
typedef long long ll;
const int MAXN = 10;
struct node
{
/* data */
double x, y;
}a[MAXN];
double len[MAXN * MAXN];
double dis(node a, node b)
{
return (a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y);
}
bool judge(double a, double b)
{
if(fabs(a - b) <= 1e-4) return true;
return false;
}
int main(int argc, char const *argv[])
{
int t;
scanf("%d", &t);
while(t--) {
memset(len, -1, sizeof(len));
bool flag = false;
for(int i = 0; i < 5; ++i)
scanf("%lf%lf", &a[i].x, &a[i].y);
int num = 0;
for(int i = 0; i < 5; ++i)
for(int j = 0; j < 5; ++j)
if(i == j) continue;
else len[num++] = dis(a[i], a[j]);
sort(len, len + num);
for(int i = 0; i < 9; ++i)
if(!judge(len[i], len[i + 1])) {
flag = true;
break;
}
for(int i = 10; i < 19; ++i)
if(!judge(len[i], len[i + 1])) {
flag = true;
break;
}
if(flag) printf("No\n");
else printf("Yes\n");
}
return 0;
}

• 本文已收录于以下专栏：

## 【HDU5563 BestCoder Round 62 (div1)A】【计算几何 凸包】Clarke and five-pointed star 正五边形判定 正五角星判定

#include #include #include #include #include #include #include #include #include #include #include ...

## BestCoder Round #62 (div.2) HDU 5563 Clarke and five-pointed star

Clarke and five-pointed star                                           Time Limit: 2000/1000 MS (Ja...

## HDU 5563 Clarke and five-pointed star(判断正五边形)——BestCoder Round #62(div.1 div.2)

HDU 5563 Clarke and five-pointed star(判断正五边形)——BestCoder Round #62(div.1 div.2)

## BestCoder Round #62 (div.2)-Clarke and five-pointed star（几何）

Clarke and five-pointed star    Accepts: 237    Submissions: 591  Time Limit: 2000/1000 MS (Java/Ot...

## hdoj5563Clarke and five-pointed star【判断五角星】

Clarke and five-pointed star Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (...

## hdu5563 ( Clarke and five-pointed star )

#include #include #include #include using namespace std; //point const double eps = 1e-8; const doub...
• czkct
• 2015年11月18日 17:34
• 244

## HDU_5563Clarke and five-pointed star

Clarke and five-pointed star Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K ...

## BestCoder Round #62 (div.2)-Clarke and food（模拟）

Clarke and food    Accepts: 353    Submissions: 962  Time Limit: 2000/1000 MS (Java/Others)    Memo...

## HDU 5562 Clarke and food(排序)——BestCoder Round #62(div.2)

HDU 5562 Clarke and food(排序)——BestCoder Round #62(div.2)

## BestCoder Round #62 (div.2)-Clarke and baton（二分搜索）

Clarke and baton    Accepts: 1    Submissions: 126  Time Limit: 12000/6000 MS (Java/Others)    Memo...

举报原因： 您举报文章：BestCoder Round #62 (div.2) HDOJ5563 Clarke and five-pointed star(计算几何) 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)