实现最小公倍数的三种方法

第一种

#include 
int main () {
	int m = 0;
	int  n = 0;
	scanf("%d %d" , &m , &n);
	int  max = m > n ? m : n;
	while (max % n != 0 || max % m != 0) {
		max++;
	}
	printf("%d" , max);
	
	return 0;
}

---

第二种

推荐这种

#include 
int main() {
    int m = 0;
    int n = 0;
    scanf("%d %d" , &m , &n);
    int max = m > n ? m : n;
    int res = max;
    while (res % m != 0 || res % n != 0)
        res += max;
    printf("%d" , res);

    return 0;
}

---

第三种

#include 
int main () {
	long long m = 0;
    long long n = 0;
    scanf("%d %d" , &m , &n);
    long long mul = m * n;
    int r = m % n;
    while (r) {
		m = n;
		n = r;
		r = m % n;
	}
	printf("%d" , mul / n);

	return 0;
}