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.