Skip to content
Skein

unique grid paths

RU: число уникальных путей в сетке

The classic 2D DP that counts routes from the top-left to the bottom-right of a grid moving only right or down: dp[i][j] = dp[i-1][j] + dp[i][j-1], with the first row and column all 1.

shortcutsexpand
search
⌘K
prev piece
k
next piece
j
cycle tier
t
this menu
?