'commit'

TangDou/AcWing/BeiBao/FangAnShu/ZhiShao_01_ErWei.cpp

@@ -0,0 +1,20 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+const int N = 110;
+
+int n, m;
+int f[N][N];
+
+int main() {
+    scanf("%d %d", &n, &m);
+    f[0][0] = 1;
+    for (int i = 1; i <= n; i++) {
+        int v;
+        scanf("%d", &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)];
+    }
+    printf("%d\n", f[n][m]);
+    return 0;
+}