Light OJ-1226

题解：

最后一个位置肯定是第i个任务的子任务，其他子任务利用插空法放在前面sum-1个空位里面。

#include <bits/stdc++.h>
#define LL long long
#define MMF(x) memset((x),0,sizeof(x))
#define MMI(x) memset((x), INF, sizeof(x))
using namespace std;
const int INF = 0x3f3f3f3f;
const int N = 1e5+20;
const LL mod = 1000000007;
LL inv[N*10], fa[N*10];
LL fpow(LL a, int n)
{
    LL r = 1;
    while(n > 0){
        if(n & 1)
            r = r * a % mod;
        a = a * a % mod;
        n >>= 1;
    }
    return r;
}
void init()
{
    fa[0] = 1;
    inv[0] = 1;
    for(LL i = 1; i <= 1000100; i++){
        fa[i] = fa[i-1] * i % mod;
        inv[i] = fpow(fa[i], mod - 2);
    }
}
LL C(LL n, LL m)
{
    if(m > n)
        return 0;
    LL ans = 0;
    ans = ((fa[n] * inv[m] % mod)* inv[n-m]) % mod;
    return ans;
}
LL lucas(LL n, LL m)
{
    if(m == 0)
        return 1;
    return C(n % mod, m % mod) * lucas(n / mod, m / mod) % mod;
}
LL a[1100];
int main()
{
    int T;
    cin >> T;
    init();
    int cnt = 0;
    while(T--){
        LL n;
        scanf("%lld", &n);
        for(int i = 1; i <= n; i++)
            scanf("%lld", a + i);
        LL ans = 1;
        LL ct = 0;
        for(int i = 1; i <= n; i++){
            ct += a[i];
            ans = (ans*lucas(ct-1, a[i]-1) % mod);
        }
        printf("Case %d: %lld\n", ++cnt, ans);
    }
    return 0;
}