Important alert: (current site time 5/19/2013 1:40:25 AM EDT) Brand new: recommended reading for every programming language on the site | revamped discussion board | 7 Source Code CDs

# lcm of 2 numbers(without euclid algorithm)

Email
 Submitted on: 8/6/2012 3:54:08 PM By: Thejwal P Level: Intermediate User Rating: Unrated Compatibility: C++ (general) Views: 1698

hey guys, recently i was wondering about how to write a program to find the lcm of two numbers..i had a flashback to my college lab days. the trick was to find the gcd of the 2 numbers using euclid algo and divide it by the product of the two numbers to find the lcm(too nerdy!!) the common sense approach would just be to multiply the larger number with numbers from 1 to the other number(outer loop) and then compare these products one by one with the products of the smaller number(inner loop)obtained by multiplying it from 1 to the larger number.

code:
Can't Copy and Paste this?
 Terms of Agreement:    By using this code, you agree to the following terms...    You may use this code in your own programs (and may compile it into a program and distribute it in compiled format for languages that allow it) freely and with no charge. You MAY NOT redistribute this code (for example to a web site) without written permission from the original author. Failure to do so is a violation of copyright laws.    You may link to this code from another website, but ONLY if it is not wrapped in a frame.  You will abide by any additional copyright restrictions which the author may have placed in the code or code's description. ``` //************************************** // Name: lcm of 2 numbers(without euclid algorithm) // Description:hey guys, recently i was wondering about how to write a program to find the lcm of two numbers..i had a flashback to my college lab days. the trick was to find the gcd of the 2 numbers using euclid algo and divide it by the product of the two numbers to find the lcm(too nerdy!!) the common sense approach would just be to multiply the larger number with numbers from 1 to the other number(outer loop) and then compare these products one by one with the products of the smaller number(inner loop)obtained by multiplying it from 1 to the larger number. // By: Thejwal P // //This code is copyrighted and has// limited warranties.Please see http://www.Planet-Source-Code.com/vb/scripts/ShowCode.asp?txtCodeId=13813&lngWId=3//for details.//************************************** #include void lcm(int,int); int main() { int a,b,num1,num2; cout<>a>>b; if(a>b) { num1=a; num2=b; } else { num2=a; num1=b; } lcm(num1,num2); } void lcm(int num1,int num2) { int i,j,product,lcm; cout<<"num1="<

Use this form to tell us if this entry should be deleted (i.e contains no code, is a virus, etc.).
This submission should be removed because:

What do you think of this code (in the Intermediate category)?
(The code with your highest vote will win this month's coding contest!)
Excellent  Good  Average  Below Average  Poor (See voting log ...)