OJ Board

the problem:
i have the weight of any number of coins...
i have also the specification of the coins in my currency as... weight and value.
i have to find the minimum possible value with which the weight can be filled...

what do you blv is the fastest way ta do it?

You may cite sample for this problem.

skinnyguy wrote:the problem:
i have the weight of any number of coins...
i have also the specification of the coins in my currency as... weight and value.
i have to find the minimum possible value with which the weight can be filled...

what do you blv is the fastest way ta do it?

If the weights and values are integers, you can use straightforward DP.