Chapter 1, Problem 11C

Explanation of Solution

Program code:

//include the required header files

#include<cstdlib>

#include<string>

#include<iostream>

//define the function GCD

int GCD(int n, int m)

{

//declare the required variables

int dividend = n;

int divisor = m;

int remainder = 1;

//iterate a while loop

while (remainder > 0)

{

//perform modulus operation on dividend and divisor

remainder = dividend % divisor;

//set the divisor to divident

dividend = divisor;

//set the reminder to divisor

divisor = remainder;

}

//return the value of divident

return dividend;

}

//define main()

int main()

{

//declare an integer variable

int n;

//call the method GCD()

GCD(