有点问题吧

The statement "Given a point p between 0 and s = a_1+a_2+...a_n, it
has at most (n-1)! ways to reach." looks suspicious. Think about 1,2,3. There are 4 sequences that reaches 3 ([1,2,3],[2,1,3],[3,1,2],[3,2,1]) and 4 > 2!

所有跟帖： 

• 回复：有点问题吧 -botong- ♂ (209 bytes) () 07/27/2009 postreply 11:01:10

• 回复：回复：有点问题吧 -dynamic- ♂ (79 bytes) () 07/27/2009 postreply 18:12:36

• 回复：回复：回复：有点问题吧 -botong- ♂ (91 bytes) () 07/28/2009 postreply 10:22:54