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 except: SCM chicken
Resource:ACM East Central North America Regional Programming Contest 2004

hide comments
2015-02-26 01:13:32 ben
@Daniel Carvalho : Nice test cases! Really helpful for tricky cases
2015-02-19 16:44:41 Srikant Aggarwal
does 226210 has less output that 22621?
2015-02-18 13:34:26 Daniel Carvalho
Don't assume ending 0 has only 1 digit. Here are some test cases and outputs:
1111 - 5
25144 - 4
2262 - 3
22621 - 6
226210 - 3
2203 - 1
2020 - 1
2022 - 2
136517 - 4
2015-02-03 22:38:14 vivek singh rana
changed size of array from 5000 to 5010....and got ac!!
2015-01-26 19:48:05 Lehar
My first DP :D :D

Last edit: 2015-01-27 10:31:06
2015-01-22 18:10:09 ashish kumar
after considering magic number 0,got AC
2015-01-20 18:28:02 lovecode
a Nice dp......
2015-01-12 22:36:15 Pratik Nagelia
A "must solve" dp ...
2015-01-01 11:07:37 AMAN RANJAN THAKUR
1st DP..:-)
2014-12-26 21:25:09 Anmol Pandey
considering zeroes makes this otherwise easy problem a good one.
Nice Prob!!
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.