2721277_ac_0ms_72k.c

北大大牛代码 1240道题的原代码 超级权威

#include <stdio.h>

int Min(int a,int b)
{
    return a>b?b:a;
}

int main()
{
    int lx, ly, lz, x, y, z;
    int a1, a2, a3, a4;

    while (scanf("%d%d%d%d%d%d",&lx,&ly,&lz,&x,&y,&z)==6)
    {
        if (!lx&&!ly&&!lz&&!x&&!y&&!z)
            return 0;
        a1 = a2 = a3 = a4 = 2100000000;
        if (!x||!y||!z)
        {
            a1 = x*x+y*y+z*z;
            printf("%d\n",x*x+y*y+z*z);
            continue;
        }
        if (z==lz)
        {
            a2 = Min(((z+x)*(z+x)+y*y),((z+y)*(z+y)+x*x));
            a2 = Min(a2,(ly+x)*(ly+x)+(z+ly-y)*(z+ly-y));
            a2 = Min(a2,(lx+y)*(lx+y)+(z+lx-x)*(z+lx-x));
        }
        if (x==lx)
        {
            a3 = Min(((z+x)*(z+x)+y*y),((x+y)*(x+y)+z*z));
            a3 = Min(a3,(lz+y)*(lz+y)+(x+lz-z)*(x+lz-z));
            a3 = Min(a3,(ly+z)*(ly+z)+(x+ly-y)*(x+ly-y));
        }
        if (y==ly)
        {
            a4 = Min(((y+z)*(y+z)+x*x),((x+y)*(x+y)+z*z));
            a4 = Min(a4,(lx+z)*(lx+z)+(y+lx-x)*(y+lx-x));
            a4 = Min(a4,(lz+x)*(lz+x)+(y+lz-z)*(y+lz-z));
        }
        printf("%d\n",Min(a2,Min(a3,a4)));
    }
    return 0;
}