Java基础编程1—最大公约数和最小公倍数

import java.util.Scanner;

/**
 * 输入两个正整数，求其最大公约数和最小公倍数
 * 
 * @author xingyang
 *
 */
public class test16 {

	public static void main(String[] args) {
		int low, high, m;
		Scanner s = new Scanner(System.in);
		System.out.print("输入第一个正整数： ");
		low = s.nextInt();
		System.out.print("输入第二个正整数： ");
		high = s.nextInt();
		m = low * high;
		low = low < high ? low : high;
		high = low < high ? high : low;

		while (low != 0) {
			if (low != high) {
				int k = high % low;
				high = low;
				low = k;
			}
		}
		System.out.println("最大公约数: " + high);
		System.out.println("最小公倍数: " + m / high);
	}
}