int a = n1;
int b = n2;
while(n2 != 0)
{
rem = n1 % n2;
n1 = n2;
n2 = rem;
}
gcd = n1;
lcm = (a * b) / n1;
// Input:
// Output:
The given code calculates the greatest common divisor (GCD) and least common multiple (LCM) of two numbers, n1 and n2.
The algorithm starts by initializing two variables, 'a' and 'b', with the values of n1 and n2, respectively.
The code then enters a while loop that continues until n2 becomes zero. Inside the loop, the remainder of the division of n1 by n2 is calculated and stored in the variable 'rem'. Then, n1 is updated to hold the value of n2, and n2 is updated to hold the value of 'rem'. This process is repeated until n2 becomes zero.
After the loop terminates, the GCD is determined by the value stored in n1. The GCD represents the largest positive integer that divides both n1 and n2 without leaving a remainder.
Finally, the LCM is calculated using the formula: LCM = (n1 * n2) / GCD. The LCM represents the smallest positive integer that is divisible by both n1 and n2.
It is important to note that the code assumes that the values of n1 and n2 are positive integers. If the input contains negative numbers, additional steps may be required to handle negative values properly.
