Poj2033

算法想到了，题目坑太多，数组，含‘0’

#include <cstdio>
#include <algorithm>
#include <cstring>
#include <iostream>
#define LL  long long
const int MAXN = ;
using namespace std;
char str[MAXN];
LL dp[MAXN];
int main()
{
    while(gets(str+)) {
        int len = strlen(str+);
        if(str[] == '' && len == ) {
            break;
        }
        dp[] = dp[] = ;
        for(int i = ; i <= len; ++i) {
            if(str[i] != '') {
                  dp[i] = dp[i-];
                  int num = (str[i-] -'') *  + str[i] - '';
                  if(num >=  && num <= )
                        dp[i] += dp[i-];
            } else {
                  if(str[i-] == '')
                        dp[i] = dp[i-];
                  else if(str[i-] == '' || str[i-] == '')
                        dp[i] = dp[i-];
            }
        }
        cout << dp[len] << endl;
      }
    return ;
}