[题解]数字计数（数位dp（模板向

#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll a,b;
int num[15],len;//num表示每位数字上限 
ll f[15][15];
ll dfs(int pos,int now,int number,bool lmt,bool led){
//当前位置，当前答案，当前正统计的数字，是否达到数字上限/有前导零 
    if(pos==0)return now;
    if(!lmt && !led && f[pos][now]!=-1)return f[pos][now];
    ll ans=0;
    int top=lmt?num[pos]:9,tnow=now;
    bool tlmt,tled;
    for(int i=0;i<=top;i++){
        tnow=now;
        if(i==top && lmt)tlmt=1;else tlmt=0;
        if(!led || i)tled=0;else tled=1;
        if((i==number)&&!tled)tnow++;
        ans+=dfs(pos-1,tnow,number,tlmt,tled);
    }
    if(!lmt && !led)f[pos][now]=ans;
    return ans;
}
ll sol(ll x,int number){
    memset(f,-1,sizeof(f));
    len=0;
    while(x){
        num[++len]=x%10;
        x/=10;
    }
    return dfs(len,0,number,1,1);
}
int main(){
    scanf("%lld%lld",&a,&b);
    for(int i=0;i<=9;i++)
    printf("%lld ",sol(b,i)-sol(a-1,i));
}