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:2s
Source limit:50000B
Memory limit:256MB
Cluster: Pyramid (Intel Pentium III 733 MHz)
Languages:All
Resource:ACM East Central North America Regional Programming Contest 2004

hide comments
2014-07-22 09:16:54 Elvis Presley
take care of following cases:

20
1190
11101
01
30

o/p:
1
0
2
0
0
2014-07-14 08:20:54 Rajat
finally done.was a bit hard to guess it was of DP. Take special care of test cases that have 0 in middle.
2014-07-06 19:51:47 Vaibhav Goyal
Instead of 5000, take the length of array 100000 otherwise you will get runtime error
2014-07-02 15:05:26 Josip
@dexter morgan
5010 is eanugh; idk why does it have to be, but take it as one (or few more) spaces for '\0', which meens end of array.
@hackr32
"30" is not a "a valid encryption"
2014-07-01 16:52:19 classified_01
leaving one tricky condition for 0 might leave with 4 wrong answers !
2014-06-28 05:11:18 hackr32
what is the answer for 30??
2014-06-27 19:51:49 WA/TLE
changed array size from 5000 to 100000 . and got AC :x
2014-06-27 17:21:16 Gautam Goyal
getting WA for along time, submission id is 11840570
2014-06-22 19:23:49 AAKASH TYAGI
my first dp :)
2014-06-12 11:43:23 krishana kant pareek
@Ankit!! input-1301 output-0;
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.