JAVA程序设计（自主模式）-最大公约数和最小公倍数

版权声明：文章都是原创，转载请注明~~~~ https://blog.csdn.net/SourDumplings/article/details/88934267

最大公约数和最小公倍数

输入两个正整数m和n，求其最大公约数和最小公倍数
输入
34 8
输出
2 136

Java：

import java.util.Scanner;

public class Main
{

	public static void main(String[] args)
	{
		// TODO Auto-generated method stub
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int m = sc.nextInt();
		sc.close();
		int g = TwoNum.gcd(n, m);
		System.out.println(g + " " + TwoNum.lcm(n, m, g));
	}

}

class TwoNum
{
	public static int gcd(int n, int m)
	{
		int r = n % m;
		while (r != 0)
		{
			n = m;
			m = r;
			r = n % m;
		}
		return m;
	}

	public static int lcm(int n, int m, int gcd)
	{
		return gcd * (n / gcd) * (m / gcd);
	}
}