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
2022-01-18 09:12:04
I got accepted without any special handling of MAXINT.
2022-01-11 02:45:53 chakib
for python users who are getting runtime error it's because of the 64bit integer. the output for 111111111111111111111111111111111111111111111111.... will be calculated properly but in other languages will output -MAXINT
2021-12-10 06:02:07
There is no need to check if the given string is valid or not because in the question it is clearly mentioned that "digits representing a valid encryption".
2021-10-01 20:09:32
check this input:
11102
10001
0
output:
2
0
2021-09-30 22:01:03
This problem has a weak testcase, My code solves string "27" = 2 and the correct solution is 1, but it is accepted.
2021-07-27 07:04:38
I tried like a 100 times and the soln works everywhere else but this question just won't take it
2021-07-15 11:41:40
Check out this video tutorial: https://youtu.be/lscBZlT39MQ

Last edit: 2021-07-15 12:39:55
2021-06-09 19:29:35
Nothing to do with 0 simply check if current character is '0' simply ignore all of its further branches in the recursion tree.
2021-05-30 07:42:10
Edge case: Check if the given digit is zero or not and do accordingly.
2021-01-31 20:18:14
Result for inputs like 10001 will be 0
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.