Exact change problem>>

Правка en1, от Vesper_Lynd, 2018-08-19 16:50:37

Source of problem

The problem basically says given N amount of money which has to be given!! we need to find how much minimum coins we can give and the total value of those coins such that the extra amount given is minimum using n given denomination!!

Example:

1400 -> N 3 -> no of denominations 500 1000 2000

Output: 1500 2

My question is what are the overlapping subproblems here!!!

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский Vesper_Lynd 2018-08-19 16:50:37 545 Initial revision (published)