1111. 数塔

//dp[i][j] = min(dp[i + 1][j], dp[i + 1][j + 1]) + a[i][j];
#include <iostream>
#include <algorithm>
using namespace std;
int a[101][101];
int dp[101][101];
int n;

int main() {
    int num;
    cin >> num;
    while (num--) {
        cin >> n;
        fill(a[0], a[0] + 101 * 101, 0);
        fill(dp[0], dp[0] + 101 * 101, 0);
        for (int i = 0; i < n; ++i) {
            for (int j = 0; j <= i; ++j) {
                cin >> a[i][j];
            }
        }
        for (int i = n - 1; i >= 0; --i) {
            for (int j = 0; j <= i; ++j) {
                dp[i][j] = min(dp[i + 1][j], dp[i + 1][j + 1]) + a[i][j];
            }
        }
        cout << dp[0][0] << endl;
    }
    return 0;
}

#include <iostream>
#include <algorithm>
using namespace std;
int a[101][101];
int n;
int _min;
void DFS(int index, int sum, int j) {
    if (index > n) {
        return;
    }
    if (index == n) {
        if (sum < _min) {
            _min = sum;
        }
        return;
    }
    DFS(index + 1, sum + a[index][j], j);
    if (index != 0) {
        DFS(index + 1, sum + a[index][j + 1], j + 1);
    }
}

int main() {
    int num;
    cin >> num;
    while (num--) {
        cin >> n;
        _min = 100000000;
        fill(a[0], a[0] + 101 * 101, 0);
        for (int i = 0; i < n; ++i) {
            for (int j = 0; j <= i; ++j) {
                cin >> a[i][j];
            }
        }
        DFS(0, 0, 0);
        cout << _min << endl;
    }
    return 0;
}

def dfs(L, i, j, N, sum):
    global min
    if i == N-1:
        a = sum + L[i][j]
        min = a if a < min else min
        return
    dfs(L, i+1, j, N, sum+L[i][j])
    dfs(L, i+1, j+1, N, sum+L[i][j])


C = int(input())
for n in range(C):
    N = int(input())
    L = []
    for i in range(N):
        L.append([int(i) for i in input().split()])
    min = 0xffffffff
    dfs(L, 0, 0, N, 0)
    print(min)

return 0;