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{
static int LONGEST=2000000000;
	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Scanner sc= new Scanner(System.in);
		//System.out.print("Input -> ");
		while(sc.hasNext()){
			long a =sc.nextLong();
			long b =sc.nextInt();
			
			//System.out.println("input="+a+" "+b);
			//System.out.println("LCM="+LCM(a,b)+" "+"GCD="+GCD(a,b));
			System.out.println(GCD(a,b)+" "+LCM(a,b));
			//System.out.print("Next Input -> ");
		}
	}
	
	public static long LCM(long a,long b){
		long max=Math.max(a, b),ans=0;
		long min;
		
		if(max==a){
			min=b;
		}else{
			min=a;
		}
		for(long i=1;i<=LONGEST;i++){
			if((max*i)%min==0){
				ans=max*i;
				 break;
			}
		}
		return ans;
	}
	
	public static long GCD(long a,long b){
		long gcd;
		if(b==0){
			gcd=a;
		}else{
			gcd=GCD(b,a%b);
		}
		return gcd;
	}

}