听了学长的讲解,这题用数位Dp
#include<iostream>
#include<cstdio>
#include<cstring>
typedef __int64 LL;
using namespace std ;
int Pow[11],len;
LL dp[11][5050],A;
char B[11];
LL dfs(int pos,int res,int full)
{
if(res<0) return 0;
if(pos==-1) return 1;
if(!full&&dp[pos][res]!=-1) return dp[pos][res];
int end=full?B[len-pos-1]-'0':9;
int ans=0;
for(int i=0;i<=end;i++){
ans+=dfs(pos-1,res-i*Pow[pos],full&&(end==i));
}
if(!full) return dp[pos][res]=ans;
return ans;
}
int main()
{
int t,sum,i;
int test=1;
Pow[0]=1;
for(i=1;i<=10;i++) Pow[i]=Pow[i-1]<<1;
scanf("%d",&t);
memset(dp,-1,sizeof(dp));
while(t--){
scanf("%I64d %s",&A,B);
sum=i=0;
while(A){
sum+=(A%10)*Pow[i++];
A/=10;
}
len=strlen(B);
printf("Case #%d: %I64d\n",test++,dfs(len-1,sum,1));
}
return 0 ;
}