Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
	"strings"
)

var sc = bufio.NewScanner(os.Stdin)
var out = bufio.NewWriter(os.Stdout)

func main() {
	sc.Split(bufio.ScanLines)
	defer out.Flush()

	for sc.Scan() {
		x, y := nextInts()
		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
		}
		fmt.Fprintf(out, "%d %d\n", y, lcm/y)
	}

}

func nextInts() (a, b int) {
	s := strings.Split(sc.Text(), " ")
	ra, _ := strconv.Atoi(s[0])
	rb, _ := strconv.Atoi(s[1])
	a = ra
	b = rb
	return
}

C++: #include<iostream>
#include<algorithm>
using namespace std;
int main() {
	int a, b;
	while (cin >> a >> b){
		int gcd;
		int aa = max(a, b);
		int bb = min(a, b);
		while (true){
			if (aa % bb == 0) {
				gcd = bb;
				cout << gcd << ' ';
				goto C;
			}
			else{
				int tmp = aa - bb;
				aa = bb;
				bb = tmp;
			}
		}
	C:
		cout << a*b / gcd << endl;
	}
}

C++: #include<cstdio>
int g(int a,int b){return b?g(b,a%b):a;}
main(){int a,b;while(~scanf("%d%d",&a,&b))printf("%d %d\n",g(a,b),a/g(a,b)*b);}

C++: #include<iostream>
#include<algorithm>
#include<cstdio>
using namespace std;
int main(){
	long long a,b;
	while(cin>>a>>b){
	long long ta=a,tb=b;
	long long s=0,m=0;
	if(a<b)swap(a,b);
	while(true){
		int tmp=a;
		a=b;
		b=tmp%a;
		if(a%b==0){
			m=b;
			break;
		}
		if(a<b){
		//cout<<a<<" "<<b<<endl;
		m=1;
		break;
		}
	}
		s=(ta*tb)/m;
		cout<<m<<" "<<s<<endl;
	}
}

C++: #include<stdio.h>
#include<math.h>
 
int main(){
    unsigned int a,b;
    while(~scanf("%u%u",&a,&b)){
        unsigned int c=a,d=b;
        while(a>0&&b>0){
            if(a>b)a=a%b;
            else b=b%a;
        }
        printf("%u %u\n",a+b,c/(a+b)*d);
    }
}

C++: #include <iostream>

using namespace std;

void solve(long long a, long long b) {
	long long num = a * b;
	while (a != b) {
		if (a > b) {
			a -= b;
		}else if(b > a){
			b -= a;
		}

		if (a == b) {
			break;
		}
	}
	cout << a << " " << num / a << endl;
}

int main() {
	long long a, b;
	while (cin >> a >> b) {
		solve(a, b);
	}
	return 0;
}

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

int euclid(int, int);
int multiple(int, int);

int main(void){
  int a, b;
  while(cin >> a >> b){
    cout << euclid(a, b) << " " << multiple(a, b) << endl;
  }
  return 0;
}

int euclid(int a, int b){
  int r;
  r = a % b;
  while(r!=0){
    a = b;
    b = r;
    r = a % b;
  }

  return b;
}

int multiple(int a, int b){
  int xa = a;
  int xb = b;
  while(xa != xb){
    if(xa < xb) xa += a;
    else xb += b;
  }

  return xa;
}

C++: #include <stdio.h>

int main (void){
	int a, b, i, j, breeeeak, c;
	while(scanf("%d%d", &a, &b)!=EOF){
		breeeeak=0;
		for(i=2;;i++){
			for(j=2;;j++){
				if(i*a<j*b){
					break;
				}
				if(i*a==j*b){
					breeeeak=1;
					c=i*a;
					break;
				}
			}
			if(breeeeak){break;}
		}
		
		printf("%d %d\n", a*b/c, c);
	}
	return 0;
}

C++: #include<iostream>
#include<algorithm>
using namespace std;
int gcdfunk(long long int, long long int);

int main(){
  long long int a, b;
  int gcd[50], lcm[50];
  int i=0;
  while(1){
    cin >> a >> b;
    if(cin.eof()){
      break;
    }
    gcd[i]= gcdfunk(a, b);
    lcm[i]= (a*b)/ gcdfunk(a,b);
    i++;
  }
  for(int j=0;j<i;j++){
    cout << gcd[j] << " " << lcm[j] << endl;
  }
  return 0;
}

int gcdfunk(long long int x, long long int y){
  int z, work=0;
  if(x<y){
    work=x;
    x=y;
    y=work;
  }
  while(1){
    z=x%y;
    if(z==0){
      break;
    }else{
      x=y;
      y=z;
    }
  }
  return y;
}

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

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

