1. 首页
2. 数位DP
3. 本页

HDU 3555 Bomb (数位DP)

题目链接：点击打开链接~

跟HDU2089差不多~~~

#include<iostream>
#include<cstdio>
#include<string>
#include<string.h>
#include<algorithm>
#include<cstdlib>
#include<ctime>
#include<cmath>
#include<iomanip>
#include<map>
#include<vector>
#include<queue>
#include<stack>
#include<bitset>
//#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const double Pi = acos(-1.0);
const double eps = 1e-9;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9+7;
const int MAXN = 320000+10;


long long dp[25][2];
int dig[25];
long long n;

long long dfs(int len,bool state,bool mxl)
{
    if(!len)
    {
        return 1;
    }
    if(!mxl && dp[len][state]!=-1)
    {
        return dp[len][state];
    }
    long long res=0;
    int maxlen=mxl?dig[len]:9;
    for(int i=0;i<=maxlen;++i)
    {
        if(state&&i==9)
        {
            continue;
        }
        res+=dfs(len-1,i==4,mxl&& i==maxlen);
    }
    if(!mxl)
    {
        dp[len][state]=res;
    }
    return res;
}


long long solve(long long x)
{
    long long tmp=x;
    int len=0;
    while(tmp!=0)
    {
        dig[++len]=tmp%10;
        tmp/=10;
    }

    return dfs(len,false,true);
}


int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        cin>>n;
        memset(dp,-1,sizeof(dp));
        cout<<(n-solve(n)+1)<<endl;
    }
    return 0;
}