传送门:
P1313 [NOIP2011 提高组] 计算系数 - 洛谷 | 计算机科学教育新生态 (luogu.com.cn)https://www.luogu.com.cn/problem/P1313
套公式即可:
1,求组合数取模的公式(预处理阶乘+阶乘逆元快速幂)
2,二项式定理
3,快速幂
#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<cstdio>
#include<cmath>
#include<string>
#include<cstring>
#include<string>
#include<algorithm>
#include<vector>
#include<cctype>
#include<map>
#include<set>
#include<queue>
#include<numeric>
#include<iomanip>
using namespace std;
typedef long long ll;
const ll p = 10007;
ll frc[100000 + 7];
ll fpow(ll a, ll b) {
ll s = 1;
while (b) {
if (b & 1)s = s * a % p;
a = a * a % p;
b >>= 1;
}
return s;
}
//829231 1000000 1000 500 500
int main() {
ll a, b, k, n, m;
cin >> a >> b >> k >> n >> m;
frc[0] = 1;
for (ll i = 1; i <= 10007; i++) {
frc[i] = frc[i - 1]%p * i % p;
}
ll sum=(frc[k]%p * fpow(frc[k - n],p-2)%p)* fpow(frc[n],p-2)%p;
ll ans = fpow(b, m) % p * fpow(a, n) % p;
cout <<sum*ans%p;
}