送交者: clriufs3 于 October 02, 2006 13:20:22:

回答: 没步骤,不给分儿:-)) --谢谢参与:-) 由 一默 于 September 30, 2006 19:33:25:

I think xiaosha was solving the modified problem proposed by mengdong where each candy is
different and each child is different.

then if all four children line up, and each candy picks a child in turn. then we have 4^17.

• No, sorry:-)) - 一默 (214 bytes) 15:37:34 10/02/06 (0)

加跟贴