No.1629 Sorting Integers (SUM of M)
Problem Statement
There are $N$ positive integers of $1$ digit each. Among them, there are $c_i$ copies of $i$ $(1\leq i\leq9)$. Rearrange these $N$ integers and regard the result as an $N$-digit integer $M$ in base $10$. Find the sum of all possible values of $M$.
Since the answer can be very large, output the remainder when it is divided by $10^9+7$.
Input
$N$ $c_1\ c_2\ c_3\ c_4\ c_5\ c_6\ c_7\ c_8\ c_9$
- $1\leq N\leq 2\times 10^5$
- $c_i\geq0$
- $\displaystyle \sum_{i=1}^9 c_i=N$
- All input values are integers.
Sample
Sample 1
Input
3 1 1 1 0 0 0 0 0 0
Output
1332
Each of $1,2,3$ appears $1$ time, and the possible values of $M$ are $123,132,213,231,312,321$. We have $123+132+213+231+312+321=1332$.
Sample 2
Input
3 1 2 0 0 0 0 0 0 0
Output
555
The digit $1$ appears $1$ time and the digit $2$ appears $2$ times, and the possible values of $M$ are $122,212,221$. We have $122+212+221=555$.
Sample 3
Input
1 0 1 0 0 0 0 0 0 0
Output
2
The only possible value of $M$ is $2$.
Sample 4
Input
9 1 1 1 1 1 1 1 1 1
Output
998387207
Output the remainder when divided by $10^9+7$.
提出するには、Twitter 、GitHub、 Googleもしくは右上の雲マークをクリックしてアカウントを作成してください。
とりゐ
re_re0101