堆箱子

#include <iostream>
#include <algorithm>
#include <cstdio>
using namespace std;
struct xiangzi{
    int x,y,z;
}; 
xiangzi a[200];
int dp[200];
bool cmp(xiangzi a,xiangzi b)
{
    if(a.x!=b.x)
    return a.x<b.x;
    else
    {
        if(a.y!=b.y)
        return a.y<b.y;
        else
        return a.z<b.z;
    }
}
int main()
{
    int n;
    int hj=0;
    while(cin>>n)
    {
        hj++;
        if(n==0)
        break;
        else
        {
            int cnt=0;
            for(int i=0;i<n;i++)
            {
                int x,y,z;
                scanf("%d%d%d",&x,&y,&z);
                if(x==y)
                {
                    if(y==z)
                    {
                        a[cnt]=(xiangzi){x,y,z};
                        cnt++;
                        continue;
                    }
                    else
                    {
                        a[cnt]=(xiangzi){x,z,y};
                        cnt++;
                        a[cnt]=(xiangzi){x,y,z};
                        cnt++;
                        a[cnt]=(xiangzi){z,x,y};
                        cnt++;
                        continue;
                    }
                }
                else
                {
                    if(y==z)
                    {
                        a[cnt]=(xiangzi){x,y,z};
                        cnt++;
                        a[cnt]=(xiangzi){y,z,x};
                        cnt++;
                        a[cnt]=(xiangzi){y,x,z};
                        cnt++;
                        continue;
                    }
                    else if(x==z)
                    {
                        a[cnt]=(xiangzi){x,y,z};
                        cnt++;
                        a[cnt]=(xiangzi){x,z,y};
                        cnt++;
                        a[cnt]=(xiangzi){y,x,z};
                        cnt++;
                        continue;
                    }
                    else
                    {
                        a[cnt]=(xiangzi){x,y,z};
                        cnt++;
                        a[cnt]=(xiangzi){x,z,y};
                        cnt++;
                        a[cnt]=(xiangzi){y,x,z};
                        cnt++;
                        a[cnt]=(xiangzi){y,z,x};
                        cnt++;
                        a[cnt]=(xiangzi){z,x,y};
                        cnt++;
                        a[cnt]=(xiangzi){z,y,x};
                        cnt++;
                        continue;
                    }
                }
            }
            sort(a,a+cnt,cmp);
            int res=0;
            for(int i=0;i<cnt;i++)
            {
                dp[i]=a[i].z;
                for(int j=0;j<i;j++)
                {
                    if(a[j].x<a[i].x&&a[j].y<a[i].y)
                    {
                        dp[i]=max(dp[i],dp[j]+a[i].z);
                    }
                }
                res=max(res,dp[i]);
            }
            printf("Case %d: maximum height = %d\n",hj,res);
        }
    }
}