Go: package main

import "fmt"

func main() {
	var gcdArr, lcmArr [50]int
	var count int
	for {
		var x, y int
		fmt.Scanf("%d %d", &x, &y)
		if count == 51 {
			break
		}
		if x < y {
			rep := x
			x, y = y, rep
		}
		gcd := x % y
		lcm := x * y
		for gcd != 0 {
			x, y, gcd = y, gcd, x%y
		}
		gcdArr[count] = y
		lcmArr[count] = lcm / y
		count++
	}
	for i := 0; i < count; i++ {
		fmt.Printf("%d %d\n", gcdArr[i], lcmArr[i])
	}
}

C++: #include <iostream>

using namespace std;

int main() {
    int a,b,big,small,r;

    while(1){
        cin >> a >> b;
        if(cin.eof()){
            break;
        }
        
        if(a > b){
            big = a;
            small = b;
        }
        else {
            big = b;
            small = a;
        }
        
        r = big % small;
        while(r != 0){
            big = small;
            small = r;
            r = big % small;
        }
        
    cout << small << ' ' << (a / small) * (b / small) * small << endl;
    
    }

    return 0;
}

C++: #include <iostream>
int gcd(int a, int b)
{
  while (1) {
    if (b == 0) {
      return a;
    }
    int temp = b;
    b = a % b;
    a = temp;
  }
}

int lcm(int a, int b)
{
  return a / gcd(a, b) * b;
}

int main()
{
  int a, b;
  while (std::cin >> a >> b) {
    std::cout << gcd(a, b) << " " << lcm(a, b) << std::endl;
  }
  return 0;
}

C++: #include <iostream>
#include <cmath>

using namespace std;

int rez(int64_t a, int64_t b)
{
   if(b == 0)return a;
   else
   return rez(b, a%b);
}

int main()
{
    while(x != -1)
{
   int a, b;
   cin >> a >> b;
   cout << rez(a, b) << (a*b)/rez(a, b) << endl;
}


}

C++: #include <cstdio>

using namespace std;

#define max( x, y ) ( ( x > y ) ? x : y )
#define min( x, y ) ( ( x < y ) ? x : y )

int main()
{
	char buf[1024];
	int a, b;

	while ( fgets( buf, sizeof( buf ) - 1, stdin ) != NULL && buf[0] != '\n' )
	{
		sscanf( buf, "%d %d", &a, &b );

		for ( int i = min( a, b ); 1 < i; i-- )
		{
			if ( !( a % i ) && !( b % i ) )
			{
				printf("%d ", i );
				break;
			}
		}

		for ( int i = min( a, b ) * 2; i <= 2000000000; i++ )
		{
			if ( !( i % a ) && !( i % b ) )
			{
				printf("%d\n", i );
				break;
			}
		}
	}

	return 0;
}

C++: #include <iostream>
#include <vector>
#include <cstdio>
#include <algorithm>
using namespace std;

int main(){
	int a,b;
	while(cin >> a >> b){
		cout << __gcd(a,b) << " " << a/__gcd(a,b)*b << endl;
	}
}

C++: #include <iostream>

using namespace std;

long gcd(long a, long b)
{
  long m, n;
  if (a > b) {
    m = a;
    n = b;
  } else {
    m = b;
    n = a;
  }

  long tmp;
  while (n != 0) {
    tmp = n;
    n = m % n;
    m = tmp;
  }

  return m;
}

long lcm(long a, long b, long _gcd = -1)
{
  if (_gcd == -1) {
    _gcd = gcd(a, b);
  }
  
  return a * (b / _gcd);
}

int main(int argc, char const* argv[])
{
  long a, b, _gcd, _lcd;
  while (cin >> a >> b) {
    _gcd = gcd(a, b);
    _lcd = lcm(a, b, _gcd);
    cout << _gcd << " " << _lcd << endl;
  }
  return 0;
}

C++: #include<cstdio>
#include<algorithm>
#include<iostream>
#include<cstring>
#include<string>
#include<algorithm>
using namespace std;
long  yaku,bai,a,b;
long long  fe;

int GCD(int x,int y){
  if(y==0){
    return x;
  }
  else{    
    return GCD(y,x%y);
  }
}
int main(){
  for(;cin>>a;){
    cin>>b;
    if(a>b){
      yaku=GCD(a,b);
    }
    else{
      yaku=GCD(b,a);
    }
    fe = a*b;
    cout<<yaku<<" "<<fe/yaku<<endl;
  }
}

C++: #include<cstdio>

int main(){
	long long a,b,g,l,t;
	while(scanf("%lld %lld", &a, &b) + 1){
		if(a > b){
			t = a;
			a = b;
			b = t;
		}

		if(b % a){
			t = a / 2;
			l = 1;
			for(int i = 2; i <= t; i++){
				if(!(a % i)){
					g = a / i;
					if(!(b % g)){
						printf("%lld %lld\n", g, a * b / g);
						i += t;
						l = 0;
					}
				}
			}
			if(l){
				printf("1 %lld\n", a * b);
			}

		}else{
			printf("%lld %lld\n", a, b);
		}
	}
	return 0;
}

