数位dp30pts，求条，玄关

#include<bits/stdc++.h>
#define int long long
using namespace std;

const int N=20;
int a[N],cnt,f[N][N];
int dfs(int x,int lst,bool egg,bool flag){
    if(!x) return 1;
    if(!flag&&!egg&&f[x][lst]!=-1) return f[x][lst];
    int up=flag?a[x]:9,res=0;
    for(int i=0;i<=up;i++){
        if(abs(i-lst)<2) continue;
        if(flag&&i==0) res+=dfs(x-1,-2,1,flag&&i==up);
        else res+=dfs(x-1,i,0,flag&&i==up);
    }
    if(!flag&&!egg) f[x][lst]=res;
    return res;
}
int solve(int x){
    cnt=0;
    while(x>0){
        int y=x%10;x/=10;
        a[++cnt]=y;
    }
    memset(f,-1,sizeof f);
    return dfs(cnt,-2,1,1);
}
signed main(){
    int a,b;
    cin>>a>>b;
    cout<<solve(b)-solve(a-1);
}