'commit'

TangDou/AcWing/BeiBao/1023_1.cpp

@@ -0,0 +1,20 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+const int N = 1010;
+int v[5] = {0, 10, 20, 50, 100};
+int f[5][N];
+
+int main() {
+    int m;
+    cin >> m;
+    // 前0种物品，体积是0的情况下只有一种方案
+    f[0][0] = 1;
+    for (int i = 1; i <= 4; i++)
+        for (int j = 0; j <= m; j++) {
+            f[i][j] = f[i - 1][j];
+            if (v[i] <= j) f[i][j] += f[i][j - v[i]];
+        }
+    printf("%d\n", f[4][m]);
+    return 0;
+}