TOM will from intersection X to intersection Y along a route that is confined to the square grid of four streets and three avennues shown in the map above. How many routes from X or Y can Tom take that have the minimum possible length.
Ok, there are five step to the destiny, three ||| and to__ __. so 5 elements to 排列 it is P(55), but ||| are same, then divied by P(33), two __ __ are same ,then divided by P(22),
finally the answer is P(55)/P(22)/P(33)=10.
Make sense?作者: kitten369 时间: 2003-1-5 01:40
[此贴子已经被作者于2003-1-5 1:40:26编辑过]
作者: 卧室春竹 时间: 2003-1-5 19:10
呵呵
不如直接数数吧!作者: kitten369 时间: 2003-1-6 01:12
if it is 5条横线,3条竖线, you still could get the answer by 直接数?作者: 卧室春竹 时间: 2003-1-6 18:18
哦.
呵呵...我相信ets得智商...
欢迎光临 国际顶尖MBA申请交流平台--TOPWAY MBA (http://forum.topway.org/)