Tags: 动态规划
A chess rook can move horizontally o r vertically to any square in the same row o r in the same column of a chessboard. Find the number of shortest paths by which a rook can move from one corner of a chessboard to the diagonally opposite corner。
输入
a interger number n is row and column of chessboard. 0 < n <=16
输出
the number of shortest paths.
样例输入
4
样例输出
20
分析
SWUST OJ 之 0577 Shortest path counting
最新推荐文章于 2023-09-10 15:21:43 发布