求最大公约数及最小公倍数

<pre name="code" class="javascript">import java.util.*;public class GcdAndLcmDemo {public static void main(String[] args) {//  题目：输入两个正整数m和n，求其最大公约数和最小公倍数。 Scanner sc = new Scanner(System.in);System.out.print("请输入m的值：");int m = sc.nextInt();System.out.print("请输入n的值：");int n = sc.nextInt();int a = 0, b = 0;for (int i = 1; i <= m / 2 && i <= n / 2; i++) {if (m % i == 0 && n % i == 0) {b = i;}}for (int i = 1; i <= m * n; i++) {if (i % m == 0 && i % n == 0) {a = i;break;}}System.out.print(m + "和" + n + "的最小公倍数为：" + a + "，它们的最大公约数为：" + b + "。");}}