Tree's a Crowd
Tree's a Crowd |
Dr William Larch, noted plant psychologist and inventor of the phrase ``Think like a tree--Think Fig'' has invented a new classification system for trees. This is a complicated system involving a series of measurements which are then combined to produce three numbers (in the range [0, 255]) for any given tree. Thus each tree can be thought of as occupying a point in a 3-dimensional space. Because of the nature of the process, measurements for a large sample of trees are likely to be spread fairly uniformly throughout the whole of the available space. However Dr Larch is convinced that there are relationships to be found between close neighbours in this space. To test this hypothesis, he needs a histogram of the numbers of trees that have closest neighbours that lie within certain distance ranges.
Write a program that will read in the parameters of up to 5000 trees and determine how many of them have closest neighbours that are less than 1 unit away, how many with closest neighbours 1 or more but less than 2 units away, and so on up to those with closest neighbours 9 or more but less than 10 units away. Thus if is the distance between the i'th point and its nearest neighbour(s) and
, with j and k integers and k = j+1, then this point (tree) will contribute 1 to the j'th bin in the histogram (counting from zero). For example, if there were only two points 1.414 units apart, then the histogram would be 0, 2, 0, 0, 0, 0, 0, 0, 0, 0.
Input and Output
Input will consist of a series of lines, each line consisting of 3 numbers in the range [0, 255]. The file will be terminated by a line consisting of three zeroes.
Output will consist of a single line containing the 10 numbers representing the desired counts, each number right justified in a field of width 4.
Sample input
10 10 0 10 10 0 10 10 1 10 10 3 10 10 6 10 10 10 10 10 15 10 10 21 10 10 28 10 10 36 10 10 45 0 0 0
Sample output
2 1 1 1 1 1 1 1 1 1
题意。。输入一堆的空间坐标点。。要找出每一点与其他点距离最小的距离。如果该距离小于10,这个距离数目就加一。。
举个例子,比如有两个点距离是5,那么5这个距离的量就多1。。
最后输出 距离10以内的个数。 这里要注意 如果距离有小数。要取整。。取整是向下取整
#include <stdio.h>
#include <string.h>
#include <math.h>
double dian[11111][3];
int d[11];
int t = 0;
int main()
{
while (scanf("%lf%lf%lf", &dian[t][0], &dian[t][1], &dian[t][2]) != EOF)
{
if (!dian[t][0] && !dian[t][1] && !dian[t][2])
{
t ++;
for (int i = 0; i < t; i ++)
{
int min = 999999999;
for (int j = 0; j < t; j ++)
{
if (i == j)
continue;
int dis = (int)(sqrt((dian[i][0] - dian[j][0]) * (dian[i][0] - dian[j][0]) + (dian[i][1] - dian[j][1]) * (dian[i][1] - dian[j][1]) + (dian[i][2] - dian[j][2]) * (dian[i][2] - dian[j][2])));
if (dis < min)
min = dis;
}
d[min] ++;
}
for (int i = 0; i < 10; i ++)
printf("%4d", d[i]);
printf("\n");
t = 0;
memset(dian, 0 , sizeof(dian));
memset(d, 0, sizeof(d));
}
t ++;
}
return 0;
}