快速幂模板 简单记录一下,以后忘了好找QwQ // m^n % k int quickpow(int m,int n,int k) { int b = 1; while (n > 0) { if (n & 1) b = (b*m)%k; n = n >> 1 ; m = (m*m)%k; } return b; } 没了,嘤嘤嘤