7-88 1028 最小公倍数和最大公约数

#include <algorithm>
#include <cmath>
#include <cstdint>
#include <iomanip>
#include <iostream>
#include <limits>
#include <numeric>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>

using i32 = std::int32_t;
using i64 = std::int64_t;
using u32 = std::uint32_t;
using u64 = std::uint64_t;
using pii = std::pair<i32, i32>;
using pll = std::pair<i64, i64>;
using vi = std::vector<i32>;
using vll = std::vector<i64>;
using vpii = std::vector<pii>;
using vpll = std::vector<pll>;

void solve();

int main()
{
    std::cin.tie(nullptr)->sync_with_stdio(false);
    solve();
}

void solve()
{
    i32 n, m;
    bool endl = false;
    while (std::cin >> n >> m)
    {
        if (endl)
        {
            std::cout << std::endl;
        }
        std::cout << "The lowest common multiple of " << n << " and " << m << " is " << std::lcm(n, m) << ".\n";
        std::cout << "The greatest common divisor of " << n << " and " << m << " is " << std::gcd(n, m) << ".\n";
        endl = true;
    }
}

换行典中典，nt判定。