package com.zmj.nineNine;

import java.util.Scanner;

public class NineXNine {

    /**
     * 使用辗转相除法求得最大公因数
     * 两个数相乘，结果除以最大公因数 得到的就是最小公倍数
     * @param args
     */
     public static void main(String []args){
          Scanner s=new Scanner(System.in);
          System.out.println("请输入两个正整数：");
          int m = 0,n = 0;
          try {
              m=s.nextInt();
              n=s.nextInt();
        } catch (Exception e) {
            System.out.println("您输入的不适整数，请重新输入：");
            m=s.nextInt();
            n=s.nextInt();
        }finally{
            NineXNine.result(m,n);//调用方法
        }     
    }

     public static void result(int m1, int n1) {
         int temp = 0;
         //先存值
         int m2 = m1,n2 = n1;
            if (m1 <= n1) {
                temp = m1;
                m1 = n1;
                n1 = temp;
            }
            //先求最大公因数
            while (n1 != 0) {
                int rem = m1 % n1;
                m1 = n1;
                n1 = rem;
            }
            System.out.println("两数的最大公因数是："+m1);
            System.out.println("两数的最小公倍数是："+(m2*n2)/m1);
        }
 }