Go: package main

import (
	"bufio"
	"fmt"
	"io"
	"math"
	"os"
	"strconv"
	"strings"

)


func main() {
	solve(os.Stdin, os.Stdout)
}

type ReaderEx struct {
	baseScanner *bufio.Scanner
	words       []string
	nextWordIdx func() int
	initWordIdx func(int)
}

func NewScannerEx(stdin io.Reader) *ReaderEx {
	var this ReaderEx
	var idx int
	var wordsCnt int
	this.baseScanner = bufio.NewScanner(stdin)
	this.baseScanner.Buffer(make([]byte, 0), 1E+11)
	this.nextWordIdx = func() int {
		cur := idx
		idx = (idx + 1) % wordsCnt
		return cur
	}
	this.initWordIdx = func(wc int) {
		idx = 0
		wordsCnt = wc
	}
	return &this
}

func (me *ReaderEx) Scan(doSplit bool) (isScanned bool) {
	isScanned = me.baseScanner.Scan()
	if doSplit {
		me.words = strings.Fields(me.baseScanner.Text())
	} else {
		me.words = []string{me.baseScanner.Text()}
	}
	me.initWordIdx(len(me.words))
	return
}

func (me *ReaderEx) nextBytes() []byte {
	return []byte(me.words[me.nextWordIdx()])
}
func (me *ReaderEx) nextString() string {
	return me.words[me.nextWordIdx()]
}

type StringArray []string

func (me *ReaderEx) nextStringArray() StringArray {
	return me.words[me.nextWordIdx():]
}

func (me StringArray) toStrings() []string {
	return me
}

func (me StringArray) toInts() []int {
	strValues := me.toStrings()
	values := make([]int, len(strValues))
	for i, v := range strValues {
		n, err := strconv.Atoi(v)
		if err != nil {
			panic(err)
		}
		values[i] = n
	}
	return values
}
func (me *ReaderEx) nextInt() int {
	n, err := strconv.Atoi(me.words[me.nextWordIdx()])

	defer func() {
		if err != nil {
			panic(fmt.Sprintf("getInt(%d)", n))
		}
	}()
	return n
}

func pow(x, y, mod int) (ans int) {

	ans = 1
	for bit := 1 << uint(math.Floor(math.Log2(float64(y)))); ; bit >>= 1 {
		if y&bit != 0 {
			ans *= x
			if mod > 0 {
				ans %= mod
			}
		}
		if bit <= 1 {
			return
		}
		ans *= ans
		if mod > 0 {
			ans %= mod
		}
	}
}

type factType struct {
	prime int
	count int
}

func fact(n int) (facts []*factType) {

	for i := 2; i*i <= n; i++ {
		if n%i == 0 {
			fa := factType{prime: i}
			for n%fa.prime == 0 {
				n /= fa.prime
				fa.count++
			}
			facts = append(facts, &fa)
		}
	}
	if n > 1 {
		facts = append(facts, &factType{prime: n, count: 1})
	}
	return facts
}
func dec2bin(n int) (ret []bool) {
	for bit := 1 << uint(math.Floor(math.Log2(float64(n)))); ; bit >>= 1 {
		ret = append(ret, n&bit != 0)

		if bit <= 1 {
			return
		}
	}

}

func abs(v int) int {
	if v < 0 {
		v = -v
	}
	return v
}

func b2i(b bool) (i int) {
	if b {
		i = 1
	} else {
		i = 0
	}
	return
}

func solve(stdin io.Reader, stdout io.Writer) {

	r := NewScannerEx(stdin)
	r.Scan(true)
	n := r.nextInt()

	type Vec struct {
		x, y float64
	}
	vec := func(a, b Vec) Vec { return Vec{b.x - a.x, b.y - a.y} }
	unv := func(a Vec) Vec { return Vec{-a.y, a.x} }
	cdot := func(a, b Vec) float64 { return a.x*b.x + a.y*b.y }
	times := func(t float64, a Vec) Vec { return Vec{t * a.x, t * a.y} }
	add := func(a, b Vec) Vec { return Vec{a.x + b.x, a.y + b.y} }
	for i := 0; i < n; i++ {

		r.Scan(true)
		nextFloat64 := func() (ret float64) { fmt.Sscanf(r.nextString(), "%f", &ret); return }
		a1, a2, a3 := Vec{nextFloat64(), nextFloat64()}, Vec{nextFloat64(), nextFloat64()}, Vec{nextFloat64(), nextFloat64()}
		unv23 := unv(vec(a2, a3))
		v12 := vec(a1, a2)
		v31 := vec(a3, a1)
		s := cdot(v12, v31) / 2 / cdot(v12, unv23)
		c := add(times(.5, add(a2, a3)), times(s, unv23))
		v1c := vec(a1, c)
		fmt.Fprintf(stdout, "%.3f %.3f %.3f\n", c.x, c.y, math.Sqrt(v1c.x*v1c.x+v1c.y*v1c.y))
	}
}

C++: #include <cstdio>
#include <cmath>
#include <utility>
#include <algorithm>
using namespace std;

#define EPS 1e-10
#define x second
#define y first

inline int sqr(int n) { return n * n; }

struct triangle
{
    pair<double, double> p[3];
    double side[3];
    double angle;

    void init()
    {
        for (int i = 0; i < 3; i++){
            scanf("%lf %lf", &p[i].x, &p[i].y);
        }
        sort(p, p + 3);
        for (int i = 0; i < 3; i++){
            double dx = p[(i + 1) % 3].x - p[i].x;
            double dy = p[(i + 1) % 3].y - p[i].y;
            side[i] = sqrt(dx * dx + dy * dy);
        }
        angle = asin((p[2].y - p[0].y) / side[2]) + EPS;
    }

    pair<double, double> circle()
    {
        double l, m;
        double t[2], lt[4], mt[4];

        t[0] = sqr(p[1].x) - sqr(p[0].x) + sqr(p[1].y) - sqr(p[0].y);
        t[1] = sqr(p[2].x) - sqr(p[1].x) + sqr(p[2].y) - sqr(p[1].y);
        lt[0] = (p[2].y - p[1].y);
        lt[1] = (p[1].y - p[0].y);
        lt[2] = lt[0] * (p[1].x - p[0].x);
        lt[3] = lt[1] * (p[2].x - p[1].x);
        l = (t[2] - t[3]) / (lt[0] + lt[1]);
        mt[0] = (p[1].y - p[0].y);
        mt[1] = (p[2].y - p[1].y);
        mt[2] = mt[0] * (p[2].x - p[1].x);
        mt[3] = mt[1] * (p[1].x - p[0].x);
        m = (t[2] - t[3]) / (mt[0] + mt[1]);

        return make_pair(-l / 2, -m / 2);
    }
};

int main()
{
    int n;

    scanf("%d", &n);
    while (n-- > 0){
        triangle tri;
        double r;
        pair<double, double> pr;

        tri.init();
        if (tri.p[1].y != tri.p[2].y) r = tri.side[1] / sin(tri.angle) / 2;
        else r = tri.side[0] / sin(tri.angle) / 2;
        pr = tri.circle();
        printf("%f %f %f\n", pr.x, pr.y, r);
    }

    return 0;
}