On Feb 27, 10:12 pm, [EMAIL PROTECTED] wrote: > On Feb 27, 8:40 pm, Michael Robertson <[EMAIL PROTECTED]> wrote: > > > > > > > Hi, > > > I need a generator which produces all ways to place n indistinguishable > > items into k distinguishable boxes. > > > For n=4, k=3, there are (4+3-1)!/(3-1)!/4! = 15 ways. > > > (0,0,4) > > (0,4,0) > > (4,0,0) > > > (0,2,2) > > (2,0,2) > > (2,2,0) > > > (0,1,3) > > (0,3,1) > > (3,0,1) > > (3,1,0) > > > (1,1,2) > > (1,2,1) > > (2,1,1) > > > The generator needs to be fast and efficient. > > > Thanks. > > Note that the boxes are indistinguishable, and as such, ( 1, 0, 3 ) == > ( 3, 0, 1 ), but != ( 3, 1, 0 ). How so?- Hide quoted text - > > - Show quoted text -
Ah, correction, retracted. -disting-uishable boxes. Copy, but then, where's ( 1, 0, 3 )? -- http://mail.python.org/mailman/listinfo/python-list
