回複：三個特例，包括（難度-低）。望起拋磚引玉之功效。

Let f(m,n) is B's cakes. We can get following recursive
function:
f(m,n)=1/2(1+f(m-1,n)+f(m-1,n-1))
f(m,m)=m/2,f(1,0)=0.
Most recursive
functions can't be simplified,but this can...if you have time.

所有跟帖： 

• i think you are right. -皆兄弟也- ♂ (233 bytes) () 07/13/2010 postreply 10:05:44

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

• 回複：Jin's answer is good enough -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