AcWing 211. 计算系数
原题链接
简单
作者:
缇拉鞠
,
2024-04-08 12:46:52
,
所有人可见
,
阅读 3
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long long LL;
typedef pair<long long, long long> pll;
#define o first
#define p second
const ll MOD = 10007;
const ll MAX_K = 1000;
void Kisara() {
ll a, b, k, n, m;
cin >> a >> b >> k >> n >> m;
vector<vector<ll>> dp(MAX_K + 1, vector<ll>(MAX_K + 1, 0));
dp[0][0] = 1;
for (ll i = 1; i <= k; ++i) {
dp[i][0] = (dp[i - 1][0] * a) % MOD;
dp[0][i] = (dp[0][i - 1] * b) % MOD;
}
for (ll i = 1; i <= k; ++i) {
for (ll j = 1; j <= k; ++j) {
dp[i][j] = (dp[i - 1][j] * a + dp[i][j - 1] * b) % MOD;
}
}
cout << dp[n][m] << endl;
return;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
Kisara();
return 0;
}