aoj 0005 GCD and LCM

Posted 8023spz

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了aoj 0005 GCD and LCM相关的知识,希望对你有一定的参考价值。

Write a program which computes the greatest common divisor (GCD) and the least common multiple (LCM) of given a and b.

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.

Constraints

  • 0 < a, b ≤ 2,000,000,000
  • LCM(a, b) ≤ 2,000,000,000
  • The number of data sets ≤ 50

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
辗转相除法求最大公约数,然后最小公倍数就是a * b / 最大公约数。
代码:
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#define Max 1001
using namespace std;
typedef long long LL;
LL gcd(LL a,LL b) {
    if(b == 0)return a;
    return gcd(b,a % b);
}
LL lcm(LL a,LL b) {
    return a / gcd(a,b) * b;
}
int main(){
    LL a,b;
    while(~scanf("%lld%lld",&a,&b)) {
        printf("%lld %lld
",gcd(a,b),lcm(a,b));
    }
    return 0;
}

 

以上是关于aoj 0005 GCD and LCM的主要内容,如果未能解决你的问题,请参考以下文章

[HDU 5382] GCD?LCM!

HDU 4497 GCD and LCM

51NOD 2026:Gcd and Lcm——题解

hdu4497-GCD and LCM-(欧拉筛+唯一分解定理+组合数)

HDU 4497 GCD and LCM (分解质因数)

GCD与LCM