题目
思路
设
f
i
,
j
,
k
f_{i,j,k}
fi,j,k为填到第i位,已有j个为数字k,且不考虑前导0的方案数,发现所谓的k在这里毫无意义(
f
i
,
j
,
0
=
f
i
,
j
,
1
=
…
=
f
i
,
j
,
9
f_{i,j,0}=f_{i,j,1}=…=f_{i,j,9}
fi,j,0=fi,j,1=…=fi,j,9),所以我们把k消除。然后记搜即可。
code:
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<iostream>
#include<cstring>
using namespace std;
unsigned long long l,r,pw[35],f[20][20],tot,lyw[20];
unsigned long long dfs(int pos,int x,bool wj,bool tjh,int sum)
{
if (!pos) return sum;
if (tjh==0&&wj&&f[pos][sum]!=-1) return f[pos][sum];
int mx=tjh?pw[pos]:9;
unsigned long long ans=0;
for (int i=0;i<=mx;i++)
{
ans+=dfs(pos-1,x,i||wj,tjh&&(i==mx),sum+((wj||i)&&(i==x)));
}
if (wj&&tjh==0) f[pos][sum]=ans;
return ans;
}
unsigned long long kyx(unsigned long long r,int x)
{
if (r==0) return 0;
memset(f,-1,sizeof(f));
tot=0;
while (r!=0)
{
pw[++tot]=r%10;
r/=10;
}
return dfs(tot,x,0,1,0);
}
int main()
{
scanf("%lld%lld",&l,&r);
lyw[0]=1;
for (int i=1;i<=13;i++) lyw[i]=lyw[i-1]*10;
for (int i=0;i<10;i++) printf("%lld ",kyx(r,i)-kyx(l-1,i));
return 0;
}