Go: package main

import (
	"fmt"
	"math"
)

func main() {
	var n int
	fmt.Scan(&n)
	for i := 0; i < n; i++ {
		var xa, ya, ra, xb, yb, rb float64
		fmt.Scan(&xa, &ya, &ra, &xb, &yb, &rb)
		// println(xa, ya, ra, xb, yb, rb)
		dis := math.Sqrt((xa-xb)*(xa-xb) + (ya-yb)*(ya-yb))
		if dis + ra < rb {
			fmt.Println(-2)
		} else if dis + rb < ra {
			fmt.Println(2)
		} else if dis > rb + ra {
			fmt.Println(0)
		} else {
			fmt.Println(1)
		}
	}
}

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

Python: import math

n = int(input())

for _ in range(n):
    xa,ya,ra,xb,yb,rb = map(float, input().split())
    len=math.sqrt((xa-xb)**2+(ya-yb)**2)

    if len + rb <= ra:
        print("2")
    elif len + ra <= rb:
        print("-2")
    elif len <= ra + rb:
        print("1")
    else:
        print("0")

Python: import math

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

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

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

Python: # -*- coding: utf-8 -*-

import sys
import os
import math

N = int(input())

for i in range(N):
    ax, ay, ar, bx, by, br = map(float, input().split())

    between_center = math.sqrt( (ax-bx)**2 + (ay-by)**2 )

    # ????????£????????????
    if between_center > ar + br:
        print(0)

    # ????????????????????¨
    else:
        # B in A
        if ar > between_center + br:
            print(2)

        # A in B
        elif br > between_center + ar:
            print(-2)

        else:
            print(1)

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 rb < ra and d < ra - rb:
    print("2")
  elif ra < rb and d < rb - ra:
    print("-2")
  elif d <= ra + rb:
    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(x1-x2, y1-y2)
    if dist+r2 <= r1:
        print(2)
    elif dist+r1 <= r2:
        print(-2)
    elif dist <= r1+r2:
        print(1)
    else:
        print(0)

Python: import sys
readline = sys.stdin.readline
write = sys.stdout.write
EPS = 1e-9
def solve():
    xa, ya, ra, xb, yb, rb = map(float, readline().split())
    d = ((xa - xb)**2 + (ya - yb)**2)**.5
    if d < rb - ra:
        write("-2\n")
    elif d < ra - rb:
        write("2\n")
    elif d > ra + rb:
        write("0\n")
    else:
        write("1\n")
T = int(readline())
for i in range(T):
    solve()

Python: n = int(input())

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

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:
        if l[5] < l[2]:
            return 2
        else:
            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

N = int(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: 
import sys,math
cases = int(input())
i = 0
while i < cases:
   for line in sys.stdin.readlines():
       xa , ya , ra , xb , yb , rb = map(float,line.split())
       dist = (yb - ya)*(yb - ya) + (xb - xa)*(xb - xa)
       dist = math.sqrt(dist)
       if (ra < rb and dist == 0):
           print("-2")
       elif (rb < ra and dist == 0):
           print("2")
       elif (ra - rb or rb - ra) < dist < ra + rb:
           print("1")
       elif dist > ra + rb :
           print("0")
   i += 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((xb - xa) ** 2 + (yb - ya) ** 2)
    if d < ra - rb:
        print(2)
    elif d < rb - ra:
        print(-2)
    elif d <= ra + rb:
        print(1)
    else:
        print(0)

Python: import math
count = int(input())
for i in range(count):
    x1,y1,r1,x2,y2,r2 =map(float,input().split())
    depth=math.sqrt((x1-x2)**2+(y1-y2)**2)
    if depth+r2<=r1:
        print(2)
    elif depth+r1<=r2:
        print(-2)
    elif depth>r1+r2:
        print(0)
    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 abs(Ra - Rb - distance) > 10E-8: # B in A
		print(2)
	elif abs(Rb - Ra - distance) > 10E-8: # A in B
		print(-2)
	elif abs(Ra + Rb - distance) > 10E-8: # Intersect
		print(1)
	else: # Not overlap
		print(0)

Python: from math import hypot

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

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((xa-xb)**2 + (ya-yb)**2)
    if ra + rb < distance:
        if (ra < rb and distance + ra < rb):
            print(-2)
        elif (rb < ra and distance + rb < ra):
            print(2)
        else:
            print(1)
    else:
        print(0)