题解 | 最大公因数与最小公倍数

#include <stdio.h>
typedef long long ll;

ll gcd(ll, ll);
ll lcm(ll, ll);

int main(void) {
    ll a, b;
    scanf("%lld%lld", &a, &b);

    gcd(a, b);
    lcm(a, b);

    ll ans1 = gcd(a, b);
    ll ans2 = lcm(a, b);
    printf("%lld %lld", ans1, ans2);
    
    return 0;
}

ll gcd(ll a, ll b){
    while(b != 0){
        ll temp = b;
        b = a % b;
        a = temp;
    }
    return a;
}

ll lcm(ll a, ll b){
    ll sum = (ll)a * b;
    return sum / gcd(a, b);
}