AcWing 211. 计算系数——组合计数+快速幂
原题链接
简单
作者:
春江花月夜ovo
,
2024-04-05 23:45:44
,
所有人可见
,
阅读 18
/* /\_/\
* (= ._.)
* / > \>
*/
#include <bits/stdc++.h>
#define x first
#define y second
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
const int N = 1010;
ll C[N][N];
ll mod = 10007;
ll a, b, k, n, m;
void Init()
{
for (int i = 0; i < N; i ++) C[i][0] = 1, C[i][i] = 1;
for (int i = 0; i < N; i ++)
{
for (int j = 0; j < i; j ++)
{
C[i][j] = (C[i - 1][j - 1] + C[i - 1][j]) % mod;
}
}
}
ll qmi(ll x, ll y, ll p)
{
ll ans = 1;
while (y)
{
if (y & 1) ans = ans * x % p;
x = x * x % p;
y >>= 1;
}
return ans;
}
int main()
{
ios::sync_with_stdio(false); cin.tie(0);
Init();
cin >> a >> b >> k >> n >> m;
cout << C[k][n] * qmi(a, n, mod) % mod * qmi(b, m, mod) % mod << "\n";
return 0;
}