C language to find the least common multiple

Through the brute force method and the euclidean division method, you can find the least common multiple in C language. Detailed introduction: 1. Brute force method, define a variable `lcm`, initialize it to the larger of the two integers, use a loop, start from `lcm`, and increment the value of `lcm` each time. In the loop, Check whether `lcm` can be divided by two integers at the same time. If so, `lcm` is the least common multiple and exit the loop. If the least common multiple is not found after the loop ends, it means that the two integers have no common multiple and a specific value can be returned. to express; 2. Euclidean division, etc.