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
2013-11-25 09:16:59 mayank rastogi
AC finally... was making a slight mistake...
2013-11-22 15:51:38 mayank rastogi
tried every test case given in different cmmnts and getting right outputs...still getting WA..
what possible test case could i be missing...?

Last edit: 2013-11-22 15:52:24
2013-10-24 13:36:36 Somesh Maurya™
try this 1201..
the answer for this test case is 1
2013-10-24 13:34:24 Somesh Maurya™
my first program of dp :)
2013-10-23 07:57:07 sobriquet
AC in first attempt. Try these test-cases:
17221->6
172210->4
1722101->4
17221012->8
34->1
23->2
1017->2
2013-08-22 13:30:17 crypt
@xyb .. thanks for the test cases
2013-07-31 17:45:38 Savan Popat
got some confidence on DP

Last edit: 2013-07-31 17:50:42
2013-07-24 13:39:35 Vineel Pratap
nice problem for DP beginners :)

Last edit: 2013-07-24 13:50:22
2013-07-21 00:48:00 Mohammad Ahmed
i'm getting time limit exceeded even if my program running in 0 second on ideone.com
please tell me what's the problem???
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.