Java 之 辗除法
题目：输入两个正整数m和n，求其最大公约数和最小公倍数。
1.程序分析：利用辗除法。
编程实现：
1 import java.util.*;
2
3 public class MultipleTest{
4 public static void main(String args[]){
5 Scanner scanner = new Scanner(System.in);
6 System.out.println("请输入两个正整数：");
7 System.out.print("第一个数为：");
8 int m = scanner.nextInt();
9 System.out.print("第二个数为：");
10 int n = scanner.nextInt();
11
12 int divisor = getGreatestCommonDivisor(m, n);
13
14 System.out.println("The Greatest Common Divisor:"+divisor);
15 System.out.println("The Lowest Common Multiple:"+m/divisor*n);
16 }
17
18 static int getGreatestCommonDivisor(int m, int n){
19 int r = m%n;
20 while(r!=0){
21 m = n;
22 n = r;
23 r = m%n;
24 }
25 return n;
26 }
27 }
