One algorithm per day: Greatest common divisor and least common multiple to find two numbers

Greatest common divisor and least common multiple to find two numbers

Answer:

When the larger number is divided by the remainder of the smaller number equals 0 o'clock, the smaller number is greatest common divisor.

The result of multiplying the two numbers by their greatest common divisor is least common multiple.

int cdivisor (int x1,int y1) {int r,temp;if (x1<y1) {Temp =x1;x1 = Y1;y1 = temp;} while (X1%Y1)//When the larger number divided by the remainder of the smaller number equals 0 o'clock, the smaller number is greatest common divisor {r=x1%y1;x1=y1;y1=r;} return y1;} int cmultiple (int x2,int y2,int d1) {return x2*y2/d1;//two multiplication result divided by their greatest common divisor to least common multiple}

　　

One algorithm per day: Greatest common divisor and least common multiple to find two numbers