some dp problems

Author: azecoder

Education/DP_Fibonacci.cpp

@@ -0,0 +1,49 @@
+#include <bits/stdc++.h>
+
+#define forr(i,a,b) for(int i=a; i<b; i++)
+#define rfor(i,a,b) for(int i=a-1; i>=b; i--)
+
+#define MX 1e4+5
+
+using namespace std;
+
+typedef long long ll;
+typedef pair<int, int> pii;
+typedef vector<int> vi;
+typedef vector<vi> vvi;
+
+
+vi fArr(40, 0);
+
+int fib(int x) {
+	// Fibonacci number, dp
+	if(x < 2)
+		return x;
+	
+	if(fArr[x])
+		return fArr[x];
+	
+	int val = fib(x-1) + fib(x-2);
+	fArr[x] = val;
+	return val;
+}
+
+void run_case() {
+	//
+    int x;
+	cin >> x;
+    
+    cout << fib(x) << "\n";
+}
+
+
+int main() {
+	//
+    ios::sync_with_stdio(false);
+ 
+    int tests;
+    cin >> tests;
+ 
+    while (tests-- > 0)
+        run_case();
+}

Education/DP_Min_Coin_Change.cpp

@@ -0,0 +1,51 @@
+#include <bits/stdc++.h>
+
+#define forr(i,a,b) for(int i=a; i<b; i++)
+#define rfor(i,a,b) for(int i=a-1; i>=b; i--)
+#define pb push_back
+
+#define MX 1e4+5
+
+using namespace std;
+
+typedef long long ll;
+typedef pair<int, int> pii;
+typedef vector<int> vi;
+typedef vector<vi> vvi;
+
+
+
+void run_case() {
+	//
+    int n, target;
+	cin >> n >> target;
+    
+    vi coins(n);
+    for(int &x: coins)
+		cin >> x;
+	
+	vi dp(target+1, INT_MAX);
+	dp[0] = 0;
+	forr(i, 1, target+1)
+	for(int x: coins)
+		dp[i] = min(dp[i], (i < x ? 0 : dp[i-x]) + 1);
+		
+	//cout << "dp: ";
+	//for(int x: dp)
+		//cout << x << " ";
+	//cout << "\n";
+		
+	cout << dp[target] << "\n";
+}
+
+
+int main() {
+	//
+    ios::sync_with_stdio(false);
+ 
+    int tests;
+    cin >> tests;
+ 
+    while (tests-- > 0)
+        run_case();
+}

Education/DP_Min_Path_Sum.cpp

@@ -0,0 +1,62 @@
+#include <bits/stdc++.h>
+
+#define forr(i,a,b) for(int i=a; i<b; i++)
+#define rfor(i,a,b) for(int i=a-1; i>=b; i--)
+#define pb push_back
+
+#define MX 1e4+5
+
+using namespace std;
+
+typedef long long ll;
+typedef pair<int, int> pii;
+typedef vector<int> vi;
+typedef vector<vi> vvi;
+
+
+
+void run_case() {
+	//
+    int n, m;
+	cin >> n >> m;
+    
+    vvi a;
+    forr(i, 0, n) {
+		vi la(m);
+		forr(j, 0, m)
+			cin >> la[j];
+		a.pb(la);
+	}
+	
+	vvi dp(n, vi(m, 0));
+	dp[0][0] = a[0][0];
+	forr(i, 1, m)
+		dp[0][i] = dp[0][i-1] + a[0][i];
+	forr(i, 1, n)
+		dp[i][0] = dp[i-1][0] + a[i][0];
+	
+	forr(i, 1, n)
+	forr(j, 1, m)
+		dp[i][j] = min(dp[i][j-1], dp[i-1][j]) + a[i][j];
+	
+	cout << "dp\n";
+	for(vi idp: dp) {
+		for(int x: idp)
+			cout << x << " ";
+		cout << "\n";
+	}
+	
+	cout << dp[n-1][m-1] << "\n";
+}
+
+
+int main() {
+	//
+    ios::sync_with_stdio(false);
+ 
+    int tests;
+    cin >> tests;
+ 
+    while (tests-- > 0)
+        run_case();
+}