hdu4734 F(x)

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int maxn=1e5+5;
int tot,e[15];
int c[15][maxn];
int t,a,b,cas;
template<class t>void red(t &x)
{
    int w=1;
    x=0;
    char ch=getchar();
    while(ch>'9'||ch<'0')
    {
        if(ch=='-')
            w=-1;
        ch=getchar();
    }
    while(ch>='0'&&ch<='9')
    {
        x=(x<<3)+(x<<1)+ch-'0';
        ch=getchar();
    }
    x*=w;
}
void input()
{
    freopen("input.txt","r",stdin);
    //freopen("output.txt","w",stdout);
}
void dv(int x)
{
    tot=0;
    while(x)
    {
        e[++tot]=x%10;
        x/=10;
    }
    e[tot+1]=0;
}
int dfs(int pos,bool limit,int sum)
{
    if(!pos)
        return sum>=0;
    if(sum<0)
        return 0;
    if(!limit&&c[pos][sum]!=-1)
        return c[pos][sum];
    int up=limit?e[pos]:9;
    int ans=0;
    for(int i=0;i<=up;++i)
        ans+=dfs(pos-1,limit&&(i==up),sum-i*(1<<(pos-1)));
    if(!limit)
        c[pos][sum]=ans;
    return ans;
}
int f(int x)
{
    int ans=0,i=0;
    while(x)
    {
        ans+=(1<<(i))*(x%10);
        x/=10;
        ++i;
    }
    return ans;
}
int solve()
{
    //memset(c,-1,sizeof(c));
    dv(b);
    return dfs(tot,1,f(a));
}
int main()
{
    //input();
    red(t);
    memset(c,-1,sizeof(c));
    while(t--)
    {
        red(a);
        red(b);
        printf("Case #%d: %d
",++cas,solve());
    }
    return 0;
}