[실3] 1002 - 터렛

 

#include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>

using namespace std;

int main()
{
	int t;
	cin >> t;

	while (t--)
	{
		int x1, y1, r1, x2, y2, r2;
		cin >> x1 >> y1 >> r1 >> x2 >> y2 >> r2;

		double d = sqrt(pow(x1 - x2, 2) + pow(y1 - y2, 2));
		double sub = r1 > r2 ? r1 - r2 : r2 - r1;
		int sum = r1 + r2;

		if (d == 0 &&
			r1 == r2)
			cout << -1 << endl;

		else if (d == sum ||
				 d == sub)
				 cout << 1 << endl;

		else if (d > sub &&
				 d < sum)
				 cout << 2 << endl;

		else
			cout << 0 << endl;
	}
}