C++求解多项式(ax+by)^k展开后x^n*y^m项系数并取模

```cpp #include <iostream> using namespace std; int main() { int a, b, k, n, m; cin >> a >> b >> k >> n >> m; // 计算系数 long long coefficient = 1; for (int i = 0; i < n; i++) { coefficient = (coefficient * (k - i) % 10007) % 10007; } for (int i = 0; i < m; i++) { coefficient = (coefficient * (k - n - i) % 10007) % 10007; } cout << coefficient << endl; return 0; } ``` ######[AI写代码神器 | 291点数解答 | 2024-12-05 20:32:13]