题意:
多项式(x1+x2+...+xk)^n.
输入n和k(0<k,n<13),分别表示多项式次数和变元数。第二行为k个非负整数n1,n2,...nk,满足n1+n2+...nk=n.
输出多项式(x1+x2+...+xk)^n展开后的(x1)^n1*(x2)^n2...(xn)^nk这一项的系数。
思路:
网上看的多项式定理的公式
(a + b + c + ... + f) ^ n =
(n! / (k! * d! * j! * ... * z!)) * a^k * b^d * c^j * ... * f^z(k + d + ...=n);
AC:
#include <cstdio>
#include <cstring>
#define ll long long
const int N = 13;
ll c[N];
int n,k,num;
int main () {
c[0] = 1;
for (int i = 1; i < N; i++)
c[i] = c[i - 1] * i;
while (scanf ("%d%d", &n, &k) != EOF) {
ll ans = c[n];
for (int i = 0; i < k; i++) {
scanf ("%d", &num);
ans /= c[num];
n -= num;
}
printf ("%lld\n", ans);
}
return 0;
}