for the given criteria,surely K should be equal to one,so distribute the candies in each box to each student...
On Mon, May 2, 2011 at 9:06 AM, tillegomezz <[email protected]> wrote: > I have "n" boxes each with "m" candys, I want distributed these candys > among "k" students > > what is the best way for distribute them such that > > 1. All students get equal number of candies. > > 2. All the candies which a student get must be from a single box only. > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]. > 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 [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
