LUCAS`````````How Many Sets II ZOJ - 3557

LUCAS模板：

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
#include <stack>

using namespace std;
typedef long long ll;
const int maxn = 1e5 + 10;

ll n, m, mod;

ll quick_mod(ll a, ll n) {
    ll ans = 1;
    while(n) {
        if(n&1) ans = ans * a %mod;
        a = a * a % mod;
        n >>= 1;
    }
    return ans;
}

ll inv(ll x) {
    return quick_mod(x, mod - 2);
}
ll C(ll n, ll m) {
    if(m > n) return 0;
    ll up = 1;
    ll down = 1;
    for (ll i = n-m+1; i <= n; i++) {
        up = up*i%mod;
    }
    for (ll i = 1; i <= m; i++) {
        down = down*i%mod;
    }
    return up*inv(down)%mod;
}
ll lucas(ll n, ll m) {
    if(m>n) return 0LL;
    ll ans = 1;
    while(m) {
        ans = ans*C(n%mod, m%mod)%mod;
        n/=mod;
        m/=mod;
    }
    return ans;
}

int main() {
    while(cin >> n >> m >> mod) {
        cout << lucas(n-m+1, m) << endl;
    }
}

LUCAS:

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long LL;
LL Power_mod(LL a, LL b, LL p)
{
	LL res = 1;
	while(b!=0)
	{
		if(b&1) res = (res*a)%p;
		a = (a*a)%p;
		b >>= 1;
	}
	return res;
}
LL Comb(LL a,LL b, LL p)
{
	if(a < b) return 0;
	if(a == b) return 1;
	if(b > a-b) b = a-b;
	LL ans = 1, ca = 1, cb = 1;
	for(LL i=0; i<b; ++i)
	{
		ca = (ca*(a-i))%p;
		cb = (cb*(b-i))%p;
	}
	ans = (ca*Power_mod(cb, p-2, p))%p;
	return ans;
}
LL Lucas(int n, int m, int p)
{
	LL ans = 1;
	while(n && m && ans)
	{
		ans = (ans * Comb(n%p, m%p, p))%p;
		n /= p;
		m /= p;
	}
	return ans;
}
int main()
{
	int n,m,p;
	while(scanf("%d%d%d",&n,&m,&p) !=EOF)
	{
		printf("%lld\n",Lucas(n,m,p));
	}
	return 0;
}

https://www.cnblogs.com/owenyu/p/6724560.html