Driver program
| 7 | |
| 8 | // Driver program |
| 9 | void findMin(int V) |
| 10 | { |
| 11 | // Initialize result |
| 12 | vector<int> ans; |
| 13 | |
| 14 | // Traverse through all denomination |
| 15 | for (int i = n - 1; i >= 0; i--) { |
| 16 | // Find denominations |
| 17 | while (V >= deno[i]) { |
| 18 | V -= deno[i]; |
| 19 | ans.push_back(deno[i]); |
| 20 | } |
| 21 | } |
| 22 | |
| 23 | // Print result |
| 24 | for (int i = 0; i < ans.size(); i++) |
| 25 | cout << ans[i] << " "; |
| 26 | } |
| 27 | |
| 28 | // Driver program |
| 29 | int main() |