F(x)

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;

const int maxn=1e4+5;

int A,B,sum;
int num[40],dp[40][maxn];

int F(int x){
    if(x==0) return 0;
    int ans=F(x/10);
    return ans*2+(x%10);
} 

int DFS(int pos,int res,bool F){
    if(pos==-1) return res<=sum;
    if(res>sum) return 0;
    if(!F&&dp[pos][sum-res]!=-1) return dp[pos][sum-res];
    
    int maxv=F?num[pos]:9;
    int ans=0;
    for(int i=0;i<=maxv;i++) ans=ans+DFS(pos-1,res+i*(1<<pos),F&&i==maxv);
    
    if(!F) dp[pos][sum-res]=ans;
    return ans;
}

int Solve(int temp){
    if(temp==0) return 1;
    int cnt=0;
    while(temp){
        num[cnt++]=temp%10;
        temp/=10;
    }
    return DFS(cnt-1,0,true);
}

int main()
{   int kase;
    cin>>kase;
    memset(dp,-1,sizeof(dp));            //放在循坏里面会超时
    for(int t=1;t<=kase;t++){
        cin>>A>>B;
        sum=F(A);
        printf("Case #%d: %d
",t,Solve(B));
    }
    return 0;
}

int DFS(int pos,int res,bool F){
    if(res>sum) return 0;           
    if(pos==-1) return 1;
    if(!F&&dp[pos][sum-res]!=-1) return dp[pos][sum-res];
    
    int maxv=F?num[pos]:9;
    int ans=0;
    for(int i=0;i<=maxv;i++) ans=ans+DFS(pos-1,res+i*(1<<pos),F&&i==maxv);
    
    if(!F) dp[pos][sum-res]=ans;
    return ans;
}