BOJ)1002 터렛

문제 : https://www.acmicpc.net/problem/1002

참고 : http://mathbang.net/101

#include <iostream> #include <math.h> using namespace std; int main() { double t, x1, y1, r1, x2, y2, r2; double d=0; double radius_big=0, radius_small=0; cin >> t; for (int i = 0; i < t; i++) { cin >> x1 >> y1 >> r1 >> x2 >> y2 >> r2; d = sqrt(pow((x2 - x1), 2) + pow((y2 - y1), 2)); if (r1 > r2) radius_big = r1, radius_small = r2; else radius_big = r2, radius_small = r1; if (d == 0) { if (radius_big==radius_small) { cout << -1 << "\n"; } else cout << 0 << "\n"; } else { if (radius_big + radius_small == d || radius_big - radius_small == d) { cout << 1 << "\n"; } else if (radius_big + radius_small > d && d > radius_big - radius_small) { cout << 2 << "\n"; } else if (radius_big + radius_small < d || radius_big - radius_small > d) { cout << 0 << "\n"; } } } }