数位dp 同类分布

using namespace std;
#define int long long
int len,Mod,a[21],A,B,f[20][200][200];
int (int p,int s,int x,int limit)
{
	if(p>len)
	{
		if(x==0&&Mod==s)return 1;
		return 0;
	}
	if(!limit&&f[p][s][x]!=-1)return f[p][s][x];
	int up=9,res=0;
	if(limit)up=a[len-p+1];
	for(int i=0;i<=up;i++)
		res+=dfs(p+1,s+i,(10*x+i)%Mod,limit&&(i==up));
	if(limit)return res;
	else return f[p][s][x]=res;
}
int solve(int x)
{
	len=0;
	int res=0;
	while(x)
	{
		a[++len]=x%10;
		x/=10;
	}
	for(Mod=1;Mod<=len*9;Mod++)
	{
		memset(f,-1,sizeof(f));
		res+=dfs(1,0,0,1);
	}
	return res;
}
signed main()
{
	scanf("%lld%lld",&A,&B);
	printf("%lldn",solve(B)-solve(A-1));
}