hdu(3007)

 

#include"stdio.h"
#include"math.h"
int main()
{
    int n,i,j;
    double a[10000],b[10000],k,h,f1,f2;
    while(scanf("%d",&n),n)
    {
        h=0.0;
        for(i=0;i<n;i++)
            scanf("%lf%lf",&a[i],&b[i]);
        for(i=0;i<n;i++)
            for(j=0;j<n;j++)
            {
                k=(double)sqrt(1.0*(a[i]-a[j])*(a[i]-a[j])+1.0*(b[i]-b[j])*(b[i]-b[j]));
                if(k>h)
                {
                    h=k;
                    f1=(a[i]+a[j])/2.0;
                    f2=(b[i]+b[j])/2.0;
                }
            }
            printf("%.2lf %.2lf %.2lf\n",f1,f2,h/2);
    }
    return 0;
}
找到距离最远的两点;

两点的中点为圆心，半径