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

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

hide comments
2017-09-17 12:30:17
Question clearly says that 'valid' encryption. It means there should be no test cases like this:

301, 50, 2002, 3020

because these are not valid encryption. Otherwise one will end up putting these corner case with expected answer to be zero.

Last edit: 2017-09-17 12:32:31
2017-09-10 09:36:58
1234567890 ..why the output is 0?
2017-09-10 09:33:54
will '0' stops the execution of the code
2017-09-06 19:12:49
It is a bit apt dp logic.Just think in terms of length of string as a state for dp solution
2017-09-02 18:42:35
simple , but focus on zero including string

Last edit: 2017-09-02 18:43:25
2017-08-26 05:52:46
bottom up dp,be careful of zeroes
2017-07-29 09:38:23
i am getting correct output for every test case in the comments but getting TLE on submission.
As this is a DP problem
Can anyone tell me which values should i store??
I cant figure it out
2017-07-14 13:03:11
1-Input followed by output
Check all the strings and see if u get the correct result if u do submit the code

123456789
3
987654321
2
1234567890
0
543212345
5
123454321
6
111111111
55
333333333
1
919
2
101
1
100
0
50
0
25114
6
99
1
865723149
4
1006598736254
0
96587412359875
3
2017-07-07 22:35:31
Damn, test cases are so tricky... Just solve this problem with DP and don't bother to get AC, you'll just lose time trying to fix everything so every test case works, it's better to move one and learn something actually vulnerable...
2017-07-07 16:13:43
@invinci Thanks for the Test Cases
AC , bottom up :)
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.