题解 | #求最小公倍数#

import java.util.*;
public class Main {
    public static void main(String[] args) {
        Scanner sc=new Scanner(System.in);
        int n1 = sc.nextInt();
        int n2 = sc.nextInt();
        int lcm = findLCM(n1, n2);
        System.out.println( lcm);
    }

    public static int findLCM(int a, int b) {//计算最小公倍数
        return (a * b) / findGCD(a, b);
    }

    public static int findGCD(int a, int b) { //计算a和b的最大公约数
        if (b == 0) {
            return a;
        } else {
            return findGCD(b, a % b);
        }
    }
}