LOJ 1011 bitmask dp

///:-)
#include <bits/stdc++.h>
#define pb push_back
#define ll long long int
#define inf 2000000000
#define infLL 9000000000000000000
#define infULL 18446744073709551615
#define Aktaruzzaman using
#define dbg printf("Here\n");
#define pi (2.0*acos(0.0))
#define Pramanik namespace std;
#define vsort(v)   sort(v.begin(),v.end())
#define ull unsigned long long int
#define mem(a, b) memset(a, b, sizeof a)
#define cf 100009
#define MOD 1000000007
#define pii pair<int, int>

//int dx[]={0,1,0,-1};
//int dy[]={1,0,-1,0};
//int dx[]={1,1,0,-1,-1,-1,0,1};
//int dy[]={0,1,1,1,0,-1,-1,-1};

template <class T> inline T gcd(T a,T b){if(b==0)return a;return gcd(b,a%b);}
template< class T > inline T lcm(T a,T b) {a=abs(a);b=abs(b); return (a/gcd(a,b))*b;}
template <class T> inline T is_prime(T a){if(a<2|a==4)return false;if(a==2||a==3||a==5)return true; T g=(T)sqrt(a)+1; for(T i=2; i<=g; i++){if(a%i==0)return false;}return false;}
template <class T> inline T bigmod(T n,T p,T m){if(p==0)return 1; if(p%2)return ((n%m)*bigmod(n,p-1,m))%m; else {T c=bigmod(n,p/2,m);return ((c%m)*(c%m))%m;}}

Aktaruzzaman Pramanik
ll vis[17][(1<<16)+5];
ll a[17][17];
ll n;

ll dp(ll pos, ll msk)
{
    if(pos==n)return 0;
    if(vis[pos][msk]!=-1)return vis[pos][msk];

    ll xx=0;

    for(ll i=0; i<n; i++){

        if((msk&(1<<i))==0){
//            dbg
            ll tmpMsk = msk;
            tmpMsk|=(1<<i);
            xx= max(xx, a[pos][i]+dp(pos+1, tmpMsk));
        }
    }

    return vis[pos][msk]=xx;

}

int main()

{
     ios_base:: sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
     ll t, i, j, k, x, y;

     cin>>t;
     ll cc=0;

     while(t--){
        cin>>n;
        for(i=0; i<n; i++){
            for(j=0; j<n; j++){
                cin>>a[i][j];
            }
        }
        mem(vis, -1);
        printf("Case %lld: %lld\n", ++cc, dp(0, 0));

     }

}