152 - Tree's a Crowd

#include <stdio.h>
#include <math.h>
typedef struct
{
	double x;
	double y;
	double z;
} Point;
Point points[5010];
int disCount[10];
int main()
{
	int a,b,c,count=0;
	while(scanf("%d",&a) && scanf("%d",&b)&& scanf("%d",&c))
	{
		if(a==0 && b==0 && c==0) break;
		points[count].x=a;
		points[count].y=b;
		points[count].z=c;
		count++;
	}
	for(int i=0;i<count;i++)
	{
		int min=999999;
		for(int j=0;j<count;j++)
		{
			if(i==j) continue;
			int dist=sqrt((points[i].x-points[j].x)*(points[i].x-points[j].x)+(points[i].y-points[j].y)*(points[i].y-points[j].y)+(points[i].z-points[j].z)*(points[i].z-points[j].z));
			if(min>dist)
				min=dist;
		}
		if(min<10)
		disCount[min]++;
	}
	for(int i=0;i<10;i++)
		printf("%4d",disCount[i]);
	printf("\n");
	return 0;
}

http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=88