最大公约数(gcd)和最小公倍数(lcm)

求最大公约数(gcd)：辗转相除法

求最小公倍数(lcm)：a*b/gcd(a,b)        (在代码中也可以这样写  a/gcd(a,b)*b ,这样是为了避免数越界 )

 

附上一道水题的代码：

 

Gdufe_2018_Summer I (D)

Write a program which computes the greatest common divisor (GCD) and the least common multiple (LCM) of given a and b.

Input

Input consists of several data sets. Each data set contains a and b separated by a single space in a line. The input terminates with EOF.

Constraints

• 0 < a, b ≤ 2,000,000,000
• LCM(a, b) ≤ 2,000,000,000
• The number of data sets ≤ 50

Output

For each data set, print GCD and LCM separated by a single space in a line.

Sample Input

8 6
50000000 30000000

Output for the Sample Input

2 24
10000000 150000000

---

题解：直接求两个数的gcd和lcm

import java.util.Scanner;

public class Main {
	static Scanner scan = new Scanner(System.in);
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		while(scan.hasNext()){
			int a = scan.nextInt();
			int b = scan.nextInt();
			System.out.print(gcd(a,b));
			System.out.println(" "+lcm(a,b));
			
		}
	}
	private static int gcd(int a,int b) {
		// TODO Auto-generated method stub
		if(b==0)
			return a;
		else
			return gcd(b,a%b);
	}
	private static int lcm(int a,int b)
	{
		return a/gcd(a,b)*b;
	}

}