zoj 1067很简单

#include<stdio.h>
#include<string.h>
#include<math.h>
#include<stdlib.h>
int main()
{
        int a[17],b[17],c[17];
        int i,k,p,t,q,x,y,z;
        for(i=0;i<16;i++)
       {
                  scanf("%d%d%d",&a[i],&b[i],&c[i]);
       }
       while(scanf("%d%d%d",&x,&y,&z)&&x!=-1&&y!=-1&&z!=-1)
      {
                  t=999999;
                  q=-1;
                  for(k=0;k<16;k++)
                  {
                           p=pow((x-a[k]),2)+pow((y-b[k]),2)+pow((z-c[k]),2);
                           if(p<t)
                          {
                                     t=p;
                                     q=k;
                          } 
                  }
                  printf("(%d,%d,%d) maps to (%d,%d,%d)\n",x,y,z,a[q],b[q],c[q]);
         }
         return 0;
} 

一个一个求解