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

hide comments
Adrian Kuegel: 2012-04-13 08:48:34

@Sameer Jain: sorry to contradict you, but you changed also following line: if(n=10||n==20)
to this line:
if(n==10||n==20)
This was the reason why you later got accepted, not that you used a bigger array. The input follows the constraints given in the problem statement!

Sameer Jain: 2012-04-07 18:34:17

change the input file size as i got AC just by increasing my string size from 5005 to 100000

Mostafa Ahmed Abdel Fattah: 2012-03-02 16:47:04

@Bond: Try dp

Ashwin Menon: 2012-02-15 11:55:32

Excellent problem for learning :)

Lakshit Arora: 2011-12-15 05:39:44

I m getting TLE with recursive approach so recursive approach is wrong or should i make some modifications in it.

BlackBird: 2011-09-16 07:09:17

the special digit ;)

Jagat Sastry P: 2011-08-07 21:58:25

@Pratik: No. 03 isn't valid, nor is 50.
@Kelvin: Try
20
2020
29
0
You should be getting
1
1
1

wil93: 2011-07-28 20:48:01

Oh my god I was getting that TLE just becouse I forgot 'freopen("in","r",stdin)' at the begin

Now I got AC with the recursive approach ;)

wil93: 2011-07-28 20:38:52

Is it normal to get TLE just because using a recursive algorithm?

Kelvin Valensius: 2011-07-16 06:53:25

could someone tell me some tricky case for this problem.. i don't understand why I always get wrong answer..


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