title: Dynamic programming problems
body: <p>I'm looking for some pointers about a dynamic programming problem. I cannot find any relevant information about how to solve this kind of problem. The only kind of problem I know how to solve using dynamic programming is when I have two sequences and create a matrix of those sequences. But I don't see how I can apply that to the following problem...</p>
  
  <p>If I have a set A = {7,11,33,71,111} and a number B. Then C which is a subset of A, contains the elements from A which builds the sum B.</p>
  
  <p>EXAMPLE:</p>
  
  <pre><code>A = {7,11,33,71,111}
  If B = 18, then C = {7,11} (because 7+11 = 18)
  
  If B = 3, then there is no solution
  </code></pre>
  
  <p>Thankful for any help here, I just don't know how to think when solving these kind of problems. I cannot find any general method either, only some examples on gene sequences and stuff like that.</p>