greatest common divisor c++ can not use modelus can not use divison only subtraction

ll uluL using repeated subtraction. Prompt the user for the dividend and divisor. For this lab, a and remainder in the form accept only positive integers for both the dividend and the divisor. Display the quotient Dividend Quotient Divisor if no remainder or Dividend Quotient Divisor + Remainder if there is a remainder 2 Greatest Common Divisor in mathematics, the Euclidean algorithm, or Euclid's algorihm, is an efficient method for computing the greatest common divisar (GCD) of two numbers, the largest the ancient Greek mathematician Eucid, who first described it in Euclid's Elements (c. 300 BC). It is an example number that divides both of thern without leaving a remainder It is named after g a calculation according to well defined rules, and is one of the oldest of an algorthm. a step by -step procedure for erformin algorithms in common use. It can be used to reduce fractions to their simplest form, and is a part of many other number theoretic and cryptographic calculations (fom wikipedia org The Euclidean Algorithm for finding GCD(A B) is as follows (from khanacadamy org lf A-0 then GCD(AB)-B since the GCD(0 B)-8, and we can stop . If B 0 then GCD(ABFA since the GCD(AO)-A and we can stop Write A in quotient remainder form (A B-Q R) Find GCD(B,R) using the Euclidean Algorithm since GCD(A B) GCD(B.R) Consider the following example finding the GCD of 270 and 192 Find the GCD(270,192) = A 270, B-192 . Use long division to find that 270/1921 with a remainder of 78, we can write this as: 270-192-1 + 78 . Now find the GCD of 192 and 78 since GCD(270 192) GCDI(192,78) " A#0 .A 192 8 78 - Use long division to find that 192/78 2 with a remainder of 36. We can write this as 192 78 2 36 . Find GCD(78.36), since GCD(192.78) GCD(78,36) A:78, B 36 nis hed