Optimized solution to find LCM
We can use the formula :
A * B = GCD(A,B) * LCM(A,B)
(simple pair hai ye....)
As,
LCM(A,B) = (A*B) / GCD(A,B)
What is GCD?
=> Here
Code :
Subscribe to:
Post Comments (Atom)
Count of digits in factorial
To count the digits in a factorial we must seek some optimization as you might also understand that getting all the product and storing the...
-
To count the digits in a factorial we must seek some optimization as you might also understand that getting all the product and storing the...
-
How to calculate GCD/HCF with optimization. Step 1 : Calculate Remainder between A and B. Step 2 : Change A with B and B with remainder obta...
-
Optimized solution to find LCM We can use the formula : A * B = GCD(A,B) * LCM(A,B) (simple pair hai ye....) As, LCM(A,B) = (A*B) / GCD(A,B...
No comments:
Post a Comment