Unbounded knapsack added

Unbounded Knaspsack Coin Change I Coin Chnage II

Author: amn2

Dynamic Programming/unbounded Knapsack/(1)UnbKp.cpp

@@ -0,0 +1,40 @@
+#include<bits/stdc++.h>
+using namespace std;
+int t[100][100];
+
+// Rod Cutting Problem
+int Unbknapsack(int *wt, int *val, int W, int n) {
+
+for (int i = 0; i <= W; i++) t[0][i] = 0;
+for (int i = 0; i <= n; i++) t[i][0] = 0;
+
+
+for (int i = 1; i <= n; i++) {
+for (int j = 1; j <= W; j++) {
+
+if (wt[i - 1] <= j) {
+t[i][j] = max(val[i - 1] + t[i][j - wt[i - 1]] , t[i - 1][j]);
+}
+else {
+t[i][j] = t[i - 1][j];
+
+}
+}
+
+}
+return t[n][W];
+}
+
+int main() {
+
+#ifndef ONLINE_JUDGE
+freopen("input.txt", "r", stdin);
+freopen("output.txt", "w", stdout);
+#endif
+
+int wt[] = {4, 9, 2, 2};
+int val[] = {1, 2, 5, 4};
+int W = 10;
+int n = sizeof(val) / sizeof(int);
+cout << Unbknapsack(wt, val, W, n) << endl;
+}

Dynamic Programming/unbounded Knapsack/(2)CoinChange1.cpp

@@ -0,0 +1,40 @@
+#include<bits/stdc++.h>
+using namespace std;
+int t[100][100];
+
+// maximum number of ways
+
+int Unbknapsack(int *wt, int W, int n) {
+
+for (int i = 0; i <= W; i++) t[0][i] = 0;
+for (int i = 0; i <= n; i++) t[i][0] = 1;
+
+
+for (int i = 1; i <= n; i++) {
+for (int j = 1; j <= W; j++) {
+
+if (wt[i - 1] <= j) {
+t[i][j] = t[i][j - wt[i - 1]] + t[i - 1][j];
+}
+else {
+t[i][j] = t[i - 1][j];
+
+}
+}
+
+}
+return t[n][W];
+}
+
+int main() {
+
+#ifndef ONLINE_JUDGE
+freopen("input.txt", "r", stdin);
+freopen("output.txt", "w", stdout);
+#endif
+
+int coins[] = {1, 2, 3};
+int W = 5;
+int n = sizeof(coins) / sizeof(int);
+cout << Unbknapsack(coins, W, n) << endl;
+}

Dynamic Programming/unbounded Knapsack/(3)CoinChange2.cpp

@@ -0,0 +1,44 @@
+#include<bits/stdc++.h>
+using namespace std;
+int t[100][100];
+
+// minimum number of coins to make sum
+
+int Unbknapsack(int *wt, int W, int n) {
+
+for (int i = 0; i <= n; i++) t[i][0] = 0;
+for (int i = 0; i <= W; i++) t[0][i] = INT_MAX - 1;
+for (int i = 1; i <= W; i++) {
+if (i % wt[0] == 0) t[1][i] = i / wt[0];
+else t[1][i] = INT_MAX - 1;
+}
+
+for (int i = 2; i <= n; i++) {
+for (int j = 1; j <= W; j++) {
+
+if (wt[i - 1] <= j) {
+t[i][j] = min( 1 + t[i][j - wt[i - 1]] , t[i - 1][j]);
+}
+else {
+t[i][j] = t[i - 1][j];
+}
+}
+
+}
+return t[n][W];
+
+}
+
+int main() {
+
+#ifndef ONLINE_JUDGE
+freopen("input.txt", "r", stdin);
+freopen("output.txt", "w", stdout);
+#endif
+
+int coins[] = {1, 2, 3};
+int W = 5;
+int n = sizeof(coins) / sizeof(int);
+cout << Unbknapsack(coins, W, n) << endl;
+
+}