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.*;
class Main{
  public static void main(String[] a){
    String b =" ";
    String c =" ";
    Scanner k = new Scanner( System.in);
    try{
      while(k.hasNextLine()){
        String line = k.nextLine();
        StringTokenizer st = new StringTokenizer(line);
        int count=0;
        while(st.hasMoreTokens()){
          if(count==1){
            c=st.nextToken();
          }
          if(count==0){
            b = st.nextToken();
            count++;
          }
        }
        long dividend=0;
        long divisor=0;
        long remainder=1;
        long i = Long.parseLong(b);
        long j = Long.parseLong(c);
        if(i>j){
          dividend = i;
          divisor = j;
        }else{
          dividend = j;
          divisor = i;
        }
        while(remainder!=0){         
          remainder = dividend%divisor;
          dividend = divisor;
          
          if(remainder==0){
            break;
          }else{
            divisor = remainder;
          }
        }
        long lcm = (i*j)/divisor;
        System.out.println(divisor+" "+lcm);
        
      }
      
    }finally{
      k.close();
    }
  }
}