快速乘取模运算

**基于快速幂（见上篇**

ll mul_mod(ll a, ll n) { ll ans = 0; while (n) { if (n & 1) ans = (ans + a) % mod; a = (a + a) % mod; n /= 2; } return ans; }