Problem:
GCD and LCM

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

Solution in JAVA (judge verdict: Accepted)

import java.util.Scanner;

public class Main {

	public static Scanner scanner = new Scanner(System.in);

	public static void main(String[] args) {

		while (scanner.hasNext()) {

			long tempA = input();
			long tempB = input();

			long a;
			long b;
			long r;
			long lcm;

			if (tempB <= tempA) {

				a = tempA;
				b = tempB;

			} else {

				a = tempB;
				b = tempA;

			}

			while ((r = a % b) != 0) {

				a = b;
				b = r;

			}

			lcm = tempA * tempB / b;

			System.out.print(b);
			System.out.print(" ");
			System.out.println(lcm);

		}

		close();

	}

	public static long input() {

		return scanner.nextLong();

	}

	public static void close() {

		if (scanner != null) {

			scanner.close();

		}
	}
}