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
codesniper99: 2018-02-18 06:08:28

I solved this in my head on the toilet seat
;)

naduhrin78: 2018-01-31 18:50:08

Finally, for god`s sake.

ram_24: 2018-01-25 07:15:35

finally...:)

satyampnc: 2018-01-24 16:04:46

my 69th ;)

karanjakhar: 2018-01-22 22:08:10

new to dp ,,,, cant figure it out

l154281: 2018-01-20 20:52:58

I wrote a top-down DP solution but it kept getting WA. I tried all the test cases given here in the comments and was almost about to give up when i decided to look up the original source of this problem where I got a hold of the test cases. It turns out the top down recursive solution was causing the stack to overflow! I then wrote a bottom up solution which got accepted :). This was my first time submitting a solution on spoj and honestly all online judges should increase the stack size for c++, as is done on Kattis and whatnot.

shashankpathak: 2018-01-19 14:51:23

Beautiful problem got a lot to learn :)

aman_sachin200: 2018-01-10 18:02:12

AC in 1 go!!

bashnewbie: 2018-01-03 15:39:50

**Hint**

Zeroes are to be paired with preceding digit
Consecutive zeroes should result in output of 0

Last edit: 2018-01-03 15:40:17
bashnewbie: 2018-01-03 15:36:40

Try:

Input
4350233
110
1001

Output
0
1
0


Added by:Adrian Kuegel
Date:2005-07-09
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