It was 10 years ago. A night just like this one. Winter. Everyone in the house was asleep. Well, Leonardo isn鈥檛 really sleeping right now but you get the idea. I was alone in the kitchen. Alone with the TV, an .avi file and an .srt file. I had just started watching movies in foreign language and during the week I had stumbled upon Old Boy. I wasn鈥檛 really in the mode of staying up late, but something made me. ...
This is a classical problem of Computer Science: it鈥檚 used to study both Greedy and Dynamic Programming algorithmic techniques. I hate having my pocket full of copper!!! -_- Definition Given: A set of n Denominations D[0鈥-1] in ascending order, representing a Monetary Coin System An money amount A, as input calculate a solution: * <strong><code>S[0...n-1]</code></strong>, with <code>0 <= S[i] <= (A/S[i])</code> and <code>0 < i < n-1</code> where: * <strong><code>A = Sum<sub>[i=0 -> n-1]</sub> { D[i] * S[i] }</code></strong> * <strong><code>Min{ Sum<sub>[i=0 -> n-1]</sub> { S[i] } }</code></strong> In other words Find the smallest amount of coins to make the given amount. ...