hdu 3943 统计出现了x次4与y次7的数字

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
using namespace std;
typedef long long LL;
int const N = 22;
int const M = 22;
LL dp

;
int bit
,ln;
int x,y;
LL getsum1(int t,int limit,int cnt4,int cnt7)
{
if(cnt4>x||cnt7>y)return 0;
if(!t)return (x==cnt4&&y==cnt7);
int up=(limit?bit[t]:9);
if(!limit&&dp[t][cnt4][cnt7]!=-1)return dp[t][cnt4][cnt7];
LL ans=0;
for(int i=0;i<=up;i++)
{
ans+=getsum1(t-1,limit&&i==up,cnt4+(i==4),cnt7+(i==7));
}
if(!limit)dp[t][cnt4][cnt7]=ans;
return ans;
}
LL getsum2(LL n)
{
for(ln=0;n;bit[++ln]=n%10,n/=10);
return getsum1(ln,1,0,0);
}
int main()
{
LL P,Q;
int T,t=0,n;
scanf("%d",&T);
while(T--)
{
memset(dp,-1,sizeof(dp));
scanf("%I64d %I64d",&P,&Q);
scanf("%d %d",&x,&y);
LL l,r,mid,k,ans;
scanf("%d",&n);
printf("Case #%d:\n",++t);
LL sign=getsum2(P);
LL up=getsum2(Q)-sign;
for(int i=0;i<n;i++)
{
scanf("%I64d",&k);
if(k>up){printf("Nya!\n");continue;}
l=P+1,r=Q;
while(l<r)
{
mid=(l+r)>>1;
LL cnt=getsum2(mid);
cnt-sign>=k?(r=mid):(l=mid+1);
}
printf("%I64d\n",l);
}
}
return 0;
}