UVA - 10250 - The Other Two Trees

/*即为已知正方形的对点，求另外两个点,注意精度，float的精度是不够的*/
#include<stdio.h>
#include<math.h>
double Dis(double x1,double y1,double x2,double y2)
{
    return (x1-x2)*(x1-x2)+(y1-y2)*(y1-y2);
}    
int main()
{
    double ax1,ay1,ax2,ay2,x1,y1,x2,y2;
    double mx,my,d,a,b;
    while(scanf("%lf%lf%lf%lf",&x1,&y1,&x2,&y2)!=EOF)
    {
        mx=0.5*(x1+x2);
        my=0.5*(y1+y2);
        d=Dis(mx,my,x1,y1);
        a=x1-mx;
        b=y1-my;
        if(a!=0)
        {
            ay1=sqrt(a*a*d/(a*a+b*b))+my;
            ay2=my-sqrt(a*a*d/(a*a+b*b));
            ax1=mx-b/a*(ay1-my);
            ax2=mx-b/a*(ay2-my);
            if(ax1==ax2&&ay1==ay2)printf("Impossible.\n");
            else
            printf("%.10lf %.10lf %.10lf %.10lf\n",ax1,ay1,ax2,ay2); 
            continue;   
        }
        if(b!=0)
        {
            ax1=sqrt(b*b*d/(a*a+b*b))+mx;
            ax2=mx-sqrt(b*b*d/(a*a+b*b));
            ay1=my-a/b*(ax1-mx);
            ay2=my-a/b*(ay2-mx);
            if(ax1==ax2&&ay1==ay2)printf("Impossible.\n");
            else
            printf("%.10lf %.10lf %.10lf %.10lf\n",ax1,ay1,ax2,ay2); 
            continue;
        }
        else
        printf("Impossible.\n");                                     
    }
    return 0;
}