| 시간 제한 | 메모리 제한 | 제출 | 정답 | 맞힌 사람 | 정답 비율 |
|---|---|---|---|---|---|
| 1 초 | 512 MB | 8 | 2 | 2 | 100.000% |
Bobo has a lot of integers. Frankly, he has $a_1$ number of 1ドル,ドル $a_2$ number of 2ドル,ドル $\dots,ドル $a_{10}$ number of 10ドル$.
Today, bobo would like to pick some of the numbers and calculate their product (If none of the numbers are chosen, the product is defined as 1ドル$). bobo is curious about the number of different products he can obtain, modulo $(10^9 + 7)$.
10ドル$ integers $a_1, a_2, \dots, a_{10}$ (0ドル \leq a_i \leq 10^9$).
A single integer denotes the number of products.
0 1 0 1 0 0 0 1 0 0
7
0 1000000000 100000000 0 0 0 0 0 0 0
400000001