B - Common Tangents FZU - 2213

版权声明:如有错误,请指出,不胜感激。 https://blog.csdn.net/qq_36424540/article/details/79950578
Problem 2213 Common Tangents

Accept: 814    Submit: 2357
Time Limit: 1000 mSec    Memory Limit : 32768 KB

Problem Description

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

310 10 5 20 20 510 10 10 20 20 1010 10 5 20 10 5

Sample Output

423


#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;

const int maxn=110;
int p[maxn];
int x1,y1,r1,x2,y2,r2;
/*
主要是判断两个圆形
相交,但是不包含的时候写的有点问题
dis<(r1+r2)&&dis>(r2-r1) 
*/
int check(){
	int dis2=(y2-y1)*(y2-y1)+(x2-x1)*(x2-x1);
	if(dis2>(r1+r2)*(r1+r2)) return 4;
	if(dis2==(r1+r2)*(r1+r2)) return 3;
	if(dis2==0&&r1==r2) return -1;//重叠 
	if(r1>r2) swap(r1,r2);
	if(dis2==(r2-r1)*(r2-r1)) return 1;//内切 
	
	if(dis2<(r2-r1)*(r2-r1)) return 0;//	
	if(dis2<(r1+r2)*(r1+r2)&&dis2>(r2-r1)*(r2-r1))return 2;
	return 2;
}

int main(){
	int T;
	scanf("%d",&T);
	while(T--){
		scanf("%d %d %d %d %d %d",&x1,&y1,&r1,&x2,&y2,&r2);
		int ans=check();
		printf("%d\n",ans);	
	}
	return 0;
}

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

私密
私密原因:
请选择设置私密原因
  • 广告
  • 抄袭
  • 版权
  • 政治
  • 色情
  • 无意义
  • 其他
其他原因:
120
出错啦
系统繁忙,请稍后再试

关闭