LCM (least common multiple)

#1

please check my code for this problem

#2

https://ide.codingblocks.com/s/95182 this is the url of the code

#3

Hello @Ayushi21,
Your code seems to be working fine.

#4

YEAH BUT IS THERE ANY OTHER METHOD BY WHICH THIS CODE CAN BE DONE

#5

Yes, for two numbers a and b, we know that a*b is equal to gcd(a,b) * lcm(a,b).
So, you can first find gcd using Euclid’s Alogrithm(Euclid’s division lemma) and then use gcd to find lcm.