题解 | #求最小公倍数#

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner console = new Scanner(System.in);
        int m = console.nextInt();
        int n = console.nextInt();
        int result = getCM(m, n);
        System.out.println(result);
    }

    public static int getCM(int m, int n){

        int sum = m*n;
        if(m < n)m = m + n - (n = m);   //确定大小，交换位置
        while(m % n != 0)       //辗转相除找最大公约数
        {
            m = m + n - (n = m);
            n = n % m;
        }
        return sum/n;   //m*n/最大公约数为最大公倍数
    }
}