不同路径

def solve():
    def uniquePaths(____):
        dp = [[____] * n for _ in range(____)]
        for i in range(____, m):
            for j in range(____, n):
                dp[i][j] = dp[i-____][j] + dp[i][j-____]
        return dp[m-____][n-____]
    print(uniquePaths(____, ____))