DMOJ · cchange

Coin Change

This C++ solution uses dynamic programming for DMOJ cchange Coin Change. Read the reasoning, inspect the code, or try your own test case below.

cchangeDynamic programmingC++27 lines
Solution046of 248
Open official problem ↗ Download C++ file ↓ Search the library → Open full Code Lab ↗ Report an issue ↗

Approach

Dynamic programming

Coin Change asks for the minimum number of supplied coin denominations summing to the target; the code implements the standard unbounded DP.

Dynamic programming

Problem and code

Useful links.

Written by benbenyaojifen. Try the problem first, then compare your approach with the code.

Open official problem ↗View exact source file ↗
Implementation

coin_change.cpp

C++

    #include <bits/stdc++.h>
     
    using namespace std;
     
    int main(){
        ios::sync_with_stdio(0);
        cin.tie(0);
        int x, n;
        cin >> x >> n;
        vector<int> coin;
        for(int i = 0; i < n; i++){
            int c;
            cin >> c;
            coin.push_back(c);
        }
        vector<int> dp(x + 1, 0x3f3f3f3f);
        dp[0] = 0;
        for(int i = 1; i < dp.size(); i++){
            for(int c : coin){
                if(c <= i){
                    dp[i] = min(dp[i], dp[i - c] + 1);
                }
            }
        }
        cout << dp[x] << '\n';
        return 0;
    }
        

Did this explanation save you time? I'm a Grade 11 student building this free library to make difficult algorithms easier to understand.

Buy me a coffee ↗Keep studying →

Test this problem

Run your code here.

Paste your code, run a test case, compare the output, or trace selected values.

Full trace, comparison & stress testing ↗
StatusReady
Output
No run yet.
Diagnostics
No diagnostics yet.

Each run is isolated and has strict limits. Passing one test does not guarantee the judge will accept the solution.