import java.util.Scanner;
class ForTest2 {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.println("请输入两个正整数");
int m = scanner.nextInt();
int n = scanner.nextInt();
//获取m和n中的较小值
int min = (m < n) ? m : n;
//最大公约数
//方式1:
int result = 1;
for (int i = 1; i <= min; i++) {
if (m % i == 0 && n % i == 0) {
result = i;
}
}
System.out.println(result);
//方式2:推荐
for (int i = min; i >= 1; i--) {
if (m % i == 0 && n % i == 0) {
System.out.println("最大公约数为:" + i);
break;//一旦执行,就跳出当前循环结构
}
}
//最小公倍数
int max = (m > n) ? m : n;
for (int i = max; i <= m * n; i++) {
if (i % m == 0 && i % n == 0) {
System.out.println("最小公倍数为:" + i);
break;
}
}
}
}