Maximum common divisor of two positive integers-(0)

Principle:

1. Compare the size of two numbers. Divide the large number by the decimal number, and a remainder is obtained;
2. Use the decimal number as the previous large number, and the remainder as the previous decimal number. Repeat the first step;
3. When the remainder is 0, the remainder we get is their maximum common number.

# Include
Main ()
{
Int u, v, r;
Cout <"Enter two positive integers :";
Cin> m> n;
If (m> n)
U = m;
Else
V = n;
If (u * v! = 0)
{
While (r = u % v)
{
U = v;
V = r;
}
Cout <"The gcd is:" <
}
Else cout <"Divided by zero! "<
}