uva 152 Tree's a Crowd

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
using namespace std;
struct node
{
double a,b,c;
}tree[5005];
int a[10];
int main()
{
int n=0;
while(scanf("%lf%lf%lf",&tree
.a,&tree
.b,&tree
.c)!=EOF)
{
if(tree
.a==0&&tree
.b==0&&tree
.c==0) break;
n++;
}
for(int i=0;i<n;i++)
{
int imin=1<<29;
for(int j=0;j<n;j++)
{
if(i==j) continue;
int temp=sqrt((tree[i].a-tree[j].a)*(tree[i].a-tree[j].a)+
(tree[i].b-tree[j].b)*(tree[i].b-tree[j].b)+
(tree[i].c-tree[j].c)*(tree[i].c-tree[j].c));
imin=min(imin,temp);
}
a[imin]++;
}
for(int i=0;i<10;i++) printf("%4d",a[i]);
puts("");
return 0;
}