DMOJ · dwite09c6p4

Time for Change

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

dwite09c6p4Dynamic programmingC++26 lines
Solution222of 248
Open official problem ↗ Download C++ file ↓ Search the library → Open full Code Lab ↗ Report an issue ↗

Approach

Dynamic programming

Time for Change repeat matches five coin systems and the minimum exact-change coin-count dynamic programming.

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

4_Time_for_change.cpp

C++

    #include <bits/stdc++.h>
    using namespace std;
    using ll = long long;
    using i128 = __int128;
    const int inf = 1e9;
    const ll INF = 1e18; //❄️
    int main() {
        ios::sync_with_stdio(0); cin.tie(0); 
        int t = 5;
        while (t--) {
            int n, m; cin >> n >> m;
            vector<int> coin(m);
            for (int i = 0; i < m; i++) {
                cin >> coin[i];
            }
            vector<int> dp(n + 1, inf);
            dp[0] = 0;
            for (int x : coin) {
                for (int i = x; i <= n; i++) {
                    dp[i] = min(dp[i], dp[i - x] + 1);
                }
            }
            cout << dp[n] << '\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.