C Exercises: Determine the LCM of two numbers
C For Loop: Exercise-45 with Solution
Write a program in C to find the LCM of any two numbers.
Visual Presentation:

Sample Solution:
C Code:
#include <stdio.h> // Include the standard input/output header file.
void main()
{
int i, n1, n2, max, lcm = 1; // Declare variables to store input and results.
printf("\n\n LCM of two numbers:\n "); // Print a message.
printf("----------------------\n"); // Print a separator.
printf("Input 1st number for LCM: "); // Prompt the user for input.
scanf("%d", &n1); // Read the first number from the user.
printf("Input 2nd number for LCM: "); // Prompt the user for input.
scanf("%d", &n2); // Read the second number from the user.
max = (n1 > n2) ? n1 : n2; // Determine the larger of the two numbers.
// Loop to find the least common multiple (LCM).
for (i = max; ; i += max)
{
if (i % n1 == 0 && i % n2 == 0)
{
lcm = i; // Update the LCM whenever a common multiple is found.
break; // Exit the loop once LCM is found.
}
}
// Print the result.
printf("\nLCM of %d and %d = %d\n\n", n1, n2, lcm);
}
Sample Output:
LCM of two numbers: ---------------------- Input 1st number for LCM: 15 Input 2nd number for LCM: 20 LCM of 15 and 20 = 60
Flowchart:

C Programming Code Editor:
Previous: Write a program in C to find LCM of any two numbers using HCF.
Next: Write a program in C to convert a binary number into a decimal number using math function.
What is the difficulty level of this exercise?
Test your Programming skills with w3resource's quiz.
- Weekly Trends
- Python Interview Questions and Answers: Comprehensive Guide
- Scala Exercises, Practice, Solution
- Kotlin Exercises practice with solution
- MongoDB Exercises, Practice, Solution
- SQL Exercises, Practice, Solution - JOINS
- Java Basic Programming Exercises
- SQL Subqueries
- Adventureworks Database Exercises
- C# Sharp Basic Exercises
- SQL COUNT() with distinct
- JavaScript String Exercises
- JavaScript HTML Form Validation
- Java Collection Exercises
- SQL COUNT() function
- SQL Inner Join