GCD and LCM Examples of two digits in C + +

1, to find the number of GCD two:

#include <iostream.h>
int maxye(int a,int b)
{
int temp;
while(a%b)
{
　 temp=b;
　 b=a%b;
　 a=temp;
}
return b;
}

void main()
{
int aa,bb;
cout<<"请输入第一个数：";
cin>>aa;
cout<<"\n请输入第二个数：";
cin>>bb;
cout<<"这二个数的最大公约数是："<<maxye(aa,bb) <<endl;
}

2, to find the number of LCM two

　#include <iostream.h>
int maxye(int a,int b)
{
int temp;
if(a<b)
{
　 temp=a;
　 a=b;
　 b=temp;
}
for(int i=1;i<=b;i++)
{
if(!((a*i)%b))
{
　 return a*i;
}
}

}

void main()
{
int aa,bb;
cout<<"请输入第一个数：";
cin>>aa;
cout<<"\n请输入第二个数：";
cin>>bb;
cout<<"这二个数的最小公倍数是："<<maxye(aa,bb) <<endl;
}

Comments:

GCD: The largest of a number of integers in a common convention;

For example: in 2, 4, 6, 2 is 2,4,6 's gcd.

LCM, for two integers, refers to the smallest of the two numbers in a common multiple.