题解 | #求最小公倍数#

lcm = n*m/gcd(n,m)

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        while (sc.hasNext()) {
            int first = sc.nextInt(), second = sc.nextInt();
            System.out.println(first/gcd(first, second)*second);
        }
    }

    private static int gcd(int first, int second) {
        if (first > second) {// ensure first <= second
            first ^= second;
            second ^= first;
            first ^= second;
        }

        if (second % first == 0) {
            return first;
        }
        return gcd(second % first, first);
    }
}