10105

最新推荐文章于 2023-03-21 17:52:02 发布

CSND12333

最新推荐文章于 2023-03-21 17:52:02 发布

阅读量195

点赞数

原文链接：http://www.cnblogs.com/ACKOKO/articles/2056778.html

版权

求多项式（x1+x2+x3+...xk）n展开式的某一项x1n1x2n2*...xknk的系数：

组合的知识：结果为n!/(n1!n2!...nk!)

//============================================================================
// Name        : 10105.cpp
// Author      : 
// Version     :
// Copyright   : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================

#include <iostream>
#include <cstdio>
using namespace std;

long long jie[15] = {1,1,2,6,24,120,720,5040,40320,362880,3628800,39916800,479001600};
long long ans;
int t, n, k;

int main() {
	while(scanf("%d%d", &n, &k)!=EOF){
		ans = jie[n];
		for(int i = 0;i < k;i++){
			scanf("%d", &t);
			ans/=jie[t];
		}
		printf("%lld\n", ans);
	}
	return 0;
}

转载于:https://www.cnblogs.com/ACKOKO/articles/2056778.html