最小公倍数和最大公约数

Description

Input

Output

Sample Input

Sample Output

设两个数是a,b最大公约数是p,最小公倍数是q

那么有这样的关系:ab=pq

#include <stdio.h>
#include <cmath>
using namespace std;
long long gcd(long long a,long long b)
{
return b==0?a:gcd(b,a%b);
}
int main()
{
long long n1,n2;
while(scanf("%lld%lld",&n1,&n2)!=EOF)
{
n1=abs(n1);
n2=abs(n2);
printf("%lld %lld\n",gcd(n1,n2),n1*n2/gcd(n1,n2));
}
return 0;
}