uva152

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

152 - Tree's a Crowd

Time limit: 3.000 seconds

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

题意：其一棵树和它相邻最近（范围>=0&&<10）的树的个数。。

思路:直接暴力，枚举。。

#include<stdio.h>

#include<string.h>

#include<iostream>

#include<algorithm>

#include<math.h>

using namespace std;

#define N 5010

struct Point{

 int x;

 int y;

 int z;

}point[N];//定义x,y,z的坐标

int main()

{

 memset(point,0,sizeof(point));

 int i=0,j=0,n=0,count[20];

 memset(count,0,sizeof(count));

 while(1)//三个数同时为零跳出循环

 {

  scanf("%d %d %d",&point[i].x,&point[i].y,&point[i].z);

  if(point[i].x ==0&&point[i].y ==0&&point[i].z==0)

   break;

  i++;n++;

 }

 for(i=0;i<n;i++)

 {

  int k=0,min=10;//只要求范围在>=0<10之内的数据，其他的无效,min的位置必须在这里

  for(j=0;j<n;j++)

  {

   if(i==j)//自己不能和自己比

    continue;

   k=(int)pow((float)point[i].x -point[j].x ,2)+pow((float)(point[i].y -point[j].y),2)+pow((float)(point[i].z -point[j].z ),2);//求距离

   k=(int )sqrt(k);//开方

   if(k<min)min=k;

  }

  count[min]++;//所有最小距离的累加

 }

 for(i=0;i<10;i++)

  printf("M",count[i]);

 printf("\n");

 return 0;

}