int main(){
    int A,B;
	cin>>A>>B;
	printf("%d %d\n",gcd(A,B),A*B/gcd(A,B));
    return 0;
}

C++: 
#include <cstdio>

using namespace std;

long long gcd(long long a, long long b)
{
	if (a<b) {
		long long tmp = a; a = b; b = tmp;
	}
	long long tmp;
	while (b!=0) {
		tmp = b;
		b = a%b;
		a = tmp;
	}
	return a;
}


int main()
{
	//freopen("in.txt", "r", stdin);

	long long a, b;

	while (scanf("%lld%lld", &a, &b)==2) {
		long long v1 = gcd(a, b);
		long long v2 = a*b/v1;

		printf("%lld %lld\n", v1, v2);

	}

	return 0;
}

C++: /* 2012-07-08T09:04:13 */
#define DEBUG_ON
#define CONDITION true
using namespace std;/*{{{*/

#include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <sys/time.h>
#include <vector>

#define INF (1e9)
static const double PI (3.14159265358979323846);
static const double EPS (1e-10);

typedef long long int ll;
typedef unsigned long long int ull;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef complex<double> P;

inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
inline double now(){ struct timeval tv; gettimeofday(&tv, NULL); return ((double)(tv.tv_sec) + (double)(tv.tv_usec) * 1e-6); }

#define FOR(i, b, e) for (typeof(b) i = (b); assert((i) <= (e)), i != (e); ++i)
#define REP(i, n) FOR(i, 0, n)

#define IFC(c) if(c) continue;
#define IFB(c) if(c) break;
#define IFR(c, r) if(c) return r;

#define OPOVER(_op, _type) inline bool operator _op (const _type &t) const

#define arrsz(a) ( sizeof(a) / sizeof(a[0]) )

#define F first
#define S second
#define MP(a, b) make_pair(a, b)

#define SZ(a) ((ll)a.size())
#define PB(e) push_back(e)
#define SORT(v) sort((v).begin(), (v).end())
#define RSORT(v) sort((v).rbegin(), (v).rend())

#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define EACH(c,it) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define EXIST(s,e) ((s).find(e)!=(s).end())

#define BIT(n) (1ULL << (n))
#define BITOF(n, m) ((n) >> (m) & 1)

#define RANGE(a, b, c) ((a) <= (b) && (b) <= (c))

#ifdef DEBUG_ON
#define dprt(fmt, ...) if (CONDITION) fprintf(stderr, fmt, __VA_ARGS__)
#define darr(a) if (CONDITION) copy( (a), (a) + arrsz(a), ostream_iterator<int>(cerr, " ") ); cerr << endl
#define darr_range(a, f, t) if (CONDITION) copy( (a) + (f), (a) + (t), ostream_iterator<int>(cerr, " ") ); cerr << endl
#define dvec(v) if (CONDITION) copy( ALL(v), ostream_iterator<int>(cerr, " ") ); cerr << endl
#define darr2(a, n, m) if (CONDITION) FOR(i, 0, (n)){ darr_range( (a)[i], 0, (m) ); }
#define dvec2(v) if (CONDITION) FOR(i, 0, SZ(v)){ dvec( (v)[i] ); }
#define WAIT() if (CONDITION) { string _wait_; cerr << "(hit return to continue)" << endl; getline(cin, _wait_); }
#else
#define cerr if(0) cerr
#define dprt(fmt, ...)
#define darr(a)
#define darr_range(a, f, t)
#define dvec(v)
#define darr2(a, n, m)
#define dvec2(v)
#define WAIT()
#endif
/*}}}*/

ll lcm(ll a, ll b)
{
	if (a == 0 || b == 0) {
		return 0;
	}
	if (a < b) {
		swap(a, b);
	}
	ll am = a, bm = b;
	while (true) {
		if (am == bm) {
			return am;
		}
		if (bm > am) {
			swap(a, b);
			swap(am, bm);
		}
		bm += b;
	}
}

ll gcd(ll a, ll b)
{
	if (a == 0 || b == 0) {
		return 0;
	}
	if (a < b) {
		swap(a, b);
	}
	while (true) {
		if (a % b == 0) {
			return b;
		}
		ll buf = a;
		a = b;
		b = buf % b;
	}
}

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

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

int gcd(int a, int b){
  if(b==0)
    return a;

  return gcd(b, a%b);
}

int main(){
  while(true){
    int a, b;
    cin >> a >> b;

    if(cin.eof())
      break;

    int g = gcd(a, b);
    cout << g << ' ' << a/g*b << endl;
  }

  return 0;
}