#include <stdio.h>
#include <math.h> 
void main(){
	int R[16],G[16],B[16],D[16];
	int i,j,a,b,c;
	for(i=0;i<=15;i++){
		scanf("%d %d %d",&R[i],&G[i],&B[i]);
	}
	scanf("%d %d %d",&a,&b,&c);
	while(a!=-1&&b!=-1&&c!=-1){
		int n=1;
		for(i=0;i<=15;i++){
	    	D[i]=(a-R[i])*(a-R[i])+(b-G[i])*(b-G[i])+(c-B[i])*(c-B[i]);
		}
        for(i=1;i<=15;i++){
		    if(D[i]<D[0]){
			    j=D[0];
			    D[0]=D[i];
			    D[i]=j;
				n=i;
			}
		}
	    printf("(%d,%d,%d) maps to (%d,%d,%d)\n",a,b,c,R[n],G[n],B[n]);
		scanf("%d %d %d",&a,&b,&c);
	}
}

• (0,0,0) maps to (0,0,0) (8) Judas 2005-11-24 14:41:23
  • Re:(0,0,0) maps to (0,0,0) (12) tears 2005-11-24 22:30:05
    • Re:(0,0,0) maps to (0,0,0) (19) tears 2005-11-24 22:31:18
      • ` (43) Judas 2005-11-25 22:14:21