From 5565beca67266d65b28d0c0ad5d1a06178ede73f Mon Sep 17 00:00:00 2001
From: omagdy7 <omar.professional8777@gmail.com>
Date: Mon, 27 May 2024 16:30:12 +0300
Subject: Solved two dp problems on cses

---
 cses/DynamicProgramming/DiceCombinations/main.cpp | 104 ++++++++++++++++++++++
 1 file changed, 104 insertions(+)
 create mode 100755 cses/DynamicProgramming/DiceCombinations/main.cpp

(limited to 'cses/DynamicProgramming/DiceCombinations/main.cpp')

diff --git a/cses/DynamicProgramming/DiceCombinations/main.cpp b/cses/DynamicProgramming/DiceCombinations/main.cpp
new file mode 100755
index 0000000..392bfe7
--- /dev/null
+++ b/cses/DynamicProgramming/DiceCombinations/main.cpp
@@ -0,0 +1,104 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+using ll = long long;
+using pii = pair<int, int>;
+using vpii = vector<pii>;
+using vi = vector<int>;
+using vll = vector<long long>;
+using mpii = map<int, int>;
+using mpll = map<ll, ll>;
+using db = long double;
+
+#define pb push_back
+#define all(x) (x).begin(), (x).end()
+#define rall(x) (x).rbegin(), (x).rend()
+#define lb lower_bound
+#define ub upper_bound
+#define make_unique(x)                                                         \
+  sort(all((x)));                                                              \
+  (x).resize(unique(all((x))) - (x).begin())
+#define ceil(a, b) ((a) + (b)-1) / (b)
+
+const int mod = (int)1e9 + 7;
+const db pi = acos((db)-1);
+const int dx[4]{1, 0, -1, 0};
+const int dy[4]{0, 1, 0, -1};
+
+#ifdef LOCAL
+#include "debug.h"
+#else
+#define dbg(...) 42
+#endif
+
+/* stuff you should look for:
+  ---------------------------
+   * special cases (n=1?)
+   * int overflow, array bounds
+   * do smth instead of nothing and stay organized
+   * WRITE STUFF DOWN
+   * DON'T GET STUCK ON ONE APPROACH
+ */
+// 5
+// 1 1 1 1 1
+// 2 1 2
+// 1 2 2
+// 2 1 2
+// 2 2 1
+// 1 1 3
+// 3 1 1
+// 1 3 1
+// 3 2
+// 2 3
+// 4 1
+// 1 4
+// 5
+
+// 4
+// 1 1 1 1
+// 2 1 1
+// 1 2 1
+// 3 1
+// 1 1 2
+// 2 2
+// 1 3
+// 4
+
+// 3
+// 1 1 1
+// 2 1
+// 1 2
+// 3
+
+// 2
+// 1 1
+// 2
+
+// 1
+// 1
+//
+
+// 1 2 4 8 13
+//
+
+void solve() {
+  int n;
+  cin >> n;
+  ll sum = 0;
+  vector<ll> dp(n + 1);
+  dp[0] = 1;
+  dp[1] = 1;
+  for (int i = 2; i <= n; i++) {
+    for (int j = 0; j < min(6, i); j++) {
+      dp[i] = (dp[i] + dp[i - j - 1]) % mod;
+    }
+  }
+  cout << dp[n] << '\n';
+}
+
+int main() {
+  ios_base::sync_with_stdio(false);
+  cin.tie(NULL);
+  solve();
+}
-- 
cgit v1.2.3