CF 553A. Kyoya and Colored Balls 组合数学 和dp有点关系

其实和dp一点关系都没有，如果说有关系，那么就是阶段的选取。

如果以dp的思维考虑问题，首先要确定阶段，这个题肯定不能以正在考虑第几个球为阶段，因为状态存不下去，而且就算这存下去了，也不好算。正确的阶段是颜色，以颜色从小到大的顺序解题。

A. Kyoya and Colored Balls

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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 i before drawing the last ball of color i + 1 for alli 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.

Examples

input

3
2
2
1

output

3

input

4
1
2
3
4

output

1680

Note

In the first sample, we have 2 balls of color 1, 2 balls of color 2, and 1 ball of color 3. The three ways for Kyoya are:

1 2 1 2 3
1 1 2 2 3
2 1 1 2 3

import java.math.BigInteger;
import java.util.Scanner;

//看了别人代码，突然觉得我这种做法很幼稚，为了防止组合公式爆long long 就用了Java中的bigInteger，结果根本没必要。
//预处理C[n][m],用的都是加法，根本不用考虑除法。
//C[x][y]=C[x-1][y-1]+C[x-1][y];

public class Main {

	static int n;
	static final int maxn=1000;
	static final int mod=1000000007;
	static int [] a=new int[maxn+10];
	
	static long cal(int sum,int x)
	{
		long ans=1;
		int n=sum+x-1;
		int m=Math.min(sum,n-sum);
		BigInteger fm=BigInteger.ONE ;
		
		for(int i=1;i<=m;i++)
		{
			fm=fm.multiply(BigInteger.valueOf(n-i+1) );
			fm=fm.divide(BigInteger.valueOf(i) );
		
		}
		fm=fm.remainder(BigInteger.valueOf(mod) );
	
		String s= fm.toString();
		ans=Integer.valueOf(s);
		
		return ans;
	}
	static long work()
	{
		long ans=1;
		int sum=0;
		for(int i=1;i<=n;i++)
		{
			ans= (ans*cal(sum,a[i]) )%mod;
			sum+=a[i];
		}
		
		return ans;
		
	}
	  public static void main(String args[])
	  {
		  Scanner sc=new Scanner(System.in);
		  while(sc.hasNextInt())
		  {
			  n=sc.nextInt();
			  for(int i=1;i<=n;i++)
			  {
				  a[i]=sc.nextInt();
			  }
			  System.out.println(work());
		  }
		  
	  }
}