The main difference between the standard CC algo, and the one with limited
coin supply is the maximum value that we can form with the given coins.
For example :
In stranded CC
coins[] = {1,2,3}
then we can can form denominations to any value(assuming that coin with 1
value will always be the
I hope this will help you
http://community.topcoder.com/tc?module=Static&d1=tutorials&d2=dynProg
On Thursday, November 15, 2012 4:01:02 PM UTC+5:30, Sarath wrote:
>
> Are there any good resources to understand Dynamic programming and also
> looking for some good problem and step by step solution
