ZOJ1199Point of Intersection【公式推导】

#include<bits/stdc++.h>
using namespace std;

int getdis(int a,int b,int c,int d){
	return (a-c)*(a-c)+(b-d)*(b-d);
}
int main(){
	int t,x1,y1,r1,x2,y2,r2;
	scanf("%d",&t);
	while(t--){
		scanf("%d%d%d",&x1,&y1,&r1);
		scanf("%d%d%d",&x2,&y2,&r2);
		if(r1==r2){
			printf("Impossible.\n");
			continue;
		}
		if(r2>r1){
			swap(x1,x2);
			swap(y1,y2);
			swap(r1,r2);
		}
		if(getdis(x1,y1,x2,y2)<=(max(r2,r1)-min(r2,r1))*(max(r2,r1)-min(r2,r1))){
			printf("Impossible.\n");
			continue;
		}
		double x=r2*(x2-x1)*1.0/(r1-r2)+x2;
		double y=r2*(y2-y1)*1.0/(r1-r2)+y2;
		printf("%.2lf %.2lf\n",x,y);
	}
}