Help in combinatorics problem.

Правка en1, от spirited_away_, 2019-12-13 21:05:17

How to handle 0's in this problem. Like when you have input like 230005450569. When there is no 0's the answer will be 2^n-1 when C is infinity. Now for C we will count how many numbers we have to subtract from answer which are > length of C. this can be computed using simple dp. But how to handle 0's in this case like sample input above.

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en3 Английский spirited_away_ 2019-12-14 05:54:58 67
en2 Английский spirited_away_ 2019-12-13 21:08:46 30
en1 Английский spirited_away_ 2019-12-13 21:05:17 451 Initial revision (published)