HDU-3555 Bomb(数位dp)

注意要多开一维状态

#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int,int>;
#define int long long
const int N = 35;
const int inf = 0x3f3f3f3f;
const int mod = 1e9+7;
int gcd(int a,int b){return b?gcd(b,a%b):a;}
int lcm(int a,int b){return a*b/gcd(a,b);}
int qmi(int a,int b,int mod){int res=1;while(b){if(b&1)res=res*a%mod;b>>=1;a=a*a%mod;}return res;}


int n,q,m;

// int e[N],ne[N],w[N],h[N],idx;
// void add(int a,int b,int c){
	// e[idx] = b,ne[idx] = h[a],w[idx] = c,h[a] = idx++;
// }
int dp[N][N][2];
int a[N];


int dfs(int len,int last,int limit,int s){
	if(!len)return s;
	if(!limit&&~dp[len][last][s])return dp[len][last][s];
	int up = limit?a[len]:9;
	int res = 0;
	for(int i=0;i<=up;++i){
		if(last==4&&i==9)res+=dfs(len-1,i,limit&&i==up,1);
		
		else res+=dfs(len-1,i,limit&&i==up,s);
	}
	
	return limit?res:dp[len][last][s] = res;
}



int cal(int x){
	int len = 0;
	while(x){a[++len] = x%10;x/=10;}
	return dfs(len,0,1,0);
	
}


void solve()
{
	memset(dp,-1,sizeof dp);
	
	cin>>q;
	
	while(q--){
		int r;cin>>r;
		cout<<cal(r)<<"\n";
	}
	
	

}

signed main()
{
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	int _;
	//cin>>_;
	_ = 1;
	while(_--)solve();
	return 0;
}