Light OJ 1011

#include<bits/stdc++.h>
using namespace std;
const int maxn = 1<<16;
int Mp[20][20];
int Dp[20][maxn + 131];

int main()
{
    int t, n;
    scanf("%d",&t);
    for(int kase = 1; kase <= t; ++kase)
    {
        scanf("%d",&n);
        for(int i = 0; i < n; ++i)
            for(int j = 0; j < n; ++j) scanf("%d",&Mp[i][j]);
        int All = 1<<n;
        memset(Dp,0,sizeof(Dp));
        for(int i = 0; i < n; ++i)
            Dp[0][1<<i] = Mp[0][i];
        for(int i = 1; i < n; ++i)
        {
            for(int s = 0; s < All; ++s) /// 枚举状态
            {
                if(Dp[i-1][s] == 0) continue ;
                /// 扫描状态
                for(int j = 0; j < n; ++j)
                {
                    if(s & (1 << j)) continue ;
                    Dp[i][s|(1<<j)] = max(Dp[i][s|(1<<j)],Dp[i-1][s] + Mp[i][j]);
                    ///当前选取 j 在 当前 和上一层 不选j的情况下 取 Max；
                }
            }
        }
        printf("Case %d: %d\n",kase, Dp[n-1][All-1]);
    }
}