Go: package main

import (
        "fmt"
        "math"
)

func main() {
        var n int
        fmt.Scanf("%d", &n)
        for i := 0; i < n; i++ {
                var ax, ay, ar, bx, by, br float64
                fmt.Scanf("%f %f %f %f %f %f", &ax, &ay, &ar, &bx, &by, &br)

                d := math.Sqrt((bx-ax)*(bx-ax) + (by-ay)*(by-ay))
                if d <= ar + br {
                        if ar > br {
                                if ar > br + d {
                                        fmt.Println("2")
                                } else {
                                        fmt.Println("1")
                                }
                        } else {
                                if br > ar + d {
                                        fmt.Println("-2")
                                } else {
                                        fmt.Println("1")
                                }
                        }
                } else {
                        fmt.Println(0)
                }
        }
}

Python: import math
def check_intersect(x1,y1,r1,x2,y2,r2):
    d = math.sqrt((x2-x1)**2 + (y2-y1)**2)
    
    if d >= r1+r2:
        print(0)
    elif d + r1 <= r2:
        print(-2)
    elif d + r2 <= r1:
        print(2)
    elif d <= r1*r2:
        print(1)
    return 0

n = int(input())
for i in range(n):
    x1,y1,r1,x2,y2,r2 = map(float,input().split())
    check_intersect(x1,y1,r1,x2,y2,r2)

Python: import math

def check_intersect(x1,y1,r1,x2,y2,r2):
    d = math.sqrt((x2-x1)**2 + (y2-y1)**2)
    
    if d >= r1+r2:
        print(0)
    elif d + r1 <= r2:
        print(-2)
    elif d + r2 <= r1:
        print(2)
    elif d <= r1+r2:
        print(1)
    return 0

n = int(input())
for i in range(n):
    x1,y1,r1,x2,y2,r2 = map(float,input().split())
    check_intersect(x1,y1,r1,x2,y2,r2)

Python: n = int(input())
for i in range(n):
    xa, ya, ra, xb, yb, rb = map(float, input().split())
    d = ((xa - xb)**2 + (ya - yb)**2)**0.5
    if d > ra + rb:
        print(0)
    elif ra + d < rb:
        print(-2)
    elif rb + d < ra:
        print(2)
    else:
        print(1)

Python: import math

n = int(input())
for i in range(n):
    xa, ya, ra, xb, yb, rb = map(float, input().split())

    d = math.sqrt((xa - xb)**2 + (ya - yb)**2)

    if ra > d + rb:
        print("2")
    elif rb > d + ra:
        print("-2")
    elif d > ra + rb:
        print("0")
    else:
        print("1")

Python: 

import math


num = int(input())

for i in range(num):
    ax,ay,ar,bx,by,br = map(float,input().split(' '))
    d = (ax - bx)*(ax - bx) + (ay * by)(ay * by)
    if d < abs(br - ar):
        if ar > br:
            print(2)
        else:
            print(-2)
    elif d <= ar + br:
        print(1)
    else:
        print(0)

Python: import math
N = int(input())
for _ in [0]*N:
    x1, y1, r1, x2, y2, r2 = map(float, input().split())
    dist = math.hypot(x2-x1, y2-y1)
    if dist+r2 <= r1:
        print(2)
    elif dist+r1 <= r2:
        print(-2)
    elif dist <= r1+r2:
        print(1)
    else:
        print(0)

Python: n=int(input())
for i in range(n):
    x1,y1,r1,x2,y2,r2=map(float,input().split())
    d=((x1-x2)**2+(y1-y2)**2)**0.5
    r_min=min(r1,r2)
    r_max=max(r1,r2)
    if r_max>r_min+d:
        if r1>r2:
            print(2)
        else:
            print(-2)
    elif d<=r1+r2:
        print(1)
    else:
        print(0)

Python: import math
n=int(input())
for _ in range(n):
    l=[float(i) for i in input().split()]
    d=math.hypot(l[3]-l[0],l[4]-l[1])
    print([2,-2,1,0][[d<l[2]-l[5],d<l[5]-l[2],d<=l[2]+l[5],d>l[2]+l[5]].index(True)])

Python: import math
for i in range(int(input())):
    xa, ya, ra, xb, yb, rb = list(map(float, input().split()))

    d1 = math.sqrt((xa - xb) ** 2 + (ya - yb) ** 2)
    d2 = math.fabs(ra + rb)

    if d1 <= d2:
        if d1 <= ra or d1 <= rb:
            print(2 if ra > rb else -2)
        else:
            print(1)
    else:
        print(0)

