gcd:
int gcd(int x,int y)
{
return y==0?x:gcd(y,x%y);
}
lcm:
x*y/gcd(x,y);
01:快速幂
02.LL fun(LL x,LL n,)
03.{
04. LL res=1;
05. while(n>0)
06. {
07. if(n & 1)
08. res=(res*x)%Max;
09. x=(x*x)%Max;
10. n >>= 1;
11. }
12. return res;
13.}