Place n indistinguishable items into k distinguishable boxes

[castironpi at gmail.com]

On Feb 27, 10:49 pm, Michael Robertson <mcrobert... at hotmail.com>
wrote:
> castiro... at gmail.com wrote the following on 02/27/2008 08:46 PM:
>
> > Just sort the list in text-ascending order, and it's pretty clear.
>
> Indeed.  After trying Mark's solution, I saw that it sorted in a very
> nice manner.

You could also make it half-way through, then reverse it.