Python: import math
num = int(input())
for i in range(num):
    lst = list(map(float, input().split()))
    xa, ya, ra = lst[0], lst[1], lst[2]
    xb, yb, rb = lst[3], lst[4], lst[5]

    d = math.sqrt((xa - xb)**2 + (ya - yb)**2)

    if ra + rb < d:
        print(0)

    elif d + min(ra, rb) < max(ra, rb):
        if ra < rb:
            print(-2)
        else:
            print(2)

    else:
        print(1)

Python: from numpy import *
N=int(input())
x_a=[0]*N
y_a=[0]*N
r_a=[0]*N
x_b=[0]*N
y_b=[0]*N
r_b=[0]*N
for i in range(N):
    x_a[i],y_a[i],r_a[i],x_b[i],y_b[i],r_b[i]=map(float,input().split())
for i in range(N):
    a=array([x_a[i]-x_b[i],y_a[i]-y_b[i]])
    AB=linalg.norm(a)
    r_diff=abs(r_a[i]-r_b[i])
    if AB > r_a[i]+r_b[i]:
        print(0)
    elif r_a[i]+r_b[i] >= AB and AB >= r_diff:
        print(1)
    elif r_diff > AB:
        if r_a[i] > r_b[i]:
            print(2)
        else:
            print(-2)

Python: for i in range(int(input())):
    points = input().split()
    p = list(map(float,points))
    if (p[3]-p[0])**2 + (p[4]-p[1])**2 <= p[2]**2:
        print(2)
    elif (p[0]-p[3])**2 + (p[1]-p[4])**2 < p[5]**2:
        print(-2)
    elif (p[3]-p[0])**2 + (p[4]-p[1])**2 < (p[2]+p[5])**2:
        print(1)
    else:
        print(0)

Python: # coding=utf-8
import math


def square(number: float) -> float:
    return number * number


if __name__ == '__main__':
    N = int(input())
    for i in range(N):
        xa, ya, ra, xb, yb, rb = map(float, input().split())
        distance = math.sqrt(square(xb - xa) + square(yb - ya))
        if distance > (ra + rb):
            print(0)
        elif distance >= math.fabs(ra - rb):
            print(1)
        elif distance < math.fabs(ra - rb):
            if ra > rb:
                print(2)
            elif ra < rb:
                print(-2)
        else:
            pass

Python: # your code goes here
import math

n = int(input())
for i in range(n):
	xa, ya, ra, xb, yb, rb = [float(x) for x in input().split(" ")]
	distance = math.sqrt((xb-xa)**2 + (yb-ya)**2)

	if distance > ra+rb:
		print(0)
	elif distance < abs(ra-rb):
		if ra > rb:
			print(2)
		elif ra < rb:
			print(-2)
		else:
			print(1)
	elif distance <= ra+rb:
		print(1)

Python: import math

def judge(dist, p, q):
    if p + q >= dist:
        if dist + p < q:
            ans.append(-2)
        elif dist + q < p:
            ans.append(2)
        else:
            ans.append(1)
    else:
        ans.append(0)

N = int(input())
circles = [list(map(float, input().split())) for _ in range(N)]
ans = []

for circle in circles:
    xa, ya, ra, xb, yb, rb = circle
    distance = math.sqrt((xa-xb)**2 + (ya-yb)**2)
    judge(distance, ra, rb)

print('\n'.join(map(str, ans)))

Python: import sys
f = sys.stdin

n = int(f.readline())
for _ in range(n):
    xa, ya, ra, xb, yb, rb = map(float, f.readline().split())
    xya, xyb = xa + ya * 1j, xb + yb * 1j
    dist =  abs(xya - xyb)
    if ra + rb < dist:
        print(0)
    elif ra > rb + dist:
        print(2)
    elif rb > ra + dist:
        print(-2)
    else:
        print(1)

Python: 
import math

N = eval(input())
for _ in range(N):
	[Xa,Ya,Ra,Xb,Yb,Rb] = [float(element) for element in input().split()]
	distance = math.sqrt((Xa - Xb)**2 + (Ya - Yb)**2) # Compute distance from point A to point B
	if Ra > Rb + distance: # B in A
		print(2)
	elif Rb > Ra + distance: # A in B
		print(-2)
	elif Ra + Rb > distance: # Intersect
		print(1)
	else: # Not overlap
		print(0)

Python: import sys
import math

n = int(input())

for _ in range(n):
    xa, ya, ra, xb, yb, rb = map(float, input().split())

    distance = math.sqrt(abs(xa-xb)**2 + abs(ya-yb)**2)
    if distance < ra + rb:
        if distance + ra < rb or distance + rb < ra:
            print("2")
        else:
            print("1")
    else:
        print("0")