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?”
Bob: “Jillions!”
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
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.
Output
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.
Example
Input: 25114 1111111111 3333333333 0 Output: 6 89 1
hide comments
anshul_srivas:
20170222 18:57:16
Take care of test cases where 0's appear in between. 

nilabja16180:
20170209 18:09:59
Thanks for Test Cases, AC in one go! 

manas0008:
20170204 09:38:27
thanks @l0gic_b0mb for your testcases! 

tni_mdixit:
20170101 21:53:03
bottom up rocks !! :)


scorpion_ajay:
20170101 15:36:16
nice dp to practice :) 

dibbu:
20161227 18:43:21
kk Last edit: 20161227 19:12:20 

chickadee:
20161224 00:26:07
For a sequence of 1's (or 2's or 12's) the problem is basically asking to calculate the n'th Fibonacci number. 5000'th Fibonacci is kind of a big number.


gauravgb21:
20161221 18:00:27
AC in 0.00!!! Bottom up approach!!!! Last edit: 20161221 18:01:02 

ashishsb95:
20161206 13:51:26
handling 0's was the tricky part 

iconoclast_003:
20161204 17:59:54
How could the output be 89 for second input.Any intuitive idea?

Added by:  Adrian Kuegel 
Date:  20050709 
Time limit:  0.341s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All 
Resource:  ACM East Central North America Regional Programming Contest 2004 