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
理解:一共五个坑位,随机选择两个来放向右走,那就是C52五个里面随机选2
登录 或 注册 后可以参加讨论