#include<bits/stdc++.h>
using namespace std;
int a[20];
long long dp[20][20];
long long dfs(int len,int last,bool shangxian)
{
int p;
if(len<=0)return 1;
if(!shangxian && dp[len][last]!=-1 && last>=0)return dp[len][last];
int cnt=0,maxn=(shangxian?a[len]:9);
for(int i=0;i<=maxn;i++)
{
if(abs(i-last)<2)continue;
p=i;
if(i==0 && last==-10)p=last;
cnt+=dfs(len-1,p,shangxian && (i==maxn));
}
if(last>=0 && !shangxian)dp[len][last]=cnt;
return cnt;
}
long long solve(long long x)
{
int pos=0;
while(x)
{
a[++pos]=x%10;
x/=10;
}
memset(dp,-1,sizeof dp);
return dfs(pos,-10,true);
}
int main()
{
long long l,r;
cin>>l>>r;
cout<<solve(r)-solve(l-1)<<endl;
}
BZOJ1026 数位DP
最新推荐文章于 2019-04-03 14:45:00 发布