蒟蒻写的记搜 10pts 样例过不掉

#include<bits/stdc++.h>
#define int long long
using namespace std;
int l,r,num[250],f[20][11][2][2];
int dfs(int loc,bool pre,bool lim,bool qd){
	if(!loc)return 1;
	if(f[loc][pre][lim][qd]!=-1)return f[loc][pre][lim][qd];
	int ans=0,temp=lim?num[loc]:9;
	for(int i=0;i<=temp;i++)if(qd||abs(pre-i)>=2)ans+=dfs(loc-1,i,lim&&(i==num[loc]),qd&(i==0));
	return f[loc][pre][lim][qd]=ans;
}
int work(int x){
	memset(f,-1,sizeof(f));
	int loc=0;
	while(x){
		num[++loc]=x%10;
		x/=10;
	}
	return dfs(loc,0,1,1);
}
signed main(){
	int l,r;
	cin>>l>>r;
	cout<<work(r)-work(l-1)<<"\n";
	return 0;
}