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: Wrong Answer)


import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class Main {

  public static void main(String[] args) throws IOException {
    BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));

    String readStr;
    while ((readStr = reader.readLine()) != null) {
      long l = Integer.parseInt(readStr.split(" ")[0]);
      long r = Integer.parseInt(readStr.split(" ")[1]);
      
      System.out.println(gcd(l, r) + " " + lcm(l, r));
    }

  }

  public static long gcd(long m, long n) {
    if (m < n)
      return gcd(n, m);

    long temp;
    while (m % n != 0) {
      temp = m;
      n = m % n;
      m = temp;
    }
    return n;
  }

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