Open 24/7/365. Never a waiting line! Login and vote now.
By meera1224
via linkmingle.com
Submitted: Jul 04 2008 / 05:50
Java Code Snippet for Solving the DP Coinage problem.
Given N coins of values val[0],val[1]...val[N-1] and a sum S. Find the minumum number of coins which can form Sum S. You can use same denominations more than once.
Add your comment
