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
iconoclast_003: 2016-12-04 17:59:54

How could the output be 89 for second input.Any intuitive idea?

kira28: 2016-11-30 23:03:45

0's matter

l0gic_b0mb: 2016-10-19 20:00:10

Highly recommended problem! Must try!
The answer for some test cases at SPOJ TOOLKIT are wrong for this problem.
If getting WA, try some of the following test cases.
226210 -> 3
301 -> 0
50 -> 0
1020 -> 1
2002-> 0
In short, make sure you don't fail at any inputs with zeros in it.
They are the most tricky ones!

sreekanthkol: 2016-10-17 14:54:57

@urohit011 use more readable variable names, so that others can help.

conquistador: 2016-10-11 13:27:13

solved it in O(n) .tried recursion but failed ..apoorv gaurav singh tera 4k wala t-Shirt aya?

mahmud2690: 2016-10-04 08:05:00

Unclear statement

Anonomous: 2016-09-25 09:09:53

Sample test cases are too ambiguous. It should at least include an example for how to interpret 0 in the input. I have to go through comments to find out what exactly the judge system expects. Some test cases:
301 -> 0 { "01" does not count for a valid input }
1001 -> 0
50 -> 0

Mayank Srivastava: 2016-09-22 14:42:05

superb problem....my 2nd dp
memorization problem, top-down approach

hamjosh1: 2016-09-13 18:20:42

used top down .-.

Prasanna Patil: 2016-09-09 07:57:50

Submitted 2 solutions. One gave 1001 -> 1 and other 1001 -> 0. 2nd got accepted. Make sure to check case when 2 0s are consecutive. Also using long long (my stupidity) for storing number costed me 2 WAs make sure to use string (I was busy in checking test cases provided in comments ;-P).


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