hdu1875

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
using namespace std;
int p[105];
int rank[105],x[105],y[105];
struct node
{
    int u,v;
    double s;
    node():u(0),v(0),s(0){}
};
bool cmp(const node &lhs,const node &rhs)
{
    return lhs.s<rhs.s;
}
void make_set()
{
    int i;
    for(i=0;i<=105;i++)
        p[i]=i;
}
int find_set(int i)
{
    if(i!=p[i])
        p[i]=find_set(p[i]);
    return p[i];
}
int Union(int i,int j)
{
    i=find_set(i);
    j=find_set(j);
    if(i==j)
        return 0;
    if(rank[i]<rank[j])
        p[i]=j;
    else
    {
        p[j]=i;
        if(rank[i]==rank[j])
            rank[i]++;
    }
    return 1;
}
void init()
{
    make_set();
    memset(rank,0,sizeof(rank));
    memset(x,0,sizeof(x));
    memset(y,0,sizeof(y));
}
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        int c;
        node map[6000];
        init();
        scanf("%d",&c);
        int i;
        for(i=0;i<c;i++)
            scanf("%d%d",&x[i],&y[i]);
        int j;
        int k=0;
        for(i=0;i<c;i++)
        {
            for(j=i+1;j<c;j++)
            {
                double t=sqrt((double)(x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]));
                if(t<10.0||t>1000.0)
                    continue;
                map[k].u=i;
                map[k].v=j;
                map[k].s=t;
                k++;
            }
        }
        sort(map,map+k,cmp);
        double sum=0;
        for(i=0;i<k;i++)
        {
            if(Union(map[i].u,map[i].v))
                sum+=map[i].s;
        }
        int count=0;
        for(i=0;i<c;i++)
            if(p[i]==i)
                count++;
        if(count==1)
            printf("%.1f\n",sum*100);
        else
            printf("oh!\n");
    }
    return 0;
}