机器人绕开坏格子
A robot goes from (0, 0) to (3, 3), moving one square right or up each step. Square (1, 1) is broken and cannot be used. How many routes are there? If the target were (n, n) with many broken squares, how would you get a computer to count?
机器人从方格 (0, 0) 出发走到 (3, 3),每步只能向右或向上一格。格子 (1, 1) 坏了不能经过。有多少条路线?如果终点是 (n, n)、坏格子很多,你会怎么让计算机来数?
Frontier ACE 模拟练习4 步提示 + 答案
- 1先数全部6 步里选 3 步向右:C(6, 3) = 20 条。
