Pat will walk from intersection X to intersection Y along a route that is confined to the square grid of four streets and three avenues shown in the map above. How many routes from X to Y can Pat take that have the minimum possible length?
Six
Eight
Ten
Fourteen
Sixteen
右2步,上3步。堪称5个要素的排列组合,就是5!/(2!*3!)
同类题型同理
登录 或 注册 后可以参加讨论