zoj2352

最新推荐文章于 2019-01-06 16:09:43 发布

xws117123

最新推荐文章于 2019-01-06 16:09:43 发布

阅读量534

点赞数

分类专栏：几何

本文链接：https://blog.csdn.net/xws117/article/details/25784643

版权

几何专栏收录该内容

21 篇文章 0 订阅

订阅专栏

# include <stdio.h>
# include <algorithm>
# include <string.h>
using namespace std;
# define eps 1e-8
int zero(double x)
{
    if(x>eps)  return 1;
    if(x<-eps)  return -1;
    return 0;
}
struct node
{
    double x,y;
}vex[109];
node s;
double cross(node a,node b,node c)
{
    return (b.x-a.x)*(c.y-a.y)-(c.x-a.x)*(b.y-a.y);
}
int cmp(node a,node b)
{
    return zero(cross(s,a,b))==1;
}
int main()
{
    int cas;
    char c,str[100];
    scanf("%d",&cas);
        while(cas--)
        {
            int i=1;
            scanf("%lf%lf",&vex[0].x,&vex[0].y);
            c=getchar();
            while(gets(str)&&strlen(str))
            {
                sscanf(str,"%lf %lf",&vex[i].x,&vex[i].y);
                i++;
            }
            s=vex[0];
            int n=i;
            sort(vex+1,vex+n,cmp);
            for(int i=0;i<n;i++)
                printf("(%.0lf,%.0lf)\n",vex[i].x,vex[i].y);
            if(cas)
            printf("\n");
        }

    return 0;
}

数据的读入比较恶心用到了ssanf