Common Tangents FZU - 2213

版权声明:欢迎评论,本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/islittlehappy/article/details/79950646
 

Two different circles can have at most four common tangents.

The picture below is an illustration of two circles with four common tangents.

Now given the center and radius of two circles, your job is to find how many common tangents between them.


Input

The first line contains an integer T, meaning the number of the cases (1 <= T <= 50.).

For each test case, there is one line contains six integers x1 (−100 ≤ x1 ≤ 100), y1 (−100 ≤ y1 ≤ 100), r1 (0 < r1 ≤ 200), x2 (−100 ≤ x2 ≤ 100), y2 (−100 ≤ y2 ≤ 100), r2 (0 < r2 ≤ 200). Here (x1, y1) and (x2, y2) are the coordinates of the center of the first circle and second circle respectively, r1 is the radius of the first circle and r2 is the radius of the second circle.

Output

For each test case, output the corresponding answer in one line.

If there is infinite number of tangents between the two circles then output -1.

Sample Input
3
10 10 5 20 20 5
10 10 10 20 20 10
10 10 5 20 10 5
Sample Output
4
2
3

题意:求两个圆公切线的条数

思路:判断两圆的位置关系

代码:

#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<iostream>
using namespace std;
double Dis(double x1,double y1,double x2,double y2){
	double X=(x1-x2)*(x1-x2);
	double Y=(y1-y2)*(y1-y2);
	return sqrt(X+Y);
}
int main(){
	int T;
	cin>>T;
	while(T--){
		double x1,y1,r1,x2,y2,r2;
		cin>>x1>>y1>>r1>>x2>>y2>>r2;
		double dis=Dis(x1,y1,x2,y2);
		if(r2<r1) swap(r1,r2);
		if(x1==x2&&y1==y2&&r1==r2) cout<<"-1"<<endl;
		else if(dis>r1+r2) cout<<"4"<<endl;//外离 
		else if(dis==r2+r1) cout<<"3"<<endl;//外切 
		else if(dis>r2-r1&&dis<r2+r1) cout<<"2"<<endl;//相交 
		else if(dis==r2-r1) cout<<"1"<<endl;//内交 
		else if(dis<r2-r1) cout<<"0"<<endl;//内含 
	}
	return 0;
}

阅读更多
想对作者说点什么?

博主推荐

换一批

没有更多推荐了,返回首页