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 Scala (judge verdict: Accepted)

import java.util.Scanner

import scala.collection.mutable.ListBuffer

object Main {
  def main(args : Array[String]) = {
    val scanner = new Scanner(System.in)
    val inputs = ListBuffer.empty[Array[Int]]
    while(scanner.hasNextLine) {
      inputs += scanner.nextLine().split(" ").map(_.toInt)
    }


    inputs.foreach {
      input =>
      var divisor = 1 :: Nil
      var i = 2
      while (i <= input.min) {
        if (input(0) % i == 0 && input(1) % i == 0) {
          divisor = i :: divisor
          input(0) = input(0) / i
          input(1) = input(1) / i
          i = 2
        } else {
          i = i + 1
        }
      }

      val maxDivisor = divisor.product
      val minMultiple = maxDivisor * input.product

      println(s"$maxDivisor $minMultiple")
    }
  }
}