Assume A and B are non-zero positive integers. The following code segment
while (A != B){
if (A > B)
A -= B ;
else
B -= A ;
}
count <<A; //printing the volume of A

A

Computes the LCM of two numbers

B

Divides the larger number by the smaller number

C

Computes the GCD of two numbers

D

Finds the smaller of two numbers