This is a C++ implementation of coin cashier machine algorithm to return minimum number of coins that add up to the total denomination given.
The goal in this problem is to find the minimum number of coins needed to change the input value (an integer) into coins with denominations 1, 5, and 10.
Constraints. 1 ≤ 𝑚 ≤ 103.