【YBTOJ】【Luogu】计算系数

思路:

二项式定理即可

$code$

#include<iostream>
#include<cstdio>
#define ll long long

using namespace std;

ll p=10007; 
ll a, b, n, m, k;

ll qpow(ll x, ll t)
{
	ll sum=1ll;
	while(t)
	{
		if(t&1)
			sum=sum*x%p;
		x=x*x%p;
		t>>=1;
	}
	return sum;
}

ll C(ll n, ll m)
{
	ll sum=1ll;
	for(int i=m+1; i<=n; i++)
		sum=sum*i%p;
	for(int i=1; i<=n-m; i++)
		sum=sum*qpow(i, p-2)%p;
	return sum;
}

int main()
{
	scanf("%lld%lld%lld%lld%lld", &a, &b, &k, &n, &m);
	printf("%lld\n", C(k, m)*qpow(a, n)%p*qpow(b, m)%p);
	return 0;
}