title: Dynamic programming: find the subset with product of all members is equals to given number
body: <p>I will find an algorithm for this problem.</p>
  
  <blockquote>
    <p>Input: array of n integers and number k</p>
    
    <p>We must find a set of numbers from array, that product of all this numbers in set equals to k is</p>
  </blockquote>
  
  <p>I think, I must use dynamic programming for this task. But I have no idea, how to use it.</p>