水题水题
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<map>
#include<set>
#include<vector>
#include<cstring>
using namespace std;
int n,arr[20][3];
int main() {
freopen("in.txt", "r", stdin);
for(int i = 0; i < 16; i++) {
for(int j = 0; j < 3; j++) {
cin >>arr[i][j];
}
}
int a,b,c;
while(~scanf("%d%d%d",&a,&b,&c) && a != -1) {
int key = 0;
int d = (arr[0][0]-a)*(arr[0][0]-a) + (arr[0][1]-b)*(arr[0][1]-b) + (arr[0][2]-c)*(arr[0][2]-c);
for(int i = 1; i < 16; i++) {
int tmp = (arr[i][0]-a)*(arr[i][0]-a) + (arr[i][1]-b)*(arr[i][1]-b) + (arr[i][2]-c)*(arr[i][2]-c);
if(tmp < d) {
d = tmp;
key = i;
}
}
printf("(%d,%d,%d) maps to (%d,%d,%d)\n",a,b,c,arr[key][0],arr[key][1],arr[key][2]);
}
return 0;
}