HDU 3555 Bomb

数位dp,第一发模板题。

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
#define N 25
#define INF 1000000000
int len;
char a[100];
long long dp[100][3];
long long dfs(int id, int s, bool f){
    if(id >= len ) {
        if(s == 2)return 1;
        else return  0;
    }
    if(!f && dp[id][s] != 0)return dp[id][s];
    long long ans = 0;
    int edge = f ? (a[id] - '0') : 9;
    for(int i = 0; i <= edge; i++){
        if(s == 2)ans += dfs(id + 1, 2, f && i == edge);
        else if(i == 4)ans += dfs(id + 1, 1, f && i == edge);
        else if(i == 9 && s == 1)ans += dfs(id + 1, 2, f&& i == edge);
        else ans += dfs(id + 1, 0, f && i == edge);
    }
    return f ? ans : dp[id][s] = ans;
}
int main() {
    int t;
    scanf("%d", &t);
    while(t --){
        memset(a, 0, sizeof(a));
        memset(dp, 0, sizeof(dp));
        scanf("%s",a);
        len = strlen(a);
        long long ans = dfs(0, 0, true);
        printf("%I64d\n", ans);
    }
    return 0;
}