lcm of 2 numbers(without euclid algorithm)

				
//**************************************
// 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<iostream.h>
void lcm(int,int);
int main()
{
	int a,b,num1,num2;
	cout<<endl<<"enter two numbers to find their lcm";
	cin>>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="<<num1<<"num2="<<num2;
	for(i=1;i<=num2;i++)	// i<=num2 we need to iterate only up to this point.
	{
		product=i*num1;
		cout<<endl<<"product="<<product;
		for(j=1;j<=num1;j++)
		{
			if(product==num2*j)
			{
				cout<<endl<<"num*j="<<num2*j;
				lcm=product;
				goto a;
			}
		
		}
	}
a:cout<<endl<<"lcm("<<num1<<","<<num2<<")=";
cout<<lcm;	
	
	
}