2
$\begingroup$

Im trying to split (say) N pink, fluffy balls into M groups as evenly as possible.

Eg: 9 Balls and 4 groups, i'd have a result set of the form: {3,2,2,2}, where each value is indicating the size of each subset.

Can anyone help me understand how to write an equation or algorithm that would solve this problem?

Thanks

$\endgroup$
  • $\begingroup$ Well, you say "divide": so look at division: what information does it tell you? Can you use that to help solve the problem? $\endgroup$ – Hurkyl Sep 20 '12 at 13:09
  • 2
    $\begingroup$ Aside: you probably didn't mean "result set", because "set" is usually used to refer to a collection that doesn't count repetition: the sets {3,2,2,2} and {3,2} are the same. $\endgroup$ – Hurkyl Sep 20 '12 at 13:10
  • $\begingroup$ Ah yes, its flooding back to me now. cheers $\endgroup$ – Larry B Sep 20 '12 at 13:16
2
$\begingroup$

If you are given $N$ and $M,$ you put $\lfloor \frac NM \rfloor+1$ in $N \pmod M$ of the groups and $\lfloor \frac NM \rfloor$ in the rest.

$\endgroup$
  • $\begingroup$ Thanks, was thinking along the lines of this. Think I was going for something like set all to n/m, then a for loop, 1 to (n Mod m) adding one. $\endgroup$ – Larry B Sep 20 '12 at 13:19

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.