GCD and LCM
Write a program which computes the greatest common divisor (GCD) and the least common multiple (LCM) of given a and b (0 < a, b ≤ 2,000,000,000). You can supporse that LCM(a, b) ≤ 2,000,000,000.
Input
Input consists of several data sets. Each data set contains a and b separated by a single space in a line. The input terminates with EOF.
Output
For each data set, print GCD and LCM separated by a single space in a line.
Sample Input
8 6
50000000 30000000
Output for the Sample Input
2 24
Write a program which computes the greatest common divisor (GCD) and the least common multiple (LCM) of given a and b (0 < a, b ≤ 2,000,000,000). You can supporse that LCM(a, b) ≤ 2,000,000,000.
Input
Input consists of several data sets. Each data set contains a and b separated by a single space in a line. The input terminates with EOF.
Output
For each data set, print GCD and LCM separated by a single space in a line.
Sample Input
8 6
50000000 30000000
Output for the Sample Input
2 24
10000000 150000000
求最大公约数和最小公倍数的。最小公倍数用扩展欧几里得算法求得,最小公倍数用两数乘积除以两数的最大公约数求得
#include <iostream>
#include <cstdio>
using namespace std;
long long int gcd(long long int a,long long int b)
{
if(b==0)
return a;
return gcd(b,a%b);
}
int main(void)
{
long long int a,b;
while(scanf("%lld%lld",&a,&b)!=EOF)
{
printf("%lld %lld\n",gcd(a,b),a/gcd(a,b)*b);
}
return 0;
}