HDOJ-2089 不要62

用dp[i][j]表示长度为i,第一个数字为j的不含不吉利数字的个数。状态转移方程:dp[i][j] += dp[i-1][k] 0<=k<=9

#include <cstdio>
#include <iostream>
#include <vector>
#include <algorithm>
#include <cstring>
#include <queue>
#include <cmath>
#define maxn 100005
using namespace std;
typedef long long ll;

int dp[8][10];
void Init(){

    memset(dp, 0, sizeof(dp));
    dp[0][0] = 1;
    for(int i = 1; i <= 7; i++){
        for(int j = 0; j <= 9; j++){
            if(j != 4)
            for(int h = 0; h <= 9; h++){
                if((j == 6 && h == 2) || h == 4)
                  continue;
                dp[i][j] += dp[i-1][h];
            }
        }
    }
}
int solve(int n){

    int s = 0;
    int num[10], cnt = 0;

    if(n == 0)
      return 1; 
    while(n){
        num[++cnt] = n % 10;
        n /= 10;
    }
    int sign = 0;
    for(int i = cnt; i >= 1; i--){
        for(int j = 0; j < num[i]; j++){
          if(j == 2 && sign)
            continue;
          s += dp[i][j];
        }
        if(num[i] == 4 || (num[i] == 2 && sign))
          break;
         if(num[i] == 6)
          sign = 1;
         else
          sign = 0; 
        if(i == 1)
         s++;
    }
    return s;
}
int main(){

//  freopen("in.txt", "r", stdin);
    int n, m;
    Init();
    while(scanf("%d%d", &n, &m) == 2){

        if(n == 0 && m == 0)
          break;
        n--;
        int s1 = solve(m);
        int s2 = solve(n);

        cout << s1 - s2 << endl;
    }

    return 0;
}