'commit'

TangDou/AcWing/BeiBao/FangAnShu/ZhiShao_01_YiWei.cpp

@@ -0,0 +1,19 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+const int N = 110;
+int n, m;
+int f[N];
+
+int main() {
+    scanf("%d %d", &n, &m);
+    f[0] = 1;
+    for (int i = 1; i <= n; i++) {
+        int v;
+        scanf("%d", &v);
+        //即使物品体积比j大，j - v < 0，也能选，等价于f[0]
+        for (int j = m; j >= 0; j--) f[j] += f[max(0, j - v)];
+    }
+    printf("%d\n", f[m]);
+    return 0;
+}