uva 10105(数论)

题意：先给出n和k，然后给了从n1到nk个数字，要求输出多项式展开后，(x1^n1)*(x2^n2)...(xk^nk)这一项的系数。

题解：不知道怎么做，看了这个人的题解恍然大悟。。http://www.cnblogs.com/scau20110726/archive/2012/12/22/2829012.html

#include <stdio.h>
#include <string.h>
const int N = 20;
int n, k;

long long C(int m, int n1) {
	long long ans = 1;	
	if (n1 - m < m)
		m = n1 - m;
	for (int i = 1; i <= m; i++)
		ans = ans * (n1 - i + 1) / i;
	return ans;
}

int main() {
	while (scanf("%d%d", &n, &k) == 2) {
		long long res = 1;
		int temp;
		for (int i = 1; i <= k; i++) {
			scanf("%d", &temp);
			res *= C(temp, n);
			n -= temp;
		}
		printf("%lld\n", res);
	}
}