A447.最大公约数和最小公倍数

#include<iostream>
using namespace std;
int gcd(int a,int b){
	while(a%b){
		int t=a;
		a=b%a;
		b=t;
	}
	return b;
}
int lcm(int a,int b){
	return (a*b/gcd(a,b));
}
int main(){
	int a,b;
	cin>>a>>b;
	cout<<"GCD="<<gcd(a,b)<<endl<<"LCM="<<lcm(a,b);
	return 0;
}