hdu 1521 排列组合

排列组合 - http://acm.hdu.edu.cn/showproblem.php?pid=1521

代码

【0MS】

#include<bits/stdc++.h>
using namespace std;
#define MXN 15
int main(){
	int N, M, s, n[MXN], F[MXN]={1};
    double c1[MXN], c2[MXN];
    for(int i = 1; i < MXN; i++) F[i] = i*F[i-1]; // n!
	while(scanf("%d%d", &N, &M) == 2){
        for(int i = 0; i < MXN; i++) c1[i] = c2[i] = 0.0;
        for(int i = 0; i < N; i++) scanf("%d", n+i);
        for(int i = 0; i <= n[0]; i++) c1[i] = 1.0/F[i];
        s = n[0];
        for(int i = 1; i < N; i++){
            for(int j = 0; j <= s; j++){
                for(int k = 0; k <= n[i] && j+k <= M; k++){
                    c2[j+k] += c1[j]/F[k];
                }
            }
            s = min(M, s+n[i]); // 注意
            for(int j = 0; j <= M; j++) c1[j] = c2[j], c2[j] = 0.0;
        }
        printf("%.0f\n", c1[M]*F[M]);
	}
	return 0;
}