uva 152 Tree's a Crowd

#include <iostream>
#include <cmath>
#include <cstdio>
#include <cstring>

using namespace std;
int main()
{
    int x[10000],y[10000],z[10000],count[10000];
    int num=0;
    while(cin>>x[num]>>y[num]>>z[num]&&(x[num]+y[num]+z[num]))
        count[num++]=0;
    for(int i=0; i<num; i++)
    {
        int m=999999;
        for(int j=0; j<num; j++)
        {
            if(i!=j)
            {
                double xx=fabs(x[i]-x[j]),yy=fabs(y[i]-y[j]),zz=fabs(z[i]-z[j]);
                int len=(int)sqrt(xx*xx+yy*yy+zz*zz);
                m=min(m,len);
            }
        }
        count[m]++;
    }
    for(int i=0; i<10; i++)
        printf("%4d",count[i]);
    cout<<endl;
    return 0;
}