题意:计算[ 0, B ] 区间内 值比A小的个数
dp[pos] [ sum ]
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <string>
#include <iostream>
#include <algorithm>
#include <sstream>
#include <cmath>
using namespace std;
#include <queue>
#include <stack>
#include <vector>
#include <deque>
#include <set>
#include <map>
#define cler(arr, val) memset(arr, val, sizeof(arr))
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define IN freopen ("in.txt" , "r" , stdin);
#define OUT freopen ("out.txt" , "w" , stdout);
typedef long long LL;
const int MAXN = 1011;
const int MAXM = 610;
const int INF = 0x3f3f3f3f;
const LL mod = 2147483647;
const double eps= 1e-8;
const double pi=acos(-1.0);
#define lson l,m, rt<<1
#define rson m+1,r,rt<<1|1int len,dig[66];
int len,dig[66],big;
int dp[10][5000];
int dfs(int pos,int sum,int limit)
{
if(pos<0)
return sum>=0;
if(sum<0) return 0;
if(!limit&&dp[pos][sum]!=-1)
return dp[pos][sum];
int res=0;
int last=limit?dig[pos]:9;
for(int i=0;i<=last;i++)
{
res+=dfs(pos-1,sum-i*(1<<pos),limit&&(i==last));
}
if(!limit)
dp[pos][sum]=res;
return res;
}
int solve(int x,int y)
{
len=0;
int j=1;
while(x)
{
dig[len++]=x%10;
x/=10;
}
big=0;
while(y)
{
big+=j*(y%10);
y/=10;
j*=2;
}
return dfs(len-1,big,1);
}
int main()
{
int t,x,y,cas=1;
cin>>t;
cler(dp,-1);
while(t--)
{
cin>>x>>y;
printf("Case #%d: ",cas++);
cout<<solve(y,x)<<endl;
}
return 0;
}