{"post":"

LCM Program in C++ | GCD Program in C++

The highest common factor is also known as GCD (Greatest common divisor). GCD is the largest possible integer which can be divided by the given numbers without a remainder.

Note: GCD is also known as HCF(Highest Common Factor).

LCM, lowest common multiple is the least possible integer which can be divided by the given numbers without a remainder.

In the example given below, we will take two numbers and find their GCD and LCM.

Logic:

For GCD/HCF:

We will take a number, check if it is perfectly divisible by both numbers. We store the value in a variable, and then, print the variable.

For LCM:

We use a formula here,

LCM = Num1*Num2/GCD

Algorithm:

Take two number's as input.
Check if the given numbers are divisible by any number less than the number itself using for loop.
If yes, then store it (in gcd) and continue ahead.
After termination of the loop, the last updated value in gcd will be GCD.
To find LCM of the numbers apply the formula for lcm.
Now, Print the GCD and LCM

Code:

#include<iostream>\nusing namespace std;\nint main()\n{\n\tint fnum,snum,gcd,lcm;\n\tcout<<\"Enter first number\";\n\tcin>>fnum;\n\tcout<<\"\\nEnter second number\";\n\tcin>>snum;\n\t//find factors of both numbers\n\tfor(int i=1;i<=fnum && i<=snum;i++)\n\t{\n\t\tif(fnum%i==0 && snum%i==0)\n\t\t\tgcd=i;\n\t}\n\t//find lcm of both numbers\n\tlcm = fnum*snum/gcd;\n\tcout<<\"\\n GCD of given numbers is:\"<<gcd;\n\tcout<<\"\\n LCM of given numbers is:\"<<lcm;\n\treturn 0;\n}

Output:

Enter first number 10\nEnter second number 5\nGCD of given numbers is:5\nLCM of given numbers is:10

\n","title":"Program for lcm in C++ | Program for hcf in C++","authorDetails":{"name":"Juhi Kamdar","slug":"juhi-kamdar"},"seo":{"title":"Program for lcm in C++ | Program for hcf in C++"},"description":"Learn to write a program to find the gcd or HCF and LCM of given two numbers in C++ using for loop. Here GCD stands for Greatest common divisor.","slug":"cpp/examples/gcd-hcf-lcm-program-in-cpp","articleId":"636a83457bb1ce5072622bf8","bookmarkStatus":{"isBookmarked":false,"bookmarkId":null}}