回复：有点问题吧

来源: botong 于 2009-07-27 11:01:10 [] [博客] [旧帖] [给我悄悄话] 阅读数 : (209 bytes)
本帖于 2009-07-28 16:38:03 时间, 由普通用户 康MM 编辑
回答: Problem 6 由 botong 于 2009-07-24 10:32:52

Don't count the way beyond the point. Actually,
The statement should be:

Given a point p between 0 and s = a_1+a_2+...a_n, it
has at most (n-1)! + 1 ways to reach

Sorry for any confusion.

所有跟帖： 

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

• 回复：回复：回复：有点问题吧 -botong- ♂ 给 botong 发送悄悄话 botong 的博客首页 (91 bytes) () 07/28/2009 postreply 10:22:54

请您先登陆，再发跟帖！