Find the greatest common divisor of two integers

Question

What will be an ideal response?

Answer 1

```
{
int n1;
int n2;
int divisor;
int dividend;
int remainder;
cout << "Enter integer 1: ";
cin << n1;
cout << "Enter integer 2: ";
cin << n2;
divisor = abs( n1 );
dividend = abs( n2 );
for ( remainder = dividend % divisor;
remainder != 0;
remainder = dividend % divisor) {
dividend = divisor;
divisor = remainder;
}
cout << "The GCD is: " << divisor << endl;
return 0;
}
```