// Problem#: 1815
// Submission#: 1076649
// The source code is licensed under Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported License
// URI: http://creativecommons.org/licenses/by-nc-sa/3.0/
// All Copyright reserved by Informatic Lab of Sun Yat-sen University
#include <iostream>
#include <cmath>
#include <algorithm>
#include <stdio.h>
using namespace std;
class point
{
public:
double length(point);
point();
point(double, double);
private:
double x;
double y;
};
point::point()
{
x = 0;
y = 0;
}
point::point(double a, double b)
{
x = a;
y = b;
}
double point::length(point p)
{
double l = 0;
l = sqrt((x - p.x)*(x - p.x) + (y - p.y)*(y - p.y));
return l;
}
int main()
{
int test_num;
scanf("%d", &test_num);
while(test_num > 0)
{
double x1, y1;
double x2, y2;
scanf("%lf%lf%lf%lf", &x1, &y1, &x2, &y2);
/*printf("%f %f %f %f", x1, y1, x2, y2);*/
point p1(x1, y1), p2(x2, y2);
/*double l = 0;
l = sqrt((x1 - x2)*(x1 - x2) + (y1 - y2)*(y1 - y2));*/
printf("%.2lf\n", /* l*/p1.length(p2));
test_num--;
}
return 0;
}