View Code of Problem 59

#include <iostream>
#include <queue>
using namespace std;
int gcd(int a,int b){
	if(b==0){
		return a;
	}
	else {
		return gcd(b,a%b);
	}
}
int main(){
	int a,b;
	cin>>a>>b;
	if(a<b){
		swap(a,b);
	}
	cout<<(a*b)/gcd(a,b)<<" ";
	cout<<gcd(a,b);
}

Double click to view unformatted code.


Back to problem 59