更新时间:2022-08-31 18:06:57
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 26432 | Accepted: 12740 |
Description
Input
Output
Sample Input
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
Sample Output
(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)
Source
#include <stdio.h> typedef struct { int r,g,b; }Color; Color color[16]; int main() { Color c; int i; int min_dis,dis,index; for(i = 0; i < 16;i++) scanf("%d%d%d",&color[i].r,&color[i].g,&color[i].b); while(1) { scanf("%d%d%d",&c.r,&c.g,&c.b); min_dis = 10000000; if(c.r==-1&&c.g==-1&&c.b==-1)break; for(i = 0; i<16; i++) { dis = (color[i].r-c.r)*(color[i].r-c.r)+(color[i].g-c.g)*(color[i].g-c.g)+(color[i].b-c.b)*(color[i].b-c.b); if(dis<min_dis) { min_dis = dis; index = i; } } printf("(%d,%d,%d) maps to (%d,%d,%d)\n",c.r,c.g,c.b,color[index].r,color[index].g,color[index].b); } return 0; }
本文转自NewPanderKing51CTO博客,原文链接:http://www.cnblogs.com/newpanderking/archive/2012/10/03/2710902.html ,如需转载请自行联系原作者