add some cses-dynamic-programming problems solutions

Author: Muhammad-Magdi

CSES/Dynamic Programming/cses1158.cpp

@@ -0,0 +1,43 @@
+#include <algorithm>
+#include <cstdio>
+#include <cstring>
+
+using namespace std;
+
+const int N = 1e3 + 5, M = 1e5 + 2, OO = 0x3f3f3f3f, MOD = 1e9 + 7;
+
+int n, x;
+int H[N], S[N];
+
+int dp[2][M]; // availableBooks, remainingMoney
+
+int solve() {
+  fill(dp[0], dp[0] + x + 1, 0);
+  dp[0][0] = dp[1][0] = 0;
+
+  for (int availableBooks = 1; availableBooks <= n; availableBooks++) {
+    dp[availableBooks & 1][0] = 0;
+    for (int remainingMoney = 1; remainingMoney <= x; remainingMoney++) {
+      dp[availableBooks & 1][remainingMoney] =
+          dp[(availableBooks - 1) & 1][remainingMoney];
+      if (remainingMoney >= H[availableBooks]) {
+        dp[availableBooks & 1][remainingMoney] =
+            max(dp[availableBooks & 1][remainingMoney],
+                dp[(availableBooks - 1) & 1][remainingMoney - H[availableBooks]] + S[availableBooks]);
+      }
+    }
+  }
+  return dp[n&1][x];
+}
+
+int main() {
+  scanf("%d %d", &n, &x);
+  for (int i = 1; i <= n; i++) {
+    scanf("%d", H + i);
+  }
+  for (int i = 1; i <= n; i++) {
+    scanf("%d", S + i);
+  }
+  printf("%d\n", solve());
+  return 0;
+}

CSES/Dynamic Programming/cses1633.cpp

@@ -0,0 +1,20 @@
+#include <cstdio>
+
+using namespace std;
+
+const int N = 1e6+5, MOD = 1e9+7;
+
+int n;
+int dp[N];
+
+int main() {
+  scanf("%d", &n);
+  dp[0] = 1;
+  for (int i = 1; i <= n; i++) {
+    for (int k = 1; k <= 6 && (i - k) >= 0; k++) {
+      dp[i] = (dp[i] + dp[i-k])%MOD;
+    }
+  }
+  printf("%d\n", dp[n]);
+  return 0;
+}

CSES/Dynamic Programming/cses1634.cpp

@@ -0,0 +1,28 @@
+#include <cstdio>
+#include <cstring>
+#include <algorithm>
+
+using namespace std;
+
+const int N = 1e2+5, M = 1e6+5, OO = 0x3f3f3f3f;
+
+int n, x;
+int A[N], dp[M];
+
+int main() {
+  scanf("%d %d", &n, &x);
+  memset(dp, OO, sizeof dp);
+  for (int i = 0; i < n; i++) {
+    scanf("%d", A+i);
+  }
+  dp[0] = 0;
+  for (int i = 1; i <= x; i++) {
+    for (int k = 0; k < n; k++) {
+      if (i >= A[k]) {
+        dp[i] = min(dp[i], dp[i-A[k]] + 1);
+      }
+    }
+  }
+  printf("%d\n", dp[x] == OO ? -1 : dp[x]);
+  return 0;
+}

CSES/Dynamic Programming/cses1635.cpp

@@ -0,0 +1,27 @@
+#include <cstdio>
+#include <cstring>
+#include <algorithm>
+
+using namespace std;
+
+const int N = 1e2+5, M = 1e6+5, OO = 0x3f3f3f3f, MOD = 1e9+7;
+
+int n, x;
+int A[N], dp[M];
+
+int main() {
+  scanf("%d %d", &n, &x);
+  for (int i = 0; i < n; i++) {
+    scanf("%d", A+i);
+  }
+  dp[0] = 1;
+  for (int i = 1; i <= x; i++) {
+    for (int k = 0; k < n; k++) {
+      if (i >= A[k]) {
+        dp[i] = (dp[i] + dp[i - A[k]]) % MOD;
+      }
+    }
+  }
+  printf("%d\n", dp[x]);
+  return 0;
+}

CSES/Dynamic Programming/cses1636.cpp

@@ -0,0 +1,28 @@
+#include <algorithm>
+#include <cstdio>
+#include <cstring>
+
+using namespace std;
+
+const int N = 1e2 + 5, M = 1e6 + 5, OO = 0x3f3f3f3f, MOD = 1e9 + 7;
+
+int n, x;
+int A[N], dp[M];
+
+int main() {
+  scanf("%d %d", &n, &x);
+  for (int i = 0; i < n; i++) {
+    scanf("%d", A + i);
+  }
+  dp[0] = 1;
+  for (int i = 0; i < n; i++) {
+    for (int rem = A[i]; rem <= x; rem++) {
+      dp[rem] += dp[rem - A[i]];
+      if (dp[rem] >= MOD) {
+        dp[rem] -= MOD;
+      }
+    }
+  }
+  printf("%d\n", dp[x]);
+  return 0;
+}

CSES/Dynamic Programming/cses1637.cpp

@@ -0,0 +1,26 @@
+#include <algorithm>
+#include <cstdio>
+#include <cstring>
+
+using namespace std;
+
+const int N = 1e6 + 5, OO = 0x3f3f3f3f, MOD = 1e9 + 7;
+
+int n, cln, d;
+int dp[N];
+
+int main() {
+  scanf("%d", &n);
+  fill(dp, dp+10, 1);
+  for (int rem = 10; rem <= n; rem++) {
+    cln = rem;
+    dp[rem] = OO;
+    while (cln) {
+      d = cln % 10;
+      cln /= 10;
+      dp[rem] = min(dp[rem], dp[rem - d] + 1);
+    }
+  }
+  printf("%d\n", dp[n]);
+  return 0;
+}

CSES/Dynamic Programming/cses1638.cpp

@@ -0,0 +1,31 @@
+#include <cstdio>
+ 
+using namespace std;
+ 
+const int N = 1e3+3, MOD = 1e9+7;
+ 
+int n;
+char A[N][N];
+int dp[N];
+ 
+int main() {
+    scanf("%d", &n);
+    for (int r = 0; r < n; r++) {
+        scanf("%s", A[r]);
+    }
+    dp[n-1] = (A[n-1][n-1] == '.');
+    for (int r = n-1; ~r; r--) {
+        for (int c = n-1; ~c; c--) {
+            if (A[r][c] != '.') {
+                dp[c] = 0;
+                continue;
+            }
+            dp[c] = (dp[c] + dp[c+1]);
+            if (dp[c] >= MOD) {
+                dp[c] -= MOD;
+            }
+        }
+    }
+    printf("%d\n", dp[0]);
+    return 0;
+}