A75173. GCD+LCM 题解

#include<bits/stdc++.h>
using namespace std;
int gcd, lcm;
int main() {
    int a, b;
    cin >> a >> b;
    for (int i = 1; i <= min(a, b); i++)
        if (a % i == 0 && b % i == 0)
            gcd = i;
    cout << gcd << ' ';
    for (int i = a * b; i >= max(a, b); i--)
        if (i % a == 0 && i % b == 0)
            lcm = i;
    cout << lcm;
    return 0;
}