Maximum common divisor and minimum common multiple, and minimum common multiple

Maximum common divisor and minimum common multiple, and minimum common multiple
Minimum Public multiple Algorithm

Least common multiple = the product of two integers; maximum common number

Algorithm for Finding the maximum common approx.

Phase Division

There are two integers a and B:
① A % B get the remainder c
② If c = 0, B is the maximum common divisor of two numbers.
③ If c = 0, a = B, B = c, and then go back to execute ①

# Include <iostream> # include <cmath> using namespace std; const float EPS = 0.00001; int bei (int a, int B); int yue (int a, int B ); int main () {int a, B; while (cin> a> B) {cout <bei (a, B) <endl ;}} int bei (int a, int B) {return a * B/yue (a, B);} int yue (int a, int B) {int n = a % B; while (n) {a = B; B = n; n = a % B;} return B ;}