GFG-COIN-CHANGE
12 Oct 2021Geeks for Geeks Basic DP problem of coin-change - alternative method of Recursive
#include<bits/stdc++.h>
using namespace std;
int count( int S[], int m, int n ) {
int i, j, x, y;
int table[n + 1][m];
for (i = 0; i < m; i++)
table[0][i] = 1;
for (i = 1; i < n + 1; i++) {
for (j = 0; j < m; j++) {
x = (i-S[j] >= 0) ? table[i - S[j]][j] : 0;
y = (j >= 1) ? table[i][j - 1] : 0;
table[i][j] = x + y;
}
}
return table[n][m - 1];
}
int main() {
int arr[] = {1, 2, 3};
int m = sizeof(arr)/sizeof(arr[0]);
int n = 4;
cout << count(arr, m, n);
return 0;
}