C++程序练习-1046:Color Me Less-简单题

提交统计提问时间限制: 1000ms内存限制: 65536kB
描述
A color reduction is a mapping from a set of discrete colors to a smaller one. The solution to this problem requires that you perform just such a mapping in a standard twenty-four bit RGB color space. The input consists of a target set of sixteen RGB color values, and a collection of arbitrary RGB colors to be mapped to their closest color in the target set. For our purposes, an RGB color is defined as an ordered triple (R,G,B) where each value of the triple is an integer from 0 to 255. The distance between two colors is defined as the Euclidean distance between two three-dimensional points. That is, given two colors (R1,G1,B1) and (R2,G2,B2), their distance D is given by the equation

输入
The input is a list of RGB colors, one color per line, specified as three integers from 0 to 255 delimited by a single space. The first sixteen colors form the target set of colors to which the remaining colors will be mapped. The input is terminated by a line containing three -1 values.
输出
For each color to be mapped, output the color and its nearest color from the target set.
样例输入
0 0 0
255 255 255
0 0 1
1 1 1
128 0 0
0 128 0
128 128 0
0 0 128
126 168 9
35 86 34
133 41 193
128 0 128
0 128 128
128 128 128
255 0 0
0 1 0
0 0 0
255 255 255
253 254 255
77 79 134
81 218 0
-1 -1 -1
样例输出
(0,0,0) maps to (0,0,0)
(255,255,255) maps to (255,255,255)
(253,254,255) maps to (255,255,255)
(77,79,134) maps to (128,128,128)
(81,218,0) maps to (126,168,9)

分析：
先初始化16个对比的Color组，然后输入单个测试数据，与Color组中对比数据依次比较，保留color less的数据，最后按格式输出结果。
很简单，不涉及难度算法。

//冰非寒(binfeihan@126.com) //256kB 0ms 1393 B G++ #include <stdio.h> #include <math.h> //global variables const int N16 = 16; const double LESS = 500.0; int Map[N16][3]; //public function double getless(int,int,int,int,int,int); //class: Color typedef class Color{ public: Color(int r,int g,int b,double less); void findLess(); void print(); private: int r; int g; int b; double less; int R; int G; int B; }Color; //class construction function Color::Color(int r,int g,int b,double less){ this->r = r; this->g = g; this->b = b; this->less = less; } //find the color with the minimum less void Color::findLess(){ double less; for(int i(0);i != N16;++ i){ less = getless(r,g,b,Map[i][0],Map[i][1],Map[i][2]); if(this->less > less){ this->less = less; this->R = Map[i][0]; this->G = Map[i][1]; this->B = Map[i][2]; } } } //print result void Color::print(){ printf("(%d,%d,%d) maps to (%d,%d,%d)\n",r,g,b,R,G,B); } //calculate the less color between 2 colors double getless(int r,int g,int b,int R,int G,int B){ return sqrt((double)(r - R)*(r - R)+(g - G)*(g - G)+(b - B)*(b - B)); } //main function int main(){ int r,g,b; //initialize Map for(int i(0);i != N16;++ i){ scanf("%d%d%d",&Map[i][0],&Map[i][1],&Map[i][2]); } while(scanf("%d%d%d",&r,&g,&b) == 3 && r != -1){ Color c(r,g,b,LESS); c.findLess(); c.print(); } return 0; }