计算几何专项：UVa 10674

一道求两圆切线的模拟题，因为排序的时候没有考虑精度问题，贡献了一WA。

#include <iostream>
#include <fstream>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <algorithm>
using namespace std;
const double eps=1e-8;
const double pi=acos(-1.0);
int dcmp(double x)
{
    if(fabs(x)<eps) return 0;
    else return x<0?-1:1;
}
struct point
{
    double x,y;
    point(double x=0,double y=0):x(x),y(y){}
};
point operator-(point a,point b){return point(a.x-b.x,a.y-b.y);}
double length(point a) {return sqrt(a.x*a.x+a.y*a.y);}
point pa[4],pb[4];
bool cmp(int a,int b)
{
    return dcmp(pa[a].x-pa[b].x)<0||(dcmp(pa[a].x-pa[b].x)==0&&dcmp(pa[a].y-pa[b].y)<0);
}
struct circle
{
    point c;
    double r;
    circle(point c,double r):c(c),r(r){}
    point cp(double a)
    {
        return point(c.x+cos(a)*r,c.y+sin(a)*r);
    }
};
int tangents(circle a,circle b,point* pa,point* pb)
{
    int cnt=0;
    if(dcmp(a.r-b.r)<0) {swap(a,b);swap(pa,pb);}
    double d2=(a.c.x-b.c.x)*(a.c.x-b.c.x)+(a.c.y-b.c.y)*(a.c.y-b.c.y);
    double rdiff=a.r-b.r;
    double rsum=a.r+b.r;
    if(dcmp(d2-rdiff*rdiff)<0) return 0;
    double base=atan2(b.c.y-a.c.y,b.c.x-a.c.x);
    if(dcmp(d2)==0&&dcmp(a.r-b.r)==0) return -1;
    if(dcmp(d2-rdiff*rdiff)==0)
    {
        pa[cnt]=a.cp(base);pb[cnt]=b.cp(base);cnt++;
        return 1;
    }
    double ang=acos((a.r-b.r)/sqrt(d2));
    pa[cnt]=a.cp(base+ang);pb[cnt]=b.cp(base+ang);cnt++;
    pa[cnt]=a.cp(base-ang);pb[cnt]=b.cp(base-ang);cnt++;
    if(dcmp(d2-rsum*rsum)==0)
    {
        pa[cnt]=a.cp(base);pb[cnt]=b.cp(pi+base);cnt++;
    }
    else if(dcmp(d2-rsum*rsum)>0)
    {
        double ang=acos((a.r+b.r)/sqrt(d2));
        pa[cnt]=a.cp(base+ang);pb[cnt]=b.cp(pi+base+ang);cnt++;
        pa[cnt]=a.cp(base-ang);pb[cnt]=b.cp(pi+base-ang);cnt++;
    }
    return cnt;
}
int main()
{
    freopen("in.txt","r",stdin);
    int x1,y1,r1,x2,y2,r2;
    while(cin>>x1>>y1>>r1>>x2>>y2>>r2)
    {
        if(!x1&&!y1&&!r1&&!x2&&!y2&&!r2) break;
        int ans=tangents(circle(point(x1,y1),r1),circle(point(x2,y2),r2),pa,pb);
        cout<<ans<<endl;
        if(ans>0)
        {
            int r[4];
            for(int i=0;i<ans;i++) r[i]=i;
            sort(r,r+ans,cmp);
            for(int i=0;i<ans;i++)
                printf("%.5f %.5f %.5f %.5f %.5f\n",pa[r[i]].x,pa[r[i]].y,pb[r[i]].x,pb[r[i]].y,length(pa[r[i]]-pb[r[i]]));
        }
    }
    return 0;
}