組合數的逆元求法

#include <bits/stdc++.h> #define ll long long using namespace std; const ll mod=1e9+7; const int maxn=1e5+7; ll fac[maxn]; ll inv[maxn]; ll C(int m,int n) { if(m>n) return -1; return

>>阅读原文<<