题目要求
输入两个数字,求他们的最小公倍数
由于两个数的乘积等于这两个数的最大公约数与最小公倍数的积。即 a×b = 最大公约数×最小公倍数。所以,求两个数的最小公倍数,就可以先求出它们的最大公约数,然后用上述公式求出它们的最小公倍数
牛客原题
https://www.nowcoder.com/practice/feb002886427421cb1ad3690f03c4242
实现代码
//格式1
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner s = new Scanner(System.in);
int a = s.nextInt();
int b = s.nextInt();
int c = a % b;
//考虑到a和b的取值如果过大,比如都是50000,则相乘会超出范围,所以强转为long提升范围
long d = (long)a * (long)b;
while (c != 0) {
a = b;
b = c;
c = a % b;
}
System.out.println(d/b);
}
}
//格式2
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner s = new Scanner(System.in);
int a = s.nextInt();
int b = s.nextInt();
int c = b;//如果a%b==0,则最大公约数是b
long d = (long)a * (long)b;
while(a%b!=0){
c = a % b;
a = b;
b = c;
}
System.out.println(d/c);
}
}
输出结果
12 28
84
50000 50000
50000
觉得写得不错的话点个赞呗😊