题解 | #求最小公倍数#

import java.util.Scanner; 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){

    //write your code here......
    int t = 0;
    for(t = m;;t--)          //先用穷举法求出最大公约数
    {
        if(m%t == 0 && n%t == 0)
            break;
    }
    return m*n/t;           //最小公倍数 = 两数之积/最大公约数
}

}