Sphere Online Judge



SPOJ Problem Set (classical)

394. Alphacode

Problem code: ACODE

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.341s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel Pentium G860 3GHz)
Languages:All
Resource:ACM East Central North America Regional Programming Contest 2004

hide comments
2014-12-17 09:58:02 Shubham
My first dp :)
Two WA for not checking 0's in middle.
Guys note this:
-there are no invalid cases like 30 or 1190
- array of size 5010 is sufficient.
- check the test cases given in comments before submitting
2014-12-12 20:24:58 Swapnil Borse
The case 2120 costed me one WA :(
A small change and accepted.. Be careful.. Btw nice problem.. taught me not to be sleeping while debugging :P
and yeah DP rocks!!!!
2014-12-11 14:35:33 shruti rani
my 40th :)
2014-12-11 04:47:34 Ved Prakash Kashyap
did with recursion..using memo
2014-12-09 07:14:33 Ashish Gaurav
Nice DP, ty @ Algorithmist and Asian Tourist :)
2014-12-04 18:53:41 Aman Mahajan
Nice :)

Last edit: 2014-12-05 13:42:07
2014-11-09 11:55:33 Ashish
Silly mistake of length caused me 3 WA
2014-10-05 19:17:17 Dima
The "29" test case seems to be missing.

I passed with http://ideone.com/o59QDg but also passed with http://ideone.com/6UEthP. Diff the sources to locate an obvious bug, which is challenged by "29".

Thanks,
Dima


Last edit: 2014-10-05 19:17:55
2014-10-04 14:51:00 Subham Nagar
phew! finally AC! requires thinking! :)
Nice Sum! I just love DP!
2014-10-02 20:01:54 7Bubble
it made me smile..
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.