1046.cpp

流牛木马原创POJ解题报告集１ http://www.cppblog.com/aclayton

#include"iostream.h"
int save[16][3]; 

void input()
{
	int i;
	for(i=0;i<16;i++)
	{
		cin>>save[i][0]>>save[i][1]>>save[i][2];

	}

	return;
}

void solve()
{

	int a[3];
    int i,j,sum,min;

	while(1)
	{
		cin>>a[0]>>a[1]>>a[2];
		if(a[0]==-1) return;
		else
		{
            min=255*255*3;j=0;
			for(i=0;i<16;i++)
			{
				sum=0; 
				sum=(save[i][0]-a[0])*(save[i][0]-a[0])+(save[i][1]-a[1])*(save[i][1]-a[1])+(save[i][2]-a[2])*(save[i][2]-a[2]);
				if(sum<min){min=sum;j=i;}

			}
	cout<<"("<<a[0]<<","<<a[1]<<","<<a[2]<<") maps to ("<<save[j][0]<<","<<save[j][1]<<","<<save[j][2]<<")"<<endl;
		}
	


	}
return ;
}

void main()
{
	input();
	solve();
	return;
}