575. Bruno's Path
Bruno is a robot positioned on a grid with m rows and n columns. The robot starts at the top-left corner of the grid (grid) and aims to reach the bottom-right corner (grid[m - 1][n - 1]). The robot can only move downwards or to the right at any given time. Given the integers m and n, determine the number of unique paths that Bruno can take to reach the bottom-right corner. The test cases are designed so that the answer will not exceed 2 * 10^9.
The first line contains the number of rows (m) in the grid. The second line contains the number of columns (n) in the grid.
Print the number of unique paths.
1 <= m, n <= 100