$O(n)$求逆元
1 |
ll inv[maxn]; |
$O(n)$求阶乘
1 |
ll f[maxn]; |
求$nchoose k$
1 |
ll cur,p[maxn],q[maxn],inv[maxn]; |
求$A^k_n$
1 |
int A(int n,int k){ |
1 |
ll inv[maxn]; |
1 |
ll f[maxn]; |
1 |
ll cur,p[maxn],q[maxn],inv[maxn]; |
1 |
int A(int n,int k){ |
近期评论