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 C (judge verdict: Time Limit Exceeded)

#include<stdio.h>
int main(){
  
  int c,d,a,b,i,temp,j;
  
  while(1){
    
    if(scanf("%d %d",&a,&b)==EOF){
      break;
    }
    
    if(b>a){
      temp=a;
      a=b;
      b=temp;
    }
    
    for(i=b;i>0;i--){
      c=a%i;
      d=b%i;
      
      if(c==0 && d==0){
	c=a/i;
	d=b/i;
	temp=c*d*i;
        printf("%d %d\n",i,temp);
	break; 
      }
    }
    
  }
  
  return 0;
}