Run ID 作者 问题 语言 测评结果 Time Memory 代码长度 提交时间
68098 标准课程 找路径 Python3 Wrong Answer 27 MS 3760 KB 251 2024-03-19 14:56:49

Tests(0/4):

Code:

def uniquePaths(m, n): dp = [[1]*n for _ in range(m)] for i in range(1, m): for j in range(1, n): dp[i][j] = dp[i-1][j] + dp[i][j-1] return dp[-1][-1] m, n = map(int, input().split()) print(uniquePaths(m, n))

Run Info:

------Input------

20 20

------Answer-----

985525432

------Your output-----

35345263800