C Algorithm for Finding the maximum common divisor and the minimum common multiple

C Algorithm for Finding the maximum common divisor and the minimum common multiple

The algorithm process is as follows: premise: set two numbers to a, B to set a to divisor, B to divisor, and temp to remainder.

1. place large numbers in a and decimal places in B;

2. Calculate the remainder of a/B;

3. If temp = 0, B is the maximum common divisor;

4. If temp! = 0, the value of B is given to the value of a and temp to B;

5. Return step 2;

# Include

 
  
# Include

  
   
Void main () {int divisor (int a, int B); int multiple (int a, int B); printf ("The highest common divisor is % d \ n ", divisor (15,9); printf ("The lowest common multiple is % d \ n", multiple (15,9);} int divisor (int a, int B) {int temp; if (