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
object Main{
    def main(args:Array[String]):Unit = {
        val scan = new Scanner(System.in)
        var res_gcd = List[Long]()
        var res_lcm = List[Long]()
        var count = 0
        while(scan.hasNextLong()){
            val a = scan.nextLong()
            val b = scan.nextLong()
            res_gcd :+= gcd(a,b)
            res_lcm :+= lcm(a,b)
            count+=1
        }

        for(i <- 0 to count-1) println(s"${res_gcd(i)} ${res_lcm(i)}")

    }

    def gcd(a:Long,b:Long):Long = if(b == 0) a else gcd(b,a%b)
    def lcm(a:Long,b:Long):Long = a*b/gcd(a,b)
}