萌新求助为什么60

#include <bits/stdc++.h>
using namespace std;
const int p=1e9+7;
#define rep(i,a,b) for(int i=a;i<=b;i++)
int dp[1010][11][11][2][2];
int a[1010];
int DP(int pos,
	int ls,int lls,
	int lim,int qd0)
{
	if(pos<0){
		return !qd0;
	}
	if(dp[pos][ls][lls][lim][qd0]!=-1){
		return dp[pos][ls][lls][lim][qd0];
	}
	int res=lim?a[pos]:9;
	int ret=0;
	rep(i,0,res){
		if(i==ls||i==lls){
			continue;
		}
		if(qd0&&i==0)
		ret+=DP(pos-1,10,10,lim&&(i==a[pos]),qd0&&(!i));
		else ret+=DP(pos-1,i,ls,lim&&(i==a[pos]),qd0&&(!i));
		ret%=p;
	}
	return dp[pos][ls][lls][lim][qd0]=ret;
}
int solve(char arr[],int len){
	rep(i,1,len){
		a[len-i]=arr[i]-'0';
	}
	memset(dp,-1,sizeof dp);
	return DP(len-1,10,10,1,1);
}
char arr[1010];
int meng(int s){
	rep(i,2,s){
		if(arr[i]==arr[i-1])return 1;
		if(i>2&&arr[i]==arr[i-2])return 1;
	}
	return 0;
}
signed main(){
	scanf("%s",arr+1);
	int s=strlen(arr+1);
	auto x=solve(arr,s);
	int good=meng(s);
	int w=0;
	rep(i,1,s){
		w=(w*10%p+arr[i]-'0')%p;
	}
	x=(w-x)%p+p;x%=p;
	scanf("%s",arr+1);
	s=strlen(arr+1);
	auto y=solve(arr,s);
	w=0;
	rep(i,1,s){
		w=(w*10%p+arr[i]-'0')%p;
	}
	y=(w-y)%p+p;y%=p;
	cout<<((y-x+good)%p+p)%p;
}