yes clasic DP
On Wed, May 29, 2013 at 8:54 PM, Ravi Ranjan <[email protected]>wrote: > @DAve > > any proper reason or link to proof that at least twice can be solved using > greedy but others are not?? > > > On Tue, May 28, 2013 at 12:41 PM, Shashwat Kumar < > [email protected]> wrote: > >> This seems to be Coin Change problem. Just google that. >> >> >> On Tue, May 28, 2013 at 12:42 AM, Adolfo Ccanto <[email protected]>wrote: >> >>> Can you write the constraints for this problem? >>> thanks. >>> Adolfo >>> >>> >>> 2013/5/18 rahul sharma <[email protected]> >>> >>>> Minimum of coins to sum s >>>> >>>> -- >>>> You received this message because you are subscribed to the Google >>>> Groups "Algorithm Geeks" group. >>>> To unsubscribe from this group and stop receiving emails from it, send >>>> an email to [email protected]. >>>> >>>> >>>> >>> >>> -- >>> You received this message because you are subscribed to the Google >>> Groups "Algorithm Geeks" group. >>> To unsubscribe from this group and stop receiving emails from it, send >>> an email to [email protected]. >>> >>> >>> >> >> >> >> -- >> Shashwat Kumar >> Third year Undergraduate student >> Department of Computer Science and Engineering >> IIT Kharagpur >> >> >> >> >> -- >> You received this message because you are subscribed to the Google Groups >> "Algorithm Geeks" group. >> To unsubscribe from this group and stop receiving emails from it, send an >> email to [email protected]. >> >> >> > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To unsubscribe from this group and stop receiving emails from it, send an > email to [email protected]. > > > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected].
