zoj 1199 Point of Intersection

此题主要计算的是那个交点p相对于小圆圆心的偏移地址
p(x的偏移+x2,y的偏移+y2)

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <queue>
#include <iomanip>
#include <vector>
#include <map>
#include <math.h>
using namespace std;

double getdis(double x1, double y1, double x2, double y2) {
	return sqrt((x2 - x1) * (x2 - x1) + (y2 - y1) * (y2 - y1));
}

int main() {
	int t;
	double x1, x2, y1, y2, r1, r2, x, y;
	scanf("%d", &t);
	while (t--) {
		scanf("%lf%lf%lf", &x1, &y1, &r1);
		scanf("%lf%lf%lf", &x2, &y2, &r2);

		if (r1 < r2) {
			swap(x1, x2);
			swap(y1, y2);
			swap(r1, r2);
		}
		
		if ((x1 == x2 && y1 == y2) || r1 == r2 || getdis(x1, y1, x2, y2) <= (r1 - r2)) {
			printf("Impossible.\n");
		} else {
			x = (x2 - x1) * r2 / (r1 - r2) + x2;
			y = (y2 - y1) * r2 / (r1 - r2) + y2;
			printf("%.2f %.2f\n", x, y);
		}
	}
}