简单排列组合：n个人住N间房，每间房足以容纳n个人，有多少种住法？

两个不同的条件：
1）考虑不同人的区别；
2）对所有人一视同仁。

所有跟帖： 

• 1）考虑不同人的区别； -皆兄弟也- ♂ (0 bytes) () 06/14/2010 postreply 08:57:20

• 回复：N^n -Blue_Diamond- ♂ (0 bytes) () 06/14/2010 postreply 22:18:40

• 对！谢谢！每个人都可选N个房中的任何一个，n个人就有N^n住法。 -皆兄弟也- ♂ (0 bytes) () 06/15/2010 postreply 12:28:39

• 2）对所有人一视同仁。 -皆兄弟也- ♂ (0 bytes) () 06/14/2010 postreply 08:57:48

• 回复：C(N+n-1,n) -Blue_Diamond- ♂ (60 bytes) () 06/14/2010 postreply 22:23:33

• 对！此题有点挑战性。请解释下您的答案：C(N+n-1,n) -皆兄弟也- ♂ (0 bytes) () 06/15/2010 postreply 12:32:08

• Blue too busy, I try... -jinjing- ♀ (296 bytes) () 06/16/2010 postreply 20:58:07

• Thanks for your try..., but hard to follow -皆兄弟也- ♂ (0 bytes) () 06/17/2010 postreply 06:59:23

• 解释：|OOO|OOOOOOOOOO|O||OOOOO|.....|OOO|||O|OOOOOOOOO|O| -皆兄弟也- ♂ (555 bytes) () 06/17/2010 postreply 07:43:19

• 回复：解释：|OOO|OOOOOOOOOO|O||OOOOO|.....|OOO|||O|OOOOOOOOO|O| -jinjing- ♀ (43 bytes) () 06/17/2010 postreply 08:30:56

• m people and n rooms: C(m+n-1,m), instead of C(m+n-1,n). -皆兄弟也- ♂ (28 bytes) () 06/17/2010 postreply 10:00:40

• I'm sorry,I think n=N,at first. -jinjing- ♀ (0 bytes) () 06/17/2010 postreply 15:08:21

• 回复：解释：|OOO|OOOOOOOOOO|O||OOOOO|.....|OOO|||O|OOOOOOOOO|O| -jinjing- ♀ (289 bytes) () 06/17/2010 postreply 08:53:58

• sorry, not smart enough. -皆兄弟也- ♂ (264 bytes) () 06/17/2010 postreply 10:15:10

• 回复：sorry, not smart enough. -Jinjing- ♀ (869 bytes) () 06/17/2010 postreply 15:03:30

• should be 1111---41,43,34,14 . -jinjing- ♀ (0 bytes) () 06/17/2010 postreply 16:17:14

• it seems i have understood you. you may have solved the problem -皆兄弟也- ♂ (192 bytes) () 06/17/2010 postreply 10:48:31