Greatest common divisor and least common multiple of primary School Olympiad

The knowledge of the mean inequality is still used, as evidenced here: http://www.cnblogs.com/xtx1999/p/4913067.html

Knowing the two numbers of greatest common divisor and least common multiple, we knew the product of two numbers. According to the mean inequality, two numbers and a certain two number, and they are two more close to the product of the larger. So when the product is certain, the closer they are and the smaller they are, the more they enumerate.

#include <iostream>#include<cstdio>using namespacestd;intgcd,lcm,a,b,tot,ans=10000000; inlineintGCD (intXinty) {    returny==0? X:GCD (y,x%y);}intMain () {scanf ("%d%d",&gcd,&LCM); Tot=gcd*LCM;  for(intI=1; i*i<=tot;i++)      if(tot%i==0&AMP;&AMP;GCD (i,tot/i) = =gcd) ans=min (ans,i+tot/i); cout<<ans;}

Greatest common divisor and least common multiple of primary School Olympiad