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.*;
public class Main {
	static final Scanner stdin = new Scanner(System.in);
	public static void main(String[] args) {
		while(stdin.hasNext()){
			
			int a = stdin.nextInt();
			int b = stdin.nextInt();
      
			int comp_val = a - b;
			int num, aval,m,n,ans1;
			
			if(comp_val > 0){
				for(int i = 0;i <= a;i++){
					aval = a - i;
					if(a%aval==0 && b%aval==0){
						m = a/aval;
						n = b/aval;
						ans1 = m * n * aval;
						System.out.println(aval+" "+ans1);
						
						break;
					}
				}
			}else{
				for(int i = 0;i <= b;i++){
					aval = b - i;
					if(a%aval==0 && b%aval==0){
						m = a/aval;
						n = b/aval;
						ans1 = m * n * aval;
						System.out.println(aval+" "+ans1);
						
						break;
					}
				}
			}
		}
	}

}