You have a string S of length N consisting of non-negative integers. Write a program to find how many arrays could have S as an output?
Sample Input
7 1234567 9
1234567
Sample Output
64
You have a string S of length N consisting of non-negative integers. Write a program to find how many arrays could have S as an output?
Sample Input
7 1234567 9
1234567
Sample Output
64
It can be solveable with dp[N][log_{2}C].
How can I trust you that this does not belong to a live contest!
Solved it.
Anyways, Thanks for your help