Method One:

#include <bits/stdc++.h>
#include <cstring>
using namespace std;
// TSP Problem (Traveling Saleman Problem)
const int MAXN = 20;
int n;
int dis[MAXN + 1][MAXN + 1];
int dp[(1 << MAXN) + 20][MAXN + 1];
int main()
{
    cin >> n;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            cin >> dis[i][j];
        }
    }   
    memset(dp, 0x3f, sizeof dp);
    dp[1][1] = 0;

    // 当前状态去拿可能转移过来的状态
    for (int state = 1; state < (1 << n); state++) {
        for (int u = 1; u <= n; u++) {
            if (!(state & (1 << (u - 1)))) { // 没有经过过 u 点
                continue; 
            }
            for (int v = 1; v <= n; v++) { // 曾经在 v 点
                if (state & (1 << (v - 1))) continue; // 如果 v 在 State 中
                dp[state | (1 << (v - 1))][v] = min(dp[state | (1 << (v - 1))][v], dp[state][u] + dis[u][v]);
            }
        }
    }
    int ans = 0x3f3f3f3f;
    for (int i = 1; i <= n; i++) {
        ans = min(ans, dp[(1 << n) - 1][i] + dis[i][1]);
    }
    cout << ans << '\n';
    return 0;
}