← 返回题目

题库练习 Kyoya and Colored Balls

← 上一题下一题 →

A9904 | $Kyoya and Colored Balls$

时间限制1s

内存限制256MB

通过 / 提交0/0

题目描述

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 all $i$ from $1$ to $k-1$ . Now he wonders how many different ways this can happen.

输入格式

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 $c_{i}$ , the number of balls of the $i$ -th color ( $1<=c_{i}<=1000$ ). The total number of balls doesn't exceed 1000.

输出格式

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

输入输出样例

输入 #1

输出 #1

输入 #2

输出 #2

C++ 编辑器

输入

输出