Scribd Logo
Upload

Welcome to Scribd!

  • Monety V2

    Uploaded by

    tonie jestskam
    0 views1 page
    This C++ code defines functions to count the number of ways to make change for a given amount of money using coins of different values. It takes a vector of coin values as input, sorts them, and calculates the minimum number of the largest coins needed. It then uses dynamic programming to recursively determine the optimal combinations of coins that make up the money amount.

    Original Description:

    Original Title

    monetyV2

    Copyright

    © © All Rights Reserved

    Available Formats

    TXT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This C++ code defines functions to count the number of ways to make change for a given amount of money using coins of different values. It takes a vector of coin values as input, sorts them, and calculates the minimum number of the largest coins needed. It then uses dynamic programming to recursively determine the optimal combinations of coins that make up the money amount.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    0 views1 page

    Monety V2

    Uploaded by

    tonie jestskam
    This C++ code defines functions to count the number of ways to make change for a given amount of money using coins of different values. It takes a vector of coin values as input, sorts them, and calculates the minimum number of the largest coins needed. It then uses dynamic programming to recursively determine the optimal combinations of coins that make up the money amount.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    #include <vector>

    #include <cmath>
    #include <algorithm>
    #include <numeric>

    using namespace std;


    void howChangeNumbers(vector<unsigned int> coins, vector<unsigned int>& Changes)
    {
    for(int i = 2; i < coins.size(); i++)
    {

    }
    }

    unsigned long long countChange(const unsigned int money, const std::vector<unsigned


    int>& coins) {

    if(money == 0) return 1;

    int counter, minNcap = 0;


    vector<unsigned int> workCoins = coins;
    vector<unsigned int> howChange;

    sort(workCoins.begin(), workCoins.end());
    minNcap = floor(money / workCoins[0]);
    howChange.push_back(0);
    howChange.push_back(minNcap);

    if(lcm(workCoins[0], workCoins[1]) <= money) {


    howChange.push_back(1);
    howChange.push_back(lcm(workCoins[0], workCoins[1])/workCoins[1]);
    }
    else {
    howChange.push_back(0);
    };
    howChangeNumbers(workCoins, howChange);

    return counter;
    }

    You might also like