[理工] 離散數學棋盤走訪(PIE)
(0,0)->(7,4) 可走(x,y)->(x+1,y) or (x,y)->(x,y+1)
若不可經過(0,1), (1,2), (2,3) or (3,4) 任一點
我用PIE算出 159
請問有沒有比較快的看法?
--
※ 發信站: 批踢踢實業坊(ptt.cc), 來自: 49.158.67.140
※ 文章網址: https://www.ptt.cc/bbs/Grad-ProbAsk/M.1421558767.A.4F4.html
→
01/18 18:55, , 1F
01/18 18:55, 1F
→
01/18 19:02, , 2F
01/18 19:02, 2F
→
01/18 19:03, , 3F
01/18 19:03, 3F
推
01/18 19:25, , 4F
01/18 19:25, 4F
→
01/18 20:23, , 5F
01/18 20:23, 5F
→
01/18 20:56, , 6F
01/18 20:56, 6F
→
01/18 20:58, , 7F
01/18 20:58, 7F
→
01/18 21:13, , 8F
01/18 21:13, 8F
→
01/18 23:26, , 9F
01/18 23:26, 9F