[arundavid.info]

Is that any other fast way to find L.C.M and G.C.D of two numbers.
If you know,Plz send me dat..........

#include"iostream.h"
#include"conio.h"
void main()
{
int a,b,g;clrscr();
cin>>a>>b;
if(a<b) g=a;
else g=b;
for(;;g--)
if(a%g==0&&b%g==0)
{
cout<<"\nG.C.D:"<<g;
break;
}
cout<<"\nL.C.M:"<<a*b/g;
getch();
}

This post has been edited by arundavid.info: 29 June 2008 - 09:01 PM

[thompson03]

I would think it would depend on the size of the numbers.

You code is "short", but if a and b were very very large numbers,
you could cut down on the loop time by factoring them using one of the following...


the square root of the number your factoring is the largest posible factor of that number,
so if the number was 10 digits, could cut your loop time down consiberably by factoring each number and comparing their factors.

even faster would be to factor using a list of prime numbers,

ex. to factor a larger number like 10000000000, you need only look at (x=2;x<=100,000;x--)

ex. if you had the prime number list up to 10,000 stored in a p[ ] variable, then (x=0; x <=1240; x--) where p[x] would give the list of prime factors less than 10000

not sure if this is where you wanted to go with with this.

Will be happy to talk more tomorrow if not, Bed time now.

[polymath]

Use euclids algorithm.

[arundavid.info]

This post has been edited by arundavid.info: 01 July 2008 - 01:49 AM

[polymath]

?

[captainhampton]

As polymath says, use Euclid's algorithm which if you need help, follow this link:
http://en.wikipedia....idean_algorithm
Plenty of pseudo-code information for you to get started.