백준 알고리즘 1002번 터렛

 

#include <iostream>
#include <cmath>
#include <algorithm>
 
#define ll long long
 
using namespace std;
 
int main(void) {
    double x1, y1, r1, x2, y2, r2;
    double d;
    int C;
    cin >> C;
    while(C--) {
        cin >> x1 >> y1 >> r1 >> x2 >> y2 >> r2;
        d = sqrt(pow(x2-x1, 2) + pow((y2-y1),2));
        //cout << max(r1,r2)-min(r1,r2) << " " << d << " " << r1+r2 << endl;
        if(x1==x2 && y1==y2 && r1==r2) cout << -1 << endl;
        else if(max(r1,r2)-min(r1,r2) < d && d < r1+r2) cout << 2 << endl;
        else if(d==(r1 + r2) || d==(max(r1,r2)-min(r1,r2))) cout << 1 << endl;
        else if(r1+r2<d || d<max(r1,r2)-min(r1,r2) || d==0) cout << 0 << endl;
    }
    return 0;
}