import java.util.Scanner;publicclassTestDemo1{publicstaticvoidmain(String[] args){
Scanner scan =newScanner(System.in);int a = scan.nextInt();int b = scan.nextInt();int tmp = a*b /gcd(a,b);
System.out.println(tmp);}publicstaticintgcd(int a,int b){while(b !=0){int tmp = a % b;
a = b;
b = tmp;}return a;}}
2. 程序思想方法
隐藏信息:最小公倍数肯定大于等于俩个数之间的最大值
import java.util.Scanner;publicclassTestDemo1{publicstaticvoidmain(String[] args){
Scanner scan =newScanner(System.in);int a = scan.nextInt();int b = scan.nextInt();int max = a > b ? a : b;while(max >0){if(max % a ==0&& max % b ==0){break;}
max++;}
System.out.println(max);}}
最小公倍数1.先求最大公约数,然后a*b/最大公约数import java.util.Scanner;public class TestDemo1 { public static void main(String[] args) { Scanner scan = new Scanner(System.in); int a = scan.nextInt(); int b = scan.nextInt(); int tmp = a*b