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.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.Scanner;
import java.util.Arrays;
import java.util.Collections;

class Main {
    public static void main (String[] args) throws IOException {
        Scanner sc = new Scanner(System.in);
        StringBuilder sb = new StringBuilder("");

        int a, b, r, temp;
        long gcd;

        while (sc.hasNextInt()) {
            a = sc.nextInt();
            b = sc.nextInt();

            gcd = (long) a * (long) b;

            if (a < b) {
                temp = a;
                a = b;
                b = temp;
            }

            do {
                r = a % b;
                a = b;
                b = r;
            } while (b != 0);

            gcd /= a;

            sb.append(a);
            sb.append(' ');
            sb.append(gcd);
            sb.append('\n');
        }

        System.out.print(sb);

    }
}