Difficulty while constructing solution in DP

Revision en3, by hulk_baba, 2016-12-29 04:26:30

Please look at problem here. I figured out how to do it: 1. I will check among all possible quasibinary numbers which provides me least numbers of such numbers whose sum is equal to n(the given number) 2. I memoize the solution. Basic DP stuff. 3. In all my tests I got correct answer for number of numbers but I can't construct the solution i.e actual numbers which form the solution. Can you help me with this.

I have submitted my solution here

Tags #dp, constructive algorithms

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en3 English hulk_baba 2016-12-29 04:26:30 15
en2 English hulk_baba 2016-12-29 04:12:00 6
en1 English hulk_baba 2016-12-29 04:11:07 610 Initial revision (published)