1001.Alphacode

Description

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 500 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 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 long variable.

简单的动态规划： 前(n - 1)位能构成的组合数设为 (combine[n - 1] + sole[n - 1]), combine为第n - 1位与第n - 2位组合的情况，sole为第n - 1位不与第n - 2位组合的情况;  则对前n位的的组合数，若第n位能与第n-1位组合，则有(combine[n] = combine[n - 2] +sole[n - 2], sole[n] = sole[n - 1] + combine[n - 1])， 若不能结合，则有(combine[n] = 0, sole[n] = sole[n - 1] + sole[ n - 1])

经过优化后时间复杂度为O(n), 空间复杂度为O(1), n为字符串长度。

// soj 1001.Alphacode--------Shawn Chow
// Web Nov 27, 2014;
#include "iostream"
#include "string"
using namespace std;

bool permuta(char a, char b);

int main(int argc, char *argv[]) {
  string S;
  cin >> S;
  while (S[0] != '0') {
    int s[3], c[3], size = S.size();
    s[0] = s[1] = 1;
    c[0] = c[1] = 0;
    
    for (int i = 2; i <= size; ++i) {
      if (S[i - 1] != '0') {	
	s[2] = s[1] + c[1];
	if (S[i - 2] != '0' && permuta(S[i - 2], S[i - 1])) {
	  c[2] = s[0] + c[0];
	} else {
	  c[2] = 0;
	}
      } else { // s[i - 1] = '0'
	s[2] = 0;
	c[2] = c[0] + s[0];
      }
      s[0] = s[1];
      s[1] = s[2];
      c[0] = c[1];
      c[1] = c[2];
    }
    cout << c[2] + s[2] << endl;
    cin >> S;
  }
  return 0;
}

bool permuta(char a, char b) {
  int ans;
  ans = (a - '0') * 10 + (b - '0');
  return ans <= 26 ? true : false;
}