题解 | #求最小公倍数#

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);
    }
// m，n 的最大公倍数 = m * n / gcd(m, n)
    public static int getCM(int m, int n){
        return m * n / gcd(m, n);

    }

  // 辗转相除法求 m，n 的最大公约数
    public static int gcd(int m, int n){
        if (n == 0) return m;
        return gcd(n, m % n);
    }
}