Tree's a Crowd

Description

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，就将对应的距离的点个数加１，最后输出距离为0,1,2...8,9的点的个数。

特别注意输出一开始的时候认为第一个没有4间距 W多好次

没读懂题是硬伤呀！！

附上代码:

#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <string.h>
using namespace std;

struct point
{
    int x,y,z;
}p[5005];
int cal(point p1,point p2)
{
    int t,x,y,z;
    x=p1.x-p2.x;
    y=p1.y-p2.y;
    z=p1.z-p2.z;
    t=(int)sqrt(x*x+y*y+z*z);
    return t;
}

int main()
{
    int num=0,x,y,z;
    while(scanf("%d%d%d",&x,&y,&z)!=EOF)
    {
        if(x==0&&y==0&&z==0)
                break;
        p[num].x=x;
        p[num].y=y;
        p[num].z=z;
        num++;
    }
    int d[10],i,j;
    memset(d,0,sizeof(d));
    for(i=0;i<num;i++)
    {
        int dist=1000;
        for(j=0;j<num;j++)
        {
            if(i==j)
                continue;
            int sum=cal(p[i],p[j]);
            if(dist>sum)
                dist=sum;
        }
        if(dist >= 0 && dist <= 9)
            d[dist]++;
    }
    for(i=0;i<10;i++)
        printf("%4d",d[i]);
 printf("\n");
    return 0;
}