AOJ 0005 求最大公约数和最小公倍数

GCD and LCM

Time Limit : 1 sec, Memory Limit : 65536 KB 
Japanese version is here

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
10000000 150000000

思路：先求最大公约数  然后根据最大公约数 和最小公倍数的关系求解

最大公约数的求法：

int gcd(int a, int b)
{
    if(b == 0)
          return a;
     else  return gcd(b, a%b);
}

源代码 ：

#include<iostream>
using namespace std;

int gcd(int a, int b)
{
    int r;
    while(b)
    {
        int r = a%b;
        a = b;
        b = r;
    }
    return a;
}
int main()
{
     //输入两个数求其最大公约数和最小公倍数
    int a, b;
    while(cin>>a>>b)
    {
        int ans = gcd(a, b);
        cout<<ans<<" "<<(a/ans)*b<<endl;
    }
    return 0;
}