Correct. Its a variant of Knapsack problem. Anuj Agarwal
Engineering is the art of making what you want from things you can get. On Mon, May 16, 2011 at 4:53 PM, anshu mishra <anshumishra6...@gmail.com>wrote: > its DP problem can be solved in O(m*n) > where m is number of elements in array and n is value of the given number. > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algogeeks@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
