【HDOJ】1508 Alphacode

简单DP。考虑10、20（出现0只能唯一组合）。01（不成立）。

 /* 1508 */
 #include <iostream>
 #include <string>
 #include <map>
 #include <queue>
 #include <set>
 #include <stack>
 #include <vector>
 #include <deque>
 #include <algorithm>
 #include <cstdio>
 #include <cmath>
 #include <ctime>
 #include <cstring>
 #include <climits>
 #include <cctype>
 #include <cassert>
 #include <functional>
 #include <iterator>
 #include <iomanip>
 using namespace std;
 //#pragma comment(linker,"/STACK:102400000,1024000")

 #define sti                set<int>
 #define stpii            set<pair<int, int> >
 #define mpii            map<int,int>
 #define vi                vector<int>
 #define pii                pair<int,int>
 #define vpii            vector<pair<int,int> >
 #define rep(i, a, n)     for (int i=a;i<n;++i)
 #define per(i, a, n)     for (int i=n-1;i>=a;--i)
 #define clr                clear
 #define pb                 push_back
 #define mp                 make_pair
 #define fir                first
 #define sec                second
 #define all(x)             (x).begin(),(x).end()
 #define SZ(x)             ((int)(x).size())
 #define lson            l, mid, rt<<1
 #define rson            mid+1, r, rt<<1|1

 const int maxn = 1e5+;
 char s[maxn];
 __int64 dp[maxn];

 int main() {
     ios::sync_with_stdio(false);
     #ifndef ONLINE_JUDGE
         freopen("data.in", "r", stdin);
         freopen("data.out", "w", stdout);
     #endif

     int len;
     __int64 ans;

     while (scanf("%s", s+)!=EOF && s[]!='') {
         len = strlen(s+);
         rep(i, , len+)    s[i] -= '';

         dp[] = ;
         rep(i, , len+) {
             if (s[i] == ) {
                 dp[i] = dp[i-];
             } else if (i> && s[i-]> && *s[i-]+s[i]<=) {
                 dp[i] = dp[i-] + dp[i-];
             } else {
                 dp[i] = dp[i-];
             }
         }

         ans = dp[len];
         printf("%I64d\n", ans);
     }

     #ifndef ONLINE_JUDGE
         printf("time = %d.\n", (int)clock());
     #endif

     return ;
 }