Run ID | User | Problem | Result | Memory | Time | Language | Code Length | Submit Time |
7550038 | kingpro | 1046 | Accepted | 164K | 0MS | C++ | 678B | 2010-08-28 23:52:26 |
#include<stdio.h> struct point{ int x; int y; int z;}; int main() { point Points[16], current; for(int i=0;i<16;i++) scanf("%d %d %d", &Points[i].x, &Points[i].y, &Points[i].z); while(scanf("%d %d %d", ¤t.x, ¤t.y, ¤t.z), current.x!=-1 || current.y!=-1 || current.z!=-1) for(int i=0, max=255*255*3, cl=0, cp=-1;i<16 || (printf("(%d,%d,%d) maps to (%d,%d,%d)\n", current.x, current.y, current.z, Points[cp].x, Points[cp].y, Points[cp].z), false); i++) cl=(current.x-Points[i].x)*(current.x-Points[i].x)+(current.y-Points[i].y)*(current.y-Points[i].y)+(current.z-Points[i].z)*(current.z-Points[i].z), cl<max && (max=cl, cp=i); return 0; }
这道题太水了...