Unique Paths

Problem Statement

Unique Paths Problem Description A robot needs to navigate a factory floor. The factory floor is represented as a grid with 'm' rows and 'n' columns. The robot starts at the top-left corner of the grid and needs to reach the bottom-right corner to complete its task. The robot can only move in two directions: right (to the adjacent cell on the right) or down (to the adjacent cell below). Before deciding which path to take to reach its destination, the robot needs to determine how many unique paths are available. Can you help the robot? Given the dimensions of the factory floor with m rows and n columns, write a program to calculate the number of unique paths the robot can take from the top-left corner to the bottom-right corner. Input Format The first line of input will have an integer m representing the number of rows in the factory floor grid. The second line of input will have an integer n representing the number of columns in the factory floor grid. Output Format A single line of ou