题解 | #求最小公倍数#辗转相除法求gcd

import java.util.Scanner;

// 注意类名必须为 Main, 不要有任何 package xxx 信息
public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int m = in.nextInt();
        System.out.println((n*m)/gcd(n,m));
    }
    static int gcd(int n,int m){
        /**
            7 5 2 
            5 2 1
            2 1 0
            
         */
        if(m > n){
            return gcd(m,n);
        }else{
            
            int r = n%m;
            while(r != 0){
                n = m ;
                m = r;
                r = n%m;
            }
            return m;
        }
    }
}