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

請您先登陸,再發跟帖!

發現Adblock插件

如要繼續瀏覽
請支持本站 請務必在本站關閉/移除任何Adblock

關閉Adblock後 請點擊

請參考如何關閉Adblock/Adblock plus

安裝Adblock plus用戶請點擊瀏覽器圖標
選擇“Disable on www.wenxuecity.com”

安裝Adblock用戶請點擊圖標
選擇“don't run on pages on this domain”