Alphacode

 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:25114111111111133333333330Output:6891

【分析】被0坑了好久。。。

有一串数字，字母a~z分别用1~26来表示，问一共有多少种情况。

dp[i]代表从1~i所有可能的情况数，如果相邻两位数小于等于26的话，dp[i] += dp[i-2]，但在0的两边的情况都不用考虑，是不可能的。

#include <iostream>#include <cstdio>#include <cmath>#include <cstring>using namespace std;#define cl(a,b) memset(a,b,sizeof a);const int maxn = 5051;const int INF = 0x3f3f3f3f;char s[maxn];int dp[maxn];int judge(int i){    int num = (s[i-1]-'0')*10+s[i]-'0';    if(num<27)        return 1;    return 0;}int main(){    s[0] = ' ';    while(~scanf("%s",s+1)){        if(s[1] == '0')            break;        int len = strlen(s);        int flag=1;        for(int i=0;i<=len;i++){            if(s[i] == '0'){                flag=0;                break;            }        }        for(int i=0;i<=len;i++){            dp[i] = 1;        }        for(int i=2;i<len;i++){            dp[i] = dp[i-1];            if(judge(i)&&s[i-1]!='0'&&s[i]!='0'&&s[i+1]!='0'){                dp[i]+=dp[i-2];            }        }        printf("%d\n",dp[len-1]);    }    return 0;}