最大公约数和最小公倍数

package repeat_job1;

public class Gcd_Lcm {
	public Gcd_Lcm(){}
	public static int gcd(int m,int n)
	{
		while(m%n!=0)
		{
			int a=n;
			n=m%n;
			m=a;
		}
		return n;	
	}
	public static int lcm(int m,int n)
	{
		return m*n/gcd(m,n);
	}

}

import repeat_job1.Gcd_Lcm;
import java.util.Scanner;
public class Test1 {
	public static void main(String[] args)
	{
		Scanner reader=new Scanner(System.in);
		System.out.println("请输入m,n:");
		int m=reader.nextInt();
		int n=reader.nextInt();
		reader.close();
		System.out.println("最大公约数："+Gcd_Lcm.gcd(m,n)+" "+"最小公倍数："+Gcd_Lcm.lcm(m,n));
	}

}