Money

This is a classical problem of Computer Science: it’s 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…n-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 &lt;= S[i] &lt;= (A/S[i])</code> and <code>0 &lt; i &lt; n-1</code> where: * <strong><code>A = Sum_{[i=0 -> n-1]} { D[i] * S[i] }</code></strong> * <strong><code>Min{ Sum_{[i=0 -> n-1]} { S[i] } }</code></strong> In other words Find the smallest amount of coins to make the given amount. ...

How can I say it without being unpolite with M$? … I simply can’t! [Original Source: melablog.it]