Codeforces 553A Kyoya and Colored Balls

Kyoya Ootori has a bag with n colored balls that are colored with k different colors. The colors are labeled from 1 to k. Balls of the same color are indistinguishable. He draws balls from the bag one by one until the bag is empty. He noticed that he drew the last ball of color ibefore drawing the last ball of color i + 1 for all i from 1 to k - 1. Now he wonders how many different ways this can happen.

Input

The first line of input will have one integer k (1 ≤ k ≤ 1000) the number of colors.

Then, k lines will follow. The i-th line will contain ci, the number of balls of the i-th color (1 ≤ ci ≤ 1000).

The total number of balls doesn't exceed 1000.

Output

A single integer, the number of ways that Kyoya can draw the balls from the bag as described in the statement, modulo 1 000 000 007.

Sample test(s)

input

3
2
2
1

output

3

input

4
1
2
3
4

output

1680

解题思路：因为题目要求第i种颜色的最后一个球要放到第i+1种颜色最后一个球的前面。我们可以这样来考虑，首先对于最后一种颜色的球的最后一个必须要放到最后一个位置，则剩余的最后一种颜色的球可以在前面的位置任意选，因此对第n种球它的放置方案数为C(sum-1,cnt[n]-1),最后一种颜色的球放置完以后，我们开始放置第n-1种颜色的球，这种颜色的球的最后一个必须要放置在前面放置结束后剩余空白位置的最后一个，则对应于该种颜色的球放置方案为C(sum-cnt[n]-1,cnt[n-1]-1),利用这样的思路逐渐向前计算即可，然后将所有的组合数相乘取余即可。

#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
const int maxn = 1010;
const ll  mod  = 1000000007;
ll C[maxn][maxn];

void init() {
    memset(C, 0, sizeof(C));
    C[0][0] = 1;
    C[1][0] = C[1][1] = 1;
    for(int i = 2; i <= 1000; ++i) {
        C[i][0] = C[i][i] = 1;
        for(int j = 1; j < i; ++j) {
            C[i][j] = (C[i-1][j-1] + C[i-1][j]) % mod;
        }
    }
}

int cnt[maxn];

int main() {

    init();
    int n;
    int c = 0;
    ll  ans = 1;
    scanf("%d", &n);
    for(int i = 1; i <= n; ++i) {
        scanf("%d", &cnt[i]);
        c += cnt[i];
    }
    for(int i = n; i >= 1; --i) {
        if(cnt[i] == 0) continue;
        ans = (ans * C[c-1][cnt[i]-1]) % mod;
        c -= cnt[i];
    }
    cout << ans << endl;
    return 0;
}