aoj-0005-GCD_and_LCM-ans.cpp

gistfile1.cpp

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

using namespace std;


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

    for(;scanf("%lld %lld", &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;
    }
    
    return 0;
}