摘要: 快速幂 ll qpow(ll x, ll y, ll mod){ ll ret = 1; while(y){ if(y & 1) ret = (ret % mod * x % mod) % mod; x = (x % mod * x % mod); y >>= 1; } return ret; } 阅读全文
posted @ 2020-07-03 09:45 wansheking 阅读(43) 评论(0) 推荐(0)