HDU3555 - Bomb

数位DP

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#define maxn 100010
#define INF (int)(1e9)
#define MOD ((int)1e9+7)
#define maxnode 400010
#define sigma_size 30
typedef long long ll;
using namespace std;
ll dp[100][10];
void init() {
    memset(dp, 0, sizeof(dp));
    dp[0][0] = 1;
    for (int i = 1; i <= 25; ++ i) {
        for (int j = 0; j < 10; ++ j) {
            for (int k = 0; k < 10; ++ k) {
                if (!(j == 4 && k == 9)) {
                    dp[i][j] += dp[i-1][k];
                }
            }
        }
    }
}
int bit[21];
ll Dp(ll n) {
    ll tmp = n;
    for (int i = 1; i <= 25; ++ i) {
        bit[i] = tmp%10;
        tmp /= 10;
    }
    ll ans = 0;
    for (int i = 24; i >= 0; -- i) {
        for (int j = 0; j < bit[i]; ++ j) {
            if (!(j == 9 && bit[i+1] == 4))
                ans += dp[i][j];
        }
        if (bit[i] == 9 && bit[i+1] == 4) break;
    }
    return n - ans;
}
int main() {
    int t;
    ll n;
    init();
    scanf("%d", &t);
    while (t --) {
        cin >> n;
        cout << Dp(n+1) << endl;
    }
}