AcWing 211. 计算系数
原题链接
简单
作者:
一块两毛五
,
2024-03-29 21:20:14
,
所有人可见
,
阅读 2
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
const int N = 1010, mod = 10007;
long long f[N][N];
long long a, b;
long long k, n, m;
long long res;
int main()
{
cin >> a >> b >> k >> n >> m;
for(int i = 0; i <= k; i++)
{
f[i][0] = 1;
f[i][i] = 1;
}
for(int i = 1; i <= k; i++)
{
for(int j = 1; j <= i / 2; j++)
{
f[i][j] = (f[i - 1][j - 1] + f[i - 1][j]) % mod;
f[i][i - j] = f[i][j];
}
}
int t = a;
for(int i = 0; i < n - 1; i++)
{
a = (a * (t % mod)) % mod;
}
t = b;
for(int i = 0; i < m - 1; i++)
{
b = (b * (t % mod)) % mod;
}
res = (((a * b) % mod)* f[k][n]) % mod;
cout << res;
return 0;
}