UVA 152 (暑假-排序、检索 -D - Tree's a Crowd)

#include <cstdio>
#include <cmath>

int main() {
	int arr[100010][3];
	int n = 0 ;
	for ( int i = 0; scanf("%d%d%d", &arr[i][0], &arr[i][1], &arr[i][2]) && (arr[i][0] || arr[i][1] || arr[i][2]); i++, n++);
	int brr[10] = {0};
	for ( int i = 0; i < n; i++) {
		int min = 10;
		for (int j = 0; j < n; j++) {
			if (i == j)
				continue;
			int num = (int) sqrt((arr[j][0] - arr[i][0]) * (arr[j][0] - arr[i][0]) + (arr[j][1] - arr[i][1]) * (arr[j][1] - arr[i][1]) + (arr[j][2] - arr[i][2]) * (arr[j][2] - arr[i][2]));
			if (  num < min)
				min = num;
		}
	if (min < 10)
		brr[min]++;
	}

	for (int i = 0; i < 10; i++)
		printf("%4d", brr[i]);
	printf("\n");

	return 0;
}