aoj-0005-GCD_and_LCM.cpp

gistfile1.cpp

#include <iostream>
#include <iomanip>
#include <cstdio>

using namespace std;


int main(void) {
    unsigned long a, b, m, n, tmp, gcd, lcm;

    for(;scanf("%ld %ld", &a, &b) == 2;) {
         m = a;
	 n = b;
	 if(m < n) {
	     tmp = b;
	     b = a;
	     a = tmp;
	 }
	 while(n) {
	     tmp = n;
	     n = m % n;
	     m = tmp;
	 }
	 gcd = m;
	 lcm = (a * b) / gcd;
	 cout << gcd << " " << lcm << endl;
    }    a
    
    return 0;
}