#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
typedef long long LL;
LL mod_pow(LL x, LL n, LL p){
LL res = 1;
while(n){
if(n & 1) res =res * x % p;
x = x * x % p;
n >>= 1;
}
return res;
}
LL comb(LL n, LL m, LL p){
<
组合数取余模板
最新推荐文章于 2021-11-29 23:51:30 发布