QOJ.ac

QOJ

時間限制: 1.0 s 記憶體限制: 512 MB 總分: 100

#7128. 巨大的乘积

统计

bobo 有很多整数。具体来说,他有 $a_1$ 个 $1$,$a_2$ 个 $2$,……,$a_{10}$ 个 $10$。

今天,bobo 想要挑选其中的一些数字并计算它们的乘积(如果不选择任何数字,乘积定义为 $1$)。bobo 对他能得到的不同乘积的数量很感兴趣,请输出该数量对 $(10^9 + 7)$ 取模的结果。

输入格式

$10$ 个整数 $a_1, a_2, \dots, a_{10}$ ($0 \le a_i \le 10^9$)。

输出格式

一个整数,表示不同乘积的数量。

样例

样例输入 1

0 1 0 1 0 0 0 1 0 0

样例输出 1

7

样例输入 2

0 1000000000 100000000 0 0 0 0 0 0 0

样例输出 2

400000001

Discussions

About Discussions

The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.

This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.

Open Discussions 0
No discussions in this category.

Issues

About Issues

If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.

Guidelines:

  1. This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
  2. Do not submit duplicated issues.
  3. Issues must be filed in English or Chinese only.
Active Issues 0
No issues in this category.
Closed/Resolved Issues 0
No issues in this category.