题解 | #求最小公倍数#

using System;

namespace HJ108
{
    internal class Program
    {
        static void Main(string[] args)
        {
            var strInput = Console.ReadLine();
            string[] strings = strInput.Split();
            uint num01 = uint.Parse(strings[0]);
            uint mum02 = uint.Parse(strings[1]);
            //最小公倍数=两数乘积/两数的最大公约数
            uint mcm = num01 * mum02 / GetGCD(num01, mum02);
            Console.WriteLine(mcm);
        }

        /// <summary> 获取最大公约数</summary>
        static uint GetGCD(uint a, uint b)
        {
            uint max;
            uint min;
            while (true)
            {
                max = a >= b ? a : b;
                min = a <= b ? a : b;
                if (min == 0)
                {
                    return max;
                }
                if (max % min == 0)
                {
                    return min;
                }
                a = max % min;
                b = min;
            }
        }
    }
}