The basic idea of Euclid's algorithm is to divide a larger number by a smaller number, take the obtained remainder as a new dividend and the original divisor as a new divisor, and continue the same operation until the remainder is 0, at which time the final divisor is the least common multiple.
Exhaustion is to enumerate all positive integers less than or equal to the product of two numbers and judge whether the integer can be divisible by two numbers. If divisible, the integer is the least common multiple. Although this method is simple and easy to understand, it is inefficient in large numbers.
The realization steps of finding the least common multiple of two numbers: define two variables and store the input two numbers respectively. Using Euclid algorithm, divide and take the remainder of two numbers until the remainder is 0. The remainder obtained each time is a factor of the least common multiple. Multiply all the obtained factors to get the least common multiple.
Application of least common multiple in c language;
1, calendar calculation: The least common multiple is very important when calculating the calendar. For example, finding the last day of a month in a year, or calculating how many weeks there are in a month, all need to use the least common multiple.
2. Time unit conversion: In time unit conversion, the least common multiple can help us find the equivalent relationship between two different units of time. For example, to convert seconds into hours, minutes and seconds, or to convert minutes into hours, minutes and seconds, you need to use the least common multiple.
3. Calculate periodic events: When dealing with periodic events (such as timers), the least common multiple can help us determine when an event will occur. For example, if an event happens every 30 seconds, we need to find out how often (in seconds) it will happen. This time is the least common multiple of 30 and 1, which is 60 seconds.
4. Project or project scheduling: In project or project scheduling, the least common multiple can help us find the most suitable start time. For example, if we have a project that needs to be completed by multiple teams, and the work cycle of each team is known, then we can use the least common multiple to determine the best start time to ensure that all teams can finish their work at the same time.