int MaxAB(int a,int b)
{
if(a>b && !a%b || a==b) return a;
if(a < b && !b%a) return b;
//先求最大公約數(shù)
int nMul;
int nMinAB = (a>b)?(nMul=b,a%b):(nMul=a,b%a);
while(nMinAB)
{
int nTemp = nMinAB;
nMinAB = nMul % nMinAB;
nMul = nTemp;
}
return A*B/nMul;
}