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: n = int(input())
for i in range(n):
    xa, ya, ra, xb, yb, rb = map(float, input().split())
    distsq = (xa-xb)**2 + (ya-yb)**2
    if distsq < (ra-rb)**2:
        if ra < rb:
            print(-2)
        else:
            print(2)
    elif (ra-rb)**2 <= distsq <= (ra+rb)**2:
        print(1)
    else:
        print(0)

Python: import math
for _ in range(int(input())):
    xa, ya, ra, xb, yb, rb = map(float, input().split())
    d = math.sqrt((xb - xa) ** 2 + (yb - ya) ** 2)
    if ra + rb < d:
        print(0)
    elif d + ra < rb:
        print(-2)
    elif d + rb < ra:
        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()]
	[Xa,Ya,Ra,Xb,Yb,Rb] = map(float,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 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 > -10E-16: # B in A
		print(2)
	elif Rb - Ra - distance > -10E-16: # A in B
		print(-2)
	elif Ra + Rb - distance > -10E-16: # Intersect
		print(1)
	else: # Not overlap
		print(0)

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)
    else:
        if r_a[i] > r_b[i]:
            print(2)
        else:
            print(-2)

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

Python: 
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):
    AB=((x_a[i]-x_b[i])**2+(y_a[i]-y_b[i])**2)**(1/2)
    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)
    else:
        if r_a[i] > r_b[i]:
            print(2)
        else:
            print(-2)

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: # ??????????????¢??¨????????????, ????????¢???
def plus(a, b):
    return a + b


def minus(a, b):
    return abs(a - b)


def distance(x1, y1, x2, y2):
    r2 = (x1 - x2)**2 + (y1 - y2)**2
    return pow(r2, 0.5)


def flag(l):
    rp = plus(l[2], l[5])
    rm = minus(l[2], l[5])
    d = distance(l[0], l[1], l[3], l[4])
    if rp < d:
        return 0
    elif d < rm:
        return 2
    else:
        return 1


N = int(input())
for i in range(N):
    a = list(map(float, input().split()))
    print(flag(a))

Python: import math
for _ in range(int(input())):
    xa, ya, ra, xb, yb, rb = map(float, input().split())
    d = math.hypot(xb - xa, yb- ya)
    if d > ra + rb:
        print(0)
    elif abs(ra - rb) <= d:
        print(1)
    else:
        print(2 if rb < ra else -2)

Python: def f():
    ax,ay,ar,bx,by,br=map(float,input().split())
    d=(ax-bx)**2+(ay-by)**2
    r1=(ar+br)*(ar+br)
    r2=(ar-br)*(ar-br)
    if d<=r1 and d>=r2:return 1;
    elif d<r2 and ar>=br:return 2
    elif d < r2 and ar <= br:return -2
    else:return 0

for _ in range(int(input())):print(f())

Python: 

import math


num = int(input())

for i in range(num):
    ax,ay,ar,bx,by,br = map(float,input().split(' '))
    d = (ax - bx)**2 + (ay * by)**2
    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 = 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 > 10E-8: # B in A
		print(2)
	elif Rb - Ra - distance > 10E-8: # A in B
		print(-2)
	elif Ra + Rb - distance > 10E-8: # Intersect
		print(1)
	else: # Not overlap
		print(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
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

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 < math.sqrt((r1-r2)**2):
        if r1 > r2:
            print('2')
        else:print('-2')
    else:
        print('1')
        
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())
    dis = (xa - xb)**2 + (ya - yb)**2
    if dis > (ra + rb)**2:
        print(0)
    elif rb > ra and dis < (rb - ra)**2:
        print(-2)
    elif ra > rb and dis < (ra - rb)**2:
        print(2)
    else:
        print(1)

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