HDU-4734 F(x)

数位DP，d[len][num]保存len位小于等于num的数的个数

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
typedef long long ll;
const int N=10;
const int M=20000;
const int p[]={1,2,4,8,16,32,64,128,256,512,1024};
int d[N][M];
int dis[N],t;
int a,b,temp;
int dp(int len,int num,bool flag)
{
	if(len==-1) return num>=0;
	if(!flag&&d[len][num]!=-1) return d[len][num];
	int ans=0;
	int end=flag?dis[len]:9;
	for(int i=0;i<=end;i++)
	{
		int n=num-p[len]*i;
		if(n>=0)
		ans+=dp(len-1,n,flag&&i==end);
	}
	if(!flag) d[len][num]=ans;
	return ans;
}
int solve(int a,int b)
{
	temp=t=0;
	while(a)
	{
		temp+=(a%10)*p[t++];
		a/=10;
	}
	t=0;
	while(b)
	{
		dis[t++]=b%10;
		b/=10;
	}	
	return dp(t-1,temp,true);
}
int main()
{
	int T,kase=0;
	scanf("%d",&T);
	memset(d,-1,sizeof(d));
	while(T--)
	{
		scanf("%d%d",&a,&b);
		printf("Case #%d: %d\n",++kase,solve(a,b));
	}
	return 0;
}