47int64_t
mincoins(
const T &n,
const std::vector<T> &coins,
const int16_t &t,
56 for (
int i = 0; i < t; i++) {
57 if (n - coins[i] >= 0) {
59 int sub =
mincoins(n - coins[i], coins, t,
dp);
60 ans = std::min(ans, sub + 1);
76 const int64_t n1 = 15;
77 const int8_t t1 = 3, a1 = 0;
78 std::cout <<
"\nTest 1...";
79 std::vector<int64_t> arr1{1, 7, 10};
80 std::vector<int64_t> dp1(n1 + 1);
81 fill(dp1.begin(), dp1.end(), a1);
84 std::cout <<
"Passed\n";
static void test()
Test implementations.
int64_t mincoins(const T &n, const std::vector< T > &coins, const int16_t &t, std::vector< T > dp)
This implementation is for finding minimum number of coins .
std::string fill(char c, int n)
Dynamic Programming algorithms.
Functions for minimum coin exchange problem.