Question

5.6. Write a program to accept any two numbers and display the ‘GCD' of them.
The GCD (Greatest Common Divisor) of two integers is calculated by continued
division method. Divide the larger number by the smaller, the remainder then
divides the previous divisor. The process is repeated till the remainder is zero.
The divisor then results the GCD.
Sample Input: 25
kame
35
Sample Output: GCD of the numbers 25 and 35 is 5.​

Answer 1

Answer:

which language bro you want the answer