【POJ 2007】
输入凸多边形的顶点,顶点个数是3~50
从原点开始,逆时针输出顶点
只有出现这种情况时,输出时不能直接按极角从小到大排,要区分正负
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <string>
#include <math.h>
using namespace std;
const double pi = acos(-1.0);
struct node
{
int x, y;
double angle;
friend bool operator < (const node n1, const node n2)
{
return n1.angle < n2.angle;
}
}a[55], b[55];
int main()
{
int li = 0;
while(~scanf("%d%d", &a[li].x, &a[li].y))
{
if(a[li].x == 0 && a[li].y == 0) continue;
a[li].angle = atan2(a[li].y, a[li].x);
li++;
}
sort(a, a+li);
printf("(0,0)\n");
double tt = a[li-1].angle - a[0].angle;
if(tt > pi && a[li-1].angle*a[0].angle<0)
{
int lb = 0;
for(int i = 0; i < li; i++)
{
if(a[i].angle > 0) printf("(%d,%d)\n", a[i].x, a[i].y);
}
for(int i = 0; i < li; i++)
{
if(a[i].angle < 0) printf("(%d,%d)\n", a[i].x, a[i].y);
}
}
else
{
for(int i = 0; i < li; i++)
{
printf("(%d,%d)\n", a[i].x, a[i].y);
}
}
return 0;
}