python/TangDou/BeiBao/PlanCount/01_Above2.cpp

#include <bits/stdc++.h>

using namespace std;
const int N = 110;

int n, m;
int f[N][N];

int main() {
    cin >> n >> m;
    f[0][0] = 1;
    for (int i = 1; i <= n; i++) {
        int v;
        cin >> v;
        for (int j = 0; j <= m; j++)//即使物品体积比j大，j - v < 0，也能选，等价于f[i - 1][0]
            f[i][j] = f[i - 1][j] + f[i - 1][max(0, j - v)];
    }
    cout << f[n][m] << endl;
    return 0;
}