Problem B
The Deal of the Day


A bored technician whose job requires inspecting each of $10$ equipment stations on a regular basis has tried to inject a little variety into his days by creating a deck of cards, each card bearing a number in the range $1..10$. From this deck he randomly deals out $K$ cards at the start of the day, and uses the numbers on these to determine which stations and in what order he will visit them on that day. (He has decided that it is OK to visit the same station more than once in the same day.)

As time goes by, he adds cards for the number of stations where he finds problems, so that he will visit them more often, so the number of cards bearing each digit may vary considerably.

One day he deals out his cards, and notices that they have come out in strictly ascending order. He starts to wonder just how likely such an ordering would be.

Find the number of ways to deal the cards that form a strictly ascending sequence. (“Strictly ascending” in this problem means that, for example $[2, 4, 5]$ would be accepted but $[3, 1, 2]$ and $[2, 2, 4]$ would not.)


The first line of input contains $10$ non-negative integers $n_ i$, each denoting the number of cards bearing the number $i$. The sum of these $10$ numbers is in the range $1\ldots 1\, 000$.

This is followed by a line containing an integer $K$, $1 \leq K \leq 10$, denoting the number of cards to be dealt.


Print a single line containing an integer denoting the number of ways to deal $K$ cards from that deck that would form a strictly ascending sequence.

Sample Input 1 Sample Output 1
4 0 0 0 4 0 0 0 0 4
Sample Input 2 Sample Output 2
4 0 0 0 4 0 0 0 0 4
Sample Input 3 Sample Output 3
10 10 10 20 0 10 10 10 10 10
Sample Input 4 Sample Output 4
100 100 100 100 100 100 100 100 100 100
CPU Time limit 1 second
Memory limit 1024 MB
Source ICPC North America Regional Contests 2019-11-09
License Creative Commons License (cc by-sa)

Please log in to submit a solution to this problem

Log in