Robo Race

Problem Statement

Robo Race There is a robot race which two robots named Robotop and Robocop are going to run. Both robots will begin from the same starting point on a circular track. The race starts at time T = 0 seconds. Robotop starts the race at T = X th second and takes exactly N seconds to complete one lap, while Robocop starts the race at T = Y th second and takes exactly M seconds to complete one lap. Your task is to find and return an integer value representing the least time T (in seconds) at which these two robots meet each other again at the starting point. Note: Assume N and M to be co-prime positive integers. Co-prime numbers are those numbers that have only 1 as common factor, e.g. 3 and 5 are co-prime numbers. The time is only considered in seconds. A lap is defined as a complete trip around a race track that is repeated several times during a competition. Input Format input1 : An integer value X, representing the time at which Robotop starts the race. input2 : An integer value N, repres