i think you are right.

来源: 皆兄弟也 于 2010-07-13 10:05:44 [] [博客] [旧帖] [给我悄悄话] 阅读数 : (233 bytes)

I have got the recursive functions as well as the direct functions in two specific cases: n=1 and n=m-1. I will post the result soon after checking correctness.

But the direct functions in general case have not been found yet.

所有跟帖： 

• Jin's answer is good enough -guest007- ♀ 给 guest007 发送悄悄话 (458 bytes) () 07/13/2010 postreply 12:57:50

• 回复：Jin's answer is good enough -jinjing- ♀ 给 jinjing 发送悄悄话 (7 bytes) () 07/15/2010 postreply 19:41:39

• 回复：Jin's answer is good enough -一川烟雨- ♀ 给 一川烟雨 发送悄悄话 (73 bytes) () 07/16/2010 postreply 14:57:24

• 之后。A先切，然后B决定是否使用优先权。使用，则拿大块，但失去一次优先权。 -皆兄弟也- ♂ 给 皆兄弟也 发送悄悄话 皆兄弟也 的博客首页 (0 bytes) () 07/16/2010 postreply 19:50:22

请您先登陆，再发跟帖！