fking dp bitmask

#include <bits/stdc++.h>
using namespace std;
const int N = 1 << 16;
int c[17][17], n, dp[N + 1][17], ans = 1e9;
void read()
{
    cin >> n;
    for (int i = 0; i < n; ++ i)
    {
        for (int j = 0; j < n; ++ j)
        {
            cin >> c[i][j];
        }
    }
    for (int i = 0; i < (1 << n); ++ i)
    {
        for (int j = 0; j < n; ++ j)
        {
            dp[i][j] = 1e9;
        }
    }
    for (int i = 0; i < n; ++ i)
    {
        dp[1 << i][i] = 0;
    }
}
void solve()
{
   for (int i = 1; i < (1 << n); ++ i)
   {
       for (int j = 0; j < n; ++ j)
       {
           if (!(i & (1 << j)))
           {
               for (int k = 0; k < n; ++ k)
               {
                   if (i & (1 << k))
                   {
                       dp[i | (1 << j)][j] = min(dp[i | (1 << j)][j], dp[i][k] + c[k][j]);
                   }
               }
           }
       }
   }
   for (int i = 0; i < n; ++ i)
   {
       ans = min(ans, dp[(1 << n) - 1][i]);
   }
   cout << ans;
}
int main()
{
   ios_base::sync_with_stdio(false);
   cin.tie(nullptr);
   //freopen(task".INP", "r", stdin);
   //freopen(task".OUT", "w", stdout);
   int t = 1;
   bool typetest = false;
   if (typetest)
   {
      cin >> t;
   }
   for (int __ = 1; __ <= t; ++ __)
   {
      read();
      solve();
   }
}