最小公倍数与最大公约数`
include<iostream>
include<algorithm>
using namespace std;
void a()
{
unsigned long long a,b,c,m,n; cin >> a >> b;
m = a; n = b;
if(a < b) swap(a,b);
while(b != 0)
{
c = a % b;
a = b;
b = c;
}
cout << a << endl;
lcd(m,n,a);
}
unsigned long long lcd(unsigned long long x,unsigned long long y,unsigned long long z)
{
cout << x*y/z << endl;
}
void b()
{
unsigned long long a,b,c,m,n; cin >> a >> b;
m = a; n = b;
if(a < b) swap(a,b);
while(a != b)
{
c = a - b;
if(b > c)
{
a = b;
b = c;
}
else
a = c;
}
cout << a << endl;
}
void c()
{
unsigned long long a,b,c; cin >> a >> b;
c = min(a,b);
for(;;c--)
if(a % c == 0 && b % c == 0)
break;
cout << c << endl;
}
int main()
{
a();
return 0;
}