In the figure above, X and Y represent locations in a district of a certain city where the streets form a rectangular grid.In traveling only north or east along the streets from X to Y, how many different paths are possible?
720
512
336
256
56
登录 或 注册 后可以参加讨论
从X走到Y一定要走五个横线和三个竖线,A1~A5是横线,B1~B3是竖线,那就一共有8!种组合,又因为A都是一样的,B都是一样的,需要排除重复的组合,所以是8!/(5!3!)=56
从X走到Y一定要走五个横线和三个竖线,A1~A5是横线,B1~B3是竖线,那就一共有8!种组合,又因为A都是一样的,B都是一样的,需要排除重复的组合,所以是8!/(5!3!)=56
登录 或 注册 后可以参加讨论