ACODE - Alphacode
Alice and Bob need to send secret messages to each other and are discussing ways to encode their messages:
Alice: “Let’s just use a very simple code: We’ll assign ‘A’ the code word 1, ‘B’ will be 2, and so on down to ‘Z’ being assigned 26.”
Bob: “That’s a stupid code, Alice. Suppose I send you the word ‘BEAN’ encoded as 25114. You could decode that in many different ways!”
Alice: “Sure you could, but what words would you get? Other than ‘BEAN’, you’d get ‘BEAAD’, ‘YAAD’, ‘YAN’, ‘YKD’ and ‘BEKD’. I think you would be able to figure out the correct decoding. And why would you send me the word ‘BEAN’ anyway?”
Bob: “OK, maybe that’s a bad example, but I bet you that if you got a string of length 5000 there would be tons of different decodings and with that many you would find at least two different ones that would make sense.”
Alice: “How many different decodings?”
For some reason, Alice is still unconvinced by Bob’s argument, so she requires a program that will determine how many decodings there can be for a given string using her code.
Input will consist of multiple input sets. Each set will consist of a single line of at most 5000 digits representing a valid encryption (for example, no line will begin with a 0). There will be no spaces between the digits. An input line of ‘0’ will terminate the input and should not be processed.
For each input set, output the number of possible decodings for the input string. All answers will be within the range of a 64 bit signed integer.
Input: 25114 1111111111 3333333333 0 Output: 6 89 1
WA in 1st go :3
AC....hint...first make normal recursive solution and then the idea of top down will hit you :)..also the testcases in comments are enough to remove WA...
The problem is so confusing.. got so many WAs.. guys, do check out the test cases in the comments before submitting as it is not clear in the question.
Problem wording: The problem really should specify that '01' through '09' are not valid pairs. For those getting WA, make sure you are not treating *any* substring that starts with '0' as valid. Otherwise- cool problem. :)
Take care of test cases where 0's appear in between.
Thanks for Test Cases, AC in one go!
thanks @l0gic_b0mb for your testcases!
bottom up rocks !! :)
nice dp to practice :)