[理工] [離散]-路徑問題
從(0,0) 到 (6,4)有多少種走法
只能往右走R:(x,y)→(X+1,Y) 和 往上走u:(x,y)→(x,y+1)
使得過程中U的數量不多於R的方法數?
解答是給 (10取3) - (10取2)
請問這是怎麼來的? 煩請高手教一下
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 122.117.206.69
推
12/23 23:15, , 1F
12/23 23:15, 1F
→
12/23 23:22, , 2F
12/23 23:22, 2F
→
12/23 23:23, , 3F
12/23 23:23, 3F
推
12/24 01:47, , 4F
12/24 01:47, 4F
推
12/24 02:01, , 5F
12/24 02:01, 5F
→
12/24 02:02, , 6F
12/24 02:02, 6F
→
12/24 08:53, , 7F
12/24 08:53, 7F
→
12/24 08:53, , 8F
12/24 08:53, 8F
→
12/24 08:54, , 9F
12/24 08:54, 9F
→
12/24 08:55, , 10F
12/24 08:55, 10F
→
12/24 12:39, , 11F
12/24 12:39, 11F
→
12/24 12:45, , 12F
12/24 12:45, 12F
→
12/24 13:48, , 13F
12/24 13:48, 13F
→
12/24 18:15, , 14F
12/24 18:15, 14F