1046 Color Me Less

简单题：
AC代码：

#include <iostream>
#include <climits>
#include <cmath>
using namespace std;

const int N = 20;

int R[N], G[N], B[N];
int r, g, b;

void dis() {//计算最接近的颜色
	float ans = INT_MAX, d;
	int tr, tg, tb;
	for (int i = 0; i < 16; i++) {
		d = sqrt((R[i] - r) * (R[i] - r) + (G[i] - g) * (G[i] - g) + (B[i] - b) * (B[i] - b));
		if (ans > d) {
			ans = d;
			tr = R[i]; tg = G[i]; tb = B[i];
		}	
	}
	printf("(%d,%d,%d)\n", tr,tg,tb);
}

int main() {
	for (int i = 0; i < 16; i++) {
		cin >> R[i] >> G[i] >> B[i];
	}
	while (cin >> r >> g >> b) {
		if (r == -1) break;
		printf("(%d,%d,%d) maps to ", r, g, b);
		dis();
	}
	return 0;
}