HDU - 3555 Bomb（数位DP）

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a[1005], dp[1005][2][10] = {0};
ll cnt(ll po, ll lim, ll la)
{
    if(po == -1)return 1;
    if(dp[po][lim][la])return dp[po][lim][la];
    ll len = lim ? a[po] : 9, i, ans = 0;
    for(i = 0; i <= len; i++)
    {
        if(la == 4 && i == 9){continue;}
        ans += cnt(po - 1, (i == len) && lim, i);
    }
    dp[po][lim][la] = ans;
    return ans;
}
ll num(ll n)
{
    ll p = 0, i;
    while(n)
    {
        a[p++] = n % 10;
        n /= 10;
    }
    memset(dp, 0, sizeof(dp));
    ll ans = cnt(p - 1, 1, 0);
    return ans;
}
int main()
{
    ll n, m;
    scanf("%lld", &m);
    while(scanf("%lld", &n) != EOF)
    {
        //if(n == 0 && m == 0)break;
        ll ans = num(n) - num(0);
        printf("%lld\n", n - ans);
    }
    return 0;
}