C++: #include <iostream>
using namespace std;
int main(){
	unsigned long long a,b,c;
	while(cin>>a>>b){
		c=a*b;
		if(a==b){
			cout<<a<<" "<<b<<endl;
		}else{
			while(!(a==0 || b==0)){
				if(a>b){
					a-=b;
				}else{
					b-=a;
				}
			}
			cout<<((a==0)?b:a)<<" "<<c/((a==0)?b:a)<<endl;
		}
	}
	return 0;
}

C++: #include <iostream>

typedef unsigned int ui;

void swap(ui & a, ui & b)
{
	unsigned int tmp = a;
	a = b;
	b = tmp;
}

ui gcd(ui a, ui b)
{
	if (a < b) swap(a, b);

	ui c = a % b;
	while (c != 0) {
		a = b;
		b = c;
		c = a % b;
	}

	return b;
}

ui lcm(ui a, ui b, ui gcd)
{
	a /= gcd;
	b /= gcd;
	return a * b * gcd;
}

int main() {
	using namespace std;

	ui a, b;
	while (cin >> a >> b) {
		const ui GCD = gcd(a, b);
		cout << GCD << ' ' << lcm(a, b, GCD) << endl;
	}
	return 0;
}

C++: #include <iostream>
#include <sstream>
#include <string>
#include <cmath>
#include <cstdio>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <functional>
#include <numeric>

using namespace std;
typedef unsigned int uint;
typedef long long ll;
typedef unsigned long long ull;

#define REP(i,n) for(int i = 0; i < (int)(n); ++i)
#define FOR(i,a,b) for(int i = (a); i < (int)(b); ++i)
#define ALL(c) (c).begin(), (c).end()
#define SIZE(v) ((int)v.size())

#define pb push_back
#define mp make_pair

ll gcd(ll a, ll b)
{
    while(1)
    {
        if (a == 0) return b;
        b %= a;
        if (b == 0) return a;
        a %= b;
    }
}

ll lcm(ll a, ll b)
{
    ll temp = gcd(a, b);
    return temp ? (a / temp * b) : 0;
}

int main(void)
{
    cin.sync_with_stdio(false);
    int a, b;
    while(cin >> a >> b){
        cout << gcd(a,b) << " " << lcm(a,b) << endl;
    }
    
    return 0;
}

C++: #include <iostream>
using namespace std;

int main(void){
    long long a,b,c,d,x,ans01,ans02;
    int count;
    while(std::cin >> a >> b && count <= 50){
        if(b > a){
           x = a;
           a = b;
           b = x;
        }
        c = a % b;
        d = b % c;
        if(d == 0) {
            ans01 = c;
            ans02 = a * b / c;
        }
        else if (c % d == 0) {
            ans01 = d;
            ans02 = a * b / d;
        }
        std::cout << ans01 << " " << ans02 << std::endl;
        count ++;
    }
    return 0;
}

C++: /*
P135
AOJ 0005 GCD and LCM
*/

#include <iostream>
#include <map>
#include <set>
#include <algorithm>
#include <cstdio>
#include <queue>
#include <functional>
#include <string.h>
#include <cmath>

using namespace std;

int gcd(int a, int b)
{
    while(b){
        int c = a % b;
        a = b;
        b = c;
    }
    return a;
}

int main()
{
    int a, b;
    long long mul;
    while(cin>>a>>b){
        mul = a * (long long)b;
        int g = gcd(a, b);
        cout << g << " " << mul / g << endl;
    }
}

C++: #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <utility>
using namespace std;
int gcd (int a , int b){
    if(a<b)
        swap(a,b);
    return b==0 ? a:gcd(b,a%b);
}
int lcm (int a , int b){
    return a/gcd(a,b)*b;
}
int main (){
    int a = 0;
    int b = 0;
    while (scanf("%d%d",&a,&b)!=EOF&&(a>0&&b>0&&a<=2000000000&&b<=2000000000)&&lcm(a,b)<=2000000000)
        cout<<gcd(a,b)<<' '<<lcm(a,b)<<endl;
    return 0;
}

C++: #include <iostream>
#include <cstdio>
using namespace std;

int gcd(int a, int b) {
   
     int p,q,r;
     if(a<b){p=b;b=a;a=p;}
    while(r!=0){
    q=b/a;
    r=b%a;
    b=a;
    a=r;
    }
    return b;
}

int main(void){
   int a, b;
   while(cin >> a >> b) {
     int lcm = a/gcd(a,b)*b;
     cout << gcd(a,b) << " " << lcm << endl;
   }
   return 0;
}