lucas定理 [排列组合]

-----------lucas定理-- ----------
用于求 C(n, m) % M = ;
n中取m的组合数 % M = ? ;
-------------end -- -----------
/*
#include <iostream>
using namespace std;
#define M 1000000007
*/

/ ---------------lucas 1 ------------------ /
long long lucas(long long n, long long m)
{
return m == 0 ? 1 : C(n % M, m % M) * lucas(n / M, m / M) % M; //C(x,y) x 中取 y组合数
}
/ ------------------end-- --------------------- /


/ ------------lucas 2 M : 100000 ------------------ /
long long lucas(long long n, long long m)
{
long long f[n] = {1}; // f[n] = n!
for (int i = 1; i <= n; i++)
f[i] = f[i - 1] * i % M;
long long w = 1;
while (n && m)
{
long long nn = n, nm = m;
if (nn < nm)
return 0;
w = w * f[nn] * pow_mod(f[nm] * f[nn - nm] % M, M - 2) % M; //pow_mod(int x,int y) 快速幂 x ^ y
n /= M;
m /= M;
}
return w;
}
/ -------------------end-- --------------------- /

/*int main()
{
long long n,m;
lucas(n, m);
}*/