GCD、LCM

GCD-最大公约数

inline int GCD(int a,int b){return b==0?a:GCD(b,a%b);}

LCM-最小公倍数

inline int KCM(int a,int b){return a/GCD(a,b)*b;} 

 

来源：https://www.cnblogs.com/jian-song/p/11567745.html