1046 Color Me Less：三维距离转换：printf致胜

题目大意

原题链接
题意：从第十六行开始计算这个点与前十六个点的距离，找出最小的。枚举一遍就好了。

菜鸡一直用cout，到这里发现printf是真的好用

#include<iostream>
#include<iomanip>
#include<string>
#include<string.h>
#include<algorithm>
#include<vector>
#include<queue>
#include<cstdio>
#include<cmath>
using namespace std;

#define ll int
#define MAX 10
#define inf 255*255*255+1

ll a[16][3];
ll b[3];

double dis(ll x) {
	double res = 0;
	for (int i = 0; i < 3; i++) res += (a[x][i] - b[i])*(a[x][i] - b[i]);
	return sqrt(res);
}

int main() {
	for (int i = 0; i < 16; i++) cin >> a[i][0] >> a[i][1] >> a[i][2];
	ll m, x, c;
	while (cin >> m >> x >> c && m + x + c != -3) {
		b[0] = m, b[1] = x, b[2] = c;
		int id = -1; double dist = inf;
		for (int i = 0; i < 16; i++) {
			double d = dis(i);
			if (d < dist) dist = d, id = i;
		}
		int a1 = b[0], a2 = b[1], a3 = b[2], a4 = a[id][0], a5 = a[id][1], a6 = a[id][2];
		printf("(%d,%d,%d) maps to (%d,%d,%d)\n", a1, a2, a3, a4, a5, a6);
	}
}